3 papers
cs.DS2026
A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
Haoran Xu, Owen Shen, Peter Glynn +2
We study nonstationary Online Linear Programming (OLP), where orders arrive sequentially with reward-resource consumption pairs that form a sequence of independent, but not nec…
math.OC2026
A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
Owen Shen, Haoran Xu, Yinyu Ye +2
We study online configuration selection with admission control problem, which arises in LLM serving, GPU scheduling, and revenue management. In a planning horizon with periods,…
cs.LG2024
Online Linear Programming with Batching
Haoran Xu, Peter W. Glynn, Yinyu Ye
We study Online Linear Programming (OLP) with batching. The planning horizon is cut into batches, and the decisions on customers arriving within a batch can be delayed to the e…