Improving Online Algorithms via ML Predictions

In this work we study the problem of using machine-learned predictions to improve the performance of online algorithms. We consider two classical problems, ski rental and non-clairvoyant job scheduling, and obtain new online algorithms that use predictions to make their decisions. These algorithms are oblivious to the performance of the predictor, improve with better predictions, but do not degrade much if the predictions are poor.

[1]  Anna R. Karlin,et al.  Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.

[2]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[3]  Mor Harchol-Balter,et al.  Exploiting process lifetime distributions for dynamic load balancing , 1997, TOCS.

[4]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[5]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[6]  Mor Harchol-Balter,et al.  Analysis of SRPT scheduling: investigating unfairness , 2001, SIGMETRICS '01.

[7]  Claire Mathieu,et al.  Dynamic TCP acknowledgement and other stories about e/(e-1) , 2001, STOC '01.

[8]  Luca Becchetti,et al.  Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines , 2001, STOC '01.

[9]  Amitabh Sinha,et al.  Non-Clairvoyant Scheduling for Minimizing Mean Slowdown , 2003, Algorithmica.

[10]  Adam Meyerson.  The parking permit problem , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[11]  Russell Bent,et al.  Online stochastic combinatorial optimization , 2006 .

[12]  Aleksandrs Slivkins,et al.  25th Annual Conference on Learning Theory The Best of Both Worlds: Stochastic and Adversarial Bandits , 2022 .

[13]  Amin Saberi,et al.  Online Optimization with Uncertain Information , 2012, ACM Trans. Algorithms.

[14]  Morteza Zadimoghaddam,et al.  Simultaneous approximations for adversarial and stochastic online budgeted allocation , 2012, SODA.

[15]  Murali S. Kodialam,et al.  The constrained Ski-Rental problem and its application to online cloud cost optimization , 2013, 2013 Proceedings IEEE INFOCOM.

[16]  Rohan Kodialam.  Competitive Algorithms for an Online Rent or Buy Problem with Variable Demand , 2014 .

[17]  Kirk Pruhs,et al.  SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[18]  Sergei Vassilvitskii,et al.  Revenue Optimization with Approximate Bid Predictions , 2017, NIPS.

[19]  Sergei Vassilvitskii,et al.  Competitive caching with machine learned advice , 2018, ICML.

[20]  Kamesh Munagala,et al.  Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints , 2014, STOC.

[21]  Tim Kraska,et al.  The Case for Learned Index Structures , 2018 .