Metraipolis › archive › dc_a50ad342cbdd
Resource-Adaptive Primal-Dual Learning for One-Warehouse Multi-Store Systems with Censored Demand — arXiv:2608.14096
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.14096
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T02:30:33.301Z
- SHA-256 of the archived text
198a76624aece8d004f18f14167f3a5741c1ce499d52b2fdbd2056df501391af- Stable URL of this page
https://metraipolis.com/documento/dc_a50ad342cbdd
How to cite
Resource-Adaptive Primal-Dual Learning for One-Warehouse Multi-Store Systems with Censored Demand — arXiv:2608.14096 — arXiv (en), https://arxiv.org/abs/2608.14096 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a50ad342cbdd (Metraipolis archive dc_a50ad342cbdd, sha256 198a76624aece8d004f18f14167f3a5741c1ce499d52b2fdbd2056df501391af)
BibTeX
@misc{dca50ad342cbdd,
title = {Resource-Adaptive Primal-Dual Learning for One-Warehouse Multi-Store Systems with Censored Demand — arXiv:2608.14096},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.14096},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a50ad342cbdd; sha256 198a76624aece8d004f18f14167f3a5741c1ce499d52b2fdbd2056df501391af},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.14096. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The one-warehouse multi-store (OWMS) system is a fundamental inventory network in which a nonreplenishable warehouse allocates shared stock across multiple stores over time. Existing OWMS learning policies are built around a fixed target calibrated to the initial average resource rate, but such a fixed-target architecture cannot re-center after realized sales change the remaining resource available per future period. We develop Resource-Adaptive Primal-Dual Learning, a new learning framework that tracks the primal-dual resolving path with censored demand as the remaining-resource state evolves. In each period, the current resource rate indexes the target store allocations and dual variable, while censored sales provide gradient estimates for updating both. The analysis combines expected-sales geometry with a moving-target argument to yield logarithmic expected regret, improving on the state-of-the-art square-root-order guarantees of existing OWMS learning policies. The underlying design and analytical ideas may inform other online learning problems with depleting shared resources. Numerical experiments further demonstrate good finite-horizon performance of a practical variant across different horizon lengths and inventory regimes. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-17 in cs.LG). Categorie arXiv: Machine Learning (cs.LG) ; Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2608.14096 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T02:26:17.790Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).