PulseAugur
实时 19:03:05

新的研究基准和方法推动图神经网络的评估和设计

几篇最新的arXiv论文探讨了图神经网络(GNNs)的进展和挑战。研究内容包括验证GNN归属和检测仿冒模型的方法,以及开发用于评估知识图谱构建和GNN性能的统一基准。其他工作则侧重于对抗性GNNs的标准化评估协议、用于缓解过挤压和过平滑的图重连技术调查、自适应节点特征选择,以及一个名为Grothendieck Graph Neural Networks的新代数框架,该框架超越了传统的基于邻域的聚合。 AI

影响 这些论文共同推动了对GNNs的理解和能力,有可能带来更强大、更具可解释性和更优越的基于图的AI系统。

排序理由 多篇arXiv论文发表,涉及图神经网络的各个方面,包括验证、基准测试、对抗鲁棒性和架构改进。

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 8 个来源。 我们如何撰写摘要 →

新的研究基准和方法推动图神经网络的评估和设计

报道来源 [8]

  1. arXiv cs.LG TIER_1 English(EN) · Rahul Nandakumar, Deepayan Chakrabarti ·

    COPYCOP: Ownership Verification for Graph Neural Networks

    arXiv:2605.05360v1 Announce Type: new Abstract: Given two GNNs that output node embeddings, how can we determine if they were trained independently? An adversary could have trained one GNN specifically to mimic the other GNN's embeddings. To obscure this relationship between the …

  2. arXiv cs.LG TIER_1 English(EN) · Tran Gia Bao Ngo, Zulfikar Alom, Federico Errica, Murat Kantarcioglu, Cuneyt Gurcan Akcora ·

    Adversarial Graph Neural Network Benchmarks: Towards Practical and Fair Evaluation

    arXiv:2605.05534v1 Announce Type: new Abstract: Adversarial learning and the robustness of Graph Neural Networks (GNNs) are topics of widespread interest in the machine learning community, as documented by the number of adversarial attacks and defenses designed for these purposes…

  3. arXiv cs.LG TIER_1 English(EN) · Othmane Kabal, Mounira Harzallah, Fabrice Guillet, Hideaki Takeda, Ryutaro Ichise ·

    A Unified Benchmark for Evaluating Knowledge Graph Construction Methods and Graph Neural Networks

    arXiv:2605.05476v1 Announce Type: new Abstract: Knowledge graphs automatically constructed from text are increasingly used in real-world applications. However, their inherent noise, fragmentation, and semantic inconsistencies significantly affect the performance of Graph Neural N…

  4. arXiv cs.LG TIER_1 English(EN) · Hugo Attali, Nathalie Pernelle, Davide Buscaldi, Fragkiskos D. Malliaros ·

    Graph Rewiring in GNNs to Mitigate Over-Squashing and Over-Smoothing: A Survey

    arXiv:2605.00951v1 Announce Type: new Abstract: Graph Neural Networks are powerful models for learning from graph-structured data, yet their effectiveness is often limited by two critical challenges: over-squashing, where information from distant nodes is excessively compressed, …

  5. arXiv cs.LG TIER_1 English(EN) · Ali Azizpour, Madeline Navarro, Santiago Segarra ·

    Adaptive Node Feature Selection For Graph Neural Networks

    arXiv:2510.03096v2 Announce Type: replace Abstract: We propose an adaptive node feature selection approach for graph neural networks (GNNs) that identifies and removes unnecessary features during training. The ability to measure how features contribute to model output is key for …

  6. arXiv cs.LG TIER_1 English(EN) · Hugo Attali, Davide Buscaldi, Nathalie Pernelle, Fragkiskos D. Malliaros ·

    Graph Rewiring in GNNs to Mitigate Over-Squashing and Over-Smoothing: A Survey

    arXiv:2411.17429v2 Announce Type: replace Abstract: Graph Neural Networks are powerful models for learning from graph-structured data, yet their effectiveness is often limited by two critical challenges: over-squashing, where information from distant nodes is excessively compress…

  7. arXiv cs.AI TIER_1 English(EN) · Kieran Maguire, Srinandan Dasmahapatra ·

    Mini-Batch Class Composition Bias in Link Prediction

    arXiv:2604.25978v1 Announce Type: cross Abstract: Prior work on node classification has shown that Graph Neural Networks (GNNs) can learn representations that transfer across graphs, when underlying graph properties are shared. For a fixed graph, one would then expect GNNs traine…

  8. arXiv cs.LG TIER_1 English(EN) · Amirreza Shiralinasab Langari, Leila Yeganeh, Kim Khoa Nguyen ·

    Grothendieck Graph Neural Networks Framework: An Algebraic Platform for Crafting Topology-Aware GNNs

    arXiv:2412.08835v2 Announce Type: replace Abstract: Graph Neural Networks (GNNs) are almost universally built on a single primitive: the neighborhood. Regardless of architectural variations, message passing ultimately aggregates over neighborhoods, which intrinsically limits expr…