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

TitleStatusHype
An efficient supervised dictionary learning method for audio signal recognition0
Semi-supervised dual graph regularized dictionary learning0
Learning Multiplication-free Linear TransformationsCode0
A multi-class structured dictionary learning method using discriminant atom selection0
On learning with shift-invariant structuresCode0
Time Series Classification to Improve Poultry Welfare0
Greedy Frank-Wolfe Algorithm for Exemplar SelectionCode1
Efficient Multi-Domain Dictionary Learning with GANs0
An Augmented Linear Mixing Model to Address Spectral Variability for Hyperspectral Unmixing0
Subgradient Descent Learns Orthogonal DictionariesCode0
Show:102550
← PrevPage 41 of 83Next →

No leaderboard results yet.