On parallel policies for ranking and selection problems

References

• C.H. Chen and L. Lee, Stochastic Simulation Optimization: An Optimal Computing Budget Allocation, World Scientific, Hackensack, NJ, 2011.
   Google Scholar
• C.H. Chen, J. Lin, E. Yücesan, and S.E. Chick, Simulation budget allocation for further enhancing the efficiency of ordinal optimization, Discrete Event Dyn. Syst. 10 (2000), pp. 251–270. doi: 10.1023/A:1008349927281
   Web of Science ®Google Scholar
• S. Chick and K. Inoue, New two-stage and sequential procedures for selecting the best simulated system, Oper. Res. 49 (2001), pp. 732–743. doi: 10.1287/opre.49.5.732.10615
   Web of Science ®Google Scholar
• E. Contal, D. Buffoni, A. Robicquet, and N. Vayatis, Parallel Gaussian process optimization with upper confidence bound and pure exploration, in Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23–27, 2013, Proceedings, Part I, H. Blockeel, K. Kersting, S. Nijssen, and F. Železný, eds. Springer, Berlin, Heidelberg, 2013, pp. 225–240.
   Google Scholar
• D.R. Cox and N. Reid, The Theory of the Design of Experiments, CRC Press, Boca Raton, FL, 2000.
   Google Scholar
• T. Desautels, A. Krause, and J.W. Burdick, Parallelizing exploration–exploitation tradeoffs in gaussian process bandit optimization, J. Mach. Learn. Res. 15 (2014), pp. 4053–4103. Available at http://jmlr.org/papers/v15/desautels14a.html.
   Web of Science ®Google Scholar
• P. Frazier, Knowledge-gradient methods for statistical learning, Ph.D. diss., Princeton University, 2009.
   Google Scholar
• P. Frazier and W. Powell, The knowledge gradient policy for offline learning with independent normal rewards, in IEEE International Symposium on Approximate Dynamic Programming and Reinforcement Learning, 2007, ADPRL 2007, Institute of Electrical and Electronics Engineers, Inc., Piscataway, NJ, 2007, pp. 143–150.
   Google Scholar
• P.I. Frazier and W.B. Powell, Paradoxes in learning and the marginal value of information, Decis. Anal. 7 (2010), pp. 378–403. doi: 10.1287/deca.1100.0190
   Web of Science ®Google Scholar
• P.I. Frazier and W. Powell, Consistency of sequential Bayesian sampling policies, SIAM J. Control Optim. 49 (2011), pp. 712–731. doi: 10.1137/090775026
   Web of Science ®Google Scholar
• P.I. Frazier, W.B. Powell, and S. Dayanik, A knowledge-gradient policy for sequential information collection, SIAM J. Control Optim. 47 (2008), pp. 2410–2439. doi: 10.1137/070693424
   Web of Science ®Google Scholar
• D. Ginsbourger, J. Janusevskis, and R. Le Riche, Dealing with asynchronicity in parallel gaussian process based global optimization, Tech. Rep. hal-00507632, HAL, 2011. Available at https://hal.archives-ouvertes.fr/hal-00507632.
   Google Scholar
• J. González, Z. Dai, P. Hennig, and N. Lawrence, Batch Bayesian optimization via local penalization, in Proceedings of the 19th International Conference on Artificial Intelligence and Statistics (AISTATS 2016), JMLR Workshop and Conference Proceedings Vol. 51, 2016, pp. 648–657.
   Google Scholar
• D. He, S.E. Chick, and C.H. Chen, Opportunity cost and ocba selection procedures in ordinal optimization for a fixed number of alternative systems, IEEE Trans. Syst. Man Cybern. C Appl. Rev. 37 (2007), pp. 951–961. doi: 10.1109/TSMCC.2007.900656
   Web of Science ®Google Scholar
• J. Janusevskis, R. Le Riche, D. Ginsbourger, and R. Girdziusas, Expected improvements for the asynchronous parallel global optimization of expensive functions: Potentials and challenges, in Learning and Intelligent Optimization: 6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers, Y. Hamadi and M. Schoenauer, eds., Springer, Berlin, Heidelberg, 2012, pp. 413–418.
   Google Scholar
• B. Kamiński and P. Szufel, Asynchronous knowledge gradient policy for ranking and selection, in Proceedings of the 2014 Winter Simulation Conference, IEEE Press, Piscataway, NJ, 2014, pp. 3785–3796.
   Google Scholar
• K. Kandasamy, A. Krishnamurthy, J. Schneider, and B. Poczos, Asynchronous parallel Bayesian optimisation via thompson sampling, Techncial Report arXiv:1705.09236, ArXiv.org, 2017. Available at https://arxiv.org/abs/1705.09236.
   Google Scholar
• T. Kathuria, A. Deshpande, and P. Kohli, Batched Gaussian process bandit optimization via determinantal point processes, Technical Report arXiv:1611.04088, ArXiv.org, 2016. Available at https://arxiv.org/abs/1611.04088.
   Google Scholar
• A.M. Law, Simulation Modeling and Analysis, McGraw-Hill Education, Boston, MA, 2007.
   Google Scholar
• L.H. Lee, C. Chen, E.P. Chew, J. Li, N.A. Pujowidianto, and S. Zhang, A review of optimal computing budget allocation algorithms for simulation optimization problem, Int. Trans. Oper. Res. 7 (2010), pp. 19–31.
   Google Scholar
• B. Letham, B. Karrer, G. Ottoni, and E. Bakshy, Constrained Bayesian optimization with noisy experiments, Technical Report arXiv:1706.07094, ArXiv.org, 2017. Available at https://arxiv.org/abs/1706.07094.
   Google Scholar
• J. Luo, C.H. Chen, E. Yucesan, and I. Lee, Distributed web-based simulation optimization, in Proceedings of the 2000 Winter Simulation Conference, J. Joines, R. Barton, K. Kang, and P. Fishwick, eds., IEEE Press, Piscataway, NJ, 2000, pp. 1785–1793.
   Google Scholar
• J. Luo and L. Hong, Large-scale ranking and selection using cloud computing, in Proceedings of the 2011 Winter Simulation Conference, S. Jain, R.R. Creasey, J. Himmelspach, K.P. White, and M. Fu, eds., Institute of Electrical and Electronics Engineers, Inc., Piscataway, NJ, 2011, pp. 4051–4061.
   Google Scholar
• J. Luo, L.J. Hong, B.L. Nelson, and Y. Wu, Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments, Oper. Res. 63 (2015), pp. 1177–1194. doi: 10.1287/opre.2015.1413
   Web of Science ®Google Scholar
• E. Ni, D. Ciocan, S. Henderson, and S. Hunter, Efficient ranking and selection in parallel computing environments, Oper. Res. 65 (2017), pp. 821–836. doi: 10.1287/opre.2016.1577
   Web of Science ®Google Scholar
• E. Ni, S. Hunter, and S. Henderson, Ranking and selection in a high performance computing environment, in Proceedings of the 2013 Winter Simulation Conference, R. Pasupathy, S.H. Kim, A. Tolk, R. Hill, and M. Kuhl, eds., IEEE Press, Piscataway, NJ, 2013, pp. 833–845.
   Google Scholar
• E. Ni, S. Hunter, and S. Henderson, A comparison of two parallel ranking and selection procedures, in Proceedings of the 2014 Winter Simulation Conference, A. Tolk, S. Diallo, I. Ryzhov, L. Yilmaz, S. Buckley, and J. Miller, eds., IEEE Press, Piscataway, NJ, 2014, pp. 3761–372.
   Google Scholar
• W.B. Powell and I.O. Ryzhov, Optimal Learning, John Wiley & Sons, Hoboken, NJ, 2012.
   Google Scholar
• A. Shah and Z. Ghahramani, Parallel predictive entropy search for batch global optimization of expensive objective functions, in Proceedings of the 28th International Conference on Neural Information Processing Systems, MIT Press, NIPS'15, 2015, pp. 3330–3338.
   Google Scholar
• Y. Taejong, H. Cho, and E. Yücesan, Web services-based parallel replicated discrete event simulation for large-scale simulation optimization, Simulation 85 (2009), pp. 461–475. doi: 10.1177/0037549709106340
   Google Scholar
• J. Wang, S.C. Clark, E. Liu, and P.I. Frazier, Parallel Bayesian global optimization of expensive functions, Technical Report arXiv:1602.05149, ArXiv.org, 2016. Available at https://arxiv.org/abs/1602.05149.
   Google Scholar
• Z. Wang, C. Li, S. Jegelka, and P. Kohli, Batched high-dimensional Bayesian optimization via structural kernel learning, Technical Report arXiv:1703.01973, ArXiv.org, 2017. Available at https://arxiv.org/abs/1703.01973.
   Google Scholar
• J. Wu and P. Frazier, The parallel knowledge gradient method for batch Bayesian optimization, in Advances in Neural Information Processing Systems 29, D.D. Lee, M. Sugiyama, U.V. Luxburg, I. Guyon, and R. Garnett, eds., Curran Associates, Inc., 2016, pp. 3126–3134. Available at http://papers.nips.cc/paper/6307-the-parallel-knowledge-gradient-method-for-batch-bayesian-optimization.pdf.
   Google Scholar