Discrete-Smoothness in Online Algorithms with Predictions

Yossi Azar, Debmalya Panigrahi, Noam Touitou

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

In recent years, there has been an increasing focus on designing online algorithms with (machine-learned) predictions. The ideal learning-augmented algorithm is comparable to the optimum when given perfect predictions (consistency), to the best online approximation for arbitrary predictions (robustness), and should interpolate between these extremes as a smooth function of the prediction error. In this paper, we quantify these guarantees in terms of a general property that we call discrete-smoothness and achieve discrete-smooth algorithms for online covering, specifically the facility location and set cover problems. For set cover, our work improves the results of Bamas, Maggiori, and Svensson (2020) by augmenting consistency and robustness with smoothness guarantees. For facility location, our work improves on prior work by Almanza et al. (2021) by generalizing to nonuniform costs and also providing smoothness guarantees by augmenting consistency and robustness.

Original languageEnglish
JournalAdvances in Neural Information Processing Systems
Volume36
StatePublished - 2023
Event37th Conference on Neural Information Processing Systems, NeurIPS 2023 - New Orleans, United States
Duration: 10 Dec 202316 Dec 2023

Funding

FundersFunder number
Israel Science Foundation2304/20
National Science FoundationCCF-1955703, CCF-1750140

    Fingerprint

    Dive into the research topics of 'Discrete-Smoothness in Online Algorithms with Predictions'. Together they form a unique fingerprint.

    Cite this