Importance Sampling for Stochastic Gradient Descent in Deep Neural Networks

Thibault Lahire
3/29/2023
cs.LG

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Stochastic gradient descent samples uniformly the training set to build an unbiased gradient estimate with a limited number of samples. However, at a given step of the training process, some data are more helpful than others to continue learning. Importance sampling for training deep neural networks has been widely studied to propose sampling schemes yielding better performance than the uniform sampling scheme. After recalling the theory of importance sampling for deep learning, this paper reviews the challenges inherent to this research area. In particular, we propose a metric allowing the assessment of the quality of a given sampling scheme; and we study the interplay between the sampling scheme and the optimizer used.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lahire2023importance,
  title  = {Importance Sampling for Stochastic Gradient Descent in Deep Neural Networks},
  author = {Thibault Lahire},
  year   = {2023},
  eprint = {2303.16529},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.16529v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.16529.svg)](https://codeofpaper.com/paper/2303.16529)

Discussion