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

TitleStatusHype
Complete Dictionary Learning via _p-norm MaximizationCode1
DB-KSVD: Scalable Alternating Optimization for Disentangling High-Dimensional Embedding SpacesCode1
A Structured Dictionary Perspective on Implicit Neural RepresentationsCode1
Deep Roto-Translation Scattering for Object ClassificationCode1
A Model-driven Deep Neural Network for Single Image Rain RemovalCode1
Discovery of Nonlinear Dynamical Systems using a Runge-Kutta Inspired Dictionary-based Sparse Regression ApproachCode1
Efficient Dictionary Learning with Switch Sparse AutoencodersCode1
Efficient Sum of Outer Products Dictionary Learning (SOUP-DIL) and Its Application to Inverse ProblemsCode1
Generalized and Discriminative Few-Shot Object Detection via SVD-Dictionary EnhancementCode1
Measuring Progress in Dictionary Learning for Language Model Interpretability with Board Game ModelsCode1
Show:102550
← PrevPage 3 of 83Next →

No leaderboard results yet.