Name
Title | ||
|---|---|---|
Learning Continuous Graph Structure with Bilevel Programming for Graph Neural Networks. |
Abstract | ||
|---|---|---|
Learning graph structure for graph neural networks (GNNs) is crucial to facilitate the GNN-based downstream learning tasks. It is challenging due to the non-differentiable discrete graph structure and lack of ground-truth. In this paper, we address these problems and propose a novel graph structure learning framework for GNNs. Firstly, we directly model the continuous graph structure with dual-normalization, which implicitly imposes sparse constraint and reduces the influence of noisy edges. Secondly, we formulate the whole training process as a bilevel programming problem, where the inner objective is to optimize the GNNs given learned graphs, while the outer objective is to optimize the graph structure to minimize the generalization error of downstream task. Moreover, for bilevel optimization, we propose an improved Neumann-IFT algorithm to obtain an approximate solution, which is more stable and accurate than existing optimization methods. Besides, it makes the bilevel optimization process memory-efficient and scalable to large graphs. Experiments on node classification and scene graph generation show that our method can outperform related methods, especially with noisy graphs. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.24963/ijcai.2022/424 | European Conference on Artificial Intelligence |
Keywords | DocType | Citations |
Machine Learning: Hyperparameter Optimization,Computer Vision: Scene analysis and understanding,Data Mining: Mining Graphs | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minyang Hu | 1 | 0 | 0.34 |
| Hong Chang | 2 | 0 | 0.34 |
| Bingpeng Ma | 3 | 651 | 36.63 |
| Shiguang Shan | 4 | 0 | 0.34 |