arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.12646cs.LGstat.ML
收藏

图学习在组合优化中的应用

Graph Learning for Combinatorial Optimization: A Survey of State-of-the-Art

Yun Peng, Byron Choi, Jianliang Xu

摘要:

图在许多应用中被广泛用于表示复杂数据。高效的图分析对于基于图的应用是非常重要的。然而,大多数图分析任务是组合优化(CO)问题,这是NP难的。最近的研究集中在使用机器学习(ML)来解决基于图的CO问题的潜力。大多数最近的方法遵循两阶段框架。第一阶段是图表示学习,它将图嵌入到低维向量中。第二阶段使用ML来解决CO问题,使用第一阶段中学习的图的嵌入。第一阶段的工作可以分为两类,图嵌入(GE)方法和端到端(E2 E)学习方法。对于GE方法,学习图嵌入有自己的目标,可能不依赖于要解决的CO问题。CO问题由独立的下游任务解决。对于E2 E学习方法,图嵌入的学习没有自己的目标,并且是解决CO问题的学习过程的中间步骤。第二阶段的工作也可以分为两类,非自回归方法和自回归方法。非自回归方法预测一个CO问题的解决方案。非自回归方法预测表示每个节点/边是CO问题的解决方案的一部分的概率的矩阵。解可以从矩阵中计算出来。自回归方法迭代地逐步扩展部分解。在每一步中,自回归方法预测一个节点/边缘条件的当前部分解决方案,这是用来其扩展。在这项调查中,我们提供了一个全面的概述最近的研究基于图学习的CO方法。调查最后对未来的研究方向提出了几点意见。

英文摘要:

Graphs have been widely used to represent complex data in many applications. Efficient and effective analysis of graphs is important for graph-based applications. However, most graph analysis tasks are combinatorial optimization (CO) problems, which are NP-hard. Recent studies have focused a lot on the potential of using machine learning (ML) to solve graph-based CO problems. Most recent methods follow the two-stage framework. The first stage is graph representation learning, which embeds the graphs into low-dimension vectors. The second stage uses ML to solve the CO problems using the embeddings of the graphs learned in the first stage. The works for the first stage can be classified into two categories, graph embedding (GE) methods and end-to-end (E2E) learning methods. For GE methods, learning graph embedding has its own objective, which may not rely on the CO problems to be solved. The CO problems are solved by independent downstream tasks. For E2E learning methods, the learning of graph embeddings does not have its own objective and is an intermediate step of the learning procedure of solving the CO problems. The works for the second stage can also be classified into two categories, non-autoregressive methods and autoregressive methods. Non-autoregressive methods predict a solution for a CO problem in one shot. A non-autoregressive method predicts a matrix that denotes the probability of each node/edge being a part of a solution of the CO problem. The solution can be computed from the matrix. Autoregressive methods iteratively extend a partial solution step by step. At each step, an autoregressive method predicts a node/edge conditioned to current partial solution, which is used to its extension. In this survey, we provide a thorough overview of recent studies of the graph learning-based CO methods. The survey ends with several remarks on future research directions.

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

↑