mlsanityData to 7 Oct 2026

Algorithms with Calibrated Machine Learning Predictions

arXiv 2502.02861 ↗First posted 5 Feb 2025stat.ML cs.DS cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

The field of algorithms with predictions incorporates machine learning advice in the design of online algorithms to improve real-world performance. A central consideration is the extent to which predictions can be trusted -- while existing approaches often require users to specify an aggregate trust level, modern machine learning models can provide estimates of prediction-level uncertainty. In this paper, we propose calibration as a principled and practical tool to bridge this gap, demonstrating the benefits of calibrated advice through two case studies: the ski rental and online job scheduling problems. For ski rental, we design an algorithm that achieves near-optimal prediction-dependent performance and prove that, in high-variance settings, calibrated advice offers more effective guidance than alternative methods for uncertainty quantification. For job scheduling, we demonstrate that using a calibrated predictor leads to significant performance improvements over existing methods. Evaluations on real-world data validate our theoretical findings, highlighting the practical impact of calibration for algorithms with predictions.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 20 of its 41 references that are in the map. First posted on arXiv 5 Feb 2025.

Builds on

20 of 41 references.

References · 20

  1. 2018Competitive caching with machine learned advicecited by 194
  2. 2020Algorithms with Predictionscited by 152
  3. 2021Calibrating Predictions to Decisions: A Novel Approach to Multi-Class Calibrationcited by 79
  4. 2019Near-Optimal Bounds for Online Caching with Machine Learned Advicecited by 73
  5. 2020Secretary and Online Matching Problems with Machine Learned Advicecited by 71
  6. 2024Improving Online Algorithms via ML Predictionscited by 65
  7. 2020Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithmscited by 64
  8. 2022Loss Minimization through the Lens of Outcome Indistinguishabilitycited by 61
  9. 2021Distribution-free calibration guarantees for histogram binning without sample splittingcited by 44
  10. 2019Online Computation with Untrusted Advicecited by 42
  11. 2023High-Dimensional Prediction for Sequential Decision Makingcited by 41
  12. 2022Learning Augmented Binary Search Treescited by 31
8 more
  1. 2022Learning Predictions for Algorithms with Predictionscited by 25
  2. 2022Permutation Predictions for Non-Clairvoyant Schedulingcited by 22
  3. 2022Customizing ML Predictions for Online Algorithmscited by 21
  4. 2024Binary Search with Distributional Predictionscited by 11
  5. 2023Online Algorithms with Uncertainty-Quantified Predictionscited by 9
  6. 2024Contract Scheduling with Distributional and Multiple Advicecited by 8
  7. 2023Calibration of Neural Networkscited by 7
  8. 2022Scheduling with Predictionscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 4.

7 papers.