QUIC & DIRTY: A quadratic approximation approach for dirty statistical models

Advances in Neural Information Processing Systems

Volumn 3, Issue January, 2014, Pages 2006-2014

  Hsieh, Cho Jui ^a   Dhillon, Inderjit S ^a   Ravikumar, Pradeep ^a   Becker, Stephen ^b   Olsen, Peder A ^c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF COLORADO   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE;

ALTERNATING DIRECTION METHOD OF MULTIPLIERS; ALTERNATING MINIMIZATION; GRAPHICAL MODEL SELECTIONS; HIGH-DIMENSIONAL PROBLEMS; LOW DIMENSIONAL STRUCTURE; QUADRATIC APPROXIMATION; SECOND-ORDER METHODS; STATISTICAL ESTIMATORS;

ALGORITHMS;

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

References (29)

1. A. Agarwal, S. Negahban, and M. J. Wainwright. Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions. Annals if Statistics, 40(2):1171-1197, 2012.
2. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1):1-122, 2011.
3. E. Candes and B. Recht. Simple bounds for recovering low-complexity models. Mathemetical Programming, 2012.
4. E. J. Candes, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? J. Assoc. Comput. Mach., 58(3):1-37, 2011.
5. V. Chandrasekaran, P. A. Parrilo, and A. S. Willsky. Latent variable graphical model selection via convex optimization. The Annals of Statistics, 2012.
6. V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky. Rank-sparsity incoherence for matrix decomposition. Siam J. Optim, 21(2):572-596, 2011.
7. Y. Chen, A. Jalali, S. Sanghavi, and C. Caramanis. Low-rank matrix recovery from errors and erasures. IEEE Transactions on Information Theory, 59(7):4324-4337, 2013.
8. M. Collins, S. Dasgupta, and R. E. Schapire. A generalization of principal component analysis to the exponential family. In NIPS, 2012.
9. Q. T. Dinh, A. Kyrillidis, and V. Cevher. An inexact proximal path-following algorithm for constrained convex minimization. arxiv:1311.1756, 2013.
10. C.-J. Hsieh, I. S. Dhillon, P. Ravikumar, and A. Banerjee. A divide-and-conquer method for sparse inverse covariance estimation. In NIPS, 2012.
11. C.-J. Hsieh and P. A. Olsen. Nuclear norm minimization via active subspace selection. In ICML, 2014.
12. C.-J. Hsieh, M. A. Sustik, I. S. Dhillon, and P. Ravikumar. Sparse inverse covariance matrix estimation using quadratic approximation. In NIPS, 2011.
13. C.-J. Hsieh, M. A. Sustik, I. S. Dhillon, P. Ravikumar, and R. A. Poldrack. BIG & QUIC: Sparse inverse covariance estimation for a million variables. In NIPS, 2013.
14. D. Hsu, S. M. Kakade, and T. Zhang. Robust matrix decomposition with sparse corruptions. IEEE Trans. Inform. Theory, 57:7221-7234, 2011.
15. A. Jalali, P. Ravikumar, S. Sanghavi, and C. Ruan. A dirty model for multi-task learning. In NIPS, 2010.
16. J. D. Lee, Y. Sun, and M. A. Saunders. Proximal Newton-type methods for convex optimization. In NIPS, 2012.
17. S. Ma, L. Xue, and H. Zou. Alternating direction methods for latent variable Gaussian graphical model selection. Neural Computation, 25(8):2172-2198, 2013.
18. S. N. Negahban, P. Ravikumar, M. J. Wainwright, and B. Yu. A unified framework for high-dimensional analysis of m-estimators with decomposable regularizers. Statistical Science, 27(4):538-557, 2012.
19. P. Olsen, F. Oztoprak, J. Nocedal, and S. Rennie. Newton-like methods for sparse inverse covariance estimation. In NIPS, 2012.
20. Z. Qin, K. Scheinberg, and D. Goldfarb. Efficient block-coordinate descent algorithm for the group lasso. Mathematical Programming Computation, 2013.
21. K. Scheinberg and X. Tang. Practical inexact proximal quasi-newton method with global complexity analysis. arxiv:1311.6547, 2014.
22. A. Tewari, P. Ravikumar, and I. Dhillon. Greedy algorithms for structurally constrained high dimensional problems. In NIPS, 2011.
23. K.-C. Toh, P. Tseng, and S. Yun. A block coordinate gradient descent method for regularized convex separable optimization and covariance selection. Mathemetical Programming, 129:331-355, 2011.
24. P. Tseng and S. Yun. A coordinate gradient descent method for nonsmooth separable minimization. Mathematical Programming, 117:387-423, 2007.
25. M. van Breukelen, R. P. W. Duin, D. M. J. Tax, and J. E. den Hartog. Handwritten digit recognition by combined classifiers. Kybernetika, 34(4):381-386, 1998.
26. C. Wang, D. Sun, and K.-C. Toh. Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm. SIAM J. Optimization, 20:2994-3013, 2010.
27. E. Yang and P. Ravikumar. Dirty statistical models. In NIPS, 2013.
28. E.-H. Yen, C.-J. Hsieh, P. Ravikumar, and I. S. Dhillon. Constant nullspace strong convexity and fast convergence of proximal methods under high-dimensional settings. In NIPS, 2014.
29. G.-X. Yuan, C.-H. Ho, and C.-J. Lin. An improved GLMNET for L1-regularized logistic regression. JMLR, 13:1999-2030, 2012.