[77] T. N. Sainath, O. Vinyals, A. Senior, and H. Sak. Convolutional, long short-term memory, fully connected deep neural networks. In 2015 IEEE international conference on acoustics, speech and signal processing (ICASSP), pages 4580-4584. IEEE, 2015.
[78] F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini. The graph neural network model. IEEE transactions on neural networks, 20(1):61-80, 2008.
[79] M. Semelhago, B. L. Nelson, E. Song, and A. Wächter. Rapid discrete optimization via simulation with gaussian markov random fields. INFORMS Journal on Computing, 33(3):915-930, 2021.
[80] N. Srinivas, A. Krause, S. Kakade, and M. Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. In Proceedings of the 27th International Conference on Machine Learning. Omnipress, 2010.
[81] N. Srinivas, A. Krause, S. M. Kakade, and M. W. Seeger. Information-theoretic regret bounds for gaussian process optimization in the bandit setting. IEEE transactions on information theory, 58(5):3250-3265, 2012.
[82] W. T. Stephenson, S. Ghosh, T. D. Nguyen, M. Yurochkin, S. Deshpande, and T. Broderick. Measuring the robustness of gaussian processes to kernel choice. In International Conference on Artificial Intelligence and Statistics, pages 3308-3331. PMLR, 2022.
[83] S. S. Tay, C. S. Foo, U. Daisuke, R. Leong, and B. K. H. Low. Efficient distributionally robust bayesian optimization with worst-case sensitivity. In International Conference on Machine Learning, pages 21180-21204. PMLR, 2022.
[84] S. Vakili, K. Khezeli, and V. Picheny. On information gain and regret bounds in gaussian process bandits. In International Conference on Artificial Intelligence and Statistics, pages 82–90. PMLR, 2021.
[85] S. Wang, S. H. Ng, and W. B. Haskell. A multilevel simulation optimization approach for quantile functions. INFORMS Journal on Computing, 34(1):569-585, 2022.
[86] W. Wang and X. Chen. An adaptive two-stage dual metamodeling approach for stochastic simulation experiments. IISE Transactions, 50(9):820-836, 2018.
[87] W. Wang, H. Wan, and X. Chen. Bonferroni-free and indifference-zone-flexible sequential elimination procedures for ranking and selection. Operations Research, 2023.
[88] C. K. Williams and C. E. Rasmussen. Gaussian processes for machine learning, volume 2. MIT press Cambridge, MA, 2006.
[89] J. Wu and P. Frazier. The parallel knowledge gradient method for batch bayesian optimization. Advances in neural information processing systems, 29, 2016.
[90] J. Wu, M. Poloczek, A. G. Wilson, and P. Frazier. Bayesian optimization with gradients. Advances in neural information processing systems, 30, 2017.
[91] G. Wynne and V. Wild. Variational gaussian processes: A functional analysis view. In International Conference on Artificial Intelligence and Statistics, pages 4955-4971. PMLR, 2022.
[92] W. Xie, B. L. Nelson, and R. R. Barton. A bayesian framework for quantifying uncertainty in stochastic simulation. Operations Research, 62(6):1439-1452, 2014.
[93] W. Xie, B. Wang, and P. Zhang. Metamodel-assisted sensitivity analysis for controlling the impact of input uncertainty. In 2019 Winter Simulation Conference (WSC), pages 3681-3692, 2019.
[94] W. Xie, Y. Yi, and H. Zheng. Global-local metamodel-assisted stochastic programming via simulation. ACM Transactions on Modeling and Computer Simulation (TOMACS), 31(1):1-34, 2020.