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

TitleStatusHype
Equiangular Kernel Dictionary Learning With Applications to Dynamic Texture Analysis0
Estimating the distribution of Galaxy Morphologies on a continuous space0
Discriminatively Trained Sparse Code Gradients for Contour Detection0
Evolutionary Simplicial Learning as a Generative and Compact Sparse Framework for Classification0
Evolving Dictionary Representation for Few-shot Class-incremental Learning0
Exact Sparse Orthogonal Dictionary Learning0
Discriminative Localized Sparse Representations for Breast Cancer Screening0
Explainable Trajectory Representation through Dictionary Learning0
Exploiting Low-dimensional Structures to Enhance DNN Based Acoustic Modeling in Speech Recognition0
Compressed Dictionary Learning0
Show:102550
← PrevPage 31 of 83Next →

No leaderboard results yet.