{"type":"ScholarlyArticle","title":"Sorting and Hypergraph Orientation under Uncertainty with Predictions","authors":[{"name":"Thomas Erlebach","slug":"thomas-erlebach","given":"Thomas","family":"Erlebach","affiliation":"Department of Computer Science , Durham University , United Kingdom"},{"name":"Murilo de Lima","slug":"murilo-de-lima","given":"Murilo","family":"de Lima","affiliation":"School of Informatics , University of Leicester , United Kingdom"},{"name":"Nicole Megow","slug":"nicole-megow","given":"Nicole","family":"Megow","affiliation":"Faculty of Mathematics and Computer Science , University of Bremen , Germany"},{"name":"Jens Schlöter","slug":"jens-schloter","given":"Jens","family":"Schlöter","affiliation":"Faculty of Mathematics and Computer Science , University of Bremen , Germany"}],"abstract":"Learning-augmented algorithms have been attracting increasing interest, but have only recently been considered in the setting of explorable uncertainty where precise values of uncertain input elements can be obtained by a query and the goal is to minimize the number of queries needed to solve a problem. We study learning-augmented algorithms for sorting and hypergraph orientation under uncertainty, assuming access to untrusted predictions for the uncertain values. Our algorithms provide improved performance guarantees for accurate predictions while maintaining worst-case guarantees that are best possible without predictions. For sorting, our algorithm uses the optimal number of queries for accurate predictions and at most twice the optimal number for arbitrarily wrong predictions. For hypergraph orientation, for any γ≥2, we give an algorithm that uses at most 1+1/γ times the optimal number of queries for accurate predictions and at most γ times the optimal number for arbitrarily wrong predictions. These tradeoffs are the best possible. We also consider different error metrics and show that the performance of our algorithms degrades smoothly with the prediction error in all the cases where this is possible.","doi":"10.24963/ijcai.2023/619","url":"https://ijcai.org/proceedings/2023/619","pdf":"https://ijcai.org/proceedings/2023/0619.pdf","markdown":"https://ijcai.org/proceedings/2023/619.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/619","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Search","track":"Main Track","number":619,"pages":{"first":5577,"last":5585},"keywords":["Search: S: Combinatorial search and optimisation","Planning and Scheduling: PS: Planning under uncertainty"],"videos":[],"references":[{"position":1,"raw":"[Albers and Eckl, 2020] Susanne Albers and Alexander Eckl. Explorable uncertainty in scheduling with non- uniform testing times. In WAOA, volume 12806 of Lec- ture Notes in Computer Science, pages 127-142. Springer, 2020.","title":"Explorable uncertainty in scheduling with nonuniform testing times","authors":"Eckl Albers, Susanne Albers, Alexander Eckl","year":"2020","venue":"WAOA","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Albers and Eckl, 2021] Susanne Albers and Alexander Eckl. Scheduling with testing on multiple identical par- allel machines. In WADS, volume 12808 of Lecture Notes in Computer Science, pages 29-42. Springer, 2021.","title":"Scheduling with testing on multiple identical parallel machines","authors":"Eckl Albers, Susanne Albers, Alexander Eckl","year":"2021","venue":"WADS","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Angelopoulos et al., 2020] Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, and Marc P. Renault. Online computation with untrusted advice. In ITCS, volume 151 of LIPIcs, pages 52:1-52:15, 2020.","title":"Online computation with untrusted advice","authors":"Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P Renault","year":"2020","venue":"LIPIcs","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Arantes et al., 2018] Luciana Arantes, Evripidis Bampis, Alexander V. Kononov, Manthos Letsios, Giorgio Lu- carelli, and Pierre Sens. Scheduling under uncertainty: A query-based approach. In IJCAI 2018, pages 4646-4652, 2018.","title":"Scheduling under uncertainty: A query-based approach","authors":"Luciana Arantes, Evripidis Bampis, Alexander V Kononov, Manthos Letsios, Giorgio Lucarelli, Pierre Sens","year":"2018","venue":"IJCAI 2018","doi":null,"url":null,"internal_url":"/proceedings/2018/646"},{"position":5,"raw":"[Azar et al., 2021] Yossi Azar, Stefano Leonardi, and Noam Touitou. Flow time scheduling with uncertain processing time. In STOC, pages 1070-1080. ACM, 2021.","title":"Flow time scheduling with uncertain processing time","authors":"Yossi Azar, Stefano Leonardi, Noam Touitou","year":"2021","venue":"STOC","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Azar et al., 2022a] Yossi Azar, Stefano Leonardi, and Noam Touitou. Distortion-oblivious algorithms for minimizing flow time. In SODA, pages 252-274. SIAM, 2022.","title":"Distortion-oblivious algorithms for minimizing flow time","authors":"Azar","year":"2022","venue":"SODA","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Azar et al., 2022b] Yossi Azar, Debmalya Panigrahi, and Noam Touitou. Online graph algorithms with predictions. In SODA, pages 35-66. SIAM, 2022.","title":"Online graph algorithms with predictions","authors":"Azar","year":"2022","venue":"SODA","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bampis et al., 2021] Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, and Jens Schlöter. Orienting (hyper)graphs under ex- plorable stochastic uncertainty. In ESA, volume 204 of LIPIcs, pages 10:1-10:18, 2021.","title":"Orienting (hyper)graphs under explorable stochastic uncertainty","authors":"Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos De Lima, Nicole Megow, Jens Schlöter","year":"2021","venue":"ESA","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bampis et al., 2022] Evripidis Bampis, Konstantinos Do- geas, Alexander V. Kononov, Giorgio Lucarelli, and Fanny Pascual. Scheduling with untrusted predictions. In IJCAI, pages 4581-4587. ijcai.org, 2022.","title":"Scheduling with untrusted predictions","authors":"Evripidis Bampis, Konstantinos Dogeas, Alexander V Kononov, Giorgio Lucarelli, Fanny Pascual","year":"2022","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2022/636"},{"position":10,"raw":"[Bruce et al., 2005] Richard Bruce, Michael Hoffmann, Danny Krizanc, and Rajeev Raman. Efficient update strategies for geometric computing with uncertainty. The- ory of Computing Systems, 38(4):411-423, 2005.","title":"Efficient update strategies for geometric computing with uncertainty","authors":"Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman","year":"2005","venue":"Theory of Computing Systems","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Chaplick et al., 2021] Steven Chaplick, Magnús M. Halldórsson, Murilo S. de Lima, and Tigran Tonoyan. Query minimization under stochastic uncertainty. Theor. Comput. Sci., 895:75-95, 2021.","title":"Query minimization under stochastic uncertainty","authors":"Steven Chaplick, M Magnús, Halldórsson, S Murilo, Tigran De Lima, Tonoyan","year":"2021","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Dürr et al., 2020] Christoph Dürr, Thomas Erlebach, Nicole Megow, and Julie Meißner. An adversarial model for scheduling with testing. Algorithmica, 82(12):3630-3675, 2020.","title":"An adversarial model for scheduling with testing","authors":"Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner","year":"2020","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Eberle et al., 2022] Franziska Eberle, Alexander Linder- mayr, Nicole Megow, Lukas Nölke, and Jens Schlöter. Robustification of online graph exploration methods. In AAAI, 2022.","title":"Robustification of online graph exploration methods","authors":"Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter","year":"2022","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Erlebach and Hoffmann, 2014] Thomas Erlebach and Michael Hoffmann. Minimum spanning tree verification under uncertainty. In WG, volume 8747 of Lecture Notes in Computer Science, pages 164-175. Springer, 2014.","title":"Minimum spanning tree verification under uncertainty","authors":"Hoffmann Erlebach, Thomas Erlebach, Michael Hoffmann","year":"2014","venue":"WG","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Erlebach and Hoffmann, 2015] Thomas Erlebach and Michael Hoffmann. Query-competitive algorithms for computing with uncertainty. Bulletin of the EATCS, 116:22-39, 2015.","title":"Query-competitive algorithms for computing with uncertainty","authors":"Hoffmann Erlebach, Thomas Erlebach, Michael Hoffmann","year":"2015","venue":"Bulletin of the EATCS","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Erlebach et al., 2008] Thomas Erlebach, Michael Hoff- mann, Danny Krizanc, Matús Mihalák, and Rajeev Ra- man. Computing minimum spanning trees with uncer- tainty. In STACS, pages 277-288, 2008.","title":"Computing minimum spanning trees with uncertainty","authors":"Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman","year":"2008","venue":"STACS","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Erlebach et al., 2022] Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, and Jens Schlöter. Learning- augmented query policies for minimum spanning tree with uncertainty. In ESA, volume 244 of LIPIcs, pages 49:1- 49:18, 2022.","title":"Learningaugmented query policies for minimum spanning tree with uncertainty","authors":"Thomas Erlebach, Murilo Santos De Lima, Nicole Megow, Jens Schlöter","year":"2022","venue":"ESA","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Erlebach et al., 2023] Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, and Jens Schlöter. Sorting and hypergraph orientation under uncertainty with predictions. CoRR, abs/2305.09245, 2023.","title":"Sorting and hypergraph orientation under uncertainty with predictions","authors":"Thomas Erlebach, Murilo Santos De Lima, Nicole Megow, Jens Schlöter","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Feder et al., 2007] Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, and Rina Panigrahy. Comput- ing shortest paths with uncertainty. Journal of Algorithms, 62(1):1-18, 2007.","title":"Computing shortest paths with uncertainty","authors":"Tomás Feder, Rajeev Motwani, O' Liadan, Chris Callaghan, Rina Olston, Panigrahy","year":"2007","venue":"Journal of Algorithms","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Focke et al., 2020] Jacob Focke, Nicole Megow, and Julie Meißner. Minimum spanning tree under explorable uncer- tainty in theory and experiments. ACM J. Exp. Algorith- mics, 25:1-20, 2020.","title":"Minimum spanning tree under explorable uncertainty in theory and experiments","authors":"Jacob Focke, Nicole Megow, Julie Meißner","year":"2020","venue":"ACM J. Exp. Algorithmics","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Goerigk et al., 2015] Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, and Sandeep Sen. The robust knapsack problem with queries. Computers & Operations Research, 55:12-22, 2015.","title":"The robust knapsack problem with queries","authors":"Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen","year":"2015","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Gong et al., 2022] Mingyang Gong, Randy Goebel, Guohui Lin, and Eiji Miyano. Improved approximation algorithms for non-preemptive multiprocessor scheduling with test- ing. J. Comb. Optim., 44(1):877-893, 2022.","title":"Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing","authors":"Mingyang Gong, Randy Goebel, Guohui Lin, Eiji Miyano","year":"2022","venue":"J. Comb. Optim","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Halldórsson and de Lima, 2021] Magnús M. Halldórsson and Murilo Santos de Lima. Query-competitive sorting with uncertainty. Theor. Comput. Sci., 867:50-67, 2021.","title":"Query-competitive sorting with uncertainty","authors":"M Magnús, Murilo Halldórsson, Santos De Lima","year":"2021","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Kahan, 1991] Simon Kahan. A model for data in motion. In STOC'91: 23rd Annual ACM Symposium on Theory of Computing, pages 265-277, 1991.","title":"A model for data in motion","authors":"Simon Kahan","year":"1991","venue":"STOC'91: 23rd Annual ACM Symposium on Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Kumar et al., 2019] Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, and Erik Vee. Semi-online bi- partite matching. In ITCS, volume 124 of LIPIcs, pages 50:1-50:20. Schloss Dagstuhl -Leibniz-Zentrum fuer In- formatik, 2019.","title":"Semi-online bipartite matching","authors":"Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee","year":"2019","venue":"ITCS","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Lattanzi et al., 2020] Silvio Lattanzi, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii. Online scheduling via learned weights. In SODA, pages 1859- 1877. SIAM, 2020.","title":"Online scheduling via learned weights","authors":"Silvio Lattanzi, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii","year":"2020","venue":"SODA","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Li and Xian, 2021] Shi Li and Jiayi Xian. Online unre- lated machine load balancing with predictions revisited. In ICML, volume 139 of Proceedings of Machine Learn- ing Research, pages 6523-6532. PMLR, 2021.","title":"Online unrelated machine load balancing with predictions revisited","authors":"Shi Li, Jiayi Xian","year":"2021","venue":"Proceedings of Machine Learning Research","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Lindermayr and Megow, 2022] Alexander Lindermayr and Nicole Megow. Permutation predictions for non- clairvoyant scheduling. In SPAA, pages 357-368. ACM, 2022.","title":"Alexander Lindermayr and Nicole Megow. Permutation predictions for nonclairvoyant scheduling","authors":"Megow Lindermayr","year":"2022","venue":"SPAA","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Lindermayr et al., 2022] Alexander Lindermayr, Nicole Megow, and Bertrand Simon. Double Coverage with Machine-Learned Advice. In ITCS, volume 215 of LIPIcs, pages 99:1-99:18, 2022.","title":"Double Coverage with Machine-Learned Advice","authors":"Alexander Lindermayr, Nicole Megow, Bertrand Simon","year":"2022","venue":"LIPIcs","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Lykouris and Vassilvtiskii, 2018] Thodoris Lykouris and Sergei Vassilvtiskii. Competitive caching with machine learned advice. In Proceedings of ICML, pages 3302- 3311, 2018.","title":"Thodoris Lykouris and Sergei Vassilvtiskii. Competitive caching with machine learned advice","authors":"Vassilvtiskii Lykouris","year":"2018","venue":"Proceedings of ICML","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Megow et al., 2017] Nicole Megow, Julie Meißner, and Martin Skutella. Randomization helps computing a min- imum spanning tree under uncertainty. SIAM Journal on Computing, 46(4):1217-1240, 2017.","title":"Randomization helps computing a minimum spanning tree under uncertainty","authors":"Nicole Megow, Julie Meißner, Martin Skutella","year":"2017","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Merino and Soto, 2019] Arturo I. Merino and José A. Soto. The minimum cost query problem on matroids with un- certainty areas. In ICALP, volume 132 of LIPIcs, pages 83:1-83:14, 2019.","title":"The minimum cost query problem on matroids with uncertainty areas","authors":"Arturo I Merino, José A Soto","year":"2019","venue":"ICALP","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Mitzenmacher, 2020] Michael Mitzenmacher. Scheduling with predictions and the price of misprediction. In Pro- ceedings of ITCS, volume 151 of LIPIcs, pages 14:1- 14:18, 2020.","title":"Scheduling with predictions and the price of misprediction","authors":"Michael Mitzenmacher","year":"2020","venue":"Proceedings of ITCS","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Purohit et al., 2018] Manish Purohit, Zoya Svitkina, and Ravi Kumar. Improving online algorithms via ML predic- tions. In Proceedings of NIPS, pages 9661-9670, 2018.","title":"Improving online algorithms via ML predictions","authors":"Manish Purohit, Zoya Svitkina, Ravi Kumar","year":"2018","venue":"Proceedings of NIPS","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Valiant, 1984] Leslie G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, 1984.","title":"A theory of the learnable","authors":"Leslie G Valiant","year":"1984","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}