DeepAI AI Chat
Log In Sign Up

Secretary and Online Matching Problems with Machine Learned Advice

06/01/2020
by   Antonios Antoniadis, et al.
Max Planck Society
0

The classical analysis of online algorithms, due to its worst-case nature, can be quite pessimistic when the input instance at hand is far from worst-case. Often this is not an issue with machine learning approaches, which shine in exploiting patterns in past inputs in order to predict the future. However, such predictions, although usually accurate, can be arbitrarily poor. Inspired by a recent line of work, we augment three well-known online settings with machine learned predictions about the future, and develop algorithms that take them into account. In particular, we study the following online selection problems: (i) the classical secretary problem, (ii) online bipartite matching and (iii) the graphic matroid secretary problem. Our algorithms still come with a worst-case performance guarantee in the case that predictions are subpar while obtaining an improved competitive ratio (over the best-known classical online algorithm for each problem) when the predictions are sufficiently accurate. For each algorithm, we establish a trade-off between the competitive ratios obtained in the two respective cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/16/2020

Algorithms with Predictions

We introduce algorithms that use predictions from machine learning appli...
02/03/2023

Online Ad Allocation with Predictions

Display Ads and the generalized assignment problem are two well-studied ...
08/14/2018

An Experimental Study of Algorithms for Online Bipartite Matching

We perform an experimental study of algorithms for online bipartite matc...
02/15/2018

Competitive caching with machine learned advice

Traditional online algorithms encapsulate decision making under uncertai...
12/06/2021

A Novel Prediction Setup for Online Speed-Scaling

Given the rapid rise in energy demand by data centers and computing syst...
11/19/2021

Adversarial Deep Learning for Online Resource Allocation

Online algorithm is an important branch in algorithm design. Designing o...
10/07/2018

Competitive Online Virtual Cluster Embedding Algorithms

In the conventional cloud service model, computing resources are allocat...