arXiv Machine Learning June 15, 2026 By Anthony Pineci, Yunzong Xu

Optimal Hidden-Target Learning for Online Inventory Optimization on General Convex Sets

Read the original on arXiv Machine Learning →

arXiv:2606. 14679v1 Announce Type: new Abstract: Online inventory optimization (OIO) is online convex optimization with physical memory: inventory carryover makes the feasible action set depend on the past.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

safety

arXiv Machine Learning

Aug 6

Non-Stationary Inventory Control with Lead Times

arXiv:2602. 05799v2 Announce Type: replace-cross Abstract: We study non-stationary single-item, periodic-review inventory control problems in which the demand distribution is unknown and may change over time.

By Nele H. Amiri, Sean R. Sinclair, Maximiliano Udenio

benchmarks

arXiv Machine Learning

Aug 17

Resource-Adaptive Primal-Dual Learning for One-Warehouse Multi-Store Systems with Censored Demand

arXiv:2608. 14096v1 Announce Type: new Abstract: 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.

By Jiameng Lyu

benchmarks

arXiv Machine Learning

Sep 24

Resource-Adaptive Stochastic Gradient Descent for Online Linear Programming without Re-solving

arXiv:2609. 28263v1 Announce Type: new Abstract: The growth of large language model (LLM) inference and search services increases the scale of online linear programming problems, motivating computationally efficient algorithms.

By Jiameng Lyu

llms

arXiv Machine Learning

Aug 4

Hard Constraints, Smooth Gradients: Learning Feasible Inventory Policies via Differentiable Projection

arXiv:2608. 02343v1 Announce Type: cross Abstract: Many operational problems are constrained sequential decision processes with large, combinatorial action spaces and interdependent feasibility constraints.

By Patrick Helm, Jan-Niklas Doerr, Joren Gijsbrechts, Stefan Minner

rag reinforcement-learning benchmarks

arXiv Machine Learning

Sep 10

A First-Order Learning Algorithm for Online Resource Allocation with Constant Regret

arXiv:2609.05895v1 Announce Type: new Abstract: We study a finite-horizon online resource allocation problem with initial resource capacities proportional to the horizon. In each period, a request ty...

By Menglong Li, Jiawei Zhang

arXiv Machine Learning

Jul 27

Online Pricing and Allocation with Demand Learning and Fulfillment Cost

arXiv:2501. 18049v3 Announce Type: replace Abstract: We study online learning for a seller that jointly chooses per-period inventory positions and a uniform price, then fulfills realized demand through a downstream allocation.

By Jianyu Xu, Xuan Wang, Yu-Xiang Wang, Jiashuo Jiang

One email a morning, machine-written

Related stories

Non-Stationary Inventory Control with Lead Times

Resource-Adaptive Primal-Dual Learning for One-Warehouse Multi-Store Systems with Censored Demand

Resource-Adaptive Stochastic Gradient Descent for Online Linear Programming without Re-solving

Hard Constraints, Smooth Gradients: Learning Feasible Inventory Policies via Differentiable Projection

A First-Order Learning Algorithm for Online Resource Allocation with Constant Regret

Online Pricing and Allocation with Demand Learning and Fulfillment Cost