Contrastive Enhanced Knowledge Distillation for Learning MLPs on GNNs

In recent years, graph neural networks (GNNs) have emerged as a promising approach for classifying non-Euclidean structural data. However, the practical implementation of GNNs faces challenges related to their limited scalability due to the presence of multi-hop data dependencies. In order to tackle this issue, existing methods have employed teacher GNNs to generate labels, which are then used to train multilayer perceptrons (MLPs) based solely on node features, without considering any structural information. However, these methods primarily focus on the soft labels generated by the teacher GNNs, leading to suboptimal performance because they disregard significant features of the teacher GNNs. Additionally, since the structural information of the graph is omitted in the input of MLPs, it can be more susceptible to the influence of erroneous features. To address these limitations, this paper proposes a novel framework that incorporates a new distillation strategy to integrate soft feature similarity into MLPs, while also utilizing contrastive learning to enhance the training of student MLPs. Our model has accuracy, averaged over seven public datasets, 5.21% higher than state-of-the-art (SOTA) methods, and even 2.49% higher than teacher GNNs over five standard scaled datasets. At the same time, its inference time is only 1.17% of comparable GNNs.

Authors

Institutions

Publication Details

Journal
Neural Processing Letters
Published
2025-07-16
DOI
https://doi.org/10.1007/s11063-025-11778-2
Citations
1
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Contrastive Enhanced Knowledge Distillation for Learning MLPs on GNNs

Xiaolan Tang, Wei Hu, Juhua Pu, Xingwu Liu
1 citations
Neural Processing Letters
Topic Modeling
2.48
article

Contrastive Enhanced Knowledge Distillation for Learning MLPs on GNNs

Xiaolan Tang, Wei Hu, Juhua Pu, Xingwu Liu
article en
1 citations

Abstract

In recent years, graph neural networks (GNNs) have emerged as a promising approach for classifying non-Euclidean structural data. However, the practical implementation of GNNs faces challenges related to their limited scalability due to the presence of multi-hop data dependencies. In order to tackle this issue, existing methods have employed teacher GNNs to generate labels, which are then used to train multilayer perceptrons (MLPs) based solely on node features, without considering any structural information. However, these methods primarily focus on the soft labels generated by the teacher GNNs, leading to suboptimal performance because they disregard significant features of the teacher GNNs. Additionally, since the structural information of the graph is omitted in the input of MLPs, it can be more susceptible to the influence of erroneous features. To address these limitations, this paper proposes a novel framework that incorporates a new distillation strategy to integrate soft feature similarity into MLPs, while also utilizing contrastive learning to enhance the training of student MLPs. Our model has accuracy, averaged over seven public datasets, 5.21% higher than state-of-the-art (SOTA) methods, and even 2.49% higher than teacher GNNs over five standard scaled datasets. At the same time, its inference time is only 1.17% of comparable GNNs.

Neural Processing LettersVol. 57(4)
Dalian University of Technology (CN), Dalian University (CN), Beijing Academy of Artificial Intelligence (CN), National Institute for Education (SK), Beihang University (CN), Capital Normal University (CN)
Capital Normal University, National Natural Science Foundation of China
Openalex Percentile: Top 9%
Topic Modeling
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.