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

学习增强的最大独立集

Learning-augmented Maximum Independent Set

Rice University(莱斯大学);Google Research(谷歌研究院);Rutgers University(罗格斯大学);University of Waterloo(滑铁卢大学);Texas A&M University(德克萨斯农工大学)

Vladimir Braverman, Prathamesh Dharangutte, Vihan Shah, Chen Wang

AI总结:

本文研究学习增强的最大独立集问题,利用机器学习预言机以1/2+ε概率回答顶点归属查询,突破近似难度障碍,分别提出O(√Δ/ε)和O(1)近似算法。

摘要:

我们在学习增强算法的框架下研究一般图上的最大独立集(MIS)问题。已知MIS问题是NP难的,并且对于任何$\delta>0$,在$n^{1-\delta}$因子内近似也是NP难的。我们证明,在存在一个通过机器学习模型预测得到的预言机的情况下,我们可以突破这一障碍,该预言机以$1/2+\varepsilon$的概率回答固定MIS的顶点成员查询。在我们考虑的第一种设置中,每个顶点可以查询一次预言机,以了解该顶点是否属于一个固定的MIS,预言机以$1/2+\varepsilon$的概率返回正确答案。在这种设置下,我们展示了一个算法,在$O(m)$时间内获得$\tilde{O}(\sqrt{\Delta}/\varepsilon)$近似,其中$\Delta$是图的最大度。在第二种设置中,我们允许对每个顶点进行多次查询,每次查询以$1/2+\varepsilon$的概率正确。对于这种设置,我们展示了一个$O(1)$近似算法,使用总共$O(n/\varepsilon^2)$次查询和$\tilde{O}(m)$运行时间。

英文摘要:

We study the Maximum Independent Set (MIS) problem on general graphs within the framework of learning-augmented algorithms. The MIS problem is known to be NP-hard and is also NP-hard to approximate to within a factor of $n^{1-δ}$ for any $δ>0$. We show that we can break this barrier in the presence of an oracle obtained through predictions from a machine learning model that answers vertex membership queries for a fixed MIS with probability $1/2+\varepsilon$. In the first setting we consider, the oracle can be queried once per vertex to know if a vertex belongs to a fixed MIS, and the oracle returns the correct answer with probability $1/2 + \varepsilon$. Under this setting, we show an algorithm that obtains an $\tilde{O}(\sqrtΔ/\varepsilon)$-approximation in $O(m)$ time where $Δ$ is the maximum degree of the graph. In the second setting, we allow multiple queries to the oracle for a vertex, each of which is correct with probability $1/2 + \varepsilon$. For this setting, we show an $O(1)$-approximation algorithm using $O(n/\varepsilon^2)$ total queries and $\tilde{O}(m)$ runtime.

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

↑