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

TitleStatusHype
Efficient Dictionary Learning with Switch Sparse AutoencodersCode1
Measuring Progress in Dictionary Learning for Language Model Interpretability with Board Game ModelsCode1
GroupCDL: Interpretable Denoising and Compressed Sensing MRI via Learned Group-Sparsity and Circulant AttentionCode1
A Concept-Based Explainability Framework for Large Multimodal ModelsCode1
SC-MIL: Sparsely Coded Multiple Instance Learning for Whole Slide Image ClassificationCode1
Combating the Curse of Multilinguality in Cross-Lingual WSD by Aligning Sparse Contextualized Word RepresentationsCode1
A Personalized Zero-Shot ECG Arrhythmia Monitoring System: From Sparse Representation Based Domain Adaption to Energy Efficient Abnormal Beat Detection for Practical ECG SurveillanceCode1
Vector Quantisation for Robust SegmentationCode1
Decomposed Linear Dynamical Systems (dLDS) for learning the latent components of neural dynamicsCode1
Poisson2Sparse: Self-Supervised Poisson Denoising From a Single ImageCode1
Show:102550
← PrevPage 2 of 83Next →

No leaderboard results yet.