• Corpus ID: 246706260

Online Learning for Min Sum Set Cover and Pandora's Box

@inproceedings{Gergatsouli2022OnlineLF,
  title={Online Learning for Min Sum Set Cover and Pandora's Box},
  author={Evangelia Gergatsouli and Christos Tzamos},
  booktitle={International Conference on Machine Learning},
  year={2022}
}
Two central problems in Stochastic Optimization are M IN S UM S ET C OVER and P ANDORA ’ S B OX . In P ANDORA ’ S B OX , we are presented with n boxes, each containing an unknown value and the goal is to open the boxes in some order to minimize the sum of the search cost and the small-est value found. Given a distribution of value vectors, we are asked to identify a near-optimal search order. M IN S UM S ET C OVER corresponds to the case where values are either 0 or infin-ity. In this work, we… 

Contextual Pandora's Box

A no-regret algorithm that performs comparably well to the optimal algorithm which knows all prior distributions exactly, even in the bandit setting where the algorithm never learns the values of the alternatives that were not explored.

Bandit Algorithms for Prophet Inequality and Pandora's Box

The main technique is to design a regret upper bound that is learnable while playing low-regret Bandit policies, which gives near-optimal total regret algorithms for both Prophet Inequality and Pandora’s Box.

References

SHOWING 1-10 OF 46 REFERENCES

Pandora's Box Problem with Order Constraints

It is proved that finding approximately optimal adaptive search strategies is NP-hard when certain matroid constraints are used to further restrict the set of boxes which may be opened, or when the order constraints are given as reachability constraints on a DAG.

Pandora's Box with Correlations: Learning and Approximation

This paper provides the first approximation algorithms for Pandora's Box-type problems with correlations and considers a number of different feasibility constraints and provides simple PA strategies that are approximately optimal with respect to the best PA strategy for each case.

Online Pandora's Boxes and Bandits

This work considers online variations of the Pandora’s box problem, a standard model for understanding issues related to the cost of acquiring information for decision-making, and shows that in many scenarios, Pandora can achieve a good approximation to the best possible performance.

A constant factor approximation algorithm for generalized min-sum set cover

A simple randomized constant factor approximation algorithm is given for the generalized min-sum set cover problem, which is given a universe of elements and a collection of subsets with each set S having a covering requirement.

Approximating Min Sum Set Cover

For the min sum vertex cover version of the problem, it is shown that it can be approximated within a ratio of 2, and is NP-hard to approximate within some constant ρ > 1.

The Pipelined Set Cover Problem

This work uses its linear-programming framework to show that the greedy and local-search algorithms are 4-approximations for pipelined set cover, and extends the analysis to minimize the l P -norm of the costs paid by the sets, where p > 2 is an integer.

Learning to Branch

It is shown how to use machine learning to determine an optimal weighting of any set of partitioning procedures for the instance distribution at hand using samples from the distribution, and it is proved that this reduction can even be exponential.

Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions

This paper studies the gap between adaptive and non-adaptive strategies for f being a submodular or a fractionally subadditive (XOS) function, and shows that the adaptivity gap is a constant for monotone andnon-monotone sub modular functions, and logarithmic for XOS functions of small width.

A Stochastic Probing Problem with Applications

The first polynomial-time Ω(1/k)-approximate "Sequential Posted Price Mechanism" under k-matroid intersection feasibility constraints is obtained, improving on prior work.

Algorithms and Adaptivity Gaps for Stochastic Probing

The first approximation algorithms for a number of stochastic probing problems, which have applications, e.g., to path-planning and precedence-constrained scheduling, are obtained.