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
SiBBlInGS: Similarity-driven Building-Block Inference using Graphs across StatesCode0
Complexity of Block Coordinate Descent with Proximal Regularization and Applications to Wasserstein CP-dictionary Learning0
Fast and Interpretable Nonlocal Neural Networks for Image Denoising via Group-Sparse Convolutional Dictionary LearningCode0
Dictionary Learning under Symmetries via Group Representations0
Personalized Dictionary Learning for Heterogeneous Datasets0
Evolving Dictionary Representation for Few-shot Class-incremental Learning0
Learning Dictionaries from Physical-Based Interpolation for Water Network Leak LocalizationCode0
Toward Real-Time Image Annotation Using Marginalized Coupled Dictionary LearningCode0
Convergence of alternating minimisation algorithms for dictionary learning0
A High-Performance Accelerator for Super-Resolution Processing on Embedded GPU0
Show:102550
← PrevPage 13 of 83Next →

No leaderboard results yet.