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

TitleStatusHype
A Linearly Convergent Method for Non-Smooth Non-Convex Optimization on the Grassmannian with Applications to Robust Subspace and Dictionary Learning0
Locality Constraint Dictionary Learning with Support Vector for Pattern ClassificationCode0
CASTER: Predicting Drug Interactions with Chemical Substructure RepresentationCode0
Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type MethodsCode0
Sparse Coding on Cascaded Residuals0
Online matrix factorization for Markovian data and applications to Network Dictionary LearningCode1
Adversarial dictionary learning for a robust analysis and modelling of spontaneous neuronal activity0
Community-Level Anomaly Detection for Anti-Money Laundering0
Learning Priors in High-frequency Domain for Inverse Imaging ReconstructionCode0
Dictionary Learning with Almost Sure Error Constraints0
Show:102550
← PrevPage 34 of 83Next →

No leaderboard results yet.