DeepAI AI Chat
Log In Sign Up

Online Primal-Dual Algorithms with Predictions for Packing Problems

by   Nguyen Kim Thang, et al.

The domain of online algorithms with predictions has been extensively studied for different applications such as scheduling, caching (paging), clustering, ski rental, etc. Recently, Bamas et al., aiming for an unified method, have provided a primal-dual framework for linear covering problems. They extended the online primal-dual method by incorporating predictions in order to achieve a performance beyond the worst-case case analysis. In this paper, we consider this research line and present a framework to design algorithms with predictions for non-linear packing problems. We illustrate the applicability of our framework in submodular maximization and in particular ad-auction maximization in which the optimal bound is given and supporting experiments are provided.


page 1

page 2

page 3

page 4


The Primal-Dual method for Learning Augmented Algorithms

The extension of classical online algorithms when provided with predicti...

Online Ad Allocation with Predictions

Display Ads and the generalized assignment problem are two well-studied ...

Online Primal-Dual Algorithms with Configuration Linear Programs

Non-linear, especially convex, objective functions have been extensively...

Robust Algorithms for Online Convex Problems via Primal-Dual

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

Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems

In this paper, we study a certain class of online optimization problems,...

Online Computation with Untrusted Advice

The advice model of online computation captures the setting in which the...

Faster Matchings via Learned Duals

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