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

TitleStatusHype
Nonconvex Demixing From Bilinear Measurements0
Energy Disaggregation via Deep Temporal Dictionary Learning0
Fast greedy algorithms for dictionary selection with generalized sparsity constraints0
Online Dictionary Learning for Approximate Archetypal Analysis0
Identifiability of Complete Dictionary Learning0
Decentralized Dictionary Learning Over Time-Varying Digraphs0
The Power of Complementary Regularizers: Image Recovery via Transform Learning and Low-Rank Modeling0
A LSTM Approach with Sub-Word Embeddings for Mongolian Phrase Break Prediction0
Learning Class Prototypes via Structure Alignment for Zero-Shot Recognition0
Coupled dictionary learning for unsupervised change detection between multi-sensor remote sensing images0
Show:102550
← PrevPage 43 of 83Next →

No leaderboard results yet.