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

在线图探索方法的鲁棒化

Robustification of Online Graph Exploration Methods

London School of Economics(伦敦政治经济学院);University of Bremen(不来梅大学)

Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter

摘要:

探索未知环境是许多领域中的基本任务,例如,机器人导航、网络安全和互联网搜索。我们通过增加对机器学习预测的访问,开始研究经典的、臭名昭著的硬在线图探索问题的学习增强变体。我们提出了一种算法,自然集成到众所周知的最近邻(NN)算法的预测,并显着优于任何已知的在线算法,如果预测的准确性高,同时保持良好的保证时,预测质量差。我们提供了理论上的最坏情况下的界限,优雅地降低预测误差,我们补充他们的计算实验,证实我们的结果。此外,我们将我们的概念扩展到一个通用框架,以robustify算法。通过在给定的算法和NN之间仔细插值,我们证明了新的性能界限,该界限利用了特定输入上的个体良好性能,同时建立了对任意输入的鲁棒性。

英文摘要:

Exploring unknown environments is a fundamental task in many domains, e.g., robot navigation, network security, and internet search. We initiate the study of a learning-augmented variant of the classical, notoriously hard online graph exploration problem by adding access to machine-learned predictions. We propose an algorithm that naturally integrates predictions into the well-known Nearest Neighbor (NN) algorithm and significantly outperforms any known online algorithm if the prediction is of high accuracy while maintaining good guarantees when the prediction is of poor quality. We provide theoretical worst-case bounds that gracefully degrade with the prediction error, and we complement them by computational experiments that confirm our results. Further, we extend our concept to a general framework to robustify algorithms. By interpolating carefully between a given algorithm and NN, we prove new performance bounds that leverage the individual good performance on particular inputs while establishing robustness to arbitrary inputs.

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

↑