Professor Thomas Erlebach thomas.erlebach@durham.ac.uk
Professor Computer Science
Professor Thomas Erlebach thomas.erlebach@durham.ac.uk
Professor Computer Science
Murilo de Lima
Nicole Megow
Jens Schlöter
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.
Erlebach, T., de Lima, M., Megow, N., & Schlöter, J. (2023, August). Sorting and Hypergraph Orientation under Uncertainty with Predictions. Presented at Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI 2023), Macao, S.A.R., China
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI 2023) |
Start Date | Aug 19, 2023 |
End Date | Aug 25, 2023 |
Acceptance Date | Apr 19, 2023 |
Publication Date | 2023 |
Deposit Date | Jun 14, 2023 |
Publicly Available Date | Dec 31, 2023 |
Pages | 5577-5585 |
Book Title | Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence |
DOI | https://doi.org/10.24963/ijcai.2023/619 |
Public URL | https://durham-repository.worktribe.com/output/1134692 |
Publisher URL | https://www.ijcai.org/proceedings/2023/619 |
Accepted Conference Proceeding
(272 Kb)
PDF
Parameterized temporal exploration problems
(2023)
Journal Article
Round-competitive algorithms for uncertainty problems with parallel queries
(2022)
Journal Article
Exploration of k-Edge-Deficient Temporal Graphs
(2022)
Journal Article
On the fast delivery problem with one or two packages
(2020)
Journal Article
Car-Sharing between Two Locations: Online Scheduling with Flexible Advance Bookings
(2022)
Journal Article
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
Apache License Version 2.0 (http://www.apache.org/licenses/)
Apache License Version 2.0 (http://www.apache.org/licenses/)
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search