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

TitleStatusHype
Local identifiability of l_1-minimization dictionary learning: a sufficient and almost necessary condition0
Local Information with Feedback Perturbation Suffices for Dictionary Learning in Neural Circuits0
Locality Constrained Analysis Dictionary Learning via K-SVD Algorithm0
Localized Dictionary design for Geometrically Robust Sonar ATR0
Local Patch Encoding-Based Method for Single Image Super-Resolution0
Low-dose spectral CT reconstruction using L0 image gradient and tensor dictionary0
Low-Rank Embedded Ensemble Semantic Dictionary for Zero-Shot Learning0
Low-Rank Tensor Approximation With Laplacian Scale Mixture Modeling for Multiframe Image Denoising0
Majorization Minimization Technique for Optimally Solving Deep Dictionary Learning0
Making sense of randomness: an approach for fast recovery of compressively sensed signals0
Show:102550
← PrevPage 55 of 83Next →

No leaderboard results yet.