paper-with-me

홈 › Papers

A Simple Practical Accelerated Method for Finite Sums

2016-02-08 · NeurIPS 2016 12 · Aaron Defazio

We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems. Our method has only one parameter (a step size), and is radically simpler than other accelerated methods for finite sums. Additionally it can be applied when the terms are non-smooth, yielding a method applicable in many areas where operator splitting methods would traditionally be applied.

📄 PDF Abstract BibTeX arXiv:1602.02442

Code (1)

adefazio/point-saga 공식 구현

Methods 이 논문이 사용한 방법론

SAGA SAGA is a method in the spirit of SAG, SDCA, MISO and SVRG, a set of recently proposed incremental gradient algorithms with fast linear convergence rates. SAGA improves on the…

Similar Papers 제목 키워드 기반

Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums

2021-05-25 · NeurIPS 2021 12 · Kaiwen Zhou, Lai Tian, Anthony Man-Cho So, James Cheng

In convex optimization, the problem of finding near-stationary points has not been adequately studied yet, unlike other optimality measures such as the function value. Even in the deterministic case, the optimal method (…

Accelerated Stochastic Gradient Descent for Minimizing Finite Sums

2015-06-09 · Atsushi Nitanda

We propose an optimization method for minimizing the finite sums of smooth convex functions. Our method incorporates an accelerated gradient descent (AGD) and a stochastic variance reduction gradient (SVRG) in a mini-bat…

Limitations on Variance-Reduction and Acceleration Schemes for Finite Sums Optimization

2017-12-01 · NeurIPS 2017 12 · Yossi Arjevani

We study the conditions under which one is able to efficiently apply variance-reduction and acceleration schemes on finite sums problems. First, we show that perhaps surprisingly, the finite sum structure, by itself, is…

Variance Reduction via Primal-Dual Accelerated Dual Averaging for Nonsmooth Convex Finite-Sums

2021-02-26 · Chaobing Song, Stephen J. Wright, Jelena Diakonikolas

We study structured nonsmooth convex finite-sum optimization that appears widely in machine learning applications, including support vector machines and least absolute deviation. For the primal-dual formulation of this p…

SignSVRG: fixing SignSGD via variance reduction

2023-05-22 · Evgenii Chzhen, Sholom Schechtman

We consider the problem of unconstrained minimization of finite sums of functions. We propose a simple, yet, practical way to incorporate variance reduction techniques into SignSGD, guaranteeing convergence that is simil…