Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement
arXiv:2607. 21885v1 Announce Type: new Abstract: Coarsening-based training for graph neural networks (GNNs), i.
HCPN-GCN is a graph-aware extension of Hierarchical Prototype Networks that replaces linear feature extractors with Graph Convolutional Networks and introduces cone-based prototypes with a diversity regularization objective. This design yields richer graph-aware representations, reduces prototype proliferation, and maintains near-zero forgetting. Experiments on six continual graph learning benchmarks show consistent accuracy improvements over the original HPN and other baselines while using roughly 30× fewer atomic prototypes.
arXiv:2607. 21885v1 Announce Type: new Abstract: Coarsening-based training for graph neural networks (GNNs), i.
arXiv:2608. 02128v1 Announce Type: new Abstract: Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers.
arXiv:2602. 01553v3 Announce Type: replace-cross Abstract: Link prediction is a core challenge in graph machine learning, demanding models that capture rich and complex topological dependencies.
arXiv:2609.25781v1 Announce Type: new Abstract: Graph Incremental Learning has garnered increasing attention as dynamic graph data continues to emerge across diverse fields. Conventional approaches p...
Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers. We show that several existing scalable approaches can be written as structured modifications of the GNN propagation matrix, providing a unified perspective that exposes their respective limitations.
HERO is a heterogeneous continual graph learning framework that preserves historical knowledge at both structural and semantic levels while adapting to new tasks. It uses DiSCo to select representative target nodes and reconstruct compact heterogeneous contexts, and applies multi-level knowledge distillation to align task-conditioned predictions with semantic responses. Experiments on four datasets with three HGNN backbones show HERO achieves best or tied-best average performance while maintaining competitive forgetting.
arXiv:2610.20238v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) excel on graph-structured data but suffer catastrophic forgetting when classes arrive sequentially. In class-incremental g...
arXiv:2601. 19449v2 Announce Type: replace Abstract: Graph neural networks (GNNs) are widely believed to excel at node representation learning through trainable neighborhood aggregations.
arXiv:2607. 10159v1 Announce Type: new Abstract: In real-world multimodal web scenarios, graph-structured data often arrives in a streaming manner, making graph continual learning a crucial paradigm for continuously modeling such evolving structures.
arXiv:2502. 17614v3 Announce Type: replace Abstract: The rapid growth of graph data creates significant scalability challenges as most graph algorithms scale quadratically with size.
arXiv:2607. 03097v1 Announce Type: new Abstract: Heterogeneous Graph Neural Networks (HGNNs) have exhibited remarkable efficacy in modeling complex systems with multiple types of nodes and relations, yet their training on large-scale heterogeneous graphs remains computationally prohibitive.
The paper introduces RGC‑Net, a Reservoir‑Based Graph Convolutional Network that combines fixed‑random reservoir dynamics with a structured convolutional framework for graph learning. It addresses limitations of existing reservoir‑based GNNs by adding a leaky integrator for better feature retention and a robust, adaptable architecture for graph classification and generation. Experiments demonstrate state‑of‑the‑art performance on classification and generative tasks, including dynamic brain connectivity, with faster convergence and reduced over‑smoothing.