The Primal-Dual method for Learning Augmented Algorithms

by   Étienne Bamas, et al.

The extension of classical online algorithms when provided with predictions is a new and active research area. In this paper, we extend the primal-dual method for online algorithms in order to incorporate predictions that advise the online algorithm about the next action to take. We use this framework to obtain novel algorithms for a variety of online covering problems. We compare our algorithms to the cost of the true and predicted offline optimal solutions and show that these algorithms outperform any online algorithm when the prediction is accurate while maintaining good guarantees when the prediction is misleading.


page 1

page 2

page 3

page 4


Online Primal-Dual Algorithms with Predictions for Packing Problems

The domain of online algorithms with predictions has been extensively st...

Large Scale Model Predictive Control with Neural Networks and Primal Active Sets

This work presents an explicit-implicit procedure that combines an offli...

Faster Matchings via Learned Duals

A recent line of research investigates how algorithms can be augmented w...

Robust Algorithms for Online Convex Problems via Primal-Dual

Primal-dual methods in online optimization give several of the state-of-...

Learning-Augmented Algorithms for Online Linear and Semidefinite Programming

Semidefinite programming (SDP) is a unifying framework that generalizes ...

Extreme Flow Decomposition for Multi-Source Multicast with Intra-Session Network Coding

Network coding (NC), when combined with multipath routing, enables a lin...

Online Directed Spanners and Steiner Forests

We present online algorithms for directed spanners and Steiner forests. ...