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

TitleStatusHype
STARK: Structured Dictionary Learning Through Rank-one Tensor Recovery0
Statistical limits of dictionary learning: random matrix theory and the spectral replica method0
Stochastic Learning of Multi-Instance Dictionary for Earth Mover's Distance based Histogram Comparison0
Structure-Aware Classification using Supervised Dictionary Learning0
Structured Dictionary Learning for Classification0
Structured Dictionary Learning for Energy Disaggregation0
Structured Discriminative Tensor Dictionary Learning for Unsupervised Domain Adaptation0
Structured Sparse Principal Component Analysis0
Subgraph Clustering and Atom Learning for Improved Image Classification0
Submodular Attribute Selection for Action Recognition in Video0
Show:102550
← PrevPage 58 of 83Next →

No leaderboard results yet.