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

TitleStatusHype
Quantifying Feature Space Universality Across Large Language Models via Sparse AutoencodersCode0
Optimal Projections for Discriminative Dictionary Learning using the JL-lemmaCode0
Occluded Face Recognition Using Low-rank Regression with Generalized Gradient DirectionCode0
ECG beats classification via online sparse dictionary and time pyramid matchingCode0
ECG Beats Fast Classification Base on Sparse DictionariesCode0
CORAD: Correlation-Aware Compression of Massive Time Series using Sparse Dictionary CodingCode0
Efficient and Parallel Separable Dictionary LearningCode0
Anomaly Detection with Selective Dictionary LearningCode0
Weakly Supervised Convolutional Dictionary Learning for Multi-Label ClassificationCode0
Metrics for Multivariate DictionariesCode0
Show:102550
← PrevPage 79 of 83Next →

No leaderboard results yet.