Sparse Coding and Autoencoders

2017/08/12 by Rangamani, Akshay, Mukherjee, Anirbit, Basu, Amitabh +4 · 2 citations
#FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.1708.03735

Abstract

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

Cited by

• Sparse Autoencoder Neural Operators: Model Recovery in Function Spaces
• From Flat to Hierarchical: Extracting Sparse Representations with Matching Pursuit

Related

• New Algorithms for Learning Incoherent and Overcomplete Dictionaries
• More Algorithms for Provable Dictionary Learning
• Approximate Guarantees for Dictionary Learning
• Dictionary Learning for the Almost-Linear Sparsity Regime
• Matrix Coherency Graph: A Tool for Improving Sparse Coding Performance