The paper investigates a failure mode in Graph-JEPA, a joint‑embedding predictive model trained on a large scientific‑reasoning graph. Despite achieving high linear‑probe accuracy and effective rank, the learned representation contains almost no usable instance information, as shown by retrieval metrics. The authors diagnose the issue to variance allocation in the objective, propose a repair that restores near‑perfect information recovery, and demonstrate that the problem persists even after repair, highlighting limitations in the evaluation metrics used.
By Gollam Rabby, S\"oren Auer
arXiv:2606. 11562v1 Announce Type: new Abstract: Graph analysis underlies many applications whose answers cannot be looked up in a single record or retrieved along a path: laundering rings, drug repurposing, user preference, and scientific theme are all inferred from a node together with its neighbourhood.
By Zhuoyi Peng, Jingzhou Jiang, Hanlin Gu, Lixin Fan, Yi Yang
GraphSkillAA introduces an attribution-guided skill-graph framework that organizes external skills into addressable nodes and typed edges, enabling precise selection, execution, failure attribution, and targeted updates. The system uses a Local Gate to retest affected examples and a Big Gate to evaluate the entire updated graph, rolling back any rejected changes. Experiments with GPT‑5.6‑sol show high performance on SearchQA, LiveMath, and DocVQA, demonstrating that object-level attribution and graph-scoped validation make skill graphs locally optimizable, testable, and reversible.
By Ziqiao Shang, Ling-Yue Ge, Lan-Zhe Guo
SynCo is a synthetic graph generator that lets users control node degree distributions and sub‑community structures, addressing limitations of existing generators that rely on power‑law distributions and lack flexibility. It is evaluated on graph mimicking, hyperparameter tuning, and node clustering, outperforming state‑of‑the‑art methods while preserving original data distributions. SynCo can generate large graphs with up to 2.1 million nodes.
By Guilherme Henrique Messias, Mariana Caravanti de Souza, Sylvia Iasulaitis, Alan Dem\'etrius Baria Valejo
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.
By Shengbo Gong, Mohammad Hashemi, Juntong Ni, Carl Yang, Wei Jin
arXiv:2609. 19210v1 Announce Type: cross Abstract: Graph neural networks are widely used for transductive node classification, with accuracy typically measured on randomly drawn train/validation/test splits.
By Naga Venkata Sai Jitin Jami, Thomas Altstidl, Sebastian Hoefler, Jonas Mueller, Dario Zanca, Bjoern Eskofier, Heike Leutheuser
SkillAA (Skill Abductive Attribution) is a structured skill‑optimization framework designed for frozen language models. It represents skill applicability, execution, and composition in a unified graph, enabling skill selection, attribution‑guided repair, and update validation within the same structure. By contrasting successful and failed executions, SkillAA routes candidate repairs to specific graph objects, updates only the selected local structure, and uses Local and Big Gates to screen candidate changes before commitment, achieving high performance on SearchQA, LiveMath, and DocVQA.
By Ziqiao Shang, Ling-Yue Ge, Lan-Zhe Guo
arXiv:2607. 17668v1 Announce Type: cross Abstract: Unsupervised Graph Domain Adaptation (UGDA) aims to facilitate knowledge transfer from a labeled source graph to an unlabeled target graph by mitigating cross-domain distribution shifts.
By Ridong Han, Yawen Shen, Zhongnian Li, Tongfeng Sun, Xinzheng Xu, Abdulmotaleb El Saddik
PACE introduces a propagation‑aware collaborative correction for one‑shot personalized federated graph learning. Each client sends a rank‑r update and a diagonal sketch of message moments, allowing the server to construct a correction that anchors to the receiver’s local model. A convex negative‑log‑likelihood calibration selects a single coefficient to blend local and external logits, improving accuracy and weighted‑F1 on most datasets while preserving local predictions when the correction is unhelpful.
By Ruizhe Huang, Chengran Li, Xiaochuan Shi
arXiv:2609.26063v1 Announce Type: new
Abstract: Federated graph learning (FGL) enables multiple clients to collaboratively train graph models without sharing their private graph data, providing a pro...
By Yinlin Zhu, Di Wu, Wang Luo, Guocong Quan, Miao Hu
ComNetX is a solver‑agnostic hierarchical adaptation framework that localizes dynamic community detection updates by expanding, closing, and contracting affected communities. It preserves the context needed by high‑quality solvers while restricting computation to the changed graph regions. Experiments on six real networks and synthetic streams show that ComNetX maintains modularity close to full recomputation while achieving up to a 41.9× speedup on large graphs.
By Aleksandr Konovalov, Anna Uporova, Alexander Drobyshev, Iaroslav Egorov, Grigoriy Bokov
The paper introduces a feedforward graph architecture that uses several frozen large language models as computational nodes connected through a shared continuous latent space via learned linear projections. By jointly optimizing projection matrices through backpropagation, the system combines the representations of three small frozen models with two larger ones, culminating in a lightweight cross‑attention output node. With only 17.6 M trainable parameters, the architecture attains state‑of‑the‑art results on ARC‑Challenge, OpenBookQA, and MMLU, surpassing both individual constituent models and parameter‑matched learned classifiers.
By Marcus Armstrong, Navid Ayoobi, Arjun Mukherjee