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

TitleStatusHype
Learning a Gaussian Mixture for Sparsity Regularization in Inverse Problems0
Learning Interpretable Queries for Explainable Image Classification with Information Pursuit0
Interpretable Online Network Dictionary Learning for Inferring Long-Range Chromatin InteractionsCode0
Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization0
Explainable Trajectory Representation through Dictionary Learning0
Clustering Inductive Biases with Unrolled Networks0
SenseAI: Real-Time Inpainting for Electron Microscopy0
Orthogonally weighted _2,1 regularization for rank-aware joint sparse recovery: algorithm and analysisCode0
Level Set KSVD0
Riemannian stochastic optimization methods avoid strict saddle points0
Show:102550
← PrevPage 9 of 83Next →

No leaderboard results yet.