Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds
Not on the map. Why?
Abstract (arXiv)
We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs. We develop a learning-augmented online algorithm that makes decisions based on (potentially inaccurate) predicted lengths of the idle periods. The algorithm's performance is near-optimal when predictions are accurate and degrades gracefully with increasing prediction error, with a worst-case guarantee almost identical to the optimal classical online algorithm for the problem. A key ingredient in our approach is a new algorithm for the online ski rental problem in the learning augmented setting with tight dependence on the prediction error. We support our theoretical findings with experiments.
Key facts. Cited by 20 papers in the map (data through 14 Oct 2026). Builds on 16 of its 49 references that are in the map. First posted on arXiv 25 Oct 2021.
Builds on
16 of 49 references.
References · 16
- 2018Competitive caching with machine learned advicecited by 195
- 2020Algorithms with Predictionscited by 153
- 2020Online metric algorithms with untrusted predictionscited by 75
- 2019Near-Optimal Bounds for Online Caching with Machine Learned Advicecited by 73
- 2020Secretary and Online Matching Problems with Machine Learned Advicecited by 71
- 2020Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithmscited by 64
- 2013Dynamical Models and Tracking Regret in Online Convex Programmingcited by 43
- 2019Online Computation with Untrusted Advicecited by 42
- 2020Secretaries with Advicecited by 41
- 2020Better and Simpler Learning-Augmented Online Cachingcited by 38
- 2020Learning Augmented Energy Minimization via Speed Scalingcited by 38
- 2018Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descentcited by 33
4 more
- 2021Double Coverage with Machine-Learned Advicecited by 10
- 2018Optimal Algorithms for Right-Sizing Data Centers- Extended Versioncited by 6
- 2016Energy-Efficient Algorithmscited by 4
- 2019Parallel Machine Scheduling to Minimize Energy Consumptioncited by 1
Built on by
Citing papers per year: 2022: 2; 2023: 2; 2024: 5; 2025: 5; 2026: 6.
20 papers.
Sort:
- 2022Permutation Predictions for Non-Clairvoyant Schedulingcited by 22
- 2023Sorting with Predictionscited by 14
- 2023Mixing predictions for online metric algorithmscited by 13
- 2024Algorithms for Caching and MTS with reduced number of predictionscited by 12
- 2022Paging with Succinct Predictionscited by 10
- 2024Non-clairvoyant Scheduling with Partial Predictionscited by 7
- 2024Learning-Augmented Priority Queuescited by 7
- 2025On Tradeoffs in Learning-Augmented Algorithmscited by 7
- 2024Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problemscited by 5
- 2024Learning-augmented Online Algorithm for Two-level Ski-rental Problemcited by 3
- 2025Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistencycited by 3
- 2025Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictorscited by 2
8 more
- 2026Ski Rental with Distributional Predictions of Unknown Qualitycited by 2
- 2026Learning-Augmented Online Minimization with Dual Predictionscited by 1
- 2025Decision-Theoretic Approaches for Improved Learning-Augmented Algorithmscited by 0
- 2025Prediction-Specific Design of Learning-Augmented Algorithmscited by 0
- 2026Analyzing the effect of prediction accuracy on the distributionally-robust competitive ratiocited by 0
- 2026Towards Optimal Robustness in Learning-Augmented Pagingcited by 0
- 2026Learning Augmented Exact Exponential Algorithmscited 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
- 2026Learning Augmented Exact Exponential Algorithms17 Jun 2026
- 2026Learning-Augmented Online Minimization with Dual Predictions3 Jun 2026
- 2026Towards Optimal Robustness in Learning-Augmented Paging31 May 2026
- 2026Ski Rental with Distributional Predictions of Unknown Quality24 Feb 2026
- 2026Analyzing the effect of prediction accuracy on the distributionally-robust competitive ratio11 Jan 2026
- 2025Prediction-Specific Design of Learning-Augmented Algorithms16 Oct 2025
- 2025Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency22 Jul 2025
- 2025Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors5 Jun 2025
- 2025Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms29 Jan 2025
- 2025On Tradeoffs in Learning-Augmented Algorithms22 Jan 2025
- 2024Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems26 Jun 2024
8 more
- 2024Learning-Augmented Priority Queues7 Jun 2024
- 2024Non-clairvoyant Scheduling with Partial Predictions2 May 2024
- 2024Algorithms for Caching and MTS with reduced number of predictions9 Apr 2024
- 2024Learning-augmented Online Algorithm for Two-level Ski-rental Problem9 Feb 2024
- 2023Sorting with Predictions1 Nov 2023
- 2023Mixing predictions for online metric algorithms4 Apr 2023
- 2022Paging with Succinct Predictions6 Oct 2022
- 2022Permutation Predictions for Non-Clairvoyant Scheduling21 Feb 2022
- 2022Permutation Predictions for Non-Clairvoyant Schedulingcited by 22
- 2023Sorting with Predictionscited by 14
- 2023Mixing predictions for online metric algorithmscited by 13
- 2024Algorithms for Caching and MTS with reduced number of predictionscited by 12
- 2022Paging with Succinct Predictionscited by 10
- 2024Non-clairvoyant Scheduling with Partial Predictionscited by 7
- 2024Learning-Augmented Priority Queuescited by 7
- 2025On Tradeoffs in Learning-Augmented Algorithmscited by 7
- 2024Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problemscited by 5
- 2024Learning-augmented Online Algorithm for Two-level Ski-rental Problemcited by 3
- 2025Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistencycited by 3
- 2025Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictorscited by 2
12 most cited of 20 All 20 (JSON)
- 2026Learning-Augmented Algorithms: Guarantees, Construction Mechanisms, and System-Level Implications4 Sep 2026
- 2026Learning Augmented Exact Exponential Algorithms17 Jun 2026
- 2026Learning-Augmented Online Minimization with Dual Predictions3 Jun 2026
- 2026Towards Optimal Robustness in Learning-Augmented Paging31 May 2026
- 2026Ski Rental with Distributional Predictions of Unknown Quality24 Feb 2026
- 2026Analyzing the effect of prediction accuracy on the distributionally-robust competitive ratio11 Jan 2026
- 2025Prediction-Specific Design of Learning-Augmented Algorithms16 Oct 2025
- 2025Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency22 Jul 2025
- 2025Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors5 Jun 2025
- 2025Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms29 Jan 2025
- 2025On Tradeoffs in Learning-Augmented Algorithms22 Jan 2025
- 2024Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems26 Jun 2024
12 newest of 20 All 20 (JSON)