arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.12911cs.DScs.LG
收藏

学习增强最大流

Learning-Augmented Maximum Flow

EPFL(洛桑联邦理工学院);Jagiellonian University(雅盖隆大学)

Adam Polak, Maksym Zub

摘要:

我们提出了一个框架,通过使用预测来加快最大流计算。预测是一种流,即,将非负流值分配给边,这满足流守恒性质,但不一定尊重实际实例的边容量(因为这些在学习时是未知的)。我们提出了一种算法,该算法在给定$m$ -边缘流网络和预测流的情况下,计算$O(mη)$时间内的最大流,其中$η$是预测的$\ell_1$误差,即,预测流量值和最佳流量值之间的绝对差的边缘上的总和。此外,我们证明了,给定一个Oracle访问流网络上的分布,可以有效地PAC学习预测最小化该分布的预期$\ell_1$错误。我们的结果符合最近的学习增强算法研究路线,其目的是通过使用预测来改善经典算法的最坏情况界限,例如,从以前的类似实例中机器学习。到目前为止,这一领域的主要重点是提高在线问题的竞争率。继Dinitz等人(NeurIPS 2021)之后,我们的结果是第一次改善离线问题的运行时间。

英文摘要:

We propose a framework for speeding up maximum flow computation by using predictions. A prediction is a flow, i.e., an assignment of non-negative flow values to edges, which satisfies the flow conservation property, but does not necessarily respect the edge capacities of the actual instance (since these were unknown at the time of learning). We present an algorithm that, given an $m$-edge flow network and a predicted flow, computes a maximum flow in $O(mη)$ time, where $η$ is the $\ell_1$ error of the prediction, i.e., the sum over the edges of the absolute difference between the predicted and optimal flow values. Moreover, we prove that, given an oracle access to a distribution over flow networks, it is possible to efficiently PAC-learn a prediction minimizing the expected $\ell_1$ error over that distribution. Our results fit into the recent line of research on learning-augmented algorithms, which aims to improve over worst-case bounds of classical algorithms by using predictions, e.g., machine-learned from previous similar instances. So far, the main focus in this area was on improving competitive ratios for online problems. Following Dinitz et al. (NeurIPS 2021), our results are one of the firsts to improve the running time of an offline problem.

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

↑