On the Uniqueness of Group Sparse Coding
Chen Kong, Simon Lucey

TL;DR
This paper proves the uniqueness of group sparse coding using a theoretical approach based on the block ACS theorem, extending the original ACS theorem to the group sparse setting.
Contribution
It introduces a proof demonstrating the uniqueness of group sparse coding, expanding the theoretical understanding of sparse coding methods.
Findings
Proves the uniqueness of group sparse coding.
Extends the original ACS theorem to group sparse coding.
Provides a theoretical foundation for group sparse coding methods.
Abstract
In this technical document we present a proof on the uniqueness of group sparse coding through the block ACS theorem. Leveraging the original ACS theorem of Hillar and Sommer for sparse coding, we demonstrate a similar uniqueness property holds for the task of group sparse coding.
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
TopicsCooperative Communication and Network Coding · Advanced MIMO Systems Optimization · Wireless Communication Security Techniques
