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

TitleStatusHype
Improving Neuron-level Interpretability with White-box Language Models0
Efficient Dictionary Learning with Switch Sparse AutoencodersCode1
Quantifying Feature Space Universality Across Large Language Models via Sparse AutoencodersCode0
Convolutional Dictionary Learning Based Hybrid-Field Channel Estimation for XL-RIS-Aided Massive MIMO Systems0
LASERS: LAtent Space Encoding for Representations with Sparsity for Generative Modeling0
Fast Structured Orthogonal Dictionary Learning using Householder Reflections0
Atom dimension adaptation for infinite set dictionary learning0
Geometry of the Space of Partitioned Networks: A Unified Theoretical and Computational FrameworkCode0
Sparsifying Parametric Models with L0 RegularizationCode0
BINDy -- Bayesian identification of nonlinear dynamics with reversible-jump Markov-chain Monte-Carlo0
Show:102550
← PrevPage 5 of 83Next →

No leaderboard results yet.