[3] Keerti Anand, Rong Ge, Amit Kumar, and Debmalya Panigrahi. Online algorithms with multiple predictions. In International Conference on Machine Learning, pages 582-598. PMLR, 2022.
[4] Alexandr Andoni and Daniel Beaglehole. Learning to hash robustly, guaranteed. In International Conference on Machine Learning, pages 599-618. PMLR, 2022.
[5] Spyros Angelopoulos, Christoph Durr, Shendan Jin, Shahin Kamali, and Marc Renault. Online computation with untrusted advice. arXiv preprint arXiv:1905.05655, 2019.
[6] Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, and Bertrand Simon. Online metric algorithms with untrusted predictions. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event, volume 119 of Proceedings of Machine Learning Research, pages 345-355. PMLR, 2020. URL http://proceedings.mlr.press/v119/antoniadis20a.html.
[7] Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, and Pavel Kolev. Secretary and online matching problems with machine learned advice. Advances in Neural Information Processing Systems, 33:7933-7944, 2020.
[8] Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M Favrholdt, Ruben Hoeksma, Kim S Larsen, Adam Polak, and Bertrand Simon. Paging with succinct predictions. arXiv preprint arXiv:2210.02775, 2022.
[9] Étienne Bamas, Andreas Maggiori, Lars Rohwedder, and Ola Svensson. Learning augmented energy minimization via speed scaling. Advances in Neural Information Processing Systems, 33:15350-15359, 2020.
[10] Evripidis Bampis, Bruno Escoffier, and Michalis Xefteris. Canadian traveller problem with predictions. In Approximation and Online Algorithms: 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings, pages 116–133. Springer, 2022.
[11] Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, and Erik Vee. Learning-augmented weighted paging. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 67-89. SIAM, 2022.
[12] Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, and Leen Stougie. Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics, 13(1):64-78, 2000.
[13] Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, and Manish Purohit. Logarithmic regret from sublinear hints. Advances in Neural Information Processing Systems, 34:28222-28232, 2021.
[14] Allan Borodin and Ran El-Yaniv. Online computation and competitive analysis. Cambridge university press, 2005.
[15] Justin Chen, Sandeep Silwal, Ali Vakilian, and Fred Zhang. Faster fundamental graph algorithms via learned predictions. In International Conference on Machine Learning, pages 3583-3602. PMLR, 2022.
[16] TCE Cheng and CCS Sin. A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47(3):271-292, 1990.
[17] Y.S. Chow, H.E. Robbins, H. Robbins, and D. Siegmund. Great Expectations: The Theory of Optimal Stopping. Houghton Mifflin, 1971. ISBN 9780395053140. URL https://books.google.fr/books?id=A6ELhyczVf4C.
[18] Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Ali Vakilian, and Nikos Zarifis. Learning online algorithms with distributional advice. In International Conference on Machine Learning, pages 2687-2696. PMLR, 2021.
[19] Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii. Algorithms with prediction portfolios. arXiv preprint arXiv:2210.12438, 2022.