Active Mini-Batch Sampling using Repulsive Point Processes
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 lowers 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.
Code (1)
Tasks
Point ProcessesMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Diversified Sampling for Batched Bayesian Optimization with Determinantal Point Processes
In Bayesian Optimization (BO) we study black-box function optimization with noisy point evaluations and Bayesian priors. Convergence of BO can be greatly sped up by batching, where multiple evaluations of the black-box f…
Bayesian OptimizationDiversityPoint ProcessesThompson SamplingAnalytical Correction for Subsampling Bias in Drifting Models
Drifting models are capable one-step generative models trained to follow a drifting field. The field combines attractive and repulsive softmax-weighted centroids over the data and current-generator distributions. In prac…
Batch Active Learning Using Determinantal Point Processes
Data collection and labeling is one of the main challenges in employing machine learning algorithms in a variety of real-world applications with limited data. While active learning methods attempt to tackle this issue by…
Active LearningDiversityPoint ProcessesStochastic Subgradient Descent on a Generic Definable Function Converges to a Minimizer
It was previously shown by Davis and Drusvyatskiy that every Clarke critical point of a generic, semialgebraic (and more generally definable in an o-minimal structure), weakly convex function is lying on an active manifo…
Fast Rates in Pool-Based Batch Active Learning
We consider a batch active learning scenario where the learner adaptively issues batches of points to a labeling oracle. Sampling labels in batches is highly desirable in practice due to the smaller number of interactive…
Active LearningDiversityInformativeness