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

TitleStatusHype
Fast Orthonormal Sparsifying Transforms Based on Householder Reflectors0
Fast Rotational Sparse Coding0
Fast Structured Orthogonal Dictionary Learning using Householder Reflections0
Features that Make a Difference: Leveraging Gradients for Improved Dictionary Learning0
Federated Dataset Dictionary Learning for Multi-Source Domain Adaptation0
Feuding Families and Former Friends: Unsupervised Learning for Dynamic Fictional Relationships0
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
Show:102550
← PrevPage 44 of 83Next →

No leaderboard results yet.