Consistency of the Group Lasso and Multiple Kernel Learning
The Journal of Machine Learning Research
A Wavelet Tour of Signal Processing, Third Edition: The Sparse Way
A Wavelet Tour of Signal Processing, Third Edition: The Sparse Way
Decoding by linear programming
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
IEEE Transactions on Information Theory
Minimum Description Length Penalization for Group and Multi-Task Sparse Learning
The Journal of Machine Learning Research
Proximal Methods for Hierarchical Sparse Coding
The Journal of Machine Learning Research
Convex and Network Flow Optimization for Structured Sparsity
The Journal of Machine Learning Research
Structured Variable Selection with Sparsity-Inducing Norms
The Journal of Machine Learning Research
Pattern Recognition Letters
Structured sparse linear graph embedding
Neural Networks
Extracting non-negative basis images using pixel dispersion penalty
Pattern Recognition
Optimization with Sparsity-Inducing Penalties
Foundations and Trends® in Machine Learning
Structured sparsity and generalization
The Journal of Machine Learning Research
Structured sparsity via alternating direction methods
The Journal of Machine Learning Research
Fast approximations to structured sparse coding and applications to object classification
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
ECCV'10 Proceedings of the 11th European conference on Trends and Topics in Computer Vision - Volume Part I
Regularizers for structured sparsity
Advances in Computational Mathematics
Hi-index | 0.00 |
This paper investigates a new learning formulation called structured sparsity, which is a natural extension of the standard sparsity concept in statistical learning and compressive sensing. By allowing arbitrary structures on the feature set, this concept generalizes the group sparsity idea. A general theory is developed for learning with structured sparsity, based on the notion of coding complexity associated with the structure. Moreover, a structured greedy algorithm is proposed to efficiently solve the structured sparsity problem. Experiments demonstrate the advantage of structured sparsity over standard sparsity.