The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Open accessAbstract
We introduce a proximal version of the stochastic dual coordinate ascent method and show how to accelerate the method using an inner-outer iteration procedure. We analyze the runtime of the framework and obtain rates that improve state-of-the-art results for various key machine learning optimization problems including SVM, logistic regression, ridge regression, Lasso, and multiclass SVM. Experiments validate our theoretical findings.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Understanding Machine Learning: From Theory to Algorithms
Shalev-Shwartz, S., & Ben-David, S. (2014) · doi:10.1017/cbo9781107298019 · Cited by 3,115
Self-citation(2015) · Cited by 2,857
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
On the algorithmic implementation of multiclass kernel-based vector machines
Crammer, K., & Singer, Y. (2002) · Journal of Machine Learning Research · Cited by 2,312
Pegasos: primal estimated sub-gradient solver for SVM
Shalev-Shwartz, S., Singer, Y., Srebro, N., & Cotter, A. (2011) · Mathematical Programming · doi:10.1007/s10107-010-0420-4 · Cited by 1,477
Self-citationGradient methods for minimizing composite functions
Nesterov, Y. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0629-5 · Cited by 1,298
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
Nesterov, Y. (2012) · SIAM Journal on Optimization · doi:10.1137/100802001 · Cited by 1,187
Efficient projections onto the l1-ball for learning in high dimensions
Duchi, J., Shalev-Shwartz, S., Singer, Y., & Chandra, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390191 · Cited by 1,184
Self-citationPegasos: Primal Estimated sub-GrAdient SOlver for SVM
Shalev-Shwartz, S., Singer, Y., & Srebro, N. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273598 · Cited by 973
Self-citationGradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
Efficient Online and Batch Learning Using Forward Backward Splitting
Duchi, J. C., & Singer, Y. (2009) · Journal of Machine Learning Research · Cited by 687
Richtárik, P., & Takáč, M. (2014) · Mathematical Programming · doi:10.1007/s10107-012-0614-z · Cited by 654
Stochastic dual coordinate ascent methods for regularized lossPreprint
Shalev‐Shwartz, S., & Zhang, T. (2013) · Cited by 637
Self-citationDual Averaging Method for Regularized Stochastic Learning and Online Optimization
Xiao, L. (2009) · Cited by 574
First-order methods of smooth convex optimization with inexact oracle
Devolder, O., Glineur, F., & Nesterov, Y. (2014) · Mathematical Programming · doi:10.1007/s10107-013-0677-5 · Cited by 422
Composite objective mirror descent
Duchi, J. C., Shalev‐Shwartz, S., Singer, Y., & Tewari, A. (2010) · Conference on Learning Theory · Cited by 372
Self-citationStochastic methods for l 1 regularized loss minimization
Shalev-Shwartz, S., & Tewari, A. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553493 · Cited by 298
Self-citationGhadimi, S., & Lan, G. (2012) · SIAM Journal on Optimization · doi:10.1137/110848864 · Cited by 269
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization
Schmidt, M., Roux, N. L., & Bach, F. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.2415 · Cited by 237
Better Mini-Batch Algorithms via Accelerated Gradient Methods
Cotter, A., Shamir, O., Srebro, N., & Sridharan, K. (2011) · arXiv · doi:10.48550/arxiv.1106.4574 · Cited by 173
Smooth Optimization with Approximate Gradient
d'Aspremont, A. (2008) · SIAM Journal on Optimization · doi:10.1137/060676386 · Cited by 168
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
Shalev‐Shwartz, S., Srebro, N., & Zhang, T. (2010) · SIAM Journal on Optimization · doi:10.1137/090759574 · Cited by 152
Self-citationMini-Batch Primal and Dual Methods for SVMsPreprint
Takáč, M., Bijral, A. S., Richtárik, P., & Srebro, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1303.2314 · Cited by 148
Accelerated Gradient Methods for Stochastic Optimization and Online Learning
Hu, C., Pan, W., & Kwok, J. T.-Y. (2009) · Cited by 140
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Collins, M., Globerson, A., Koo, T., Carreras, X., & Bartlett, P. L. (2008) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · doi:10.5555/1390681.1442791 · Cited by 139
Stochastic Methods for l 1 -regularized Loss Minimization
Shalev‐Shwartz, S., & Tewari, A. (2011) · Journal of Machine Learning Research · Cited by 129
Self-citationProximal Stochastic Dual Coordinate AscentPreprint
Shalev‐Shwartz, S., & Zhang, T. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1211.2717 · Cited by 99
Self-citationRoux, N. L., Schmidt, M., & Bach, F. (2012) · Cited by 81
Accelerated, Parallel and Proximal Coordinate DescentPreprint
Fercoq, O., & Richtárik, P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1312.5799 · Cited by 79
On the Dual Formulation of Regularized Linear Systems with Convex Risks
Zhang, T. (2002) · Machine Learning · doi:10.1023/a:1012498226479 · Cited by 59
Self-citationStochastic Block-Coordinate Frank-Wolfe Optimization for Structural SVMsPreprint
Lacoste-Julien, S., Jaggi, M., Schmidt, M., & Pletscher, P. (2012) · arXiv (Cornell University) · Cited by 17
Cited by
Rainfall–runoff modelling using Long Short-Term Memory (LSTM) networks
(2018) · doi:10.5194/hess-22-6005-2018 · Cited by 2,114
Minimizing finite sums with the stochastic average gradient
Schmidt, M., Le Roux, N., & Bach, F. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1030-6 · Cited by 922
SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
Defazio, A., Bach, F., & Lacoste-Julien, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.0202 · Cited by 834
From Eliza to XiaoIce: Challenges and opportunities with social chatbots
Shum, H.-Y., He, X.-D., & Li, D. (2018) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.1700826 · Cited by 749
Wang, F., Xuan, Z., Zhen, Z., Li, K., Wang, T., & Shi, M. (2020) · Energy Conversion and Management · doi:10.1016/j.enconman.2020.112766 · Cited by 639
Metadata
- Authors
- Shalev-Shwartz, S., & Zhang, T.
- Venue
- Mathematical Programming
- Published
- 2014-11-20
- Volume
- 155
- Issue
- 1-2
- Pages
- 105-145
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2118545728
- Cited by
- 360
- References
- 32
- FWCI
- 49.85
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.