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

TitleStatusHype
Sketchformer: Transformer-based Representation for Sketched StructureCode1
Complete Dictionary Learning via _p-norm MaximizationCode1
Online matrix factorization for Markovian data and applications to Network Dictionary LearningCode1
Greedy Frank-Wolfe Algorithm for Exemplar SelectionCode1
Deep Micro-Dictionary Learning and Coding NetworkCode1
Efficient Sum of Outer Products Dictionary Learning (SOUP-DIL) and Its Application to Inverse ProblemsCode1
Deep Roto-Translation Scattering for Object ClassificationCode1
Joint space-time wind field data extrapolation and uncertainty quantification using nonparametric Bayesian dictionary learning0
Evaluating Sparse Autoencoders: From Shallow Design to Matching Pursuit0
Mechanistic Decomposition of Sentence Representations0
Show:102550
← PrevPage 5 of 83Next →

No leaderboard results yet.