Contract Scheduling with Distributional and Multiple Advice

• URL: http://arxiv.org/abs/2404.12485v1
• Date: Thu, 18 Apr 2024 19:58:11 GMT
• Title: Contract Scheduling with Distributional and Multiple Advice
• Authors: Spyros Angelopoulos, Marcin Bienkowski, Christoph Dürr, Bertrand Simon,
• Abstract summary: Previous work has showed that a prediction on the interruption time can help improve the performance of contract-based systems. We introduce and study more general and realistic learning-augmented settings in which the prediction is in the form of a probability distribution. We show that the resulting system is robust to prediction errors in the distributional setting.
• Score: 37.64065953072774
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Conformal Prediction for Hierarchical Data [5.580128181112309]
  We propose a first step towards combining Conformal Prediction and Forecast Reconciliation. We show that the validity granted by SCP remains while improving the efficiency of the prediction sets.
  arXiv  Detail & Related papers  (2024-11-20T17:26:26Z)
• Performative Time-Series Forecasting [71.18553214204978]
  We formalize performative time-series forecasting (PeTS) from a machine-learning perspective. We propose a novel approach, Feature Performative-Shifting (FPS), which leverages the concept of delayed response to anticipate distribution shifts. We conduct comprehensive experiments using multiple time-series models on COVID-19 and traffic forecasting tasks.
  arXiv  Detail & Related papers  (2023-10-09T18:34:29Z)
• Predictive Inference with Feature Conformal Prediction [80.77443423828315]
  We propose feature conformal prediction, which extends the scope of conformal prediction to semantic feature spaces. From a theoretical perspective, we demonstrate that feature conformal prediction provably outperforms regular conformal prediction under mild assumptions. Our approach could be combined with not only vanilla conformal prediction, but also other adaptive conformal prediction methods.
  arXiv  Detail & Related papers  (2022-10-01T02:57:37Z)
• What Should I Know? Using Meta-gradient Descent for Predictive Feature Discovery in a Single Stream of Experience [63.75363908696257]
  computational reinforcement learning seeks to construct an agent's perception of the world through predictions of future sensations. An open challenge in this line of work is determining from the infinitely many predictions that the agent could possibly make which predictions might best support decision-making. We introduce a meta-gradient descent process by which an agent learns what predictions to make, 2) the estimates for its chosen predictions, and 3) how to use those estimates to generate policies that maximize future reward.
  arXiv  Detail & Related papers  (2022-06-13T21:31:06Z)
• Computing the ensemble spread from deterministic weather predictions using conditional generative adversarial networks [0.0]
  We propose to use deep-learning algorithms to learn the statistical properties of an ensemble prediction system. Once trained, the costly ensemble prediction system will not be needed anymore to obtain future ensemble forecasts.
  arXiv  Detail & Related papers  (2022-05-18T19:10:38Z)
• Novel Techniques to Assess Predictive Systems and Reduce Their Alarm Burden [0.0]
  We introduce an improved performance assessment technique ("u-metrics") using utility functions to score each prediction. Compared to traditional performance measures, u-metrics more accurately reflect the real-world benefits and costs of a predictor operating in a workflow context. We also describe the use of "snoozing," a method whereby predictions are suppressed for a period of time, commonly improving predictor performance.
  arXiv  Detail & Related papers  (2021-02-10T19:05:06Z)
• Contract Scheduling With Predictions [12.335698325757491]
  We study the setting in which there is a potentially erroneous prediction concerning the interruption. For both settings, we investigate tradeoffs between the robustness (i.e., the worst-case performance assuming adversarial prediction) and the consistency (i.e., the performance assuming that the prediction is error-free)
  arXiv  Detail & Related papers  (2020-11-24T23:00:04Z)
• Video Prediction via Example Guidance [156.08546987158616]
  In video prediction tasks, one major challenge is to capture the multi-modal nature of future contents and dynamics. In this work, we propose a simple yet effective framework that can efficiently predict plausible future states.
  arXiv  Detail & Related papers  (2020-07-03T14:57:24Z)
• Counterfactual Predictions under Runtime Confounding [74.90756694584839]
  We study the counterfactual prediction task in the setting where all relevant factors are captured in the historical data. We propose a doubly-robust procedure for learning counterfactual prediction models in this setting.
  arXiv  Detail & Related papers  (2020-06-30T15:49:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.