arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.14673cs.DScs.LG
收藏

非平稳在线线性规划的单样本对数回归界

A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming

Haoran Xu, Owen Shen, Peter Glynn, Yinyu Ye, Patrick Jaillet

AI总结:

本文提出一种新算法,在非平稳在线线性规划中实现O((log n)^2)的回归界,证明在资源充足时,即使环境变化大,也能有效分配资源。

摘要:

我们研究了非平稳在线线性规划(OLP),其中n个订单按顺序到达,每个订单的奖励-资源消耗对形成独立但不一定同分布的随机向量序列。在规划时间范围内开始时,决策者会获得足够的资源以满足大部分请求。决策者试图通过接受或拒绝每个订单的即时且不可撤销决策来最大化预期总奖励,受此资源保障限制。我们聚焦于挑战性的单样本设置,其中只有每个分布的一个样本在规划时间范围内开始时可用。我们提出了一种新颖的重新解决算法,结合了动态规划视角与传统在平稳环境中的对偶框架。在资源充足的情况下,即资源保障与订单数量线性增长时,我们证明我们的算法在广泛的非平稳分布序列上实现了O((log n)^2)的回归。我们的结果表明,即使在显著的环境变化和有限的数据可用性下,也能实现对数回归,弥合了平稳OLP与更波动的现实资源分配问题之间的差距。

英文摘要:

We study nonstationary Online Linear Programming (OLP), where $n$ orders arrive sequentially with reward-resource consumption pairs that form a sequence of independent, but not necessarily identically distributed, random vectors. At the beginning of the planning horizon, the decision-maker is provided with a resource endowment that is sufficient to fulfill a significant portion of the requests. The decision-maker seeks to maximize the expected total reward by making immediate and irrevocable acceptance or rejection decisions for each order, subject to this resource endowment. We focus on the challenging single-sample setting, where only one sample from each of the $n$ distributions is available at the start of the planning horizon. We propose a novel re-solving algorithm that integrates a dynamic programming perspective with the dual-based frameworks traditionally employed in stationary environments. In the large-resource regime, where the resource endowment scales linearly with the number of orders, we prove that our algorithm achieves $O((\log n)^2)$ regret across a broad class of nonstationary distribution sequences. Our results demonstrate that polylogarithmic regret is attainable even under significant environmental shifts and minimal data availability, bridging the gap between stationary OLP and more volatile real-world resource allocation problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑