arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.01716math.OCcs.DScs.LGmath.PR
收藏

超越非退化性:重新审视在线线性规划的确定性等价启发式算法

Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming

School of Data Science, the Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)数据科学学院);Data Science and Analytics Thrust, Information Hub, the Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州)信息枢纽数据科学与分析学域)

Yilun Chen, Wenjia Wang

AI总结:

本研究重新审视在线线性规划的确定性等价启发式算法(CE),证明其在无需流体正则条件的温和假设下可实现一致近最优遗憾,有效克服退化诅咒,推广多秘书设置结论并开发新分析技术。

摘要:

确定性等价启发式算法(CE)是运筹学(OR)和运营管理(OM)中各类动态资源分配问题的广泛使用算法。尽管其流行,CE的现有理论保证仅限于满足限制性流体正则条件的设置,特别是非退化条件——普遍认为违反此类条件会导致性能恶化,需要CE之外的算法创新。在本研究中,我们在在线线性规划的通用框架内对CE进行了精细化性能分析。我们证明,仅在基础分布的温和假设下,无需依赖任何流体正则条件,CE即可实现一致近最优遗憾(不超过T的多对数因子)。我们的结果表明,与先前观点相反,对于具有连续条件奖励分布的广泛问题实例,CE可有效克服退化诅咒,突出了离散与非离散设置之间问题结构的差异。我们的显式遗憾界在温和的(log T)²机制与最坏情况的√T机制之间插值,其中参数β量化条件奖励分布的最小概率累积率,推广了多秘书设置中的先前发现。为实现这些结果,我们开发了新颖的算法分析技术;借鉴经验过程理论的工具,我们建立了随机线性规划解的强集中分析,从而在显著放宽的假设下改进了遗憾分析——这些技术可能在更广泛的在线决策语境中找到潜在应用。

英文摘要:

The Certainty Equivalent heuristic (CE) is a widely-used algorithm for various dynamic resource allocation problems in OR and OM. Despite its popularity, existing theoretical guarantees of CE are limited to settings satisfying restrictive fluid regularity conditions, particularly, the non-degeneracy conditions, under the widely held belief that the violation of such conditions leads to performance deterioration and necessitates algorithmic innovation beyond CE. In this work, we conduct a refined performance analysis of CE within the general framework of online linear programming. We show that CE achieves uniformly near-optimal regret (up to a polylogarithmic factor in $T$) under only mild assumptions on the underlying distribution, without relying on any fluid regularity conditions. Our result implies that, contrary to prior belief, CE effectively beats the curse of degeneracy for a wide range of problem instances with continuous conditional reward distributions, highlighting the distinction of the problem's structure between discrete and non-discrete settings. Our explicit regret bound interpolates between the mild $(\log T)^2$ regime and the worst-case $\sqrt{T}$ regime with a parameter $β$ quantifying the minimal rate of probability accumulation of the conditional reward distributions, generalizing prior findings in the multisecretary setting. To achieve these results, we develop novel algorithmic analytical techniques. Drawing tools from the empirical processes theory, we establish strong concentration analysis of the solutions to random linear programs, leading to improved regret analysis under significantly relaxed assumptions. These techniques may find potential applications in broader online decision-making contexts.

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

↑