Overview

Gradient descent is a family of methods that repeatedly adjusts parameters in the direction that lowers an objective, making it a basic tool for training neural networks and fitting models such as logistic regression. Common approaches include full-batch and stochastic gradient descent, momentum and Nesterov acceleration, adaptive optimizers such as Adam, and geometry-aware variants such as natural, preconditioned, projected, or mirror descent. Theory and applications span deep-network training, matrix recovery, differential privacy, and decentralized or federated learning, with evaluations often measuring convergence, prediction quality, communication, memory, or privacy cost. A central tension is that larger or adaptive steps can speed training but also cause oscillations or instability, while the geometry, noise, and stopping time can change both which solution is reached and how well it generalizes.

Latest papers

CardsList

118 papers16 papers in the last four weeks, up 60% on the four weeks before. 0.1% of all new papers.

  1. Gradient descent reaches arbitrary accuracy in a fixed number of large steps on multiclass logistic regression

    Oct 19, 2026Andreea-Alexandra Musat, Nicolas BoumalGradient DescentLogistic Regression

  2. Understanding Stability of Outer Nesterov Momentum on Stochastic Pseudo-Gradients

    Oct 15, 2026Nishant Sharma, Laura Gomezjurado Gonzalez, Ganesh Talluri +2Neural Network StabilityNeural Network Training Dynamics

  3. Geometry-Aware Multi-Objective Optimization: Norm-Constrained Oracles with Entropic Weight Updates

    Oct 9, 2026El Mahdi Chayti, Alireza Mirrokni, Martin JaggiLMO MethodsMulti-Objective Optimization

  4. Inference and learning in sparse autoencoders as natural gradient flow

    Oct 5, 2026Hadi Vafaii, Tejas Rao, David Chanin +6Gradient DescentSparse Autoencoders

  5. Interleaved Projected Gradient Descent for Safe Imitation Learning

    Oct 5, 2026Shengfan Cao, Francesco BorrelliGradient DescentImitation Learning

  6. Learning Decision-Stump Thresholds in Context: Dynamics of Softmax Attention

    Oct 5, 2026Hong Ha Le, Jackie Lok, Atsushi Nitanda +1Language Model PretrainingSoftmax Attention

  7. Smoothed Gradient Method for Nonconvex Federated Stochastic Bilevel Optimization

    Oct 4, 2026Xinwen Zhang, Peiran Yu, Zhaosong Lu +1Gradient DescentNonconvex Stochastic Optimization

  8. Differential Privacy of Gradient Descent on Perturbed Objectives

    Oct 2, 2026Austin Watkins, Raman AroraDifferential PrivacyGradient Descent

  9. CAGE-NAS: Certified Functional Descent for Efficient Model Growth

    Oct 1, 2026Santiago Florido Gomez, Stéphane RivaudGradient DescentNeural Network Optimization

  10. Convex Optimization Is Free When Accuracy Is Expensive

    Sep 28, 2026Arthur Paing, Arthur JacotStochastic OptimizationGradient Descent

  11. LionMuon: Alternating Spectral and Sign Descent for Efficient Training

    Sep 28, 2026Arman Bolatov, Artem Riabinin, Nikita Kornilov +4Stochastic OptimizationLanguage Model Pretraining

  12. Overfitting of Spectral Gradient Descent: How Matrix Geometry shapes Generalization and Implicit Bias

    Sep 26, 2026Guillaume Braun, Ichiro Hashimoto, Masaaki ImaizumiGradient DescentNeural Network Generalization

  13. Averaged Mirror Descent and Dual Gradient Methods: Convergent Algorithms for Entropic Gromov-Wasserstein Problems

    Sep 25, 2026Joanna Marks, Gabriel Rioux, Riccardo PasseggeriGradient DescentMirror Descent

  14. Continuous Optimization for p-adic Models

    Sep 21, 2026Julian Salazar, Dimitri Kanevsky, Matt Harvey +2Gradient Descent

  15. Gradient Descent with Stochastic Subspaces via Persistence of Memory

    Sep 16, 2026Subhroshekhar Ghosh, Clement Z. Q. Ng, Pierre-Louis Poirion +1Gradient DescentStochastic Optimization Convergence

  16. Geometry of learning dynamics: Gradient descent versus natural gradient on the ridge of optimization

    Sep 15, 2026Akira TamamoriInformation GeometryGradient Descent

  17. Stochastic Nonconvex Bilevel Optimization: Improved Rates Without Rare-Visit Assumption

    Sep 6, 2026Daniel Cortild, Mathias Staudigl, Juan Peypouquet +1Stochastic Bilevel OptimizationBilevel Optimization

  18. Momentum in large-batch training: Polyak enlarges the critical batch size, Nesterov improves data efficiency

    Sep 2, 2026Jia-Nan Wang, Zixun Huang, Kairui Li +2Momentum MethodsGradient Descent

  19. Efficient Hypergradient Descent for Inverse Reinforcement Learning

    Aug 11, 2026Nikita Sevriukov, Anna Barabanova, Uliana Gagarina +4Reinforcement LearningGradient Descent

  20. A lower bound for stepsize-based acceleration of gradient descent

    Aug 11, 2026Jianhao Ma, Yuxin ChenLearning Rate SchedulingLast-Iterate Convergence