arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0704.1020cs.LGcs.SC
收藏

部分监控下的在线最短路问题

The on-line shortest path problem under partial monitoring

Computer and Automation Research Institute of the Hungarian Academy of Sciences(匈牙利科学院计算机与自动化研究所);Queen’s University(女王大学);ICREA(加泰罗尼亚研究与高级研究院);Universitat Pompeu Fabra(庞培法布拉大学);Budapest University of Technology and Economics(布达佩斯技术与经济大学)

Andras Gyorgy, Tamas Linder, Gabor Lugosi, Gyorgy Ottucsak

摘要:

在线最短路径问题被认为是在各种模型的部分监控。给定一个加权有向无环图,其边的权重可以以任意(对抗)方式改变,决策者必须在每一轮游戏中选择两个不同顶点之间的路径,使得所选路径的损失(定义为其组成边的权重之和)尽可能小。在一个推广的多臂强盗问题中,在选择了一条路径后,决策者只学习属于所选路径的那些边的权值.对于这个问题,给出了一个算法,它在n轮中的平均累积损失超过最佳路径的平均累积损失,离线匹配到整个边权值序列,通过与1/ \sqrt{n}成比例的量,并且仅多项式地依赖于图的边的数量。该算法可以实现与轮数n和边数的线性复杂度。还给出了对所谓的标签有效设置的扩展,其中在总共m << n个时间实例处向决策者通知与所选路径相对应的边的权重。另一个扩展示出的决策者竞争对随时间变化的路径,跟踪最佳专家的问题的泛化。最短路径的多臂强盗设置的一个版本也讨论了决策者只学习所选路径的总权重,但不学习路径上的各个边的权重。

英文摘要:

The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (adversarial) way, a decision maker has to choose in each round of a game a path between two distinguished vertices such that the loss of the chosen path (defined as the sum of the weights of its composing edges) be as small as possible. In a setting generalizing the multi-armed bandit problem, after choosing a path, the decision maker learns only the weights of those edges that belong to the chosen path. For this problem, an algorithm is given whose average cumulative loss in n rounds exceeds that of the best path, matched off-line to the entire sequence of the edge weights, by a quantity that is proportional to 1/\sqrt{n} and depends only polynomially on the number of edges of the graph. The algorithm can be implemented with linear complexity in the number of rounds n and in the number of edges. An extension to the so-called label efficient setting is also given, in which the decision maker is informed about the weights of the edges corresponding to the chosen path at a total of m << n time instances. Another extension is shown where the decision maker competes against a time-varying path, a generalization of the problem of tracking the best expert. A version of the multi-armed bandit setting for shortest path is also discussed where the decision maker learns only the total weight of the chosen path but not the weights of the individual edges on the path. Applications to routing in packet switched networks along with simulation results are also presented.

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

↑