arXiv Machine Learning
SHAKE-GNN: Scalable Hierarchical Kirchhoff-Forest Graph Neural Network
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Aug 18
Not All Neighbors Matter: Understanding the Impact of Graph Sparsification on GNN Pipelines
arXiv:2603. 06952v2 Announce Type: replace Abstract: As graphs scale to billions of nodes and edges, graph Machine Learning workloads are constrained by the cost of multi-hop traversals over exponentially growing neighborhoods.
arXiv Machine Learning
Jul 31
Train Small, Deploy Large: Zero-Shot GNN Transfer Through Geometric Renormalization
arXiv:2607. 27767v1 Announce Type: new Abstract: Graph neural networks (GNNs) can operate on large graphs but become infrastructure-sensitive at the scale of millions of nodes and typically require scalable training techniques for even larger graphs.
arXiv Machine Learning
Jun 19
Towards Graph-Based Deep Learning for Map Generalization: Insights from Building Footprints Simplification and Aggregation
arXiv:2606. 19956v1 Announce Type: new Abstract: Map generalization remains one of the fundamental tasks in cartography, especially for the simplification and aggregation of complex building footprints.
arXiv Machine Learning
Oct 8
EDiS: Edge Disjoint Subgraph Sparsification Framework for Graph Neural Networks
The paper introduces EDiS, an Edge‑Disjoint Subgraph sparsification framework that separates a one‑time structural extraction of a graph into cacheable edge‑disjoint subgraphs from the per‑epoch graph composition. By recombining these cached subgraphs under edge‑budget constraints, EDiS avoids repeated sampling or recomputation while allowing varying training graphs across epochs. Experiments on 19 node‑classification benchmarks show that EDiS outperforms 17 baselines in accuracy/ROC‑AUC, achieving the lowest average rank and gap‑to‑best, especially at tight edge budgets.
arXiv Machine Learning
Oct 28
Label Ensemble Perspective for Reduced-Complexity Graph Node Classification under Label Noise
The paper introduces LEGNN, a lower‑complexity Graph Neural Network designed to handle label noise in node classification. LEGNN reframes the problem as a label ensemble task, using random neighbor masks to gather high‑probability label sets and a partial‑label learning strategy to aggregate them, while also collecting low‑probability labels to mitigate noise. Experiments on six datasets show that LEGNN achieves strong classification performance, computational efficiency, and scalability to graphs with over a hundred thousand nodes and one million edges.
arXiv Machine Learning
Sep 7
Physics-Aware Random Walk Fingerprints for Scalable Power Grid Graph Classification
The paper introduces Multi-Channel Physics-Aware Random Walk Fingerprints (MC-PA-RWF), a lightweight graph-level representation that incorporates physical edge states into random-walk propagation for power grid graphs. By constructing multiple edge-weighted channels from domain-relevant attributes and concatenating channel-specific fingerprints, the method achieves high balanced accuracy on PowerGraph benchmarks, outperforming topology-only RWF and matching or surpassing several graph neural network baselines. Experiments on three benchmark systems show statistically significant improvements, with the node-edge extension reaching up to 99.32% balanced accuracy and boosting failure-class F1 scores by 1.60–5.84 percentage points.