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 361–370 of 823 papers

TitleStatusHype
Compressed Dictionary Learning—0
Greedy Optimization of Electrode Arrangement for Epiretinal Prostheses—0
Applications of Online Nonnegative Matrix Factorization to Image and Time-Series Data—0
Group-based Sparse Representation for Image Compressive Sensing Reconstruction with Non-Convex Regularization—0
High-speed Millimeter-wave 5G/6G Image Transmission via Artificial Intelligence—0
Group Crosscoders for Mechanistic Analysis of Symmetry—0
Group Invariant Dictionary Learning—0
Group Re-Identification via Unsupervised Transfer of Sparse Features Encoding—0
Optimal Projected Variance Group-Sparse Block PCA—0
Discriminative Feature and Dictionary Learning with Part-aware Model for Vehicle Re-identification—0
Show:102550
← PrevPage 37 of 83Next →

No leaderboard results yet.