Mini-batch primal and dual methods for SVMs

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 3, 2013, Pages 2059-2067

  Takáč, Martin ^a   Bijral, Avleen ^b   Richtárik, Peter ^a   Srebro, Nathan ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

STOCHASTIC SYSTEMS;

COORDINATE ASCENT; DUAL METHOD; PARALLELIZATIONS; PRIMAL PROBLEM; SPECTRAL NORMS; STOCHASTIC OPTIMIZATIONS; SUBGRADIENT DESCENT;

SUPPORT VECTOR MACHINES;

EID: 84897543082     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Agarwal, A. and Duchi, J. Distributed delayed stochastic optimization. In NIPS, 2011.
2. Bradley, J.K., Kyrola, A., Bickson, D., and Guestrin, C. Parallel coordinate descent for l1-regularized loss minimization. In ICML, 2011.
3. Cotter, A., Shamir, O., Srebro, N., and Sridharan, K. Better mini-batch algorithms via accelerated gradient methods. In NIPS, 2011.
4. Dekel, O., Gilad-Bachrach, R., Shamir, O., and Xiao, L. Optimal distributed online prediction using minibatches. Journal of Machine Learning Research, 13: 165-202, 2012.
5. Duchi, John, Bartlett, Peter L., and Wainwright, Martin J. Randomized smoothing for (parallel) stochastic optimization. In ICML, 2012a.
6. Duchi, John, Bartlett, Peter L., and Wainwright, Martin J. Randomized smoothing for stochastic optimization. SIAM Journal on Optimization, 22(2): 674-701, June 2012b.
7. Hsieh, C-J., Chang, K-W., Lin, C-J., Keerthi, S.S., and Sundarajan, S. A dual coordinate descent method for large-scale linear svm. In ICML, 2008.
8. Hsu, D., Karampatziakis, N., Langford, J., and Smola, A. Parallel online learning. arXiv:1103.4204, 2011.
9. Libsvm. Datasets. http://www.csie.ntu.edu.tw/~cjlin/libsvmtools/datasets/ binary.html.
10. Nesterov, Yu. Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optimization, 22:341-362, 2012.
11. Niu, F., Recht, B., Re, C., and Wright, S. Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In Shawe-Taylor, J., Zemel, R.S., Bartlett, P., Pereira, F.C.N., and Weinberger, K.Q. (eds.), NIPS 24, pp. 693-701. 2011.
12. Rakhlin, A., Shamir, O., and Sridharan, K. Making gradient descent optimal for strongly convex stochastic optimization. ArXiv:1109.5647, 2012.
13. Richtárik, P. and Tákač, M. Distributed coordinate descent methods for big data optimization. Technical report.
14. Richtárik, P. and Takáč, M. Parallel coordinate descent methods for big data optimization. ArXiv:1212.0873, 2012.
15. Richtárik, P. and Takáč, M. Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming, 2013. doi: 10.1007/s10107-012-0614-z.
16. Shalev-Shwartz, S. and Tewari, A. Stochastic Methods for 11-regularized Loss Minimization. JMLR, 12: 1865-1892, 2011.
17. Shalev-Shwartz, S. and Zhang, T. Stochastic dual coordinate ascent methods for regularized loss minimization. ArXiv:1209.1873, 2012.
18. Shalev-Shwartz, S.S., Singer, Y., Srebro, N., and Cotter, A. Pegasos: Primal estimated sub-gradient solver for svm. Mathematical Programming: Series A and B- Special Issue on Optimization and Machine Learning, pp. 3-30, 2011.
19. Tappenden, R., Richtarik, P., and Gondzio, J. Inexact coordinate descent: complexity and preconditioning. ArXiv:1304-5530, 2013.
20. Zhang, T. Solving large scale linear prediction using stochastic gradient descent algorithms. In ICML, 2004.