A Layer Separation Optimization Framework for Cross-Entropy Training in Deep Learning
Not on the map. Why?
Abstract (arXiv)
This paper investigates the deep learning optimization problem with softmax cross-entropy loss. We propose a layer separation strategy to alleviate the strong nonconvexity encountered during training deep networks. For cross-entropy models with fully connected and convolutional neural networks, we introduce auxiliary variables associated with hidden layer outputs and construct corresponding layer separation models, which decompose the original deeply nested optimization problem into a sequence of more manageable subproblems. We also conduct theoretical analyses, proving that the new layer separation loss provides an upper bound for the original cross-entropy loss. Moreover, we design alternating minimization algorithms and prove that, under appropriate conditions, these algorithms exhibit decreasing properties of the loss function. Numerical experiments validate the effectiveness of the proposed methods and indicate improved optimization behavior, especially for fully connected and convolutional neural networks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 20 references that are in the map. First posted on arXiv 25 Apr 2026.
Builds on
15 of 20 references.
References · 15
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
- 2019Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networkscited by 222
- 2019Towards moderate overparameterization: global convergence guarantees for training shallow neural networkscited by 176
- 2019An Improved Analysis of Training Over-parameterized Deep Neural Networkscited by 121
- 2019A Comparative Analysis of the Optimization and Generalization Property of Two-layer Neural Network and Random Feature Models Under Gradient Descent Dynamicscited by 49
3 more
Built on by
Not cited yet.