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

TitleStatusHype
A Targeted Sampling Strategy for Compressive Cryo Focused Ion Beam Scanning Electron Microscopy0
Beyond Codebook-Based Analog Beamforming at mmWave: Compressed Sensing and Machine Learning Methods0
A Riemannian ADMMCode0
Simple Alternating Minimization Provably Solves Complete Dictionary Learning0
Geometric Sparse Coding in Wasserstein Space0
Dictionary Learning for the Almost-Linear Sparsity RegimeCode0
Hybrid mmWave MIMO Systems under Hardware Impairments and Beam Squint: Channel Model and Dictionary Learning-aided Configuration0
Unsupervised Opinion Summarization Using Approximate Geodesics0
Self-Supervised Texture Image Anomaly Detection By Fusing Normalizing Flow and Dictionary Learning0
Unitary Approximate Message Passing for Matrix Factorization0
Show:102550
← PrevPage 19 of 83Next →

No leaderboard results yet.