Stochastic Bilevel Optimization with Lower-Level Contextual Markov Decision Processes
<|reference_start|>Stochastic Bilevel Optimization with Lower-Level Contextual Markov Decision Processes: In various applications, the optimal policy in a strategic decision-making problem depends both on the environmental configuration and exogenous events. For these settings, we introduce Bilevel Optimization with Contextual Markov Decision Processes (BO-CMDP), a stochastic bilevel decision-making model, where the lower level consists of solving a contextual Markov Decision Process (CMDP). BO-CMDP can be viewed as a Stackelberg Game where the leader and a random context beyond the leader's control together decide the setup of (many) MDPs that (potentially multiple) followers best respond to. This framework extends beyond traditional bilevel optimization and finds relevance in diverse fields such as model design for MDPs, tax design, reward shaping and dynamic mechanism design. We propose a stochastic Hyper Policy Gradient Descent (HPGD) algorithm to solve BO-CMDP, and demonstrate its convergence. Notably, HPGD only utilizes observations of the followers' trajectories. Therefore, it allows followers to use any training procedure and the leader to be agnostic of the specific algorithm used, which aligns with various real-world scenarios. We further consider the setting when the leader can influence the training of followers and propose an accelerated algorithm. We empirically demonstrate the performance of our algorithm.<|reference_end|>
@article{thoma2024stochastic,
    title={Stochastic Bilevel Optimization with Lower-Level Contextual Markov
  Decision Processes},
    author={Vinzenz Thoma, Barna Pasztor, Andreas Krause, Giorgia Ramponi, Yifan
  Hu},
    journal={arXiv preprint arXiv:2406.01575},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.01575},
    primaryClass={math.OC cs.AI cs.LG stat.ML}
}