SOTAVerified

Dictionary Learning

Dictionary Learning is an important problem in multiple areas, ranging from computational neuroscience, machine learning, to computer vision and image processing. The general goal is to find a good basis for given data. More formally, in the Dictionary Learning problem, also known as sparse coding, we are given samples of a random vector $y\in\mathbb{R}^n$, of the form $y=Ax$ where $A$ is some unknown matrix in $\mathbb{R}^{n×m}$, called dictionary, and $x$ is sampled from an unknown distribution over sparse vectors. The goal is to approximately recover the dictionary $A$.

Source: Polynomial-time tensor decompositions with sum-of-squares

Papers

Showing 761770 of 823 papers

TitleStatusHype
Dictionary learning for fast classification based on soft-thresholding0
An Inequality with Applications to Structured Sparsity and Multitask Dictionary Learning0
Dictionary Learning over Distributed Models0
Phase transitions and sample complexity in Bayes-optimal matrix factorization0
Extrinsic Methods for Coding and Dictionary Learning on Grassmann Manifolds0
Learning _1-based analysis and synthesis sparsity priors using bi-level optimization0
Learning parametric dictionaries for graph signalsCode0
More Algorithms for Provable Dictionary Learning0
An Adaptive Dictionary Learning Approach for Modeling Dynamical Textures0
Sample Complexity of Dictionary Learning and other Matrix Factorizations0
Show:102550
← PrevPage 77 of 83Next →

No leaderboard results yet.