Contract Scheduling with Distributional and Multiple Advice
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 13 of its 41 references that are in the map. First posted on arXiv 18 Apr 2024.
Builds on
13 of 41 references.
References · 13
- 2018Competitive caching with machine learned advicecited by 194
- 2020Algorithms with Predictionscited by 152
- 2019Online Computation with Untrusted Advicecited by 42
- 2022Online Algorithms with Multiple Predictionscited by 22
- 2021Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problemscited by 19
- 2022Algorithms with Prediction Portfolioscited by 19
- 2013Reasoning About Beliefs and Actions Under Computational Resource Constraintscited by 18
- 2022A Regression Approach to Learning-Augmented Online Algorithmscited by 12
- 2023Mixing predictions for online metric algorithmscited by 12
- 2021Robustification of Online Graph Exploration Methodscited by 10
- 2020Contract Scheduling With Predictionscited by 5
- 2023Online Dynamic Acknowledgement with Learned Predictionscited by 4
1 more
Built on by
Citing papers per year: 2024: 2; 2025: 4; 2026: 2.
8 papers.
- 2024Binary Search with Distributional Predictionscited by 11
- 2024Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithmscited by 8
- 2025Algorithms with Calibrated Machine Learning Predictionscited by 7
- 2025Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Searchcited by 4
- 2025Learning-Augmented Online Bidding in Stochastic Settingscited by 3
- 2025Decision-Theoretic Approaches for Improved Learning-Augmented Algorithmscited by 0
- 2026The Secretary Problem with a Stochastic Precursorcited by 0
- 2026Learning-Augmented Algorithms: Guarantees, Construction Mechanisms, and System-Level Implicationscited by 0
- 2026Learning-Augmented Algorithms: Guarantees, Construction Mechanisms, and System-Level Implications4 Sep 2026
- 2026The Secretary Problem with a Stochastic Precursor21 May 2026
- 2025Learning-Augmented Online Bidding in Stochastic Settings29 Oct 2025
- 2025Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search8 Feb 2025
- 2025Algorithms with Calibrated Machine Learning Predictions5 Feb 2025
- 2025Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms29 Jan 2025
- 2024Binary Search with Distributional Predictions25 Nov 2024
- 2024Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms7 Aug 2024