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

TitleStatusHype
A Concept-Based Explainability Framework for Large Multimodal ModelsCode1
Unsupervised learning of Data-driven Facial Expression Coding System (DFECS) using keypoint tracking0
CREIMBO: Cross-Regional Ensemble Interactions in Multi-view Brain Observations0
Improving Language Models Trained on Translated Data with Continual Pre-Training and Dictionary Learning Analysis0
Identifying Functionally Important Features with End-to-End Sparse Dictionary LearningCode2
Towards Principled Evaluations of Sparse Autoencoders for Interpretability and Control0
Efficient Matrix Factorization Via Householder Reflections0
Lightweight Conceptual Dictionary Learning for Text Classification Using Information Compression0
Improving Dictionary Learning with Gated Sparse AutoencodersCode3
Lighter, Better, Faster Multi-Source Domain Adaptation with Gaussian Mixture Models and Optimal TransportCode0
Show:102550
← PrevPage 7 of 83Next →

No leaderboard results yet.