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

TitleStatusHype
Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picture0
Complexity of Block Coordinate Descent with Proximal Regularization and Applications to Wasserstein CP-dictionary Learning0
Compositional Dictionaries for Domain Adaptive Face Recognition0
Compressed Dictionary Learning0
Compressed Online Dictionary Learning for Fast fMRI Decomposition0
Compressive Electron Backscatter Diffraction Imaging0
Compressive hyperspectral imaging via adaptive sampling and dictionary learning0
Compressive Scanning Transmission Electron Microscopy0
Computational Intractability of Dictionary Learning for Sparse Representation0
Concave losses for robust dictionary learning0
Show:102550
← PrevPage 75 of 83Next →

No leaderboard results yet.