A General Framework of Dual Certificate Analysis for Structured Sparse Recovery Problems

Abstract

This paper develops a general theoretical framework to analyze structured sparse recovery problems using the notation of dual certificate. Although certain aspects of the dual certificate idea have already been used in some previous work, due to the lack of a general and coherent theory, the analysis has so far only been carried out in limited scopes for specific problems. In this context the current paper makes two contributions. First, we introduce a general definition of dual certificate, which we then use to develop a unified theory of sparse recovery analysis for convex programming. Second, we present a class of structured sparsity regularization called structured Lasso for which calculations can be readily performed under our theoretical framework. This new theory includes many seemingly loosely related previous work as special cases; it also implies new results that improve existing ones even for standard formulations such as L1 regularization.

References in corpus (2)

• Consistency of the group Lasso and multiple kernel learning
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise

Cited by in corpus (7)

• Adaptive estimation of the copula correlation matrix for semiparametric elliptical copulas
• Low Rank Matrix Completion with Exponential Family Noise
• Regularized calibrated estimation of propensity scores with model misspecification and high-dimensional data
• Calibrated Elastic Regularization in Matrix Completion
• Relaxed Sparse Eigenvalue Conditions for Sparse Estimation via Non-convex Regularized Regression
• Learning Pairwise Graphical Models with Nonlinear Sufficient Statistics
• On the Conditions of Sparse Parameter Estimation via Log-Sum Penalty Regularization