Manifold Metric: A Loss Landscape Approach for Predicting Model Performance
Not on the map. Why?
Abstract (arXiv)
Determining the optimal model for a given task often requires training multiple models from scratch, which becomes impractical as dataset and model sizes grow. A more efficient alternative is to expand smaller pre-trained models, but this approach is underutilized due to a limited understanding of its impact on the training dynamics. Existing methods for quantifying this impact have notable limitations, including computation cost. To address this, we introduce a new perspective based on the loss landscape, which has been shown to contain a manifold of linearly connected minima. Specifically, we propose a metric that estimates the size of this manifold to study the impact of model expansion. Our experiments reveal a strong correlation between performance gains and our manifold metric, enabling more informed model comparison and offering a first step toward a geometry-driven approach for reliable model expansion. Notably, our metric outperforms other baselines, even when different types of expansion with equivalent number of parameters are applied to a model.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 57 of its 67 references that are in the map. First posted on arXiv 24 May 2024.
Builds on
57 of 67 references.
References · 57
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 816
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
38 more
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
- 2020What is being transferred in transfer learning?cited by 365
- 2019Learn to Grow: A Continual Structure Learning Framework for Overcoming Catastrophic Forgettingcited by 302
- 2021DyTox: Transformers for Continual Learning with DYnamic TOken eXpansioncited by 291
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
- 2020A Comprehensive Survey of Neural Architecture Search: Challenges and Solutionscited by 253
- 2015Net2Net: Accelerating Learning via Knowledge Transfercited by 245
- 2020Neural Architecture Search without Trainingcited by 241
- 2020Loss landscapes and optimization in over-parameterized non-linear systems and neural networkscited by 231
- 2021Zero-Cost Proxies for Lightweight NAScited by 194
- 2020Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernelcited by 185
- 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 178
- 2019BANANAS: Bayesian Optimization with Neural Architectures for Neural Architecture Searchcited by 175
- 2020Linear Mode Connectivity in Multitask and Continual Learningcited by 144
- 2023Neural Architecture Search: Insights from 1000 Paperscited by 136
- 2021Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariancescited by 125
- 2019Are All Layers Created Equal?cited by 94
- 2021How Powerful are Performance Predictors in Neural Architecture Search?cited by 88
- 2023Learning to Grow Pretrained Models for Efficient Transformer Trainingcited by 81
- 2020In Search of Robust Measures of Generalizationcited by 79
- 2021Loss Surface Simplexes for Mode Connecting Volumes and Fast Ensemblingcited by 75
- 2019Optimization for deep learning: theory and algorithmscited by 70
- 2019Explaining Landscape Connectivity of Low-cost Solutions for Multilayer Netscited by 63
- 2022Re-basin via implicit Sinkhorn differentiationcited by 61
- 2020The Global Landscape of Neural Networks: An Overviewcited by 57
- 2022On the Maximum Hessian Eigenvalue and Generalizationcited by 57
- 2022Linear Connectivity Reveals Generalization Strategiescited by 55
- 2023Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivitycited by 50
- 2020On the Transformer Growth for Progressive BERT Trainingcited by 49
- 2019Loss Landscapes of Regularized Linear Autoencoderscited by 45
- 2018The loss landscape of overparameterized neural networkscited by 38
- 2021Taxonomizing local versus global structure in neural network loss landscapescited by 34
- 2022Exploring Mode Connectivity for Pre-trained Language Modelscited by 26
- 2020Speedy Performance Estimation for Neural Architecture Searchcited by 24
50 most cited of 57 All 57 (JSON)
Built on by
Not cited yet.