Adaptive Control Variates for Finite-Horizon Simulation

Adaptive Monte Carlo methods are simulation efficiency improvement techniques designed to adaptively tune simulation estimators. Most of the work on adaptive Monte Carlo methods has been devoted to adaptively tuning importance sampling schemes. We instead focus on adaptive methods based on control variate schemes. We introduce two adaptive control variate methods, and develop their asymptotic properties. The first method uses stochastic approximation to adaptively tune control variate estimators. It is easy to implement, but it requires some nontrivial tuning of parameters. The second method is based on sample average approximation. Tuning is no longer required, but it can be computationally expensive. Numerical results for the pricing of barrier options are presented to demonstrate the methods.

[1]  Dennis D. Cox,et al.  Adaptive importance sampling on discrete Markov chains , 1999 .

[2]  James C. Spall,et al.  Introduction to stochastic search and optimization - estimation, simulation, and control , 2003, Wiley-Interscience series in discrete mathematics and optimization.

[3]  James C. Spall,et al.  Introduction to Stochastic Search and Optimization. Estimation, Simulation, and Control (Spall, J.C. , 2007 .

[4]  Sujin Kim,et al.  Adaptive control variates , 2004, Proceedings of the 2004 Winter Simulation Conference, 2004..

[5]  B. Simon,et al.  Adaptive simulation using perfect control variates , 2004, Journal of Applied Probability.

[6]  P. L’Ecuyer,et al.  On the interchange of derivative and expectation for likelihood ratio derivative estimators , 1995 .

[7]  Philippe L. Toint,et al.  Convergence theory for nonconvex stochastic programming with an application to mixed logit , 2006, Math. Program..

[8]  A. Shapiro.  Monte Carlo Sampling Methods , 2003 .

[9]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[10]  Sean P. Meyn,et al.  Variance Reduction for Simulation in Multiclass Queueing Networks , 1999 .

[11]  S. Maire.  Reducing variance using iterated control variates , 2003 .

[12]  Paul Glasserman,et al.  Monte Carlo Methods in Financial Engineering , 2003 .

[13]  Alʹbert Nikolaevich Shiri︠a︡ev,et al.  Theory of martingales , 1989 .

[14]  Sean P. Meyn,et al.  Performance Evaluation and Policy Selection in Multiclass Networks , 2003, Discret. Event Dyn. Syst..

[15]  Sean P. Meyn,et al.  Efficient simulation of multiclass queueing networks , 1997, WSC '97.

[16]  Peter W. Glynn,et al.  Approximating Martingales for Variance Reduction in Markov Process Simulation , 2002, Math. Oper. Res..

[17]  Ward Whitt,et al.  Indirect Estimation Via L = λW , 1989, Oper. Res..

[18]  Alexander Shapiro,et al.  Asymptotic Behavior of Optimal Solutions in Stochastic Programming , 1993, Math. Oper. Res..

[19]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[20]  Peter Kall,et al.  Stochastic Programming , 1995 .

[21]  H. Kushner,et al.  Stochastic Approximation and Recursive Algorithms and Applications , 2003 .

[22]  Sandeep Juneja,et al.  Function-approximation-based Perfect Control Variates for Pricing American Options , 2005, Proceedings of the Winter Simulation Conference, 2005..

[23]  Sean P. Meyn.  Workload models for stochastic networks: value functions and performance evaluation , 2005, IEEE Transactions on Automatic Control.

[24]  James C. Spall,et al.  Introduction to stochastic search and optimization - estimation, simulation, and control , 2003, Wiley-Interscience series in discrete mathematics and optimization.