arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2305.06167cs.LG
收藏

K-SpecPart:用于改进超图划分的监督嵌入算法与割叠加

K-SpecPart: Supervised embedding algorithms and cut overlay for improved hypergraph partitioning

Ismail Bustany, Andrew B. Kahng, Ioannis Koutis, Bodhisatta Pramanik, Zhiang Wang

AI总结:

本文提出监督谱超图划分框架 K-SpecPart,利用广义特征向量、监督降维嵌入和割叠加集成多路方案,在二分与多路划分上分别取得最高15%和20%的割尺寸改进。

摘要:

最先进的超图划分器遵循多级范式,该范式构建多个逐级粗化的超图,用于驱动层次结构每一层上的割细化。多级划分器存在两个局限:(i)超图粗化过程依赖局部邻域结构,而未充分考虑超图的全局结构;(ii)细化启发式方法有陷入局部极小值的风险。本文描述了 K-SpecPart,这是一个用于多路划分的监督谱框架,可直接解决这两个局限。K-SpecPart 依赖广义特征向量计算和监督降维技术来生成顶点嵌入。这些计算原语速度很快,并能捕捉现有划分器未明确考虑的超图全局结构属性。随后,K-SpecPart 将顶点嵌入转换为多个划分方案。K-SpecPart 引入了通过割叠加聚类技术对多个方案进行“集成”的思想,该技术通常能够支持使用 ILP(整数线性规划)等计算需求较高的划分方法。通过将标准划分器的输出作为监督提示,K-SpecPart 有效地结合了成熟多级划分技术的优势与谱图理论及其他组合算法的益处。K-SpecPart 显著扩展了我们先前关于二分划分器 SpecPart 的工作中首次提出的思想和算法。实验证明了 K-SpecPart 的有效性。对于二分划分,K-SpecPart 生成的方案相比 SpecPart 最高实现 15% 的割尺寸改进。对于多路划分,K-SpecPart 生成的方案相比领先划分器 hMETIS 和 KaHyPar 最高实现 20% 的割尺寸改进。

英文摘要:

State-of-the-art hypergraph partitioners follow the multilevel paradigm that constructs multiple levels of progressively coarser hypergraphs that are used to drive cut refinement on each level of the hierarchy. Multilevel partitioners are subject to two limitations: (i) hypergraph coarsening processes rely on local neighborhood structure without fully considering the global structure of the hypergraph; and (ii) refinement heuristics risk entrapment in local minima. In this paper, we describe K-SpecPart, a supervised spectral framework for multi-way partitioning that directly tackles these two limitations. K-SpecPart relies on the computation of generalized eigenvectors and supervised dimensionality reduction techniques to generate vertex embeddings. These are computational primitives that are fast and capture global structural properties of the hypergraph that are not explicitly considered by existing partitioners. K-SpecPart then converts the vertex embeddings into multiple partitioning solutions. K-SpecPart introduces the idea of ''ensembling'' multiple solutions via a cut-overlay clustering technique that often enables the use of computationally demanding partitioning methods such as ILP (integer linear programming). Using the output of a standard partitioner as a supervision hint, K-SpecPart effectively combines the strengths of established multilevel partitioning techniques with the benefits of spectral graph theory and other combinatorial algorithms. K-SpecPart significantly extends ideas and algorithms that first appeared in our previous work on the bipartitioner SpecPart. Our experiments demonstrate the effectiveness of K-SpecPart. For bipartitioning, K-SpecPart produces solutions with up to 15% cutsize improvement over SpecPart. For multi-way partitioning, K-SpecPart produces solutions with up to 20% cutsize improvement over leading partitioners hMETIS and KaHyPar.

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

↑