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

TitleStatusHype
Dictionary Learning by Dynamical Neural Networks0
Dictionary Learning for Adaptive GPR Landmine Classification0
Dictionary Learning for Blind One Bit Compressed Sensing0
Demystifying overcomplete nonlinear auto-encoders: fast SGD convergence towards sparse representation from random initialization0
A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization0
DEMAND: Deep Matrix Approximately Nonlinear Decomposition to Identify Meta, Canonical, and Sub-Spatial Pattern of functional Magnetic Resonance Imaging in the Human Brain0
Deep Transform and Metric Learning Networks0
Dictionary Learning for Two-Dimensional Kendall Shapes0
Dictionary Learning from Ambiguously Labeled Data0
Boosting Dictionary Learning with Error Codes0
Show:102550
← PrevPage 24 of 83Next →

No leaderboard results yet.