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

TitleStatusHype
Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning0
Matrix factorization with neural networks0
Mechanistic Decomposition of Sentence Representations0
Metalearning: Sparse Variable-Structure Automata0
Minimax Lower Bounds for Kronecker-Structured Dictionary Learning0
MIRE: Matched Implicit Neural Representations0
Mixed-Features Vectors and Subspace Splitting0
Mixture-of-Shape-Experts (MoSE): End-to-End Shape Dictionary Framework to Prompt SAM for Generalizable Medical Segmentation0
Model-based Iterative Restoration for Binary Document Image Compression with Dictionary Learning0
Model-based Reconstruction with Learning: From Unsupervised to Supervised and Beyond0
Show:102550
← PrevPage 56 of 83Next →

No leaderboard results yet.