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

TitleStatusHype
From Group Sparse Coding to Rank Minimization: A Novel Denoising Model for Low-level Image Restoration0
Generalized Time Warping Invariant Dictionary Learning for Time Series Classification and Clustering0
Generative Deep Deconvolutional Learning0
Generic Image Classification Approaches Excel on Face Recognition0
Geometric Sparse Coding in Wasserstein Space0
Global Identifiability of _1-based Dictionary Learning via Matrix Volume Optimization0
Global Identifiability of _1-based Dictionary Learning via Matrix Volume Optimization0
Globally Variance-Constrained Sparse Representation and Its Application in Image Set Coding0
Graph Signal Representation with Wasserstein Barycenters0
Greedy Deep Dictionary Learning0
Show:102550
← PrevPage 46 of 83Next →

No leaderboard results yet.