Sciweavers

403 search results - page 9 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
COLT
2003
Springer
14 years 3 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
WSC
1997
13 years 11 months ago
Optimal Quadratic-Form Estimator of the Variance of the Sample Mean
A classical problem of stochastic simulation is how to estimate the variance of the sample mean of dependent but stationary outputs. Many variance estimators, such as the batch me...
Wheyming Tina Song, Neng-Hui Shih, Mingjian Yuan
AAAI
2004
13 years 11 months ago
Regrets Only! Online Stochastic Optimization under Time Constraints
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
Russell Bent, Pascal Van Hentenryck
MP
2008
103views more  MP 2008»
13 years 9 months ago
Aggregation and discretization in multistage stochastic programming
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
Daniel Kuhn
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 10 months ago
Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...
David Soloveichik