Papers › Graph Entropy Minimization for Semi-supervised Node Classification
Graph Entropy Minimization for Semi-supervised Node Classification
Yi Luo, Guangchun Luo, Ke Qin, Aiguo Chen
Node classifiers are required to comprehensively reduce prediction errors, training resources, and inference latency in the industry. However, most graph neural networks (GNN) concentrate only on one or two of them. The compromised aspects thus are the shortest boards on the bucket, hindering their practical deployments for industrial-level tasks. This work proposes a novel semi-supervised learning method termed Graph Entropy Minimization (GEM) to resolve the three issues simultaneously. GEM benefits its one-hop aggregation from massive uncategorized nodes, making its prediction accuracy comparable to GNNs with two or more hops message passing. It can be decomposed to support stochastic training with mini-batches of independent edge samples, achieving extremely fast sampling and space-saving training. While its one-hop aggregation is faster in inference than deep GNNs, GEM can be further accelerated to an extreme by deriving a non-hop classifier via online knowledge distillation. Thus, GEM can be a handy choice for latency-restricted and error-sensitive services running on resource-constraint hardware. Code is available at https://github.com/cf020031308/GEM.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Node Classification | CiteSeer with Public Split: fixed 20 nodes per class | GEM | Accuracy | 74.2 | #9 of 40 | Archive leaderboard | report |
| Node Classification | CiteSeer with Public Split: fixed 20 nodes per class | OKDEEM | Accuracy | 73.53 | #13 of 40 | Archive leaderboard | report |
| Node Classification | CiteSeer with Public Split: fixed 20 nodes per class | EEM | Accuracy | 72.63 | #25 of 40 | Archive leaderboard | report |
| Node Classification | Cora with Public Split: fixed 20 nodes per class | GEM | Accuracy | 83.05% | #22 of 36 | Archive leaderboard | report |
| Node Classification | PubMed with Public Split: fixed 20 nodes per class | Graph-MLP | Accuracy | 79.91 | #18 of 37 | Archive leaderboard | report |
| Node Classification | PubMed with Public Split: fixed 20 nodes per class | GEM | Accuracy | 78.48 | #25 of 37 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections