Train Faster, Perform Better: Modular Adaptive Training in Over-Parameterized Models
Not on the map. Why?
Abstract (arXiv)
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. Empirical evidence reveals that when scaling down into network modules, such as heads in self-attention models, we can observe varying learning patterns implicitly associated with each module's trainability. To describe such modular-level learning capabilities, we introduce a novel concept dubbed modular neural tangent kernel (mNTK), and we demonstrate that the quality of a module's learning is tightly associated with its mNTK's principal eigenvalue λmax. A large λmax indicates that the module learns features with better convergence, while those miniature ones may impact generalization negatively. Inspired by the discovery, we propose a novel training strategy termed Modular Adaptive Training (MAT) to update those modules with their λmax exceeding a dynamic threshold selectively, concentrating the model on learning common features and ignoring those inconsistent ones. Unlike most existing training schemes with a complete BP cycle across all network modules, MAT can significantly save computations by its partially-updating strategy and can further improve performance. Experiments show that MAT nearly halves the computational cost of model training and outperforms the accuracy of baselines.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 39 of its 46 references that are in the map. First posted on arXiv 13 May 2024.
Builds on
39 of 46 references.
References · 39
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
27 more
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2014How transferable are features in deep neural networks?cited by 1,216
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
- 2017Train longer, generalize better: closing the generalization gap in large batch training of neural networkscited by 278
- 2020Loss landscapes and optimization in over-parameterized non-linear systems and neural networkscited by 231
- 2020Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernelcited by 185
- 2021Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired Perspectivecited by 168
- 2019Gradient Descent with Early Stopping is Provably Robust to Label Noise for Overparameterized Neural Networkscited by 158
- 2021Group Fisher Pruning for Practical Network Compressioncited by 130
- 2019Are All Layers Created Equal?cited by 94
- 2019Generalization Guarantees for Neural Networks via Harnessing the Low-rank Structure of the Jacobiancited by 67
- 2020Dynamic Sparse Training: Find Efficient Sparse Network From Scratch With Trainable Masked Layerscited by 66
- 2022Fast Finite Width Neural Tangent Kernelcited by 62
- 2021Tensor Programs IIb: Architectural Universality of Neural Tangent Kernel Training Dynamicscited by 57
- 2018Predicting the Computational Cost of Deep Learning Modelscited by 49
- 2022Memorization and Optimization in Deep Neural Networks with Minimum Over-parameterizationcited by 36
- 2021KNAS: Green Neural Architecture Searchcited by 33
- 2022A Fast, Well-Founded Approximation to the Empirical Neural Tangent Kernelcited by 30
- 2023NTK-SAP: Improving neural network pruning by aligning training dynamicscited by 30
- 2022Winning the Lottery Ahead of Time: Efficient Early Network Pruningcited by 21
- 2022Spectral Bias Outside the Training Set for Deep Networks in the Kernel Regimecited by 11
- 2021Multirate Training of Neural Networkscited by 5
- 2022TorchNTK: A Library for Calculation of Neural Tangent Kernels of PyTorch Modelscited by 3
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 1.
3 papers.
- 2024Inductive Gradient Adjustment For Spectral Bias In Implicit Neural Representationscited by 8
- 2024F3OCUS -- Federated Finetuning of Vision-Language Foundation Models with Optimal Client Layer Updating Strategy via Multi-objective Meta-Heuristicscited by 4
- 2026SD-MoE: Spectral Decomposition for Effective Expert Specializationcited by 3
- 2026SD-MoE: Spectral Decomposition for Effective Expert Specialization13 Feb 2026
- 2024F3OCUS -- Federated Finetuning of Vision-Language Foundation Models with Optimal Client Layer Updating Strategy via Multi-objective Meta-Heuristics17 Nov 2024
- 2024Inductive Gradient Adjustment For Spectral Bias In Implicit Neural Representations17 Oct 2024