Boosting Graph Neural Networks via Adaptive Knowledge Distillation
Abstract
Graph neural networks (GNNs) have shown remarkable performance on diverse graph mining tasks. While sharing the same message passing framework, our study shows that different GNNs learn distinct knowledge from the same graph. This implies potential performance improvement by distilling the complementary knowledge from multiple models. However, knowledge distillation (KD) transfers knowledge from high-capacity teachers to a lightweight student, which deviates from our scenario: GNNs are often shallow. To transfer knowledge effectively, we need to tackle two challenges: how to transfer knowledge from compact teachers to a student with the same capacity; and, how to exploit student GNN's own learning ability. In this paper, we propose a novel adaptive KD framework, called BGNN, which sequentially transfers knowledge from multiple GNNs into a student GNN. We also introduce an adaptive temperature module and a weight boosting module. These modules guide the student to the appropriate knowledge for effective learning. Extensive experiments have demonstrated the effectiveness of BGNN. In particular, we achieve up to 3.05\
Benchmark Results
Tested on 2 datasets
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 44 | GCN | 0.8033
±0.0088 | |
| 184 | GCN BGNN(m)-TS | 0.7487
±0.0025 | This paper |
| 193 | GAT BGNN(m)-CS | 0.7470
±0.0008 | This paper |
| 196 | SAGE BGNN(m)-TC | 0.7467
±0.0033 | This paper |
| 200 | GAT BGNN | 0.7453
±0.0029 | This paper |
| 208 | SAGE BGNN(m)-CT | 0.7440
±0.0016 | This paper |
| 220 | GAT BGNN(m)-SC | 0.7420
±0.0008 | This paper |
| 236 | SAGE BGNN | 0.7390
±0.0016 | This paper |
| 238 | GCN BGNN | 0.7387
±0.0024 | This paper |
| 265 | GCN BGNN(m)-ST | 0.7360
±0.0014 | This paper |
| 320 | SAGE BAN | 0.7310
±0.0057 | This paper |
| 348 | GAT BAN | 0.7290
±0.0008 | This paper |
| 350 | MLP | 0.7289
±0.0010 | |
| 359 | GCN LSP | 0.7277
±0.0034 | This paper |
| 385 | GCN KD | 0.7259
±0.0028 | This paper |
| 386 | SAGE KD | 0.7258
±0.0032 | This paper |
| 388 | GAT KD | 0.7252
±0.0020 | This paper |
| 404 | GCN BAN | 0.7247
±0.0021 | This paper |
| 405 | GAT NoKD | 0.7246
±0.0075 | This paper |
| 407 | Ensemble | 0.7243
±0.0026 | prev best: AutoGL: A Library for Automated Graph Learning (ICLR 2021) |
| 425 | GCN MulDE | 0.7233
±0.0009 | This paper |
| 433 | GCN NoKD | 0.7230
±0.0021 | This paper |
| 469 | GAT LSP | 0.7190
±0.0036 | This paper |
| 495 | SAGE NoKD | 0.7162
±0.0033 | This paper |
| 525 | SAGE LSP | 0.7137
±0.0034 | This paper |
| 536 | GAT MulDE | 0.7123
±0.0019 | This paper |
| 658 | SAGE MulDE | 0.6883
±0.0034 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 18 | GCN | 0.9296
±0.0015 | |
| 210 | MLP | 0.8690
±0.0074 | |
| 379 | GCN BGNN(m)-TS | 0.8090 | This paper |
| 393 | GCN BGNN | 0.8073
±0.0025 | This paper |
| 423 | GAT BGNN(m)-SC | 0.8030
±0.0017 | This paper |
| 435 | GCN BGNN(m)-ST | 0.8020
±0.0008 | This paper |
| 470 | GCN BAN | 0.7987
±0.0021 | This paper |
| 472 | GAT BGNN | 0.7983
±0.0012 | This paper |
| 473 | GAT BGNN(m)-CS | 0.7983
±0.0005 | This paper |
| 495 | GCN KD | 0.7960
±0.0067 | This paper |
| 501 | GAT BAN | 0.7957
±0.0012 | This paper |
| 504 | GAT LSP | 0.7953
±0.0026 | This paper |
| 534 | GCN NoKD | 0.7940
±0.0056 | This paper |
| 541 | GAT NoKD | 0.7936
±0.0019 | This paper |
| 554 | SAGE BGNN(m)-TC | 0.7923
±0.0005 | This paper |
| 578 | SAGE BGNN(m)-CT | 0.7910
±0.0008 | This paper |
| 584 | SAGE BGNN | 0.7903
±0.0009 | This paper |
| 601 | GCN LSP | 0.7893
±0.0038 | This paper |
| 602 | GAT KD | 0.7891
±0.0018 | This paper |
| 624 | GCN MulDE | 0.7873
±0.0009 | This paper |
| 638 | Ensemble | 0.7850
±0.0040 best reported | best at pub: AutoGL: A Library for Automated Graph Learning (ICLR 2021) best today: Automated Graph Machine Learning: Approaches, Libraries, Benchmarks and Directions (2022) Difference within reported uncertainty; not counted as underperformance. |
| 651 | GAT MulDE | 0.7840
±0.0008 | This paper |
| 665 | SAGE MulDE | 0.7813
±0.0034 | This paper |
| 678 | SAGE NoKD | 0.7800
±0.0023 | This paper |
| 691 | SAGE BAN | 0.7790
±0.0008 | This paper |
| 720 | SAGE LSP | 0.7740
±0.0022 | This paper |
| 724 | SAGE KD | 0.7725
±0.0039 | This paper |
