Fetching the paper…
Reading the bibliography…
We propose a doubly stochastic primal-dual coordinate optimization algorithm for empirical risk minimization, which can be formulated as a bilinear saddle-point problem.
Prox-method with rate of convergence o ( 1 / t ) o(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle-point problems
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Earlier work this paper cites.
Smooth minimization of nonsmooth functions
Yu. Nesterov · 2005
Earlier work this paper cites.
Fast solvers and efficient implementations for distance metric learning
Kilian Q. Weinberger and Lawrence K. Saul · 2008
Earlier work this paper cites.
Stochastic methods for l1 regularized loss minimization
Shai Shalev-Shwartz and Ambuj Tewari · 2009
Earlier work this paper cites.
Distance metric learning for large margin nearest neighbor classification
Kilian Q. Weinberger and Lawrence K. Saul · 2009
Earlier work this paper cites.
Large margin multi-task metric learning
Shibin Parameswaran and Kilian Q. Weinberger · 2010
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
A Chambolle and T Pock · 2011
Earlier work this paper cites.
Faster least squares approximation
Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, and Tamàs Sarlós · 2011
Earlier work this paper cites.
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
N. Halko, P. G. Martinsson, and J. A. Tropp · 2011
Earlier work this paper cites.
Randomized algorithms for matrices and data
Michael W. Mahoney · 2011
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Earlier work this paper cites.
A stochastic gradient method with an exponential convergence rate for finite training sets
N. Le Roux, M. Schmidt, and F. Bach · 2012
Earlier work this paper cites.
Nyström method vs random fourier features: A theoretical and empirical comparison
Tianbao Yang, Yu feng Li, Mehrdad Mahdavi, Rong Jin, and Zhi hua Zhou · 2012
Earlier work this paper cites.
Accelerated, parallel and proximal coordinate descent
Olivier Fercoq and Peter Richtárik · 2013
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Cited alongside, same era.
Semi-stochastic gradient descent methods
Jakub Konecný and Peter Richtárik · 2013
Cited alongside, same era.
Minimizing finite sums with the stochastic average gradient
Mark W. Schmidt, Nicolas Le Roux, and Francis R. Bach · 2013
Cited alongside, same era.
Scalable kernel methods via doubly stochastic gradients
Bo Dai, Bo Xie, Niao He, Yingyu Liang, Anant Raj, Maria-Florina Balcan, and Le Song · 2014
Cited alongside, same era.
Randomized first-order methods for saddle point optimization
Cong Dang and Guanghui Lan · 2014
Cited alongside, same era.
An optimal randomized incremental gradient method
Guanghui Lan and Yi Zhou · 2015
Closest in time.
An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
Qihang Lin, Zhaosong Lu, and Lin Xiao · 2015
Closest in time.
On the complexity analysis of randomized block-coordinate descent methods
Zhaosong Lu and Lin Xiao · 2015
Closest in time.
Incremental majorization-minimization optimization with application to large-scale machine learning
Julien Mairal · 2015
Closest in time.
Robust sketching for multiple square-root lasso problems
Vu Pham and Laurent El Ghaoui · 2015
Closest in time.
Regularization-free estimation in trace regression with symmetric positive semidefinite matrices
Martin Slawski, Ping Li, and Matthias Hein · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jakub Konecný, Zheng Qu, and Peter Richtárik · 2014
Cited alongside, same era.
Distributed stochastic optimization of the regularized risk
Shin Matsushima, Hyokun Yun, and S. V. N. Vishwanathan · 2014
Cited alongside, same era.
Stochastic proximal gradient descent with acceleration techniques
Atsushi Nitanda · 2014
Cited alongside, same era.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
P. Richtárik and M. Takáč · 2014
Cited alongside, same era.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Cited alongside, same era.
Saddle points and accelerated perceptron algorithms
Adams Wei Yu, Fatma Kilinç-Karzan, and Jaime G. Carbonell · 2014
Cited alongside, same era.
Accelerated mini-batch randomized block coordinate descent method
Tuo Zhao, Mo Yu, Yiming Wang, Raman Arora, and Han Liu · 2014
Cited alongside, same era.
Closest in time.
Stochastic primal-dual coordinate method for regularized empirical risk minimization
Yuchen Zhang and Lin Xiao · 2015
Closest in time.
Katyusha: Accelerated variance reduction for faster sgd
Zeyuan Allen-Zhu · 2016
Closest in time.
Even faster accelerated coordinate descent using non-uniform sampling
Zeyuan Allen-Zhu, Peter Richtárik, Zheng Qu, and Yang Yuan · 2016
Closest in time.
Stochastic variance reduction methods for saddle-point problems
Palaniappan Balamurugan and Francis Bach · 2016
Closest in time.
Importance sampling for minibatches
Dominik Csiba and Peter Richtárik · 2016
Closest in time.
Efficiency of accelerated coordinate descent method on structured optimization problems
Yurii Nesterov and Sebastian Stich · 2016
Closest in time.
On optimal probabilities in stochastic coordinate descent methods
Peter Richtárik and Martin Takáč · 2016
Closest in time.
Jialei Wang, Jason D Lee, Mehrdad Mahdavi, Mladen Kolar, and Nathan Srebro · 2016
Closest in time.