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

TitleStatusHype
Recognizing Partial Biometric PatternsCode0
Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Method0
An unsupervised deep learning framework for medical image denoising0
Complete Dictionary Learning via ^4-Norm Maximization over the Orthogonal Group0
Community-Level Anomaly Detection for Anti-Money Laundering0
A Lightweight Randomized Nonlinear Dictionary Learning Method using Random Vector Functional Link0
A Linearly Convergent Method for Non-Smooth Non-Convex Optimization on the Grassmannian with Applications to Robust Subspace and Dictionary Learning0
Collaborative Representation for Classification, Sparse or Non-sparse?0
A Novel Tensor-Based Video Rain Streaks Removal Approach via Utilizing Discriminatively Intrinsic Priors0
Coding Kendall's Shape Trajectories for 3D Action Recognition0
Show:102550
← PrevPage 19 of 83Next →

No leaderboard results yet.