Goto

Collaborating Authors

 Ganapathy, Tejaswini


Sparse Coding and Autoencoders

arXiv.org Machine Learning

In "Dictionary Learning" one tries to recover incoherent matrices $A^* \in \mathbb{R}^{n \times h}$ (typically overcomplete and whose columns are assumed to be normalized) and sparse vectors $x^* \in \mathbb{R}^h$ with a small support of size $h^p$ for some $0