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
Exploring the Limitations of Structured Orthogonal Dictionary Learning0
Extended dynamic mode decomposition with dictionary learning using neural ordinary differential equations0
Extractive Summarization by Maximizing Semantic Volume0
Extrinsic Methods for Coding and Dictionary Learning on Grassmann Manifolds0
Face Recognition using Multi-Modal Low-Rank Dictionary Learning0
Fast and robust tensor decomposition with applications to dictionary learning0
Fast and Scalable Distributed Deep Convolutional Autoencoder for fMRI Big Data Analytics0
Fast Convolutional Dictionary Learning off the Grid0
Fast greedy algorithms for dictionary selection with generalized sparsity constraints0
Fast Multi-class Dictionaries Learning with Geometrical Directions in MRI Reconstruction0
Show:102550
← PrevPage 43 of 83Next →

No leaderboard results yet.