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

TitleStatusHype
On the need for metrics in dictionary learning assessmentCode0
Kernel Coding: General Formulation and Special Cases0
Sparse Coding on Symmetric Positive Definite Manifolds using Bregman Divergences0
_1-K-SVD: A Robust Dictionary Learning Algorithm With Simultaneous Update0
Dependent Nonparametric Bayesian Group Dictionary Learning for online reconstruction of Dynamic MR images0
A fast patch-dictionary method for whole image recovery0
Sparse and spurious: dictionary learning with noise and outliers0
Subspace metrics for multivariate dictionaries and application to EEGCode0
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method0
Estimating the distribution of Galaxy Morphologies on a continuous space0
Show:102550
← PrevPage 74 of 83Next →

No leaderboard results yet.