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

TitleStatusHype
Learning differentiable solvers for systems with hard constraints0
Temporal Forward-Backward Consistency, Not Residual Error, Measures the Prediction Accuracy of Extended Dynamic Mode Decomposition0
Deep Dictionary Learning with An Intra-class Constraint0
A Personalized Zero-Shot ECG Arrhythmia Monitoring System: From Sparse Representation Based Domain Adaption to Energy Efficient Abnormal Beat Detection for Practical ECG SurveillanceCode1
Recent Results of Energy Disaggregation with Behind-the-Meter Solar Generation0
Vector Quantisation for Robust SegmentationCode1
Supervised Dictionary Learning with Auxiliary CovariatesCode0
Convolutional Dictionary Learning by End-To-End Training of Iterative Neural NetworksCode0
Decomposed Linear Dynamical Systems (dLDS) for learning the latent components of neural dynamicsCode1
Poisson2Sparse: Self-Supervised Poisson Denoising From a Single ImageCode1
Show:102550
← PrevPage 17 of 83Next →

No leaderboard results yet.