Simple iterative method reliably recovers dictionary components from sparse data

Iterative Atom Refinement: A Monotonicity Principle for Dictionary Learning

Machine Learning

Summary

Dictionary learning is about finding the basic building blocks that combine to make complex data. The authors present a simple method called Iterative Atom Refinement (IAR) that starts with a random guess and improves it step by step by focusing on data points that best match the current guess. They prove mathematically that this method will quickly isolate one of the true building blocks after only a few steps. Their experiments show that the theory accurately predicts how the method behaves in practice.

What this means in practice

Authors

Alexander Christie, Miguel Moscoso, Alexei Novikov, George Papanicolaou, Chrysoula Tsogka

Abstract

Dictionary learning seeks to recover an unknown dictionary $A$ from observations ${\bf y}_i = A{\bf x}_i$ with sparse coefficient vectors ${\bf x}_i$. We introduce the \emph{Iterative Atom Refinement} (IAR) algorithm, a simple procedure for recovering individual dictionary atoms. Starting from a random direction, IAR repeatedly selects the observations most strongly correlated with the current iterate and updates the direction by averaging the selected data. Our main contribution is a rigorous convergence theory of IAR. Using high-dimensional probabilistic estimates and a novel monotonicity principle for atom-selection probabilities, we show that a small initial advantage of one atom is amplified until that atom is isolated. Under our model assumptions, IAR identifies a generating atom after only three refinement steps. Numerical experiments support the theory and show that the resulting dynamics accurately capture the behavior observed in dictionary refinement.