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

TitleStatusHype
Recovery under Side Constraints0
Understanding approximate and unrolled dictionary learning for pattern recoveryCode0
Deriving Autism Spectrum Disorder Functional Networks from RS-FMRI Data using Group ICA and Dictionary LearningCode0
Stable and Interpretable Unrolled Dictionary LearningCode0
Optimal Spectral Recovery of a Planted Vector in a Subspace0
Locality Constrained Analysis Dictionary Learning via K-SVD Algorithm0
Deep Transform and Metric Learning Networks0
Learning Log-Determinant Divergences for Positive Definite Matrices0
Blind Primed Supervised (BLIPS) Learning for MR Image ReconstructionCode0
Deep Multi-Resolution Dictionary Learning for Histopathology Image Analysis0
Show:102550
← PrevPage 25 of 83Next →

No leaderboard results yet.