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.
By Yuhang Song, Naima Abrar Shami, Romaric Duvignau, Vasiliki Kalavri
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.
By Sai Karthik Navuluru, Siddhartha Shankar Das, Franck Dernoncourt, S M Ferdous, Ryan A. Rossi, Nesreen K. Ahmed, Baris Coskunuzer, Alex Pothen, Lakshman Tamil, Mahantesh M Halappanavar
arXiv:2605. 15511v2 Announce Type: replace Abstract: Graph Neural Networks (GNNs) have become the dominant framework for inductive graph-level learning.
By Louisa Cornelis, Johan Mathe, Louis Van Langendonck, Guillermo Bern\'ardez, Nina Miolane
arXiv:2609.37057v1 Announce Type: new
Abstract: Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeat...
By Dooho Lee, Jinmo Lee, Minho Jeong, Kijung Shin, Jaemin Yoo
The paper introduces Kernel-Anticipated Unlearning (KAU), a method for approximate unlearning of knowledge-graph embeddings that accounts for relearning during continued training. KAU uses the tangent kernel to model how forgotten facts’ scores change, expressing this response in closed form and guiding edits to minimize future leakage. Experiments show KAU reduces leakage by 46‑63% on FB15k-237 and 50‑82% on CoDEx-L compared to the strongest existing unlearner, while preserving higher utility.
By Parnian Fazel, Mohammad M Maheri, Hamed Haddadi
MUGEN is a framework that generates unlearnable graph examples capable of protecting multiple downstream tasks—node classification, graph classification, and link prediction—simultaneously. It achieves this by perturbing a single clean dataset with a shared GNN encoder and task‑specific heads, guided by a Task‑Aligned Separability Objective (TASO) and a Type‑Adaptive Perturbation (TAP) that handles both discrete and continuous node attributes. Experiments on five benchmarks, four GNN backbones, and three learning paradigms show that MUGEN’s perturbations transfer across models and remain effective even under adversarial training and data augmentation.
By Ziyan Liu, Chengshuai Zhao, Huan Liu