Online Algorithms with Multiple Predictions

This paper studies online algorithms augmented with multiple machine-learned predictions. We give a generic algorithmic framework for online covering problems with multiple predictions that obtains an online solution that is competitive against the performance of the best solution obtained from the predictions. Our algorithm incorporates the use of predictions in the classic potential-based analysis of online algorithms. We apply our algorithmic framework to solve classical problems such as online set cover, (weighted) caching, and online facility location in the multiple predictions setting.

Authors

• Keerti Anand
• Rong Ge 0001
• Amit Kumar 0001
• Debmalya Panigrahi

Keywords

No keywords are indexed for this paper.