PFGE: Parsimonious Fast Geometric Ensembling of DNNs
Not on the map. Why?
Abstract (arXiv)
Ensemble methods are commonly used to enhance the generalization performance of machine learning models. However, they present a challenge in deep learning systems due to the high computational overhead required to train an ensemble of deep neural networks (DNNs). Recent advancements such as fast geometric ensembling (FGE) and snapshot ensembles have addressed this issue by training model ensembles in the same time as a single model. Nonetheless, these techniques still require additional memory for test-time inference compared to single-model-based methods. In this paper, we propose a new method called parsimonious FGE (PFGE), which employs a lightweight ensemble of higher-performing DNNs generated through successive stochastic weight averaging procedures. Our experimental results on CIFAR-{10,100} and ImageNet datasets across various modern DNN architectures demonstrate that PFGE achieves 5x memory efficiency compared to previous methods, without compromising on generalization performance. For those interested, our code is available at https://github.com/ZJLAB-AMMI/PFGE.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 30 of its 48 references that are in the map. First posted on arXiv 14 Feb 2022.
Builds on
30 of 48 references.
References · 30
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2016Wide Residual Networkscited by 3,070
- 2016Identity Mappings in Deep Residual Networkscited by 1,965
18 more
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2015Cyclical Learning Rates for Training Neural Networkscited by 629
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 560
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
- 2018Accurate Uncertainties for Deep Learning Using Calibrated Regressioncited by 422
- 2017Snapshot Ensembles: Train 1, get M for freecited by 350
- 2014Stochastic Gradient Hamiltonian Monte Carlocited by 343
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
- 2016Deep Learning without Poor Local Minimacited by 234
- 2019Optimization for deep learning: theory and algorithmscited by 70
- 2021Taxonomizing local versus global structure in neural network loss landscapescited by 34
- 2016Challenges and Opportunities in Edge Computingcited by 26
- 2022Stochastic Weight Averaging Revisitedcited by 26
- 2021Billion-Scale Pretraining with Vision Transformers for Multi-Task Visual Representationscited by 24
- 2021Optimizing Memory Efficiency of Graph Neural Networks on Edge Computing Platformscited by 6
- 2018Particle Filtering Methods for Stochastic Optimization with Application to Large-Scale Empirical Risk Minimizationcited by 3
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024Switch EMA: A Free Lunch for Better Flatness and Sharpness14 Feb 2024