2011
NIPS
NeurIPS 2011
Finite Time Analysis of Stratified Sampling for Monte Carlo
Abstract
We consider the problem of stratified sampling for Monte-Carlo integration. We model this problem in a multi-armed bandit setting, where the arms represent the strata, and the goal is to estimate a weighted average of the mean values of the arms. We propose a strategy that samples the arms according to an upper bound on their standard deviations and compare its estimation quality to an ideal allocation that would know the standard deviations of the arms. We provide two regret analyses: a distribution-dependent bound O(n^{-3/2}) that depends on a measure of the disparity of the arms, and a distribution-free bound O(n^{-4/3}) that does not. To the best of our knowledge, such a finite-time analysis is new for this problem.
🌉
Interdisciplinary Bridge
— Machine Learning and Mathematics & Optimization
🧭
Keyword Pioneer
— monte carlo integration
🐣
Hot Topic Early Bird
— multi-armed bandit
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Data Science & Analytics, Deep Learning, Interdisciplinary, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Speech & Audio
📈
Trend Setter
— Stochastic Processes
Authors
Topics
Machine Learning > Learning Types > Active Learning
Machine Learning > Optimization & Theory > Theory
Mathematics & Optimization > Mathematics > Probability
Mathematics & Optimization > Mathematics > Statistics
Mathematics & Optimization > Optimization > Stochastic Methods
Machine Learning > Optimization & Theory > Stochastic Methods
Machine Learning > Learning Types > Multi-Armed Bandits
Mathematics & Optimization > Probability > Stochastic Processes