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

TitleStatusHype
Interpretable Neural Embeddings with Sparse Self-Representation0
BINDy -- Bayesian identification of nonlinear dynamics with reversible-jump Markov-chain Monte-Carlo0
Deep Neural Networks with Random Gaussian Weights: A Universal Classification Strategy?0
Discriminative Feature and Dictionary Learning with Part-aware Model for Vehicle Re-identification0
Deep Non-Rigid Structure from Motion0
Jitter-Adaptive Dictionary Learning - Application to Multi-Trial Neuroelectric Signals0
Blind Denoising Autoencoder0
Joint Dictionaries for Zero-Shot Learning0
Discriminative Dictionary Learning based on Statistical Methods0
Compositional Dictionaries for Domain Adaptive Face Recognition0
Show:102550
← PrevPage 40 of 83Next →

No leaderboard results yet.