Parallel coordinate descent for the adaboost problem

Proceedings - 2013 12th International Conference on Machine Learning and Applications, ICMLA 2013

Volumn 1, Issue , 2013, Pages 354-358

  Fercoq, Olivier ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Adaboost; iteration complexity; parallel algorithm; randomised coordinate descent

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; LEARNING SYSTEMS; PARALLEL ALGORITHMS;

ADABOOST ALGORITHM; COORDINATE DESCENT; ITERATION COMPLEXITY; LARGE-SCALE PROBLEM; LIPSCHITZ CONTINUOUS; PARALLEL COORDINATES; PARALLEL VERSION; SPEED-UP FACTORS;

ADAPTIVE BOOSTING;

EID: 84899444154     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLA.2013.72     Document Type: Conference Paper

References (21)

1. Y. Freund and R. E. Schapire, "A decision-theoretic generalization of on-line learning and an application to boosting," Journal of Computer and System Sciences, vol. 55, no. 1, pp. 119-139, 1997.
2. R. E. Schapire and Y. Singer, "Improved boosting algorithms using confidence-rated predictions," Machine learning, vol. 37, no. 3, pp. 297-336, 1999.
3. P. Viola and M. Jones, "Rapid object detection using a boosted cascade of simple features," in IEEE Comp. Soc. Conf. on Computer Vision and Pattern Recognition. CVPR 2001, vol. 1. IEEE, 2001, pp. 1-511.
4. D. Zinovev, J. Furst, and D. Raicu, "Building an ensemble of probabilistic classifiers for lung nodule interpretation," in 10th International Conference on Machine Learning and Applications and Workshops (ICMLA), vol. 2, 2011, pp. 155-161.
5. A. Assareh, L. G. Volkert, and J. Li, "Interaction trees: Optimizing ensembles of decision trees for gene-gene interaction detections," in 11th International Conference on Machine Learning and Applications (ICMLA), vol. 1, 2012, pp. 616-621.
6. M. Collins, R. E. Schapire, and Y. Singer, "Logistic regression, adaboost and bregman distances," Machine Learning, vol. 48, no. 1-3, pp. 253-285, 2002.
7. I. Mukherjee, K. Canini, R. Frongillo, and Y. Singer, "Parallel boosting with momentum," 2013.
8. K. Zeng, Y. Tang, and F. Liu, "Parallization of adaboost algorithm through hybrid mpi/openmp and transactional memory," in 19th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, 2011, pp. 94-100.
9. S. Merler, B. Caprile, and C. Furlanello, "Parallelizing adaboost by weights dynamics," Computational Statistics & Data Analysis, vol. 51, no. 5, pp. 2487-2498, 2007.
10. I. Palit and C. K. Reddy, "Scalable and parallel boosting with mapreduce," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 10, pp. 1904-1916, 2012.
11. P. Richtárik and M. Takáč, "Parallel coordinate descent methods for big data optimization problems," arXiv:1212.0873, November 2012.
12. M. Takác, A. Bijral, P. Richtárik, and N. Srebro, "Mini-batch primal and dual methods for SVMs," in 30th International Conference on Machine Learning, 2013.
13. O. Fercoq and P. Richtárik, "Smooth minimization of nonsmooth functions by parallel coordinate descent," 2013, arXiv:1309.5885.
14. I. Mukherjee, C. Rudin, and R. E. Schapire, "The rate of convergence of adaboost," arXiv preprint arXiv:1106.6024, 2011.
15. M. Telgarsky, "A primal-dual convergence analysis of boosting," The Journal of Machine Learning Research, vol. 13, pp. 561-606, 2012.
16. J. Friedman, T. Hastie, and R. Tibshirani, "Additive logistic regression: a statistical view of boosting (with discussion and a rejoinder by the authors)," The annals of statistics, vol. 28, no. 2, pp. 337-407, 2000.
17. C. Shen and H. Li, "On the dual formulation of boosting algorithms," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 32, no. 12, pp. 2216-2231, 2010.
18. Y. Nesterov, "Smooth minimization of nonsmooth functions," Mathematical Programming, vol. 103, pp. 127-152, 2005.
19. O. Fercoq, "Parallel coordinate descent for the adaboost problem," 2013, arxiv preprint:1310.1840.
20. J. C. Platt, "12 fast training of support vector machines using sequential minimal optimization," in Advances in Kernel Methods - Support Vector Learning, B. Schlkopf, C. J. C. Burges, and A. J. Smola, Eds. MIT Press, 1999, http://www.csie.ntu.edu.tw/ cjlin/libsvmtools/datasets/binary.html.
21. J. Ma, L. K. Saul, S. Savage, and G. M. Voelker, "Identifying suspicious urls: an application of large-scale online learning," in Proceedings of the 26th Annual International Conference on Machine Learning. ACM, 2009, pp. 681-688, http://www.csie.ntu.edu.tw/ cjlin/libsvmtools/datasets/ binary.html.