Data-driven Competitive Algorithms for Online Knapsack and Set Cover

12/09/2020
by   Ali Zeynali, et al.
0

The design of online algorithms has tended to focus on algorithms with worst-case guarantees, e.g., bounds on the competitive ratio. However, it is well-known that such algorithms are often overly pessimistic, performing sub-optimally on non-worst-case inputs. In this paper, we develop an approach for data-driven design of online algorithms that maintain near-optimal worst-case guarantees while also performing learning in order to perform well for typical inputs. Our approach is to identify policy classes that admit global worst-case guarantees, and then perform learning using historical data within the policy classes. We demonstrate the approach in the context of two classical problems, online knapsack and online set cover, proving competitive bounds for rich policy classes in each case. Additionally, we illustrate the practical implications via a case study on electric vehicle charging.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

06/01/2020

Secretary and Online Matching Problems with Machine Learned Advice

The classical analysis of online algorithms, due to its worst-case natur...
09/15/2020

The Importance of Pessimism in Fixed-Dataset Policy Optimization

We study worst-case guarantees on the expected return of fixed-dataset p...
12/15/2015

Data Driven Resource Allocation for Distributed Learning

In distributed machine learning, data is dispatched to multiple machines...
11/14/2020

Data-driven Algorithm Design

Data driven algorithm design is an important aspect of modern data scien...
01/26/2021

Online Network Utility Maximization: Algorithm, Competitive Analysis, and Applications

We consider an online version of the well-studied network utility maximi...
01/28/2020

Benchmark Design and Prior-independent Optimization

This paper compares two leading approaches for robust optimization in th...
04/20/2021

Robust Online Algorithms for Dynamic Choosing Problems

Semi-online algorithms that are allowed to perform a bounded amount of r...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.