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

TitleStatusHype
Sparse Factor Analysis for Learning and Content Analytics0
Learning Stable Multilevel Dictionaries for Sparse Representations0
Multiple Kernel Sparse Representations for Supervised and Unsupervised Learning0
Metrics for Multivariate DictionariesCode0
Bayesian Nonparametric Dictionary Learning for Compressed Sensing MRI0
Sample Complexity of Bayesian Optimal Dictionary Learning0
Jitter-Adaptive Dictionary Learning - Application to Multi-Trial Neuroelectric Signals0
Dictionary Subselection Using an Overcomplete Joint Sparsity Model0
Semi-blind Source Separation via Sparse Representations and Online Dictionary Learning0
Online L1-Dictionary Learning with Application to Novel Document Detection0
Show:102550
← PrevPage 81 of 83Next →

No leaderboard results yet.