paper-with-me

홈 › Papers

Second-order step-size tuning of SGD for non-convex optimization

2021-03-05 · Camille Castera, Jérôme Bolte, Cédric Févotte, Edouard Pauwels

In view of a direct and simple improvement of vanilla SGD, this paper presents a fine-tuning of its step-sizes in the mini-batch case. For doing so, one estimates curvature, based on a local quadratic model and using only noisy gradient approximations. One obtains a new stochastic first-order method (Step-Tuned SGD), enhanced by second-order information, which can be seen as a stochastic version of the classical Barzilai-Borwein method. Our theoretical results ensure almost sure convergence to the critical set and we provide convergence rates. Experiments on deep residual network training illustrate the favorable properties of our approach. For such networks we observe, during training, both a sudden drop of the loss and an improvement of test accuracy at medium stages, yielding better results than SGD, RMSprop, or ADAM.

📄 PDF Abstract BibTeX arXiv:2103.03570

Code (1)

Abdoulaye-Koroko/Second-order-step-size-tuning-of-SGD-for-non-convex-optimization pytorch

Methods 이 논문이 사용한 방법론

SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…

Similar Papers 제목 키워드 기반

First-ish Order Methods: Hessian-aware Scalings of Gradient Descent

2025-02-06 · Oscar Smee, Fred Roosta, Stephen J. Wright

Gradient descent is the primary workhorse for optimizing large-scale problems in machine learning. However, its performance is highly sensitive to the choice of the learning rate. A key limitation of gradient descent is …

valid

Doubly Adaptive Scaled Algorithm for Machine Learning Using Second-Order Information

2021-09-11 · ICLR 2022 4 · Majid Jahani, Sergey Rusakov, Zheng Shi, Peter Richtárik 외

We present a novel adaptive optimization algorithm for large-scale machine learning problems. Equipped with a low-cost estimate of local curvature and Lipschitz smoothness, our method dynamically adapts the search direct…

BIG-bench Machine LearningSecond-order methods

SP2: A Second Order Stochastic Polyak Method

2022-07-17 · Shuang Li, William J. Swartworth, Martin Takáč, Deanna Needell 외

Recently the "SP" (Stochastic Polyak step size) method has emerged as a competitive adaptive method for setting the step sizes of SGD. SP can be interpreted as a method specialized to interpolated models, since it solves…

Matrix CompletionSecond-order methods

Bayesian Natural Gradient Fine-Tuning of CLIP Models via Kalman Filtering

2025-11-03 · Hossein Abdi, Mingfei Sun, Wei Pan arxiv

Vision-language pre-trained models, such as CLIP, have established new benchmarks in multimodal data mining. In such models, few-shot fine-tuning is a major challenge to achieve optimal performance on both in-distributio…

Image ClassificationBayesian Inference

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization

2024-06-04 · Ruichen Jiang, Ali Kavis, Qiujiang Jin, Sujay Sanghavi 외

We propose adaptive, line search-free second-order methods with optimal rate of convergence for solving convex-concave min-max problems. By means of an adaptive step size, our algorithms feature a simple update rule that…

Second-order methods