Neural Architecture Search via Bregman Iterations
Not on the map. Why?
Abstract (arXiv)
We propose a novel strategy for Neural Architecture Search (NAS) based on Bregman iterations. Starting from a sparse neural network our gradient-based one-shot algorithm gradually adds relevant parameters in an inverse scale space manner. This allows the network to choose the best architecture in the search space which makes it well-designed for a given task, e.g., by adding neurons or skip connections. We demonstrate that using our approach one can unveil, for instance, residual autoencoders for denoising, deblurring, and classification tasks. Code is available at https://github.com/TimRoith/BregmanLearning.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 33 of its 56 references that are in the map. First posted on arXiv 4 Jun 2021.
Builds on
33 of 56 references.
References · 33
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
- 2017Learning Transferable Architectures for Scalable Image Recognitioncited by 1,097
21 more
- 2016An overview of gradient descent optimization algorithmscited by 1,021
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
- 2016Designing Neural Network Architectures using Reinforcement Learningcited by 277
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
- 2018Efficient Multi-objective Neural Architecture Search via Lamarckian Evolutioncited by 151
- 2017Evolving Deep Neural Networkscited by 93
- 2016Group Sparse Regularization for Deep Neural Networkscited by 89
- 2019BayesNAS: A Bayesian Approach for Neural Architecture Searchcited by 67
- 2017NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigmcited by 60
- 2019Sparse evolutionary Deep Learning with over one million artificial neurons on commodity hardwarecited by 48
- 2021Momentum Residual Neural Networkscited by 36
- 2019Deep learning as optimal control problems: models and numerical methodscited by 33
- 2018You Only Search Once: Single Shot Neural Architecture Search via Direct Sparse Optimizationcited by 23
- 2021A Bregman Learning Framework for Sparse Neural Networkscited by 15
- 2019The Role of Memory in Stochastic Optimizationcited by 10
- 2020Neural Architecture Search as Sparse Supernetcited by 10
- 2017Choose your path wisely: gradient descent in a Bregman distance frameworkcited by 8
- 2019Exploring Structural Sparsity of Deep Networks via Inverse Scale Spacescited by 7
- 2020Semi-discrete optimization through semi-discrete optimal transport: a framework for neural architecture searchcited by 2
- 2020Traditional and accelerated gradient descent for neural architecture searchcited by 1
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 0; 2025: 1; 2026: 1.
5 papers.
- 2022Duality for Neural Networks through Reproducing Kernel Banach Spacescited by 15
- 2023From NeurODEs to AutoencODEs: a mean-field control framework for width-varying Neural Networkscited by 3
- 2026Sparse Training of Neural Networks based on Multilevel Mirror Descentcited by 3
- 2023Learning a Sparse Representation of Barron Functions with the Inverse Scale Space Flowcited by 1
- 2025OCTANE -- Optimal Control for Tensor-based Autoencoder Network Emergence: Explicit Casecited by 0
- 2026Sparse Training of Neural Networks based on Multilevel Mirror Descent3 Feb 2026
- 2025OCTANE -- Optimal Control for Tensor-based Autoencoder Network Emergence: Explicit Case9 Sep 2025
- 2023Learning a Sparse Representation of Barron Functions with the Inverse Scale Space Flow5 Dec 2023
- 2023From NeurODEs to AutoencODEs: a mean-field control framework for width-varying Neural Networks5 Jul 2023
- 2022Duality for Neural Networks through Reproducing Kernel Banach Spaces9 Nov 2022