Sparse Optimization

On the Sample Complexity of Robust PCA NeurIPS 2012 Reconstruction from Anisotropic Random Measurements COLT 2012 Recovery of Sparse Probability Measures via Convex Programming NeurIPS 2012 Smooth-projected Neighborhood Pursuit for High-dimensional Nonparanormal Graph Estimation NeurIPS 2012 Sparse Approximate Manifolds for Differential Geometric MCMC NeurIPS 2012 Sparse Prediction with the k-Support Norm NeurIPS 2012 Spectral Learning of General Weighted Automata via Constrained Matrix Completion NeurIPS 2012 Stochastic optimization and sparse statistical recovery: Optimal algorithms for high dimensions NeurIPS 2012 Structure estimation for discrete graphical models: Generalized covariance matrices and their inverses NeurIPS 2012 Universal Measurement Bounds for Structured Sparse Signal Recovery AISTATS 2012 A blind sparse deconvolution method for neural spike identification NeurIPS 2011 A concave regularization technique for sparse mixture models NeurIPS 2011 Generalized Lasso based Approximation of Sparse Coding for Visual Recognition NeurIPS 2011 Greedy Algorithms for Structurally Constrained High Dimensional Problems NeurIPS 2011 Learning Auto-regressive Models from Sequence and Non-sequence Data NeurIPS 2011 Learning Scale Free Networks by Reweighted ℓ_1 regularization AISTATS 2011 Learning Sparse Representations of High Dimensional Data on Large Scale Dictionaries NeurIPS 2011 Non-parametric Group Orthogonal Matching Pursuit for Sparse Learning with Multiple Kernels NeurIPS 2011 On Learning Discrete Graphical Models using Greedy Methods NeurIPS 2011 On the accuracy of l1-filtering of signals with block-sparse structure NeurIPS 2011 Orthogonal Matching Pursuit with Replacement NeurIPS 2011 Penalty Decomposition Methods for Rank Minimization NeurIPS 2011 Robust Lasso with missing and grossly corrupted observations NeurIPS 2011 SpaRCS: Recovering low-rank and sparse matrices from compressive measurements NeurIPS 2011 Sparse Estimation with Structured Dictionaries NeurIPS 2011