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

TitleStatusHype
A Simple Sparse Denoising Layer for Robust Deep Learning0
Bayesian Nonparametric Dictionary Learning for Compressed Sensing MRI0
Bayesian sparsity and class sparsity priors for dictionary learning and coding0
Deep Decision Trees for Discriminative Dictionary Learning with Adversarial Multi-Agent Trajectories0
Deep Dictionary Learning: A PARametric NETwork Approach0
Deep Dictionary Learning with An Intra-class Constraint0
Deep Double Sparsity Encoder: Learning to Sparsify Not Only Features But Also Parameters0
Beyond Codebook-Based Analog Beamforming at mmWave: Compressed Sensing and Machine Learning Methods0
Deep Face Image Retrieval: a Comparative Study with Dictionary Learning0
A Comparative Study for the Nuclear Norms Minimization Methods0
Show:102550
← PrevPage 19 of 83Next →

No leaderboard results yet.