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

TitleStatusHype
Finding a sparse vector in a subspace: Linear sparsity using alternating directionsCode0
Submodular Attribute Selection for Action Recognition in Video0
On the relations of LFPs & Neural Spike Trains0
Projective dictionary pair learning for pattern classification0
Noisy Matrix Completion under Sparse Factor Models0
Generalized Adaptive Dictionary Learning via Domain Shift Minimization0
Generalized Conditional Gradient for Sparse Estimation0
Reconstructive Sparse Code Transfer for Contour Detection and Semantic Labeling0
Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14)0
Active Dictionary Learning in Sparse Representation Based Classification0
Show:102550
← PrevPage 73 of 83Next →

No leaderboard results yet.