LGSISep 1, 2024

Towards Faster Graph Partitioning via Pre-training and Inductive Inference

arXiv:2409.00670v13 citationsh-index: 8Has Code
Originality Incremental advance
AI Analysis

This work addresses the need for efficient graph partitioning in applications like network analysis, but it is incremental as it builds on existing pre-training and refinement techniques.

The paper tackles the problem of faster graph partitioning for large-scale graphs by proposing PR-GPT, a method that uses pre-training on small synthetic graphs and inductive inference to generalize to large graphs, followed by refinement with an efficient method like InfoMap, resulting in faster partitioning without significant quality degradation on the Graph Challenge benchmark.

Graph partitioning (GP) is a classic problem that divides the node set of a graph into densely-connected blocks. Following the IEEE HPEC Graph Challenge and recent advances in pre-training techniques (e.g., large-language models), we propose PR-GPT (Pre-trained & Refined Graph ParTitioning) based on a novel pre-training & refinement paradigm. We first conduct the offline pre-training of a deep graph learning (DGL) model on small synthetic graphs with various topology properties. By using the inductive inference of DGL, one can directly generalize the pre-trained model (with frozen model parameters) to large graphs and derive feasible GP results. We also use the derived partition as a good initialization of an efficient GP method (e.g., InfoMap) to further refine the quality of partitioning. In this setting, the online generalization and refinement of PR-GPT can not only benefit from the transfer ability regarding quality but also ensure high inference efficiency without re-training. Based on a mechanism of reducing the scale of a graph to be processed by the refinement method, PR-GPT also has the potential to support streaming GP. Experiments on the Graph Challenge benchmark demonstrate that PR-GPT can ensure faster GP on large-scale graphs without significant quality degradation, compared with running a refinement method from scratch. We will make our code public at https://github.com/KuroginQin/PRGPT.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes