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

TitleStatusHype
Joint space-time wind field data extrapolation and uncertainty quantification using nonparametric Bayesian dictionary learning0
Decomposing MLP Activations into Interpretable Features via Semi-Nonnegative Matrix FactorizationCode1
Evaluating Sparse Autoencoders: From Shallow Design to Matching Pursuit0
Mechanistic Decomposition of Sentence Representations0
HyperSteer: Activation Steering at Scale with HypernetworksCode2
Interpreting Large Text-to-Image Diffusion Models with Dictionary LearningCode0
Towards Privacy-Preserving Fine-Grained Visual Classification via Hierarchical Learning from Label Proportions0
DB-KSVD: Scalable Alternating Optimization for Disentangling High-Dimensional Embedding SpacesCode1
Modeling Musical Genre Trajectories through Pathlet LearningCode0
From Attention to Atoms: Spectral Dictionary Learning for Fast, Interpretable Language Models0
Show:102550
← PrevPage 1 of 83Next →

No leaderboard results yet.