DeepAI AI Chat
Log In Sign Up

Paging with Succinct Predictions

by   Antonios Antoniadis, et al.

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.


page 1

page 2

page 3

page 4


Online Algorithms for Weighted Paging with Predictions

In this paper, we initiate the study of the weighted paging problem with...

Online TSP with Predictions

We initiate the study of online routing problems with predictions, inspi...

Better and Simpler Learning-Augmented Online Caching

Lykouris and Vassilvitskii (ICML 2018) introduce a model of online cachi...

MUSTACHE: Multi-Step-Ahead Predictions for Cache Eviction

In this work, we propose MUSTACHE, a new page cache replacement algorith...

Learning-Augmented Algorithms for Online TSP on the Line

We study the online Traveling Salesman Problem (TSP) on the line augment...

Learning-Augmented Maximum Flow

We propose a framework for speeding up maximum flow computation by using...

On the Power of Learning-Augmented BSTs

We present the first Learning-Augmented Binary Search Tree(BST) that att...