paper-with-me

홈 › Papers

Hessian-Free High-Resolution Nesterov Acceleration for Sampling

2020-06-16 · Ruilin Li, Hongyuan Zha, Molei Tao

Nesterov's Accelerated Gradient (NAG) for optimization has better performance than its continuous time limit (noiseless kinetic Langevin) when a finite step-size is employed \citep{shi2021understanding}. This work explores the sampling counterpart of this phenonemon and proposes a diffusion process, whose discretizations can yield accelerated gradient-based MCMC methods. More precisely, we reformulate the optimizer of NAG for strongly convex functions (NAG-SC) as a Hessian-Free High-Resolution ODE, change its high-resolution coefficient to a hyperparameter, inject appropriate noise, and discretize the resulting diffusion process. The acceleration effect of the new hyperparameter is quantified and it is not an artificial one created by time-rescaling. Instead, acceleration beyond underdamped Langevin in $W_2$ distance is quantitatively established for log-strongly-concave-and-smooth targets, at both the continuous dynamics level and the discrete algorithm level. Empirical experiments in both log-strongly-concave and multi-modal cases also numerically demonstrate this acceleration.

📄 PDF Abstract BibTeX arXiv:2006.09230

Code (0)

등록된 구현이 없습니다.

Tasks

Vocal Bursts Intensity Prediction

Similar Papers 제목 키워드 기반

FLeNS: Federated Learning with Enhanced Nesterov-Newton Sketch

2024-09-23 · Sunny Gupta, Mohit Jindal, Pankhi Kashyap, Pranav Jeevan 외

Federated learning faces a critical challenge in balancing communication efficiency with rapid convergence, especially for second-order methods. While Newton-type algorithms achieve linear convergence in communication ro…

Dimensionality ReductionEdge-computingFederated LearningSecond-order methods

Acceleration through spectral density estimation

2020-01-01 · ICML 2020 1 · Fabian Pedregosa, Damien Scieur

We develop a framework for designing optimal optimization methods in terms of their average-case runtime. This yields a new class of methods that achieve acceleration through a model of the Hessian's expected spectral de…

Density Estimationregression

“Convex Until Proven Guilty”: Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions

2017-08-01 · ICML 2017 8 · Yair Carmon, John C. Duchi, Oliver Hinder, Aaron Sidford

We develop and analyze a variant of Nesterov’s accelerated gradient descent (AGD) for minimization of smooth non-convex functions. We prove that one of two cases occurs: either our AGD variant converges quickly, as …

SHANG++: Robust Stochastic Acceleration under Multiplicative Noise

2026-03-10 · Yaxin Yu, Long Chen, Minfu Feng arxiv

Under the multiplicative noise scaling (MNS) condition, original Nesterov acceleration is provably sensitive to noise and may diverge when gradient noise overwhelms the signal. In this paper, we develop two accelerated s…

Nesterov's Acceleration For Approximate Newton

2017-10-17 · Haishan Ye, Zhihua Zhang

Optimization plays a key role in machine learning. Recently, stochastic second-order methods have attracted much attention due to their low computational cost in each iteration. However, these algorithms might perform po…

Second-order methods