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

TitleStatusHype
Low-Rank Tensor Approximation With Laplacian Scale Mixture Modeling for Multiframe Image Denoising0
Linearization to Nonlinear Learning for Visual Tracking0
Sparse Dynamic 3D Reconstruction From Unsynchronized Videos0
Conformal and Low-Rank Sparse Representation for Image Restoration0
Efficient Sum of Outer Products Dictionary Learning (SOUP-DIL) - The _0 Method0
Multimodal sparse representation learning and applications0
FRIST - Flipping and Rotation Invariant Sparsifying Transform Learning and Applications0
Sparse-promoting Full Waveform Inversion based on Online Orthonormal Dictionary Learning0
Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method0
Zero-Shot Learning via Joint Latent Similarity Embedding0
Show:102550
← PrevPage 66 of 83Next →

No leaderboard results yet.