[1] V. Aglietti, X. Lu, A. Paleyes, and J. González. Causal bayesian optimization. In International Conference on Artificial Intelligence and Statistics, pages 3155-3164. PMLR, 2020.
[2] S. Agrawal and N. Goyal. Analysis of thompson sampling for the multi-armed bandit problem. In Conference on learning theory, pages 39–1. JMLR Workshop and Conference Proceedings, 2012.
[3] J. M. Antle and S. M. Capalbo. Econometric-process models for integrated assessment of agricultural production systems. American Journal of Agricultural Economics, 83(2):389-401, 2001.
[4] P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine learning, 47:235-256, 2002.
[5] A. Balke and J. Pearl. Counterfactual probabilities: Computational methods, bounds and applications. In Uncertainty Proceedings 1994, pages 46-54. Elsevier, 1994.
[6] E. Bareinboim, A. Forney, and J. Pearl. Bandits with unobserved confounders: A causal approach. Advances in Neural Information Processing Systems, 28, 2015.
[7] J. Bartroff, T. L. Lai, and M.-C. Shih. Sequential experimentation in clinical trials: design and analysis, volume 298. Springer Science & Business Media, 2012.
[8] B. Bilodeau, L. Wang, and D. M. Roy. Adaptively exploiting d-separators with causal bandits. arXiv preprint arXiv:2202.05100, 2022.
[9] R. Combes and A. Proutiere. Unimodal bandits: Regret lower bounds and optimal algorithms. In International Conference on Machine Learning, pages 521-529. PMLR, 2014.
[10] R. Combes, S. Magureanu, and A. Proutiere. Minimal exploration in structured stochastic bandits. Advances in Neural Information Processing Systems, 30, 2017.
[11] A. D'Amour, K. Heller, D. Moldovan, B. Adlam, B. Alipanahi, A. Beutel, C. Chen, J. Deaton, J. Eisenstein, M. D. Hoffman, et al. Underspecification presents challenges for credibility in modern machine learning. The Journal of Machine Learning Research, 23(1):10237-10297, 2022.
[12] G. Dulac-Arnold, N. Levine, D. J. Mankowitz, J. Li, C. Paduraru, S. Gowal, and T. Hester. Challenges of real-world reinforcement learning: definitions, benchmarks and analysis. Machine Learning, 110(9):2419-2468, 2021.
[13] S. Feng and W. Chen. Combinatorial causal bandits. arXiv preprint arXiv:2206.01995, 2022.
[14] A. Garivier and O. Cappé. The KL-UCB algorithm for bounded stochastic bandits and beyond. In Proceedings of the 24th annual conference on learning theory, pages 359–376. JMLR Workshop and Conference Proceedings, 2011.
[15] T. L. Graves and T. L. Lai. Asymptotically efficient adaptive choice of control laws in controlled markov chains. SIAM journal on control and optimization, 35(3):715-743, 1997.
[16] A. H. Guide. Infinite dimensional analysis. Springer, 2006.
[17] B. Hao, T. Lattimore, and C. Szepesvari. Adaptive exploration in linear contextual bandit. In International Conference on Artificial Intelligence and Statistics, pages 3536-3545. PMLR, 2020.
[18] T. L. Lai and H. Robbins. Asymptotically efficient adaptive allocation rules. Advances in applied mathematics, 6(1):4-22, 1985.
[19] F. Lattimore, T. Lattimore, and M. D. Reid. Causal bandits: Learning good interventions via causal inference. Advances in Neural Information Processing Systems, 29, 2016.
[20] T. Lattimore and C. Szepesvari. The end of optimism? an asymptotic analysis of finite-armed linear bandits. In Artificial Intelligence and Statistics, pages 728–737. PMLR, 2017.