SlowGuess/NeurIPS_2023_OCR huggingface dataset:
[1] C. Ararat and C. Tekin. Vector optimization with stochastic bandit feedback. In Proceedings of The 26th International Conference on Artificial Intelligence and Statistics, volume 206, pages 2165-2190. PMLR, 2023.
[2] J.-Y. Audibert and S. Bubeck. Best arm identification in multi-armed bandits. In COLT - 23th Conference on Learning Theory - 2010, page 13 p., 2010.
[3] J. Audifren and L. Ralaivola. Bandits dueling on partially ordered sets. In Advances in Neural Information Processing Systems, volume 30. Curran Associates, Inc., 2017.
[4] P. Auer, C.-K. Chiang, R. Ortner, and M.-M. Drugan. Pareto front identification from stochastic bandit feedback. In Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, volume 51, pages 939-947. PMLR, 2016.
[5] R. Degenne and W.M. Koolen. Pure exploration with multiple correct answers. In Advances in Neural Information Processing Systems, volume 32. Curran Associates, Inc., 2019.
[6] M.-M. Drugan and A. Nowe. Designing multi-objective multi-armed bandits algorithms: A study. In The 2013 International Joint Conference on Neural Networks (IJCNN), pages 1–8, 2013.
[7] M. Ehrgott. Multicriteria Optimization. Springer, second edition edition, 2005.
[8] E. Even-Dar, S. Mannor, and Y. Mansour. Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. Journal of Machine Learning Research, 7(39):1079–1105, 2006.
[9] V. Gabillon, M. Ghavamzadeh, and A. Lazaric. Best arm identification: A unified approach to fixed budget and fixed confidence. In Advances in Neural Information Processing Systems, volume 25. Curran Associates, Inc., 2012.
[10] A. Garivier and E. Kaufmann. Optimal best arm identification with fixed confidence. In 29th Annual Conference on Learning Theory, volume 49, pages 998-1027. PMLR, 2016.
[11] K. Jamieson, M. Malloy, R. Nowak, and S. Bubeck. *lil' ucb: An optimal exploration algorithm for multi-armed bandits*. In Proceedings of The 27th Conference on Learning Theory, volume 35, pages 423–439. PMLR, 2014.
[12] M. Jourdan, R. Degenne, D. Baudry, R. de Heide, and E. Kaufmann. Top two algorithms revisited. In Advances in Neural Information Processing Systems, volume 35, pages 26791-26803. Curran Associates, Inc., 2022.
[13] K.-S. Jun, K. Jamieson, R. Nowak, and X. Zhu. Top arm identification in multi-armed bandits with batch arm pulls. In Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, volume 51, pages 139–148. PMLR, 2016.
[14] K-S. Jun and R. Nowak. Anytime exploration for multi-armed bandits using confidence information. In Proceedings of The 33rd International Conference on Machine Learning, volume 48, pages 974–982. PMLR, 2016.
[15] S. Kalyanakrishnan, A. Tewari, P. Auer, and P. Stone. PAC subset selection in stochastic multiarmed bandits. In Proceedings of the 29th International Coference on International Conference on Machine Learning, pages 227-234. Omnipress, 2012.
[16] J. Katz-Samuels and C. Scott. Feasible arm identification. In Proceedings of the 35th International Conference on Machine Learning, volume 80, pages 2535-2543. PMLR, 2018.
[17] J. Katz-Samuels and C. Scott. Top feasible arm identification. In Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics, pages 1593–1601. PMLR, 2019.
[18] E. Kaufmann, O. Cappé, and A. Garivier. On the complexity of best-arm identification in multi-armed bandit models. Journal of Machine Learning Research, 17(1):1-42, 2016.
[19] E. Kaufmann and S. Kalyanakrishnan. Information complexity in bandit subset selection. In Conference On Learning Theory, volume 30. JMLR: Workshop and Conference Proceedings, 2013.
[20] E. Kaufmann and W.-M. Koolen. Mixture martingales revisited with applications to sequential tests and confidence intervals. Journal of Machine Learning Research, 22(246):1-44, 2021.
[21] T. Lattimore and C. CSzepesvári. Bandit Algorithms. Cambridge University Press, 2020.
[22] R. Mehrotra, N. Xue, and M. Lalmas. Bandit based optimization of multiple objectives on a music streaming platform. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, page 3224-3233. Association for Computing Machinery, 2020.
[23] K. Miettinen. Nonlinear multiobjective optimization. In International Series in Operations Research and Management Science, 1998.
[24] A.-P.-S. Munro, L. Janani, V. Cornelius, and et al. Safety and immunogenicity of seven COVID-19 vaccines as a third dose (booster) following two doses of ChAdOx1 nCov-19 or BNT162b2 in the UK (COV-BOOST): a blinded, multicentre, randomised, controlled, phase 2 trial. The Lancet, 398(10318):2258–2276, 2021.
[25] A. Roy Chaudhuri and S. Kalyanakrishnan. PAC identification of many good arms in stochastic multi-armed bandits. In Proceedings of the 36th International Conference on Machine Learning, volume 97, pages 991–1000. PMLR, 2019.
[26] M. Simchowitz, K. Jamieson, and B. Recht. The simulator: Understanding adaptive sampling in the moderate-confidence regime. In Proceedings of the 2017 Conference on Learning Theory, volume 65, pages 1794–1834. PMLR, 2017.
[27] M. Zuluaga, A. Krause, and M. Puschel. e-pal: An active learning approach to the multi-objective optimization problem. Journal of Machine Learning Research, 17(104):1-32, 2016.
[28] M. Zuluaga, G. Sergent, A. Krause, and M. Puschel. Active learning for multi-objective optimization. In Proceedings of the 30th International Conference on Machine Learning, volume 28, pages 462-470. PMLR, 2013.