mlsanityData to 7 Oct 2026

A Triple-Inertial Accelerated Alternating Optimization Method for Deep Learning Training

arXiv 2503.08489 ↗First posted 11 Mar 2025cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

The stochastic gradient descent (SGD) algorithm has achieved remarkable success in training deep learning models. However, it has several limitations, including susceptibility to vanishing gradients, sensitivity to input data, and a lack of robust theoretical guarantees. In recent years, alternating minimization (AM) methods have emerged as a promising alternative for model training by employing gradient-free approaches to iteratively update model parameters. Despite their potential, these methods often exhibit slow convergence rates. To address this challenge, we propose a novel Triple-Inertial Accelerated Alternating Minimization (TIAM) framework for neural network training. The TIAM approach incorporates a triple-inertial acceleration strategy with a specialized approximation method, facilitating targeted acceleration of different terms in each sub-problem optimization. This integration improves the efficiency of convergence, achieving superior performance with fewer iterations. Additionally, we provide a convergence analysis of the TIAM algorithm, including its global convergence properties and convergence rate. Extensive experiments validate the effectiveness of the TIAM method, showing significant improvements in generalization capability and computational efficiency compared to existing approaches, particularly when applied to the rectified linear unit (ReLU) and its variants.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 47 references that are in the map. First posted on arXiv 11 Mar 2025.

Builds on

20 of 47 references.

References · 20

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,061
  3. 2018Pitfalls of Graph Neural Network Evaluationcited by 994
  4. 2019On the Convergence of Adam and Beyondcited by 834
  5. 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 282
  6. 2018Sensitivity and Generalization in Neural Networks: an Empirical Studycited by 187
  7. 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 181
  8. 2022Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Modelscited by 172
  9. 2018Which Neural Net Architectures Give Rise To Exploding and Vanishing Gradients?cited by 94
  10. 2016Training Neural Networks Without Gradients: A Scalable ADMM Approachcited by 61
  11. 2017Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problemscited by 40
  12. 2017Convergent Block Coordinate Descent for Training Tikhonov Regularized Deep Neural Networkscited by 26
8 more
  1. 2018Beyond Backprop: Online Alternating Minimization with Auxiliary Variablescited by 23
  2. 2019ADMM for Efficient Deep Learning with Global Convergencecited by 20
  3. 2014Optimized first-order methods for smooth convex minimizationcited by 18
  4. 2018A Proximal Block Coordinate Descent Algorithm for Deep Neural Network Trainingcited by 15
  5. 2019On ADMM in Deep Learning: Convergence and Saturation-Avoidancecited by 15
  6. 2020Toward Model Parallelism for Deep Neural Network based on Gradient-free ADMM Frameworkcited by 9
  7. 2021The Role of Momentum Parameters in the Optimal Convergence of Adaptive Polyak's Heavy-ball Methodscited by 7
  8. 2018Accelerated Gradient-free Neural Network Training by Multi-convex Alternating Optimizationcited by 5

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.