Steepest Descent Neural Architecture Optimization: Escaping Local Optimum with Signed Neural Splitting
Not on the map. Why?
Abstract (arXiv)
Developing efficient and principled neural architecture optimization methods is a critical challenge of modern deep learning. Recently, Liu et al.[19] proposed a splitting steepest descent (S2D) method that jointly optimizes the neural parameters and architectures based on progressively growing network structures by splitting neurons into multiple copies in a steepest descent fashion. However, S2D suffers from a local optimality issue when all the neurons become "splitting stable", a concept akin to local stability in parametric optimization. In this work, we develop a significant and surprising extension of the splitting descent framework that addresses the local optimality issue. The idea is to observe that the original S2D is unnecessarily restricted to splitting neurons into positive weighted copies. By simply allowing both positive and negative weights during splitting, we can eliminate the appearance of splitting stability in S2D and hence escape the local optima to obtain better performance. By incorporating signed splittings, we significantly extend the optimization power of splitting steepest descent both theoretically and empirically. We verify our method on various challenging benchmarks such as CIFAR-100, ImageNet and ModelNet40, on which we outperform S2D and other advanced methods on learning accurate and energy-efficient neural networks.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Mar 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 3; 2024: 5; 2025: 2.
14 papers.
Sort:
By area:
- 2021bert2BERT: Towards Reusable Pretrained Language Modelscited by 70
- 2022GradMax: Growing Neural Networks using Gradient Informationcited by 64
- 2021Firefly Neural Architecture Descent: a General Approach for Growing Neural Networkscited by 48
- 2024Unified Gradient-Based Machine Unlearning with Remain Geometry Enhancementcited by 43
- 2022Sparsity Winning Twice: Better Robust Generalization from More Efficient Trainingcited by 41
- 2023Reusing Pretrained Models by Multi-linear Operators for Efficient Trainingcited by 15
- 2025Steepest Descent Density Control for Compact 3D Gaussian Splattingcited by 13
- 2024Preparing Lessons for Progressive Training on Language Modelscited by 10
- 2023Accelerated Training via Incrementally Growing Neural Networks using Variance Transfer and Learning Rate Adaptationcited by 8
- 2023Split-Ensemble: Efficient OOD-aware Ensemble via Task and Model Splittingcited by 4
- 2024When To Grow? A Fitting Risk-Aware Policy for Layer Growing in Deep Neural Networkscited by 3
- 2025Flat Channels to Infinity in Neural Loss Landscapescited by 3
- 2025Flat Channels to Infinity in Neural Loss Landscapes17 Jun 2025
- 2025Steepest Descent Density Control for Compact 3D Gaussian Splatting8 May 2025
- 2024Learning Morphisms with Gauss-Newton Approximation for Growing Networks7 Nov 2024
- 2024Unified Gradient-Based Machine Unlearning with Remain Geometry Enhancement29 Sep 2024
- 2024Beyond Uniform Scaling: Exploring Depth Heterogeneity in Neural Architectures19 Feb 2024
- 2024Preparing Lessons for Progressive Training on Language Models17 Jan 2024
- 2024When To Grow? A Fitting Risk-Aware Policy for Layer Growing in Deep Neural Networks6 Jan 2024
- 2023Split-Ensemble: Efficient OOD-aware Ensemble via Task and Model Splitting14 Dec 2023
- 2023Reusing Pretrained Models by Multi-linear Operators for Efficient Training16 Oct 2023
- 2023Accelerated Training via Incrementally Growing Neural Networks using Variance Transfer and Learning Rate Adaptation22 Jun 2023
- 2022Sparsity Winning Twice: Better Robust Generalization from More Efficient Training20 Feb 2022
- 2022GradMax: Growing Neural Networks using Gradient Information13 Jan 2022
2 more
- 2021bert2BERT: Towards Reusable Pretrained Language Modelscited by 70
- 2022GradMax: Growing Neural Networks using Gradient Informationcited by 64
- 2021Firefly Neural Architecture Descent: a General Approach for Growing Neural Networkscited by 48
- 2022Sparsity Winning Twice: Better Robust Generalization from More Efficient Trainingcited by 41
- 2023Reusing Pretrained Models by Multi-linear Operators for Efficient Trainingcited by 15
- 2025Steepest Descent Density Control for Compact 3D Gaussian Splattingcited by 13
- 2024Preparing Lessons for Progressive Training on Language Modelscited by 10
- 2023Accelerated Training via Incrementally Growing Neural Networks using Variance Transfer and Learning Rate Adaptationcited by 8
- 2023Split-Ensemble: Efficient OOD-aware Ensemble via Task and Model Splittingcited by 4
- 2024When To Grow? A Fitting Risk-Aware Policy for Layer Growing in Deep Neural Networkscited by 3
- 2025Flat Channels to Infinity in Neural Loss Landscapescited by 3
- 2024Learning Morphisms with Gauss-Newton Approximation for Growing Networkscited by 1
12 most cited of 13 All 13 (JSON)
- 2025Flat Channels to Infinity in Neural Loss Landscapes17 Jun 2025
- 2025Steepest Descent Density Control for Compact 3D Gaussian Splatting8 May 2025
- 2024Learning Morphisms with Gauss-Newton Approximation for Growing Networks7 Nov 2024
- 2024Beyond Uniform Scaling: Exploring Depth Heterogeneity in Neural Architectures19 Feb 2024
- 2024Preparing Lessons for Progressive Training on Language Models17 Jan 2024
- 2024When To Grow? A Fitting Risk-Aware Policy for Layer Growing in Deep Neural Networks6 Jan 2024
- 2023Split-Ensemble: Efficient OOD-aware Ensemble via Task and Model Splitting14 Dec 2023
- 2023Reusing Pretrained Models by Multi-linear Operators for Efficient Training16 Oct 2023
- 2023Accelerated Training via Incrementally Growing Neural Networks using Variance Transfer and Learning Rate Adaptation22 Jun 2023
- 2022Sparsity Winning Twice: Better Robust Generalization from More Efficient Training20 Feb 2022
- 2022GradMax: Growing Neural Networks using Gradient Information13 Jan 2022
- 2021bert2BERT: Towards Reusable Pretrained Language Models14 Oct 2021
12 newest of 13 All 13 (JSON)