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

TitleStatusHype
Cloud K-SVD for Image DenoisingCode0
X-ray Spectral Estimation using Dictionary Learning0
Hiding Data Helps: On the Benefits of Masking for Sparse CodingCode0
Sparse, Geometric Autoencoder Models of V10
An Efficient Approximate Method for Online Convolutional Dictionary LearningCode0
A variational autoencoder-based nonnegative matrix factorisation model for deep dictionary learning0
Reprogramming Pretrained Language Models for Protein Sequence Representation Learning0
Optimal Regularization for a Data Source0
Near-Field Sparse Channel Representation and Estimation in 6G Wireless Communications0
Learning Invariant Subspaces of Koopman Operators--Part 1: A Methodology for Demonstrating a Dictionary's Approximate Subspace Invariance0
Show:102550
← PrevPage 14 of 83Next →

No leaderboard results yet.