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

TitleStatusHype
Discriminative Nonlinear Analysis Operator Learning: When Cosparse Model Meets Image Classification0
Efficient GPU Implementation for Single Block Orthogonal Dictionary Learning0
Efficient Large-Scale Similarity Search Using Matrix Factorization0
Efficient Matrix Factorization Via Householder Reflections0
Efficient Multi-Domain Dictionary Learning with GANs0
Efficient Sum of Outer Products Dictionary Learning (SOUP-DIL) - The _0 Method0
Compressed Online Dictionary Learning for Fast fMRI Decomposition0
_1-K-SVD: A Robust Dictionary Learning Algorithm With Simultaneous Update0
Energy Disaggregation via Deep Temporal Dictionary Learning0
Discriminatively Trained Sparse Code Gradients for Contour Detection0
Show:102550
← PrevPage 30 of 83Next →

No leaderboard results yet.