Active Mini-Batch Sampling Using Repulsive Point Processes


  • Cheng Zhang Microsoft Research
  • Cengiz Öztireli Disney Research
  • Stephan Mandt Disney Research
  • Giampiero Salvi KTH Royal Institute of Technology



The convergence speed of stochastic gradient descent (SGD) can be improved by actively selecting mini-batches. We explore sampling schemes where similar data points are less likely to be selected in the same mini-batch. In particular, we prove that such repulsive sampling schemes lower the variance of the gradient estimator. This generalizes recent work on using Determinantal Point Processes (DPPs) for mini-batch diversification (Zhang et al., 2017) to the broader class of repulsive point processes. We first show that the phenomenon of variance reduction by diversified sampling generalizes in particular to non-stationary point processes. We then show that other point processes may be computationally much more efficient than DPPs. In particular, we propose and investigate Poisson Disk sampling—frequently encountered in the computer graphics community—for this task. We show empirically that our approach improves over standard SGD both in terms of convergence speed as well as final model performance.




How to Cite

Zhang, C., Öztireli, C., Mandt, S., & Salvi, G. (2019). Active Mini-Batch Sampling Using Repulsive Point Processes. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 5741-5748.



AAAI Technical Track: Machine Learning