Contextual Pandora's Box

05/26/2022
by   Alexia Atsidakou, et al.
0

Pandora's Box is a fundamental stochastic optimization problem, where the decision-maker must find a good alternative while minimizing the search cost of exploring the value of each alternative. In the original formulation, it is assumed that accurate priors are given for the values of all the alternatives, while recent work studies the online variant of Pandora's Box where priors are originally unknown. In this work, we extend Pandora's Box to the online setting, while incorporating context. At every round, we are presented with a number of alternatives each having a context, an exploration cost and an unknown value drawn from an unknown prior distribution that may change at every round. Our main result is a no-regret algorithm that performs comparably well to the optimal algorithm which knows all prior distributions exactly. Our algorithm works even in the bandit setting where the algorithm never learns the values of the alternatives that were not explored. The key technique that enables our result is novel a modification of the realizability condition in contextual bandits that connects a context to the reservation value of the corresponding distribution rather than its mean

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2022

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

Two central problems in Stochastic Optimization are Min Sum Set Cover an...
research
10/17/2016

Risk-Aware Algorithms for Adversarial Contextual Bandits

In this work we consider adversarial contextual bandits with risk constr...
research
01/31/2023

Weitzman's Rule for Pandora's Box with Correlations

Pandora's Box is a central problem in decision making under uncertainty ...
research
08/30/2021

Approximating Pandora's Box with Correlations

The Pandora's Box problem asks to find a search strategy over n alternat...
research
12/13/2020

Online Stochastic Optimization with Wasserstein Based Non-stationarity

We consider a general online stochastic optimization problem with multip...
research
11/05/2019

Learning Optimal Search Algorithms from Data

Classical algorithm design is geared towards worst case instances and fa...
research
07/19/2022

Regret Minimization with Noisy Observations

In a typical optimization problem, the task is to pick one of a number o...

Please sign up or login with your details

Forgot password? Click here to reset