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

TitleStatusHype
Analysis of Fast Alternating Minimization for Structured Dictionary Learning0
Learning Light Field Reconstruction from a Single Coded Image0
Robust Kronecker Component Analysis0
Denoising Dictionary Learning Against Adversarial Perturbations0
Frame-based Sparse Analysis and Synthesis Signal Representations and Parseval K-SVD0
Deep Spatial Feature Reconstruction for Partial Person Re-identification: Alignment-Free ApproachCode0
Demystifying overcomplete nonlinear auto-encoders: fast SGD convergence towards sparse representation from random initialization0
Travel time tomography with adaptive dictionaries0
Image Super-resolution via Feature-augmented Random ForestCode0
Low-dose spectral CT reconstruction using L0 image gradient and tensor dictionary0
Show:102550
← PrevPage 48 of 83Next →

No leaderboard results yet.