← Optimization & Theory
Machine Learning › Optimization & Theory ›

Sparse Optimization

95 directly classified papers

Papers per year

Papers

Robust Lasso with missing and grossly corrupted observations NIPS 2011
Shaping Level Sets with Submodular Functions NIPS 2011
Moreau-Yosida Regularization for Grouped Tree Structure Learning NIPS 2010
Learning Networks of Stochastic Differential Equations NIPS 2010
Structured sparsity-inducing norms through submodular functions NIPS 2010
Guaranteed Rank Minimization via Singular Value Projection NIPS 2010
Sufficient Conditions for Generating Group Level Sparsity in a Robust Minimax Framework NIPS 2010
Multi-Stage Dantzig Selector NIPS 2010
Predicting Execution Time of Computer Programs Using Sparse Polynomial Regression NIPS 2010
Inter-domain Gaussian Processes for Sparse Inference using Inducing Features NIPS 2009
Learning with Compressible Priors NIPS 2009
Sparse Metric Learning via Smooth Optimization NIPS 2009
Fast Image Deconvolution using Hyper-Laplacian Priors NIPS 2009
Thresholding Procedures for High Dimensional Variable Selection and Statistical Estimation NIPS 2009
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers NIPS 2009
Model Selection in Gaussian Graphical Models: High-Dimensional Consistency of \boldmath$\ell_1$-regularized MLE NIPS 2008
Differentiable Sparse Coding NIPS 2008
SpAM: Sparse Additive Models NIPS 2007
Compressed Regression NIPS 2007
Large-Scale Sparsified Manifold Regularization NIPS 2006