mlsanityData to 14 Oct 2026

Contextual Bandits for Evaluating and Improving Inventory Control Policies

arXiv 2310.16096 ↗First posted 24 Oct 2023stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Solutions to address the periodic review inventory control problem with nonstationary random demand, lost sales, and stochastic vendor lead times typically involve making strong assumptions on the dynamics for either approximation or simulation, and applying methods such as optimization, dynamic programming, or reinforcement learning. Therefore, it is important to analyze and evaluate any inventory control policy, in particular to see if there is room for improvement. We introduce the concept of an equilibrium policy, a desirable property of a policy that intuitively means that, in hindsight, changing only a small fraction of actions does not result in materially more reward. We provide a light-weight contextual bandit-based algorithm to evaluate and occasionally tweak policies, and show that this method achieves favorable guarantees, both theoretically and in empirical studies.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 6 references that are in the map. First posted on arXiv 24 Oct 2023.

Builds on

3 of 6 references.

References · 3

  1. 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 197
  2. 2020Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizabilitycited by 115
  3. 2022Deep Inventory Managementcited by 23

Built on by

Not cited yet.