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 531540 of 823 papers

TitleStatusHype
Sparse and spurious: dictionary learning with noise and outliers0
Sparse Bayesian Dictionary Learning with a Gaussian Hierarchical Model0
Sparse Coding and Autoencoders0
Sparse Coding and Dictionary Learning With Linear Dynamical Systems0
Sparse Coding for Classification via Discrimination Ensemble0
Sparse coding for multitask and transfer learning0
Sparse Coding for Third-Order Super-Symmetric Tensor Descriptors With Application to Texture Recognition0
Sparse Coding of Shape Trajectories for Facial Expression and Action Recognition0
Sparse Coding on Cascaded Residuals0
Sparse Coding on Symmetric Positive Definite Manifolds using Bregman Divergences0
Show:102550
← PrevPage 54 of 83Next →

No leaderboard results yet.