arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.32503cs.DScs.GT
收藏

基于预测的帕累托最优调度

Pareto-optimal Non-Clairvoyant Scheduling with Predictions

Amazon(亚马逊);CREST, ENSAE(CREST,ENSAE);Criteo AI Lab(Criteo人工智能实验室)

Ziyad Benomar, Vianney Perchet

AI总结:

该研究针对带预测的可抢占单机调度问题,精确确定了确定性算法的一致性与鲁棒性最优权衡关系,提出了贪心算法并证明了匹配下界,突破了此前鲁棒性的性能瓶颈。

摘要:

我们研究带预测的可抢占单机调度问题,其中可获得作业顺序(或作业大小)的预测,目标是最小化总完成时间。若算法在预测正确时具备c-竞争性,则称其为c-一致性算法;若算法在任意预测下均具备R-竞争性,则称其为R-鲁棒性算法。该问题作为学习增强算法的首批示例之一被提出后,一致性与鲁棒性之间的最优权衡关系一直悬而未决。我们针对确定性算法精确确定了该权衡关系:对任意R>2,给出一种R-鲁棒性算法,其一致性为c(R)=R[1-(1-(R+2)/R²)^(R/(R+2))],并证明不存在确定性R-鲁棒性算法(无论是基于预测顺序还是预测作业大小)能取得更优的一致性。特别地,一致性1+ε可通过鲁棒性ε^(-1/2)+1/6+O(√ε)实现,而此前所有算法均需鲁棒性Θ(1/ε)。我们的算法是贪心算法:在满足“已产生的成本至多为所有未完成作业立即结束时实例最优值的R倍”这一不变量的前提下,尽可能遵循预测顺序。对应的匹配下界基于如下观察:所有鲁棒确定性算法在处理正确预测的过程中,必须满足相同的不变量。

英文摘要:

We study preemptive single-machine non-clairvoyant scheduling with predictions, where a prediction of the order of the jobs (or of their sizes) is available, and the objective is to minimize the total completion time. An algorithm is $c$-consistent if it is $c$-competitive when the prediction is correct, and $R$-robust if it is $R$-competitive whatever the prediction. Since the introduction of this problem as one of the first examples of learning-augmented algorithms, the best possible trade-off between consistency and robustness has remained open. We determine it exactly for deterministic algorithms. For every $R>2$, we give an $R$-robust algorithm whose consistency is \[ c(R)=R\Big(1-\Big(1-\frac{R+2}{R^2}\Big)^{\frac R{R+2}}\Big), \] and we prove that no deterministic $R$-robust algorithm, with either predicted order or predicted job sizes, has better consistency. In particular, consistency $1+\varepsilon$ is achievable with robustness $\varepsilon^{-1/2}+\frac16+O(\sqrt\varepsilon)$, whereas all previous algorithms required robustness $Θ(1/\varepsilon)$. Our algorithm is greedy: it follows the predicted order as fast as possible, subject to the invariant that the cost paid so far is at most $R$ times the optimum of the instance in which every unfinished job would end immediately. The matching lower bound rests on the observation that every robust deterministic algorithm must satisfy the same invariant along its run on correct predictions. Furthermore, we give a simple randomized algorithm, using predicted sizes, with consistency $1+\varepsilon$ and robustness $(3\varepsilon)^{-1/2}+O(1)$, strictly below the deterministic frontier. The question of determining the Pareto-optimal frontier among randomized algorithms remains open.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑