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

TitleStatusHype
Analysis of Fast Alternating Minimization for Structured Dictionary Learning0
Analysis of Fast Structured Dictionary Learning0
An Augmented Linear Mixing Model to Address Spectral Variability for Hyperspectral Unmixing0
An efficient supervised dictionary learning method for audio signal recognition0
An improved analysis of the ER-SpUD dictionary learning algorithm0
An Incidence Geometry approach to Dictionary Learning0
An Inequality with Applications to Structured Sparsity and Multitask Dictionary Learning0
An information theoretic formulation of the Dictionary Learning and Sparse Coding Problems on Statistical Manifolds0
Anomaly-Sensitive Dictionary Learning for Unsupervised Diagnostics of Solid Media0
A Novel Tensor-Based Video Rain Streaks Removal Approach via Utilizing Discriminatively Intrinsic Priors0
Show:102550
← PrevPage 69 of 83Next →

No leaderboard results yet.