Skip to content
conftrace_

sparse optimization

255 papers

Papers

A Family of Penalty Functions for Structured Sparsity NeurIPS 2010 CUR from a Sparse Optimization Viewpoint NeurIPS 2010 Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization NeurIPS 2010 Fast detection of multiple change-points shared by many signals using group LARS NeurIPS 2010 Lower Bounds on Rate of Convergence of Cutting Plane Methods NeurIPS 2010 Multi-Stage Dantzig Selector NeurIPS 2010 On the Convexity of Latent Social Network Inference NeurIPS 2010 Sparse Inverse Covariance Selection via Alternating Linearization Methods NeurIPS 2010 Structured sparsity-inducing norms through submodular functions NeurIPS 2010 Sufficient Conditions for Generating Group Level Sparsity in a Robust Minimax Framework NeurIPS 2010 The Feature Selection Path in Kernel Methods AISTATS 2010 Asymptotic Analysis of MAP Estimation via the Replica Method and Compressed Sensing NeurIPS 2009 Efficient Learning using Forward-Backward Splitting NeurIPS 2009 Fast Image Deconvolution using Hyper-Laplacian Priors NeurIPS 2009 Sparse and Locally Constant Gaussian Graphical Models NeurIPS 2009 Sparse Metric Learning via Smooth Optimization NeurIPS 2009 An Homotopy Algorithm for the Lasso with Online Observations NeurIPS 2008 High-dimensional support union recovery in multivariate regression NeurIPS 2008 Model Selection in Gaussian Graphical Models: High-Dimensional Consistency of \boldmath$\ell_1$-regularized MLE NeurIPS 2008 Robust Regression and Lasso NeurIPS 2008 A New View of Automatic Relevance Determination NeurIPS 2007 Catching Change-points with Lasso NeurIPS 2007 Compressed Regression NeurIPS 2007 Hierarchical Penalization NeurIPS 2007 Progressive mixture rules are deviation suboptimal NeurIPS 2007