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

TitleStatusHype
Uncovering hidden geometry in Transformers via disentangling position and contextCode0
Unsupervised Complex Semi-Binary Matrix Factorization for Activation Sequence Recovery of Quasi-Stationary Sources0
Wave-informed dictionary learning for high-resolution imaging in complex media0
Global Identifiability of _1-based Dictionary Learning via Matrix Volume Optimization0
Global Identifiability of _1-based Dictionary Learning via Matrix Volume Optimization0
Federated Dataset Dictionary Learning for Multi-Source Domain Adaptation0
Multi-Source Domain Adaptation meets Dataset Distillation through Dataset Dictionary Learning0
Bayesian sparsity and class sparsity priors for dictionary learning and coding0
Optimal Projections for Discriminative Dictionary Learning using the JL-lemmaCode0
Sparse Models for Machine Learning0
Show:102550
← PrevPage 14 of 83Next →

No leaderboard results yet.