← Optimization
Mathematics & Optimization › Optimization ›

Sparse Optimization

347 directly classified papers

Papers per year

Papers

Exploiting Covariate Similarity in Sparse Regression via the Pairwise Elastic Net AISTATS 2010
The Group Dantzig Selector AISTATS 2010
The Feature Selection Path in Kernel Methods AISTATS 2010
A Primal-Dual Algorithm for Group Sparse Regularization with Overlapping Groups NIPS 2010
Learning Networks of Stochastic Differential Equations NIPS 2010
Fast detection of multiple change-points shared by many signals using group LARS NIPS 2010
The LASSO risk: asymptotic results and real world examples NIPS 2010
Multi-Stage Dantzig Selector NIPS 2010
Moreau-Yosida Regularization for Grouped Tree Structure Learning NIPS 2010
Multivariate Dyadic Regression Trees for Sparse Learning Problems NIPS 2010
A Family of Penalty Functions for Structured Sparsity NIPS 2010
Sufficient Conditions for Generating Group Level Sparsity in a Robust Minimax Framework NIPS 2010
Network Flow Algorithms for Structured Sparsity NIPS 2010
Structured sparsity-inducing norms through submodular functions NIPS 2010
Group Sparse Coding with a Laplacian Scale Mixture Prior NIPS 2010
Guaranteed Rank Minimization via Singular Value Projection NIPS 2010
A Dirty Model for Multi-task Learning NIPS 2010
$L_1$-Penalized Robust Estimation for a Class of Inverse Problems Arising in Multiview Geometry NIPS 2009
Inter-domain Gaussian Processes for Sparse Inference using Inducing Features NIPS 2009
Sparse Metric Learning via Smooth Optimization NIPS 2009
Efficient Recovery of Jointly Sparse Vectors NIPS 2009
Learning with Compressible Priors NIPS 2009
Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction NIPS 2009
Data-driven calibration of linear estimators with minimal penalties NIPS 2009
A Sparse Non-Parametric Approach for Single Channel Separation of Known Sounds NIPS 2009