Accelerate RNN-based Training with Importance Sampling
Fei Wang, Xiaofeng Gao, Guihai Chen, Jun Ye

TL;DR
This paper introduces a novel algorithm to enable importance sampling in RNN training, significantly accelerating convergence by effectively handling unstructured data.
Contribution
It proposes the Fast-Importance-Mining algorithm that allows importance sampling to be applied to RNNs with unstructured data, overcoming previous limitations.
Findings
Importance sampling improves RNN training convergence.
The proposed algorithm effectively computes importance factors for unstructured data.
Experimental results validate faster training of RNNs using importance sampling.
Abstract
Importance sampling (IS) as an elegant and efficient variance reduction (VR) technique for the acceleration of stochastic optimization problems has attracted many researches recently. Unlike commonly adopted stochastic uniform sampling in stochastic optimizations, IS-integrated algorithms sample training data at each iteration with respect to a weighted sampling probability distribution , which is constructed according to the precomputed importance factors. Previous experimental results show that IS has achieved remarkable progresses in the acceleration of training convergence. Unfortunately, the calculation of the sampling probability distribution causes a major limitation of IS: it requires the input data to be well-structured, i.e., the feature vector is properly defined. Consequently, recurrent neural networks (RNN) as a popular learning algorithm is not able to enjoy the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Neural Networks and Applications · Advanced Neural Network Applications
