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

TitleStatusHype
SiBBlInGS: Similarity-driven Building-Block Inference using Graphs across StatesCode0
Group-based Sparse Representation for Image RestorationCode0
Orthogonally weighted _2,1 regularization for rank-aware joint sparse recovery: algorithm and analysisCode0
Stochastic regularized majorization-minimization with weakly convex and multi-convex surrogatesCode0
When Are Nonconvex Problems Not Scary?Code0
Lighter, Better, Faster Multi-Source Domain Adaptation with Gaussian Mixture Models and Optimal TransportCode0
Parametric PDE Control with Deep Reinforcement Learning and Differentiable L0-Sparse Polynomial PoliciesCode0
Word Embedding Visualization Via Dictionary LearningCode0
Linearized Kernel Dictionary LearningCode0
Harmonization of diffusion MRI datasets with adaptive dictionary learningCode0
Show:102550
← PrevPage 75 of 83Next →

No leaderboard results yet.