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

TitleStatusHype
Feuding Families and Former Friends: Unsupervised Learning for Dynamic Fictional Relationships0
Coupled dictionary learning for unsupervised change detection between multi-sensor remote sensing images0
Finding GEMS: Multi-Scale Dictionaries for High-Dimensional Graph Signals0
Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications0
First and Second Order Methods for Online Convolutional Dictionary Learning0
Flexible Multi-layer Sparse Approximations of Matrices and Applications0
Frame-based Sparse Analysis and Synthesis Signal Representations and Parseval K-SVD0
Frequency Regularized Deep Convolutional Dictionary Learning and Application to Blind Denoising0
Fast and Scalable Distributed Deep Convolutional Autoencoder for fMRI Big Data Analytics0
Fast and robust tensor decomposition with applications to dictionary learning0
Show:102550
← PrevPage 34 of 83Next →

No leaderboard results yet.