REVIEW 4 cited by
Neural Coordination and Capacity Control for Inventory Management
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Neural Coordination and Capacity Control for Inventory Management
read the original abstract
This paper addresses the capacitated periodic review inventory control problem, focusing on a retailer managing multiple products with limited shared resources, such as storage or inbound labor at a facility. Specifically, this paper is motivated by the questions of (1) what does it mean to backtest a capacity control mechanism, (2) can we devise and backtest a capacity control mechanism that is compatible with recent advances in deep reinforcement learning for inventory management? First, because we only have a single historic sample path of Amazon's capacity limits, we propose a method that samples from a distribution of possible constraint paths covering a space of real-world scenarios. This novel approach allows for more robust and realistic testing of inventory management strategies. Second, we extend the exo-IDP (Exogenous Decision Process) formulation of Madeka et al. 2022 to capacitated periodic review inventory control problems and show that certain capacitated control problems are no harder than supervised learning. Third, we introduce a `neural coordinator', designed to produce forecasts of capacity prices, guiding the system to adhere to target constraints in place of a traditional model predictive controller. Finally, we apply a modified DirectBackprop algorithm for learning a deep RL buying policy and a training the neural coordinator. Our methodology is evaluated through large-scale backtests, demonstrating RL buying policies with a neural coordinator outperforms classic baselines both in terms of cumulative discounted reward and capacity adherence (we see improvements of up to 50% in some cases).
Forward citations
Cited by 4 Pith papers
-
Policy Optimization in Hybrid Discrete-Continuous Action Spaces via Mixed Gradients
HPO enables unbiased policy optimization in hybrid action spaces by mixing differentiable simulation gradients with score-function estimates, outperforming PPO as continuous dimensions increase.
-
Hard Constraints, Smooth Gradients: Learning Feasible Inventory Policies via Differentiable Projection
A differentiable QP-projection plus dual-aware rounding layer lets deep RL policies enforce interdependent hard constraints, achieving near-optimal cost on small instances and 2.5–3.2% savings on an ASML case study.
-
Ready from Day 1: Population-Aware Coordination for Large-Scale Constrained Multi-Agent Systems
Population-conditioned learned primal and dual maps support reliable coordination of large multi-agent systems under composition shifts without per-cycle retraining, cutting forecast error 16-19% and violations 20-51%...
-
Ready from Day 1: Population-Aware Coordination for Large-Scale Constrained Multi-Agent Systems
Learned primal and dual maps conditioned on population summaries enable reliable coordination across composition shifts in large multi-agent systems, cutting forecast error 16-19% and violations 20-51% in a supply-cha...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.