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

TitleStatusHype
Compressive Scanning Transmission Electron Microscopy0
DriPP: Driven Point Processes to Model Stimuli Induced Patterns in M/EEG Signals0
Generalization Error Bounds for Iterative Recovery Algorithms Unfolded as Neural Networks0
SSDL: Self-Supervised Dictionary Learning0
Spherical Matrix Factorization0
Sparse Subspace Clustering Friendly Deep Dictionary Learning for Hyperspectral Image Classification0
Dynamic Texture Recognition using PDV Hashing and Dictionary Learning on Multi-scale Volume Local Binary Pattern0
Discriminative Dictionary Learning based on Statistical Methods0
Sparse dictionary learning recovers pleiotropy from human cell fitness screensCode0
Dictionary Learning Using Rank-One Atomic Decomposition (ROAD)0
Show:102550
← PrevPage 22 of 83Next →

No leaderboard results yet.