[19] S. Cakmak, R. Astudillo Marban, P. Frazier, and E. Zhou. Bayesian optimization of risk measures. Advances in Neural Information Processing Systems, 33:20130-20141, 2020.
[20] S. Cakmak, E. Zhou, and S. Gao. Contextual ranking and selection with gaussian processes. In 2021 Winter Simulation Conference (WSC), pages 1-12. IEEE, 2021.
[21] I. Char, Y. Chung, W. Neiswanger, K. Kandasamy, A. O. Nelson, M. Boyer, E. Kolemen, and J. Schneider. Offline contextual bayesian optimization. Advances in Neural Information Processing Systems, 32, 2019.
[22] N. Chatterji, A. Pacchiano, and P. Bartlett. Online learning with kernel losses. In International Conference on Machine Learning, pages 971-980. PMLR, 2019.
[23] H. Chen and H. Lam. Pseudo-bayesian optimization. arXiv preprint arXiv:2310.09766, 2023.
[24] V. Chernozhukov, M. Demirer, G. Lewis, and V. Syrgkanis. Semi-parametric efficient policy learning with continuous actions. Advances in Neural Information Processing Systems, 32, 2019.
[25] S. R. Chowdhury and A. Gopalan. On kernelized multi-armed bandits. In International Conference on Machine Learning, pages 844–853. PMLR, 2017.
[26] K. Cutajar, M. Pullin, A. Damianou, N. Lawrence, and J. González. Deep gaussian processes for multi-fidelity modeling. arXiv preprint arXiv:1903.07320, 2019.
[27] A. Damianou and N. D. Lawrence. Deep gaussian processes. In Artificial intelligence and statistics, pages 207-215. PMLR, 2013.
[28] S. Daulton, S. Cakmak, M. Balandat, M. A. Osborne, E. Zhou, and E. Bakshy. Robust multi-objective bayesian optimization under input noise. arXiv preprint arXiv:2202.07549, 2022.
[29] L. De, B. De-Moor, and J. Vandewalle. On the best rank-1 and rank-(r1 r2... rn) approximation of higher-order tensors. SIAM journal on Matrix Analysis and Applications, 21(4):1324-1342, 2000.
[30] L. De Lathauwer, B. De Moor, and J. Vandewalle. Computation of the canonical decomposition by means of a simultaneous generalized schur decomposition. SIAM journal on Matrix Analysis and Applications, 26(2):295-327, 2004.
[31] Y. Deng, X. Zhou, B. Kim, A. Tewari, A. Gupta, and N. Shroff. Weighted gaussian process bandits for non-stationary environments. In International Conference on Artificial Intelligence and Statistics, pages 6909–6932. PMLR, 2022.
[32] T. Desautels, A. Krause, and J. W. Burdick. Parallelizing exploration-exploitation tradeoffs in gaussian process bandit optimization. Journal of Machine Learning Research, 15:3873-3923, 2014.
[33] L. Ding, L. J. Hong, H. Shen, and X. Zhang. Knowledge gradient for selection with covariates: Consistency and computation. Naval Research Logistics (NRL), 69(3):496-507, 2022.
[34] L. Ding, R. Tuo, and X. Zhang. High-dimensional simulation optimization via brownian fields and sparse grids. arXiv preprint arXiv:2107.08595, 2021.
[35] J. Djolonga, A. Krause, and V. Cevher. High-dimensional gaussian process bandits. Advances in neural information processing systems, 26, 2013.
[36] J. Du, S. Gao, and C.-H. Chen. A contextual ranking and selection method for personalized medicine. Manufacturing & Service Operations Management, 2023.
[37] A. Durand, C. Achilleos, D. Iacovides, K. Strati, G. D. Mitsis, and J. Pineau. Contextual bandits for adapting treatment in a mouse model of de novo carcinogenesis. In Machine learning for healthcare conference, pages 67-82. PMLR, 2018.