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

TitleStatusHype
NNK-Means: Data summarization using dictionary learning with non-negative kernel regression0
Noise Level Estimation for Overcomplete Dictionary Learning Based on Tight Asymptotic Bounds0
Noisy Inductive Matrix Completion Under Sparse Factor Models0
Noisy Matrix Completion under Sparse Factor Models0
Nonconvex Demixing From Bilinear Measurements0
Nonlinear Functional Output Regression: a Dictionary Approach0
Nonnegative dictionary learning in the exponential noise model for adaptive music signal representation0
Non-negative representation based discriminative dictionary learning for face recognition0
Non-negative Tensor Patch Dictionary Approaches for Image Compression and Deblurring Applications0
Non-Parametric Bayesian Dictionary Learning for Sparse Image Representations0
Show:102550
← PrevPage 60 of 83Next →

No leaderboard results yet.