mlsanityData to 7 Oct 2026

slimTrain -- A Stochastic Approximation Method for Training Separable Deep Neural Networks

arXiv 2109.14002 ↗First posted 28 Sep 2021cs.LG cs.NA math.NAcited by 6

Not on the map. Why?

Abstract (arXiv)

Deep neural networks (DNNs) have shown their success as high-dimensional function approximators in many applications; however, training DNNs can be challenging in general. DNN training is commonly phrased as a stochastic optimization problem whose challenges include non-convexity, non-smoothness, insufficient regularization, and complicated data distributions. Hence, the performance of DNNs on a given task depends crucially on tuning hyperparameters, especially learning rates and regularization parameters. In the absence of theoretical guidelines or prior experience on similar tasks, this requires solving many training problems, which can be time-consuming and demanding on computational resources. This can limit the applicability of DNNs to problems with non-standard, complex, and scarce datasets, e.g., those arising in many scientific applications. To remedy the challenges of DNN training, we propose slimTrain, a stochastic optimization method for training DNNs with reduced sensitivity to the choice hyperparameters and fast initial convergence. The central idea of slimTrain is to exploit the separability inherent in many DNN architectures; that is, we separate the DNN into a nonlinear feature extractor followed by a linear model. This separability allows us to leverage recent advances made for solving large-scale, linear, ill-posed inverse problems. Crucially, for the linear weights, slimTrain does not require a learning rate and automatically adapts the regularization parameter. Since our method operates on mini-batches, its computational overhead per iteration is modest. In our numerical experiments, slimTrain outperforms existing DNN training methods with the recommended hyperparameter settings and reduces the sensitivity of DNN training to the remaining hyperparameters.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 24 of its 56 references that are in the map. First posted on arXiv 28 Sep 2021.

Builds on

24 of 56 references.

References · 24

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
  5. 2018Neural Ordinary Differential Equationscited by 3,733
  6. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  7. 2017Stable Architectures for Deep Neural Networkscited by 340
  8. 2019Physics-Constrained Deep Learning for High-dimensional Surrogate Modeling and Uncertainty Quantification without Labeled Datacited by 261
  9. 2020Model Reduction and Neural Networks for Parametric PDEscited by 257
  10. 2015Coordinate Descent Algorithmscited by 218
  11. 2018Bayesian Deep Convolutional Encoder-Decoder Networks for Surrogate Modeling and Uncertainty Quantificationcited by 199
  12. 2018Deep Neural Networks Motivated by Partial Differential Equationscited by 187
12 more
  1. 2020Evaluation of Neural Architectures Trained with Square Loss vs Cross-Entropy in Classification Taskscited by 137
  2. 2018Deep UQ: Learning deep neural network surrogate models for high dimensional uncertainty quantificationcited by 81
  3. 2014A Stochastic Quasi-Newton Method for Large-Scale Optimizationcited by 68
  4. 2019Robust Training and Initialization of Deep Neural Networks: An Adaptive Basis Viewpointcited by 42
  5. 2020Derivative-Informed Projected Neural Networks for High-Dimensional Parametric Maps Governed by PDEscited by 40
  6. 2016Exact and Inexact Subsampled Newton Methods for Optimizationcited by 38
  7. 2016Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimizationcited by 37
  8. 2017Second-Order Optimization for Non-Convex Machine Learning: An Empirical Studycited by 35
  9. 2020Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projectioncited by 12
  10. 2020A block coordinate descent optimizer for classification problems exploiting convexitycited by 5
  11. 2019Inexact Newton Methods for Stochastic Nonconvex Optimization with Applications to Neural Network Trainingcited by 4
  12. 2017Stochastic Newton and Quasi-Newton Methods for Large Linear Least-squares Problemscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 1; 2024: 0; 2025: 1; 2026: 2.

6 papers.