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

TitleStatusHype
SenseAI: Real-Time Inpainting for Electron Microscopy0
Orthogonally weighted _2,1 regularization for rank-aware joint sparse recovery: algorithm and analysisCode0
Level Set KSVD0
Riemannian stochastic optimization methods avoid strict saddle points0
A Strictly Bounded Deep Network for Unpaired Cyclic Translation of Medical Images0
Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming0
MRI brain tumor segmentation using informative feature vectors and kernel dictionary learning0
Joint Sparse Representations and Coupled Dictionary Learning in Multi-Source Heterogeneous Image Pseudo-color Fusion0
Enhancing Predictive Capabilities in Data-Driven Dynamical Modeling with Automatic Differentiation: Koopman and Neural ODE Approaches0
Uncovering Model Processing Strategies with Non-Negative Per-Example Fisher Factorization0
Show:102550
← PrevPage 13 of 83Next →

No leaderboard results yet.