Multi-Step Stochastic ADMM in High Dimensions: Applications to Sparse Optimization and Matrix Decomposition
暂无分享,去创建一个
Anima Anandkumar | Edmond A. Jonckheere | Hanie Sedghi | Anima Anandkumar | Hanie Sedghi | E. Jonckheere
[1] Dmitry M. Malioutov,et al. Walk-Sums and Belief Propagation in Gaussian Graphical Models , 2006, J. Mach. Learn. Res..
[2] Martin J. Wainwright,et al. Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions , 2011, ICML.
[3] Wotao Yin,et al. On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers , 2016, J. Sci. Comput..
[4] Shiqian Ma,et al. Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers , 2013, ArXiv.
[5] Alexandre d'Aspremont,et al. First-Order Methods for Sparse Covariance Selection , 2006, SIAM J. Matrix Anal. Appl..
[6] Zhaoran Wang,et al. OPTIMAL COMPUTATIONAL AND STATISTICAL RATES OF CONVERGENCE FOR SPARSE NONCONVEX LEARNING PROBLEMS. , 2013, Annals of statistics.
[7] Shiqian Ma,et al. Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection , 2012, Neural Computation.
[8] S. Sra. Generalized Proximity and Projection with Norms and Mixed-norms , 2010 .
[9] Jim Pitman,et al. Archimedes, Gauss, and Stein , 2012, 1201.4422.
[10] Pradeep Ravikumar,et al. Sparse inverse covariance matrix estimation using quadratic approximation , 2011, MLSLP.
[11] Martin J. Wainwright,et al. A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers , 2009, NIPS.
[12] Vincent Y. F. Tan,et al. High-dimensional Gaussian graphical model selection: walk summability and local separation criterion , 2011, J. Mach. Learn. Res..
[13] Anima Anandkumar,et al. Guarantees for Multi-Step Stochastic ADMM in High Dimensions , 2014, ArXiv.
[14] Joel A. Tropp,et al. Robust computation of linear models, or How to find a needle in a haystack , 2012, ArXiv.
[15] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[16] Van H. Vu,et al. Spectral norm of random matrices , 2005, STOC '05.
[17] Pablo A. Parrilo,et al. Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..
[18] Mark W. Schmidt,et al. A Stochastic Gradient Method with an Exponential Convergence Rate for Strongly-Convex Optimization with Finite Training Sets , 2012, ArXiv.
[19] G. Sapiro,et al. A collaborative framework for 3D alignment and classification of heterogeneous subvolumes in cryo-electron tomography. , 2013, Journal of structural biology.
[20] Martin J. Wainwright,et al. Stochastic optimization and sparse statistical recovery: An optimal algorithm for high dimensions , 2012, 2014 48th Annual Conference on Information Sciences and Systems (CISS).
[21] Bin Yu,et al. High-dimensional covariance estimation by minimizing ℓ1-penalized log-determinant divergence , 2008, 0811.3628.
[22] Pradeep Ravikumar,et al. BIG & QUIC: Sparse Inverse Covariance Estimation for a Million Variables , 2013, NIPS.
[23] Yi Ma,et al. The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices , 2010, Journal of structural biology.
[24] João M. F. Xavier,et al. Distributed ADMM for model predictive control and congestion control , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).
[25] Michael I. Jordan. Graphical Models , 1998 .
[26] Xi Chen,et al. Variance Reduction for Stochastic Gradient Optimization , 2013, NIPS.
[27] Richard G. Baraniuk,et al. Fast Alternating Direction Optimization Methods , 2014, SIAM J. Imaging Sci..
[28] Po-Ling Loh,et al. Regularized M-estimators with nonconvexity: statistical and algorithmic theory for local optima , 2013, J. Mach. Learn. Res..
[29] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[30] Joel A. Tropp,et al. Robust Computation of Linear Models by Convex Relaxation , 2012, Foundations of Computational Mathematics.
[31] Tong Zhang,et al. Accelerating Stochastic Gradient Descent using Predictive Variance Reduction , 2013, NIPS.
[32] Pablo A. Parrilo,et al. Latent variable graphical model selection via convex optimization , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[33] Sham M. Kakade,et al. Robust Matrix Decomposition With Sparse Corruptions , 2011, IEEE Transactions on Information Theory.
[34] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[35] Stephen P. Boyd,et al. An ADMM Algorithm for a Class of Total Variation Regularized Estimation Problems , 2012, 1203.1828.
[36] Yoram Singer,et al. Efficient projections onto the l1-ball for learning in high dimensions , 2008, ICML '08.
[37] Shai Shalev-Shwartz,et al. Online Learning and Online Convex Optimization , 2012, Found. Trends Mach. Learn..
[38] Arindam Banerjee,et al. Bregman Alternating Direction Method of Multipliers , 2013, NIPS.
[39] G. Watson. Characterization of the subdifferential of some matrix norms , 1992 .
[40] Stephen P. Boyd,et al. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..
[41] Tony F. Chan,et al. A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science , 2010, SIAM J. Imaging Sci..
[42] Shai Shalev-Shwartz,et al. Accelerated Mini-Batch Stochastic Dual Coordinate Ascent , 2013, NIPS.
[43] Martin J. Wainwright,et al. Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$ -Balls , 2009, IEEE Transactions on Information Theory.
[44] Alexander G. Gray,et al. Stochastic Alternating Direction Method of Multipliers , 2013, ICML.