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

TitleStatusHype
On the uniqueness and stability of dictionaries for sparse representation of noisy signals0
Optimal Regularization for a Data Source0
Optimal Spectral Recovery of a Planted Vector in a Subspace0
Optimization of Clustering for Clustering-based Image Denoising0
Optimized Kernel-based Projection Space of Riemannian Manifolds0
Optimizing Hard Thresholding for Sparse Model Discovery0
Overcomplete Dictionary Learning with Jacobi Atom Updates0
Patchwise Sparse Dictionary Learning from pre-trained Neural Network Activation Maps for Anomaly Detection in Images0
Per-Block-Convex Data Modeling by Accelerated Stochastic Approximation0
Performance Limits of Dictionary Learning for Sparse Coding0
Show:102550
← PrevPage 46 of 83Next →

No leaderboard results yet.