paper-with-me

홈 › Papers

Stochastic Adaptive Gradient Descent Without Descent

2025-09-18 · Jean-François Aujol, Jérémie Bigot, Camille Castera arxiv

We introduce a new adaptive step-size strategy for convex optimization with stochastic gradient that exploits the local geometry of the objective function only by means of a first-order stochastic oracle and without any hyper-parameter tuning. The method comes from a theoretically-grounded adaptation of the Adaptive Gradient Descent Without Descent method to the stochastic setting. We prove the convergence of stochastic gradient descent with our step-size under various assumptions, and we show that it empirically competes against tuned baselines.

📄 PDF Abstract BibTeX arXiv:2509.14969

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Recurrent neural network training with preconditioned stochastic gradient descent

2016-06-14 · Xi-Lin Li

This paper studies the performance of a recently proposed preconditioned stochastic gradient descent (PSGD) algorithm on recurrent neural network (RNN) training. PSGD adaptively estimates a preconditioner to accelerate g…

Handwritten Digit Recognition

Optimal Adaptive and Accelerated Stochastic Gradient Descent

2018-10-01 · Qi Deng, Yi Cheng, Guanghui Lan

Stochastic gradient descent (\textsc{Sgd}) methods are the most powerful optimization tools in training machine learning and deep learning models. Moreover, acceleration (a.k.a. momentum) methods and diagonal scaling (a.…

BIG-bench Machine LearningStochastic Optimization

Adaptive Stochastic Gradient Descents on Manifolds with an Application on Weighted Low-Rank Approximation

2025-03-14 · Peiqi Yang, Conglong Xu, Hao Wu

We prove a convergence theorem for stochastic gradient descents on manifolds with adaptive learning rate and apply it to the weighted low-rank approximation problem.

Exponential Convergence of (Stochastic) Gradient Descent for Separable Logistic Regression

2026-02-21 · Sacchit Kale, Piyushi Manupriya, Pierre Marion, Francis Bach 외 arxiv

Gradient descent and stochastic gradient descent are central to modern machine learning, yet their behavior under large step sizes remains theoretically unclear. Recent work suggests that acceleration often arises near t…

Stochastic Runge-Kutta methods and adaptive SGD-G2 stochastic gradient descent

2020-02-20 · Imen Ayadi, Gabriel Turinici

The minimization of the loss function is of paramount importance in deep neural networks. On the other hand, many popular optimization algorithms have been shown to correspond to some evolution equation of gradient flow …