学习增强型One-Max搜索中的帕累托最优性、平滑性与随机性
Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
AI总结:
针对One-max搜索现有学习增强方法无法兼顾平滑性与最优最坏情况保证的问题,提出首个同时实现这两个目标的算法,并利用其平滑性分析了含价格和预测随机性的场景,填补了一致性与鲁棒性权衡的空白。
摘要:
One-max搜索是在线决策领域的经典问题,交易员根据一系列披露的价格采取行动,不可撤销地接受其中一个以最大化利润。该问题已在概率和最坏情况场景下得到研究,尤其是通过竞争分析,近期还拓展到学习增强场景——交易员可获取序列预测。然而现有方法要么缺乏平滑性,要么无法实现最优最坏情况保证:未能在算法的一致性与鲁棒性间达成最佳权衡。我们提出首个同时实现这两个重要目标的算法,填补了这一空白。此外,我们展示如何利用所得平滑性,对随机学习增强场景下的One-max搜索进行分析,该场景同时捕捉观测价格和预测中的随机性。
英文摘要:
One-max search is a classic problem in online decision-making, in which a trader acts on a sequence of revealed prices and accepts one of them irrevocably to maximise its profit. The problem has been studied both in probabilistic and in worst-case settings, notably through competitive analysis, and more recently in learning-augmented settings in which the trader has access to a prediction on the sequence. However, existing approaches either lack smoothness, or do not achieve optimal worst-case guarantees: they do not attain the best possible trade-off between the consistency and the robustness of the algorithm. We close this gap by presenting the first algorithm that simultaneously achieves both of these important objectives. Furthermore, we show how to leverage the obtained smoothness to provide an analysis of one-max search in stochastic learning-augmented settings which capture randomness in both the observed prices and the prediction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。