← Search

Mingzhi Dong

11 accepted papers

2026

Metis: Training LLMs with FP4 Quantization

ICLR 2026poster

This work identifies anisotropy in the singular value spectra of parameters, activations, and gradients as the fundamental barrier to low-bit training of large language models (LLMs). These spectra are dominated by a small fraction of large singular values, inducing wide numerical ranges that cause…

Cited by 0SourceScholar
2026

Multi-Head Attention as a Source of Catastrophic Forgetting in MoE Transformers

ICML 2026poster

Mixture-of-Experts (MoE) architectures are often considered a natural fit for continual learning because sparse routing should localize updates and reduce interference, yet MoE Transformers still forget substantially even with sparse, well-balanced expert utilization. We attribute this gap to a pre-…

Cited by 0SourceScholar
2026

SD-MoE: Spectral Decomposition for Effective Expert Specialization

ICML 2026poster

Mixture-of-Experts (MoE) architectures scale Large Language Models via expert specialization induced by conditional computation. In practice, however, expert specialization often fails: some experts become functionally similar, while others functioning as de facto shared experts, limiting the effect…

Cited by 0SourceScholar
2026

Spectra: Rethinking Optimizers for LLMs Under Spectral Anisotropy

ICML 2026poster

Gradient signals in LLM training are highly anisotropic: recurrent linguistic structure concentrates energy into a small set of dominant spectral directions, while context-specific information resides in a long tail. We show that this spike–tail separation persists throughout training, with the spik…

Cited by 0SourceScholar
2025

Oracle-MoE: Locality-preserving Routing in the Oracle Space for Memory-constrained Large Language Model Inference

ICML 2025poster

Mixture-of-Experts (MoE) is widely adopted to deploy Large Language Models (LLMs) on edge devices with limited memory budgets. Although MoE is, in theory, an inborn memory-friendly architecture requiring only a few activated experts to reside in the memory for inference, current MoE architectures ca…

Cited by 0SourcePDFScholar
2024

Once Read is Enough: Domain-specific Pretraining-free Language Models with Cluster-guided Sparse Experts for Long-tail Domain Knowledge

NeurIPS 2024poster

Language models (LMs) only pretrained on a general and massive corpus usually cannot attain satisfying performance on domain-specific downstream tasks, and hence, applying domain-specific pretraining to LMs is a common and indispensable practice. However, domain-specific pretraining can be costly an…

Cited by 0SourcePDFScholar
2023

Over-parameterized Model Optimization with Polyak-{\L}ojasiewicz Condition

ICLR 2023poster

This work pursues the optimization of over-parameterized deep models for superior training efficiency and test performance. We first theoretically emphasize the importance of two properties of over-parameterized models, i.e., the convergence gap and the generalization gap. Subsequent analyses unveil…

Cited by 2SourcePDFScholar
2023

Train Faster, Perform Better: Modular Adaptive Training in Over-Parameterized Models

NeurIPS 2023poster

Despite their prevalence in deep-learning communities, over-parameterized models convey high demands of computational costs for proper training. This work studies the fine-grained, modular-level learning dynamics of over-parameterized models to attain a more efficient and fruitful training strategy.…

Cited by 3SourcePDFScholar
2022

Recursive Disentanglement Network

ICLR 2022poster

Disentangled feature representation is essential for data-efficient learning. The feature space of deep models is inherently compositional. Existing $\beta$-VAE-based methods, which only apply disentanglement regularization to the resulting embedding space of deep models, cannot effectively regulari…

Cited by 4SourcePDFScholar
2020

Dynamic Face Video Segmentation via Reinforcement Learning

CVPR 2020poster

For real-time semantic video segmentation, most recent works utilised a dynamic framework with a key scheduler to make online key/non-key decisions. Some works used a fixed key scheduling policy, while others proposed adaptive key scheduling methods based on heuristic strategies, both of which may l…

Cited by 31PDFScholar
2020

Generalization Bound of Gradient Descent for Non-Convex Metric Learning

NeurIPS 2020poster

Metric learning aims to learn a distance measure that can benefit distance-based methods such as the nearest neighbour (NN) classifier. While considerable efforts have been made to improve its empirical performance and analyze its generalization ability by focusing on the data structure and model co…