Approximate Guarantees for Dictionary Learning
Aditya Bhaskara, Wai Ming Tai

TL;DR
This paper investigates approximate solutions for dictionary learning without incoherence assumptions, introducing algorithms based on threshold correlation and hypercontractive norms, applicable even with outliers.
Contribution
It provides the first analysis of dictionary learning guarantees without incoherence assumptions, using novel algorithms related to hypercontractive norms.
Findings
Algorithms achieve approximate factorization without incoherence assumptions.
Applicable to datasets with outliers, maintaining guarantees.
Introduces threshold correlation problem related to hypercontractive norms.
Abstract
In the dictionary learning (or sparse coding) problem, we are given a collection of signals (vectors in ), and the goal is to find a "basis" in which the signals have a sparse (approximate) representation. The problem has received a lot of attention in signal processing, learning, and theoretical computer science. The problem is formalized as factorizing a matrix (whose columns are the signals) as , where has a prescribed number of columns (typically ), and has columns that are -sparse (typically ). Most of the known theoretical results involve assuming that the columns of the unknown have certain incoherence properties, and that the coefficient matrix has random (or partly random) structure. The goal of our work is to understand what can be said in the absence of such assumptions. Can we still find …
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 · Blind Source Separation Techniques · Distributed Sensor Networks and Detection Algorithms
