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

TitleStatusHype
Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picture0
Multiple Instance Dictionary Learning using Functions of Multiple InstancesCode0
Computational Intractability of Dictionary Learning for Sparse Representation0
Personalized Age Progression with Aging Dictionary0
When Are Nonconvex Problems Not Scary?Code0
Linearized Kernel Dictionary LearningCode0
Overcomplete Dictionary Learning with Jacobi Atom Updates0
Dictionary Learning and Sparse Coding for Third-order Super-symmetric Tensors0
Extractive Summarization by Maximizing Semantic Volume0
Dictionary Learning for Blind One Bit Compressed Sensing0
Show:102550
← PrevPage 67 of 83Next →

No leaderboard results yet.