Exclusive Sparsity Norm Minimization with Random Groups via Cone Projection
Yijun Huang, Ji Liu

TL;DR
This paper develops efficient algorithms with optimal convergence rates for exclusive sparsity norm minimization and introduces a random grouping scheme to effectively identify true features when group information is unavailable.
Contribution
It provides the first algorithms with $O(1/k^2)$ convergence for exclusive sparsity norm minimization and proposes a probabilistic method for group construction without prior group info.
Findings
Algorithms achieve optimal convergence rate $O(1/k^2)$
Random grouping scheme effectively identifies true features
Empirical validation shows efficiency and effectiveness
Abstract
Many practical applications such as gene expression analysis, multi-task learning, image recognition, signal processing, and medical data analysis pursue a sparse solution for the feature selection purpose and particularly favor the nonzeros \emph{evenly} distributed in different groups. The exclusive sparsity norm has been widely used to serve to this purpose. However, it still lacks systematical studies for exclusive sparsity norm optimization. This paper offers two main contributions from the optimization perspective: 1) We provide several efficient algorithms to solve exclusive sparsity norm minimization with either smooth loss or hinge loss (non-smooth loss). All algorithms achieve the optimal convergence rate ( is the iteration number). To the best of our knowledge, this is the first time to guarantee such convergence rate for the general exclusive sparsity norm…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Face and Expression Recognition · Machine Learning and ELM
MethodsSupport Vector Machine
