使用简洁预测的分页
Paging with Succinct Predictions
摘要:
分页是在线算法领域的一个典型问题。它还在学习增强算法的发展中发挥了核心作用-最近的一系列研究旨在通过让算法获得预测来改善经典最坏情况分析的缺点。这种预测通常可以使用机器学习方法来生成,但它们本质上是不完美的。先前关于学习增强分页的工作研究了以下预测:(i)当前页面何时会被再次请求(重现预测),(ii)最佳算法中缓存的当前状态(状态预测),(iii)直到当前页面再次被请求的所有请求,以及(iv)页面被请求的相对顺序。我们研究学习增强分页的新角度,需要尽可能少的预测信息。更具体地,在每个页面请求旁边获得的预测仅限于一位。我们考虑两个自然的这样的设置:(i)丢弃预测,其中预测的位表示驱逐此页面是否“安全”,以及(ii)阶段预测,其中位表示当前页面是否将在下一阶段中被请求(用于将输入适当划分为阶段)。我们为这两种设置中的每一种开发算法,这些算法满足学习增强算法的所有三个理想特性-也就是说,它们是一致的,鲁棒的和平滑的-尽管每个请求仅限于一位预测。我们还提出了下限,建立我们的算法基本上是最好的可能。
英文摘要:
Paging is a prototypical problem in the area of online algorithms. It has also played a central role in the development of learning-augmented algorithms -- a recent line of research that aims to ameliorate the shortcomings of classical worst-case analysis by giving algorithms access to predictions. Such predictions can typically be generated using a machine learning approach, but they are inherently imperfect. Previous work on learning-augmented paging has investigated predictions on (i) when the current page will be requested again (reoccurrence predictions), (ii) the current state of the cache in an optimal algorithm (state predictions), (iii) all requests until the current page gets requested again, and (iv) the relative order in which pages are requested. We study learning-augmented paging from the new perspective of requiring the least possible amount of predicted information. More specifically, the predictions obtained alongside each page request are limited to one bit only. We consider two natural such setups: (i) discard predictions, in which the predicted bit denotes whether or not it is ``safe'' to evict this page, and (ii) phase predictions, where the bit denotes whether the current page will be requested in the next phase (for an appropriate partitioning of the input into phases). We develop algorithms for each of the two setups that satisfy all three desirable properties of learning-augmented algorithms -- that is, they are consistent, robust and smooth -- despite being limited to a one-bit prediction per request. We also present lower bounds establishing that our algorithms are essentially best possible.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。