Contract Scheduling with Distributional and Multiple Advice
Abstract: Contract scheduling is a widely studied framework for designing real-time systems with interruptible capabilities. Previous work has showed that a prediction on the interruption time can help improve the performance of contract-based systems, however it has relied on a single prediction that is provided by a deterministic oracle. In this work, we introduce and study more general and realistic learning-augmented settings in which the prediction is in the form of a probability distribution, or it is given as a set of multiple possible interruption times. For both prediction settings, we design and analyze schedules which perform optimally if the prediction is accurate, while simultaneously guaranteeing the best worst-case performance if the prediction is adversarial. We also provide evidence that the resulting system is robust to prediction errors in the distributional setting. Last, we present an experimental evaluation that confirms the theoretical findings, and illustrates the performance improvements that can be attained in practice.
- Online facility location with multiple advice. Advances in Neural Information Processing Systems, 34:4661–4673, 2021.
- The theory of search games and rendezvous. Kluwer Academic Publishers, 2003.
- A regression approach to learning-augmented online algorithms. Advances in Neural Information Processing Systems, 34:30504–30517, 2021.
- Online algorithms with multiple predictions. In International Conference on Machine Learning, pages 582–598. PMLR, 2022.
- Earliest-completion scheduling of contract algorithms with end guarantees. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, (IJCAI), pages 5493–5499, 2019.
- Contract scheduling with predictions. J. Artif. Intell. Res., 77:395–426, 2023.
- Interruptible algorithms for multi-problem solving. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), pages 380–386, 2009.
- Weighted online search. J. Comput. Syst. Sci., 138:103457, 2023.
- Optimal scheduling of contract algorithms with soft deadlines. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI), pages 868–873, 2008.
- Online computation with untrusted advice. In Proceedings of the 11th International Conference on Innovations in Theoretical Computer Science (ITCS), pages 52:1–52:15, 2020.
- Spyros Angelopoulos. Further connections between contract-scheduling and ray-searching problems. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), pages 1516–1522, 2015.
- Mixing predictions for online metric algorithms. In International Conference on Machine Learning, pages 969–983. PMLR, 2023.
- On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM, 44(3):486–504, 1997.
- Scheduling contract algorithms on multiple processors. In Proceedings of the 18th AAAI Conference on Artificial Intelligence (AAAI), pages 702–706, 2002.
- Contract algorithms and robots on rays: Unifying two scheduling problems. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), pages 1211–1217, 2003.
- New results on multi-level aggregation. Theor. Comput. Sci., 861:133–143, 2021.
- Deliberation scheduling for problem solving in time-constrained environments. Artif. Intell., 67(2):245–285, 1994.
- SIGACT news online algorithms column 10: Competitiveness via doubling. SIGACT News, 37(4):115–126, 2006.
- Incremental medians via online bidding. Algorithmica, 50(4):455–478, 2008.
- Online searching with turn cost. Theoretical Computer Science, 361:342–355, 2006.
- Learning online algorithms with distributional advice. In International Conference on Machine Learning, pages 2687–2696. PMLR, 2021.
- Algorithms with prediction portfolios. Advances in neural information processing systems, 35:20273–20286, 2022.
- Optimal and online preemptive scheduling on uniformly related machines. J. Sched., 12(5):517–527, 2009.
- Robustification of online graph exploration methods. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, pages 9732–9740. AAAI Press, 2022.
- Online algorithms for rent-or-buy with expert advice. In Proceedings of the 36th International Conference on Machine Learning (ICML), pages 2319–2327, 2019.
- Eric Horvitz. Reasoning about beliefs and actions under computational resource constraints. Int. J. Approx. Reasoning, 2(3):337–338, 1988.
- Online dynamic acknowledgement with learned predictions. In INFOCOM, pages 1–10. IEEE, 2023.
- Online state exploration: Competitive worst case and learning-augmented algorithms. In ECML/PKDD (4), volume 14172 of Lecture Notes in Computer Science, pages 333–348. Springer, 2023.
- P. Jaillet and M. Stafford. Online searching. Operations Research, 49:234–244, 1993.
- Repository of works on algorithms with predictions. https://algorithms-with-predictions.github.io, 2023. Accessed: 2023-12-01.
- Optimal scheduling of contract algorithms for anytime problem-solving. J. Artif. Intell. Res., 51:533–554, 2014.
- Competitive caching with machine learned advice. J. ACM, 68(4):24:1–24:25, 2021.
- Algorithms with predictions. In Beyond the Worst-Case Analysis of Algorithms, pages 646–662. Cambridge University Press, 2020.
- Improving online algorithms via ML predictions. In Proceedings of the 31st Annual Conference on Neural Information Processing Systems (NIPS), pages 9661–9670, 2018.
- A metric for distributions with applications to image databases. In Sixth international conference on computer vision (IEEE Cat. No. 98CH36271), pages 59–66. IEEE, 1998.
- Composing real-time systems. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI), pages 212–217, 1991.
- Pareto-optimal learning-augmented algorithms for online conversion problems. In Proceedings of the 34th Annual Conference on Neural Information Processing Systems (NeurIPS), pages 10339–10350, 2021.
- A competitive algorithm for online multi-robot exploration of a translating plume. In 2019 International Conference on Robotics and Automation (ICRA), pages 3391–3397. IEEE, 2019.
- Online algorithms for multi-shop ski rental with machine learned advice. Advances in Neural Information Processing Systems, 33:8150–8160, 2020.
- Anytime sensing planning and action: A practical model for robot control. In IJCAI, pages 1402–1407. Morgan Kaufmann, 1993.
- Optimal composition of real-time systems. Artif. Intell., 82(1-2):181–213, 1996.
- Optimal sequencing of contract algorithms. Ann. Math. Artif. Intell., 39(1-2):1–18, 2003.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.