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

TitleStatusHype
Greedy Deep Dictionary Learning0
Learning a low-rank shared dictionary for object classificationCode0
Trainlets: Dictionary Learning in High Dimensions0
Joint Sensing Matrix and Sparsifying Dictionary Optimization for Tensor Compressive Sensing0
Exploiting Low-dimensional Structures to Enhance DNN Based Acoustic Modeling in Speech Recognition0
Localized Dictionary design for Geometrically Robust Sonar ATR0
Block-Diagonal Sparse Representation by Learning a Linear Combination Dictionary for Recognition0
Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes0
Denoising and Completion of 3D Data via Multidimensional Dictionary Learning0
Multi-centrality Graph Spectral Decompositions and their Application to Cyber Intrusion Detection0
Show:102550
← PrevPage 64 of 83Next →

No leaderboard results yet.