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

TitleStatusHype
Fast Convolutional Dictionary Learning off the Grid0
Fast greedy algorithms for dictionary selection with generalized sparsity constraints0
A Targeted Sampling Strategy for Compressive Cryo Focused Ion Beam Scanning Electron Microscopy0
Fast Multi-class Dictionaries Learning with Geometrical Directions in MRI Reconstruction0
Fast Orthonormal Sparsifying Transforms Based on Householder Reflectors0
Fast Rotational Sparse Coding0
Fast Structured Orthogonal Dictionary Learning using Householder Reflections0
CREIMBO: Cross-Regional Ensemble Interactions in Multi-view Brain Observations0
Features that Make a Difference: Leveraging Gradients for Improved Dictionary Learning0
Discriminative Feature and Dictionary Learning with Part-aware Model for Vehicle Re-identification0
Show:102550
← PrevPage 33 of 83Next →

No leaderboard results yet.