Fetching the paper…
Reading the bibliography…
We consider the minimization of composite objective functions composed of the expectation of quadratic functions and an arbitrary convex function.
On the uniform convexity of L p L^{p} and l p l^{p}
O. Hanner · 1956
Earlier work this paper cites.
Fonctions convexes duales et points proximaux dans un espace Hilbertien
J.-J. Moreau · 1962
Earlier work this paper cites.
A relaxation method of finding a common point of convex sets and its application to the solution of problems in convex programming
L. M. Bregman · 1967
Earlier work this paper cites.
Breve communication. régularisation d’inéquations variationnelles par approximations successives
B. Martinet · 1970
Earlier work this paper cites.
Convex analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
Effective methods for the solution of convex programming problems of large dimensions
A. S. Nemirovski and D. B. Yudin · 1979
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. S. Nemirovsky and D. B. Yudin · 1983
Earlier work this paper cites.
Strong and weak convexity of sets and functions
J.-P. Vial · 1983
Earlier work this paper cites.
Acceleration of stochastic approximation by averaging
B. T. Polyak and A. B. Juditsky · 1992
Earlier work this paper cites.
Adaptive processing: The least mean squares approach with applications in transmission
O. Macchi · 1995
Earlier work this paper cites.
A probabilistic theory of pattern recognition , volume 31 of Applications of Mathematics (New York)
L. Devroye, L. Györfi, and G. Lugosi · 1996
Earlier work this paper cites.
Legendre functions and the method of random Bregman projections
H. H. Bauschke and J. M. Borwein · 1997
Earlier work this paper cites.
Exponentiated gradient versus gradient descent for linear predictors
J. Kivinen and M. K. Warmuth · 1997
Earlier work this paper cites.
Proximal minimization methods with generalized Bregman functions
K. C. Kiwiel · 1997
Earlier work this paper cites.
The robustness of the p p -norm algorithms
C. Gentile and N. Littlestone · 1999
Earlier work this paper cites.
Functional aggregation for nonparametric regression
A. Juditsky and A. S. Nemirovski · 2000
Earlier work this paper cites.
Fundamentals of convex analysis
J.-B. Hiriart-Urruty and C. Lemaréchal · 2001
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
A. Beck and M. Teboulle · 2003
Earlier work this paper cites.
Stochastic Approximation and Recursive Algorithms and Applications , volume 35
H. Kushner and G G. Yin · 2003
Earlier work this paper cites.
Optimal rates of aggregation
A. B. Tsybakov · 2003
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Cited alongside, same era.
Introductory Lectures on Convex Optimization , volume 87 of Applied Optimization
Y. Nesterov · 2004
Cited alongside, same era.
Efficient algorithms for online decision problems
A. Kalai and S. Vempala · 2005
Cited alongside, same era.
Prediction, learning, and games
N. Cesa-Bianchi and G. Lugosi · 2006
Cited alongside, same era.
Optimal oracle inequality for aggregation of classifiers under low noise condition
G. Lecué · 2006
Cited alongside, same era.
Online learning meets optimization in the dual
S. Shalev-Shwartz and Y. Singer · 2006
Cited alongside, same era.
Optimal distributed online prediction using mini-batches
O. Dekel, R. Gilad-Bachrach, O. Shamir, and L. Xiao · 2012
Later among the works it cites.
Dual averaging for distributed optimization: convergence analysis and network scaling
J. Duchi, A. Agarwal, and M. Wainwright · 2012
Later among the works it cites.
Manifold identification in dual averaging for regularized stochastic online learning
S. Lee and S. J. Wright · 2012
Later among the works it cites.
Non-strongly-convex smooth stochastic approximation with convergence rate O ( 1 / n ) O(1/n)
F. Bach and E. Moulines · 2013
Later among the works it cites.
First-order methods with inexact oracle: the strongly convex case
O. Devolder, F. Glineur, and Y. Nesterov · 2013
Later among the works it cites.
Gradient methods for minimizing composite functions
Y. Nesterov · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Lecué · 2007
Cited alongside, same era.
Competing in the dark: An efficient algorithm for bandit linear optimization
J. Abernethy, E. Hazan, and A. Rakhlin · 2008
Cited alongside, same era.
Introduction to Nonparametric Estimation
A. B. Tsybakov · 2008
Cited alongside, same era.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Cited alongside, same era.
Primal-dual subgradient methods for convex problems
Y. Nesterov · 2009
Cited alongside, same era.
Mind the duality gap: Logarithmic regret algorithms for online optimization
S. Shalev-Shwartz and S. m. Kakade · 2009
Cited alongside, same era.
Later among the works it cites.
Dual averaging and proximal gradient descent for online alternating direction multiplier method
T. Suzuki · 2013
Later among the works it cites.
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
A. Defazio, F. Bach, and S. Lacoste-Julien · 2014
Later among the works it cites.
Sparse modeling: theory, algorithms, and applications
I. Rish and G. Grabarnik · 2014
Later among the works it cites.
Duality between subgradient and conditional gradient methods
F. Bach · 2015
Later among the works it cites.
From averaging to acceleration, there is only a step-size
N. Flammarion and F. Bach · 2015
Later among the works it cites.
Accelerated mirror descent in continuous and discrete time
W. Krichene, A. Bayen, and P. L. Bartlett · 2015
Later among the works it cites.
A descent lemma beyond lipschitz gradient continuity: first-order methods revisited and applications
H. H. Bauschke, J. Bolte, and M. Teboulle · 2016
Later among the works it cites.
Gossip dual averaging for decentralized optimization of pairwise functions
I. Colin, A. Bellet, J. Salmon, and S. Clémençon · 2016
Later among the works it cites.
Harder, better, faster, stronger convergence rates for least-squares regression
A. Dieuleveut, N. Flammarion, and F. Bach · 2016
Later among the works it cites.
J. Duchi and F. Ruan · 2016
Later among the works it cites.
Parallelizing stochastic approximation through mini-batching and tail-averaging
P. Jain, S. M. Kakade, R. Kidambi, P. Netrapalli, and A. Sidford · 2016
Later among the works it cites.
Relatively-smooth convex optimization by first-order methods, and applications
H. Lu, R. Freund, and Y. Nesterov · 2016
Later among the works it cites.
A variational perspective on accelerated methods in optimization
A. Wibisono, A. C. Wilson, and M. I. Jordan · 2016
Later among the works it cites.
A Lyapunov analysis of momentum methods in optimization
A. I. Wilson, B. Recht, and M. I. Jordan · 2016
Later among the works it cites.