Feature clustering for accelerating parallel coordinate descent

Advances in Neural Information Processing Systems

Volumn 1, Issue , 2012, Pages 28-36

  Scherrer, Chad ^a   Tewari, Ambuj ^b   Halappanavar, Mahantesh ^c   Haglin, David J ^c  

^a Independent Consultant   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC APPROACH; CONVERGENCE ANALYSIS; COORDINATE DESCENT; FEATURE CLUSTERING; HIGH-DIMENSIONAL; LOSS MINIMIZATION; PARALLEL COORDINATES; REGRESSION PROBLEM;

ALGORITHMS;

PROBLEM SOLVING;

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

References (11)

1. J Friedman, T Hastie, H Höfling, and R Tibshirani. Pathwise coordinate optimization. Annals of Applied Statistics, 1(2):302-332, 2007.
2. T Wu and K Lange. Coordinate descent algorithms for lasso penalized regression. Annals of Applied Statistics, 2:224-244, 2008.
3. 1-regularized loss minimization. Journal of Machine Learning Research, 12:1865-1892, 2011.
4. J K Bradley, A Kyrola, D Bickson, and C Guestrin. Parallel Coordinate Descent for L1-Regularized Loss Minimization. In Proceedings of the 28th International Conference on Machine Learning, pages 321-328, 2011.
5. C Scherrer, A Tewari, M Halappanavar, and D Haglin. Scaling up Parallel Coordinate Descent Algorithms. In International Conference on Machine Learning, 2012.
6. 1 Minimization with Application to Compressed Sensing; a Greedy Algorithm Solving the Unconstrained Problem. Inverse Problems and Imaging, 3:487-503, 2009.
7. I S Dhillon, P Ravikumar, and A Tewari. Nearest neighbor based greedy coordinate descent. In Advances in Neural Information Processing Systems 24, pages 2160-2168, 2011.
8. D Lewis, Y Yang, T Rose, and F Li. RCV1: A New Benchmark Collection for Text Categorization Research. Journal of Machine Learning Research, 5:361-397, 2004.
9. S S Keerthi and D DeCoste. A modified finite Newton method for fast solution of large scale linear SVMs. Journal of Machine Learning Research, 6:341-361, 2005.
10. RealSim. Document classification data gathered by Andrew McCallum., circa 1997. URL: http://people.cs.umass.edu/~mccallum/data.html.
11. Hung-Yi Lo, Kai-Wei Chang, Shang-Tse Chen, Tsung-Hsien Chiang, Chun-Sung Ferng, Cho-Jui Hsieh, Yi-Kuang Ko, Tsung-Ting Kuo, Hung-Che Lai, Ken-Yi Lin, Chia-Hsuan Wang, Hsiang-Fu Yu, Chih-Jen Lin, Hsuan-Tien Lin, and Shou de Lin. Feature engineering and classifier ensemble for KDD Cup 2010, 2011. To appear in JMLR Workshop and Conference Proceedings.