Robust Secretary and Prophet Algorithms for Packing Integer Programs

12/24/2021
by   C. J. Argue, et al.
0

We study the problem of solving Packing Integer Programs (PIPs) in the online setting, where columns in [0,1]^d of the constraint matrix are revealed sequentially, and the goal is to pick a subset of the columns that sum to at most B in each coordinate while maximizing the objective. Excellent results are known in the secretary setting, where the columns are adversarially chosen, but presented in a uniformly random order. However, these existing algorithms are susceptible to adversarial attacks: they try to "learn" characteristics of a good solution, but tend to over-fit to the model, and hence a small number of adversarial corruptions can cause the algorithm to fail. In this paper, we give the first robust algorithms for Packing Integer Programs, specifically in the recently proposed Byzantine Secretary framework. Our techniques are based on a two-level use of online learning, to robustly learn an approximation to the optimal value, and then to use this robust estimate to pick a good solution. These techniques are general and we use them to design robust algorithms for PIPs in the prophet model as well, specifically in the Prophet-with-Augmentations framework. We also improve known results in the Byzantine Secretary framework: we make the non-constructive results algorithmic and improve the existing bounds for single-item and matroid constraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2019

Robust Online Algorithms for Dynamic Problems

Online algorithms that allow a small amount of migration or recourse hav...
research
11/17/2019

Robust Algorithms for the Secretary Problem

In classical secretary problems, a sequence of n elements arrive in a un...
research
12/06/2021

Online Bin Packing with Known T

In the online bin packing problem, a sequence of items is revealed one a...
research
05/02/2023

The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs

In this paper, we present a low-diameter decomposition algorithm in the ...
research
09/08/2022

Predict+Optimize for Packing and Covering LPs with Unknown Parameters in Constraints

Predict+Optimize is a recently proposed framework which combines machine...
research
09/12/2019

Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds

We study an online linear programming (OLP) problem under a random input...
research
10/19/2020

Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs

We consider ILPs, where each variable corresponds to an integral point w...

Please sign up or login with your details

Forgot password? Click here to reset