← Optimization & Theory
Machine Learning › Optimization & Theory ›

Sparse Optimization

95 directly classified papers

Papers per year

Papers

Discriminative Sparse Inverse Covariance Matrix: Application in Brain Functional Network Classification CVPR 2014
Finding a sparse vector in a subspace: Linear sparsity using alternating directions NIPS 2014
Sparse Random Feature Algorithm as Coordinate Descent in Hilbert Space NIPS 2014
Zeta Hull Pursuits: Learning Nonconvex Data Hulls NIPS 2014
Parallel Feature Selection Inspired by Group Testing NIPS 2014
Two-Layer Feature Reduction for Sparse-Group Lasso via Decomposition of Convex Sets NIPS 2014
Estimation with Norm Regularization NIPS 2014
Average Case Analysis of High-Dimensional Block-Sparse Recovery and Regression for Arbitrary Designs AISTATS 2014
Exclusive Feature Learning on Arbitrary Structures via $\ell_{1,2}$-norm NIPS 2014
Large Scale Distributed Sparse Precision Estimation NIPS 2013
Dirty Statistical Models NIPS 2013
Block Regularized Lasso for Multivariate Multi-Response Linear Regression AISTATS 2013
When in Doubt, SWAP: High-Dimensional Sparse Recovery from Correlated Measurements NIPS 2013
On model selection consistency of penalized M-estimators: a geometric theory NIPS 2013
BIG & QUIC: Sparse Inverse Covariance Estimation for a Million Variables NIPS 2013
Accelerated Training for Matrix-norm Regularization: A Boosting Approach NIPS 2012
Recovery of Sparse Probability Measures via Convex Programming NIPS 2012
A Divide-and-Conquer Method for Sparse Inverse Covariance Estimation NIPS 2012
Nonconvex Penalization Using Laplace Exponents and Concave Conjugates NIPS 2012
Sparsistency of the Edge Lasso over Graphs AISTATS 2012
High-dimensional Sparse Inverse Covariance Estimation using Greedy Methods AISTATS 2012
Minimax Localization of Structural Information in Large Noisy Matrices NIPS 2011
EigenNet: A Bayesian hybrid of generative and conditional models for sparse learning NIPS 2011
On Learning Discrete Graphical Models using Greedy Methods NIPS 2011
Non-parametric Group Orthogonal Matching Pursuit for Sparse Learning with Multiple Kernels NIPS 2011