Metraipolis › archive › dc_431a81efdc15
Overcoming Demand Censoring through Randomization for Risk-Sensitive Newsvendor Learning — arXiv:2611.02267
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02267
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:21:27.647Z
- SHA-256 of the archived text
7e84ae9344d289a9d17d266fec246af886f18c555756fd6103b947b4a5ebb54d- Stable URL of this page
https://metraipolis.com/documento/dc_431a81efdc15
How to cite
Overcoming Demand Censoring through Randomization for Risk-Sensitive Newsvendor Learning — arXiv:2611.02267 — arXiv (en), https://arxiv.org/abs/2611.02267 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_431a81efdc15 (Metraipolis archive dc_431a81efdc15, sha256 7e84ae9344d289a9d17d266fec246af886f18c555756fd6103b947b4a5ebb54d)
BibTeX
@misc{dc431a81efdc15,
title = {Overcoming Demand Censoring through Randomization for Risk-Sensitive Newsvendor Learning — arXiv:2611.02267},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02267},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_431a81efdc15; sha256 7e84ae9344d289a9d17d266fec246af886f18c555756fd6103b947b4a5ebb54d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02267. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study online newsvendor learning with bounded demand, censored observations, and convex nonlinear shortage costs. Because stockouts can conceal the shortage magnitudes needed by gradient-based algorithms, we use randomized ordering to construct unbiased subgradient estimates. We characterize admissible randomization distributions within this framework and develop an online inventory policy that combines the resulting subgradient estimates with gradient-based updates. Our regret analysis quantifies the cost of randomization via the estimation variance and an additional loss term. We characterize the randomization distributions that minimize this objective. For piecewise-linear shortage costs, the optimal distribution is computed through a linear-time recursion; for costs with bounded curvature density, it is characterized by a scalar ordinary differential equation. The policy achieves expected regret of $O(T^{2/3})$ against the best fixed order in hindsight over $T$ periods. Under independent demand and suitable curvature of expected losses, the bound improves to $O(\sqrt{T})$. Matching minimax lower bounds establish rate optimality over the corresponding classes with a fixed marginal-cost bound. Both rates extend to nonperishable inventory under uniformly positive conditional expected demand. Numerical experiments on synthetic and retail data show improvements over alternative policies using censored observations.
Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.02267 — 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-11-03T11:02:37.597Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).