Sparse Optimization

The Feature Selection Path in Kernel Methods AISTATS 2010 The Group Dantzig Selector AISTATS 2010 The LASSO risk: asymptotic results and real world examples NeurIPS 2010 L_1-Penalized Robust Estimation for a Class of Inverse Problems Arising in Multiview Geometry NeurIPS 2009 A Sparse Non-Parametric Approach for Single Channel Separation of Known Sounds NeurIPS 2009 Data-driven calibration of linear estimators with minimal penalties NeurIPS 2009 Efficient Recovery of Jointly Sparse Vectors NeurIPS 2009 Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction NeurIPS 2009 Inter-domain Gaussian Processes for Sparse Inference using Inducing Features NeurIPS 2009 Learning with Compressible Priors NeurIPS 2009 Orthogonal Matching Pursuit From Noisy Random Measurements: A New Analysis NeurIPS 2009 Reconstruction of Sparse Circuits Using Multi-neuronal Excitation (RESCUME) NeurIPS 2009 Semi-supervised Learning using Sparse Eigenfunction Bases NeurIPS 2009 Sparse Estimation Using General Likelihoods and Non-Factorial Priors NeurIPS 2009 Sparse Metric Learning via Smooth Optimization NeurIPS 2009 Thresholding Procedures for High Dimensional Variable Selection and Statistical Estimation NeurIPS 2009 Adaptive Forward-Backward Greedy Algorithm for Sparse Learning with Linear Models NeurIPS 2008 Adaptive Template Matching with Shift-Invariant Semi-NMF NeurIPS 2008 An Homotopy Algorithm for the Lasso with Online Observations NeurIPS 2008 Deflation Methods for Sparse PCA NeurIPS 2008 Differentiable Sparse Coding NeurIPS 2008 Model Selection in Gaussian Graphical Models: High-Dimensional Consistency of \boldmath$\ell_1$-regularized MLE NeurIPS 2008 Multi-stage Convex Relaxation for Learning with Sparse Regularization NeurIPS 2008 Phase transitions for high-dimensional joint support recovery NeurIPS 2008 QUIC-SVD: Fast SVD Using Cosine Trees NeurIPS 2008