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

TitleStatusHype
Blind Denoising Autoencoder0
Block and Group Regularized Sparse Modeling for Dictionary Learning0
Block-Diagonal Sparse Representation by Learning a Linear Combination Dictionary for Recognition0
Boosting Adversarial Robustness and Generalization with Structural Prior0
Boosting Dictionary Learning with Error Codes0
A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization0
Buried object detection using handheld WEMI with task-driven extended functions of multiple instances0
CIM: Class-Irrelevant Mapping for Few-Shot Classification0
Classification and Representation via Separable Subspaces: Performance Limits and Algorithms0
Classification of dry age-related macular degeneration and diabetic macular edema from optical coherence tomography images using dictionary learning0
Show:102550
← PrevPage 73 of 83Next →

No leaderboard results yet.