论文标题
预测安排
Scheduling with Predictions
论文作者
论文摘要
对诊断放射学部署机器学习算法的兴趣很大,因为现代学习技术使得在几分钟内检测医学图像异常。尽管由机器辅助诊断尚无法可靠地替代放射科医生对图像的评论,但他们可以为确定审查患者病例的顺序提供优先级规则,以使患有时间敏感的患者可以从早期干预中受益。 我们通过将其作为一个学习的在线调度问题来研究这种情况。我们获得了有关每个到达患者的紧迫性水平的信息,但是这些预测不可避免地容易出错。在此公式中,我们面临在不完美的信息下的决策挑战,并在实时观察到更好的数据时会动态响应预测错误。我们提出了一项简单的在线政策,并表明该政策实际上是某些程式化设置中最好的。我们还证明,我们的政策实现了具有预测的在线算法的两种逃避:一致性(绩效提高预测准确性)和鲁棒性(防止最坏情况)。我们通过对设置下的政策进行的经验评估来补充我们的理论发现,这些政策更准确地反映了现实世界中的临床情况。
There is significant interest in deploying machine learning algorithms for diagnostic radiology, as modern learning techniques have made it possible to detect abnormalities in medical images within minutes. While machine-assisted diagnoses cannot yet reliably replace human reviews of images by a radiologist, they could inform prioritization rules for determining the order by which to review patient cases so that patients with time-sensitive conditions could benefit from early intervention. We study this scenario by formulating it as a learning-augmented online scheduling problem. We are given information about each arriving patient's urgency level in advance, but these predictions are inevitably error-prone. In this formulation, we face the challenges of decision making under imperfect information, and of responding dynamically to prediction error as we observe better data in real-time. We propose a simple online policy and show that this policy is in fact the best possible in certain stylized settings. We also demonstrate that our policy achieves the two desiderata of online algorithms with predictions: consistency (performance improvement with prediction accuracy) and robustness (protection against the worst case). We complement our theoretical findings with empirical evaluations of the policy under settings that more accurately reflect clinical scenarios in the real world.