Online Paging with a Vanishing Regret

11/18/2020
by   Yuval Emek, et al.
1

This paper considers a variant of the online paging problem, where the online algorithm has access to multiple predictors, each producing a sequence of predictions for the page arrival times. The predictors may have occasional prediction errors and it is assumed that at least one of them makes a sublinear number of prediction errors in total. Our main result states that this assumption suffices for the design of a randomized online algorithm whose time-average regret with respect to the optimal offline algorithm tends to zero as the time tends to infinity. This holds (with different regret bounds) for both the full information access model, where in each round, the online algorithm gets the predictions of all predictors, and the bandit access model, where in each round, the online algorithm queries a single predictor. While online algorithms that exploit inaccurate predictions have been a topic of growing interest in the last few years, to the best of our knowledge, this is the first paper that studies this topic in the context of multiple predictors for an online problem with unbounded request sequences. Moreover, to the best of our knowledge, this is also the first paper that aims for (and achieves) online algorithms with a vanishing regret for a classic online problem under reasonable assumptions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/04/2023

Mixing predictions for online metric algorithms

A major technique in learning-augmented online algorithms is combining m...
research
10/26/2016

Things Bayes can't do

The problem of forecasting conditional probabilities of the next event g...
research
02/13/2019

Distributed Online Linear Regression

We study online linear regression problems in a distributed setting, whe...
research
10/20/2020

POND: Pessimistic-Optimistic oNline Dispatch

This paper considers constrained online dispatch with unknown arrival, r...
research
06/16/2020

Online Algorithms for Weighted Paging with Predictions

In this paper, we initiate the study of the weighted paging problem with...
research
07/02/2021

Online Multi-Agent Forecasting with Interpretable Collaborative Graph Neural Network

This paper considers predicting future statuses of multiple agents in an...
research
02/07/2022

Online Optimization with Untrusted Predictions

We examine the problem of online optimization, where a decision maker mu...

Please sign up or login with your details

Forgot password? Click here to reset