Global Identifiability of Overcomplete Dictionary Learning via L1 and Volume Minimization

Yuchen Sun, Kejun Huang
2/12/2026

No confident code implementation found for this paper. 1 possible match can be shown below.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Strong and Precise Modulation of Human Percepts via Robustified ANNs

99% match1 repo242026

Faster Approximation of Probabilistic and Distributional Values via Least Squares

99% match2026

Recaptured Raw Screen Image and Video Demoiréing via Channel and Spatial Modulations

97% match1 repo202026

Segment Any Event Streams via Weighted Adaptation of Pivotal Tokens

96% match1 repo1002026

Backdoor Defense via Test-Time Detecting and Repairing

96% match2026

Addressing Spatial-Temporal Heterogeneity: General Mixed Time Series Analysis via Latent Continuity Recovery and Alignment

94% match1 repo242026

Cite this paper

@article{sun2026global,
  title  = {Global Identifiability of Overcomplete Dictionary Learning via L1 and Volume Minimization},
  author = {Yuchen Sun and Kejun Huang},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:3a8d3fa8253a49387df5c433569c3d9966e8672b},
  journal = {ICLR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/3a8d3fa8253a49387df5c433569c3d9966e8672b.svg)](https://codeofpaper.com/paper/3a8d3fa8253a49387df5c433569c3d9966e8672b)

Discussion