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

TitleStatusHype
Bayesian sparsity and class sparsity priors for dictionary learning and coding0
Beta Process Joint Dictionary Learning for Coupled Feature Spaces with Application to Single Image Super-Resolution0
Beyond Codebook-Based Analog Beamforming at mmWave: Compressed Sensing and Machine Learning Methods0
Beyond Label Attention: Transparency in Language Models for Automated Medical Coding via Dictionary Learning0
Binary Matrix Factorization via Dictionary Learning0
Analysis of Fast Structured Dictionary Learning0
BINDy -- Bayesian identification of nonlinear dynamics with reversible-jump Markov-chain Monte-Carlo0
Blind Denoising Autoencoder0
Analysis Co-Sparse Coding for Energy Disaggregation0
A Tree-based Dictionary Learning Framework0
Show:102550
← PrevPage 10 of 83Next →

No leaderboard results yet.