Fetching the paper…
Reading the bibliography…
We provide improved convergence rates for various \emph{non-smooth} optimization problems via higher-order accelerated methods.
Support-vector networks
C. Cortes and V. Vapnik · 1995
Earlier work this paper cites.
Feature selection via concave minimization and support vector machines
P. S. Bradley and O. Mangasarian · 1998
Earlier work this paper cites.
Sequential minimal optimization: A fast algorithm for training support vector machines
J. Platt · 1998
Earlier work this paper cites.
An introduction to support vector machines and other kernel-based learning methods
N. Cristianini, J. Shawe-Taylor, et al · 2000
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
D. A. Spielman and S.-H. Teng · 2004
Earlier work this paper cites.
1-norm support vector machines
J. Zhu, S. Rosset, R. Tibshirani, and T. J. Hastie · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Exact 1-norm support vector machines via unconstrained convex differentiable minimization
O. L. Mangasarian · 2006
Earlier work this paper cites.
Cubic regularization of Newton method and its global performance
Y. Nesterov and B. T. Polyak · 2006
Earlier work this paper cites.
Accelerating the cubic regularization of Newton’s method on convex problems
Y. Nesterov · 2008
Earlier work this paper cites.
Estimate sequence methods: extensions and approximations
M. Baes · 2009
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
P. Christiano, J. A. Kelner, A. Madry, D. A. Spielman, and S.-H. Teng · 2011
Cited alongside, same era.
Pegasos: Primal estimated sub-gradient solver for svm
S. Shalev-Shwartz, Y. Singer, N. Srebro, and A. Cotter · 2011
Cited alongside, same era.
Smoothing and first order methods: A unified framework
A. Beck and M. Teboulle · 2012
Cited alongside, same era.
A fast solver for a class of linear systems
I. Koutis, G. L. Miller, and R. Peng · 2012
Cited alongside, same era.
Prisma: Proximal iterative smoothing algorithm
F. Orabona, A. Argyriou, and N. Srebro · 2012
Cited alongside, same era.
Runtime guarantees for regression problems
H. H. Chin, A. Madry, G. L. Miller, and R. Peng · 2013
Finding approximate local minima faster than gradient descent
N. Agarwal, Z. Allen-Zhu, B. Bullins, E. Hazan, and T. Ma · 2017
Later among the works it cites.
Area-convexity, ℓ ∞ \ell_{\infty} regularization, and undirected multicommodity flow
J. Sherman · 2017
Later among the works it cites.
Oracle complexity of second-order methods for smooth convex optimization
Y. Arjevani, O. Shamir, and R. Shiff · 2018
Later among the works it cites.
Near-optimal method for highly smooth convex optimization
S. Bubeck, Q. Jiang, Y. T. Lee, Y. Li, and A. Sidford · 2018
Later among the works it cites.
Fast minimization of structured convex quartics
B. Bullins · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
R. D. Monteiro and B. F. Svaiter · 2013
Cited alongside, same era.
Gradient methods for minimizing composite functions
Y. Nesterov · 2013
Cited alongside, same era.
An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
J. A. Kelner, Y. T. Lee, L. Orecchia, and A. Sidford · 2014
Cited alongside, same era.
Path finding methods for linear programming: Solving linear programs in õ(sqrt(rank)) iterations and faster algorithms for maximum flow
Y. T. Lee and A. Sidford · 2014
Cited alongside, same era.
Optimal black-box reductions between optimization objectives
Z. Allen-Zhu and E. Hazan · 2016
Cited alongside, same era.
Tight complexity bounds for optimizing composite objectives
B. E. Woodworth and N. Srebro · 2016
Cited alongside, same era.
M. B. Cohen, Y. T. Lee, and Z. Song · 2018
Later among the works it cites.
Complexity of finding near-stationary points of convex functions stochastically
D. Davis and D. Drusvyatskiy · 2018
Later among the works it cites.
The global rate of convergence for optimal tensor methods in smooth convex optimization
A. Gasnikov, P. Dvurechensky, E. Gorbunov, D. Kovalev, A. Mohhamed, E. Chernousova, and C. A. Uribe · 2018
Later among the works it cites.
An optimal high-order tensor method for convex optimization
B. Jiang, H. Wang, and S. Zhang · 2018
Later among the works it cites.
Implementable tensor methods in unconstrained convex optimization
Y. Nesterov · 2018
Later among the works it cites.
Coordinate methods for accelerating ℓ ∞ \ell_{\infty} regression and faster approximate maximum flow
A. Sidford and K. Tian · 2018
Later among the works it cites.
Improved convergence for ℓ ∞ \ell_{\infty} and ℓ 1 \ell_{1} regression via iteratively reweighted least squares
A. Ene and A. Vladu · 2019
Closest in time.