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.
Decomposable Submodular Function Minimization via Maximum Flow
MIT(麻省理工学院);University of Warsaw(华沙大学);CNRS(法国国家科学研究中心);IRIF(法国信息学研究所);Université de Paris(巴黎大学)
本文桥梁离散和连续优化方法可分解的子模函数最小化,在标准和参数设置。我们为这个问题提供了改进的运行时间,通过减少它到一个最大流的Oracle的调用数量。当分解中的每个函数作用在基集$V$的$O(1)$元素上并且多项式有界时,我们的运行时间达到了多项式对数因子,等于在具有$O(\vert V \vert)$顶点和多项式积分容量的稀疏图中求解最大流的时间。我们实现这一点,通过提供一个简单的迭代法,它可以优化到高精度的任何凸函数定义的次模基多面体,只要我们可以有效地减少它的基础多面体对应于一定的图,我们构造的切割功能。我们解决这个最小化问题的参数切割问题,我们通过一个新的有效的组合减少最大流的解决方案。这种减少是独立的利益,并意味着一些以前未知的界限参数最小$s,t$切割问题在多个设置。
From Incremental Transitive Cover to Strongly Polynomial Maximum Flow
Centrum Wiskunde & Informatica(数学与计算机科学中心);Utrecht University(乌得勒支大学);Massachusetts Institute of Technology(麻省理工学院);Stanford University(斯坦福大学);University of Bonn(波恩大学)
Incremental Approximate Maximum Flow via Residual Graph Sparsification
Faculty of Computer Science, University of Vienna(维也纳大学计算机学院);Institute of Science and Technology Austria (ISTA)(奥地利科学与技术研究所);Technical University Munich(慕尼黑工业大学);UniVie Doctoral School Computer Science DoCS(维也纳大学计算机科学博士学校)