arXiv:2507.18804cs.LG2025-07

提出轻量级方法Ralts,提升GNN在硬件位翻转错误下的鲁棒性。

Ralts: Robust Aggregation for Enhancing Graph Neural Network Resilience on Bit-flip Errors

  • 利用图相似性过滤异常,修复受损拓扑结构
  • 权重或嵌入出错时准确率提升至少20%,邻接矩阵出错时提升10%
  • 可无缝集成到任意消息传递GNN,效率接近PyTorch Geometric原生函数

图神经网络(GNN)已广泛应用于金融、医疗等安全关键场景,其预测失误可能引发灾难性后果。现有研究多聚焦软件层面威胁,而硬件故障尤其是由先进制程带来的瞬态故障导致的位翻转与无声数据损坏仍鲜被关注。针对此问题,本文首先对GNN在位翻转错误下的鲁棒性进行系统分析,揭示未来可靠高效GNN系统的优化空间。其次提出Ralts,一种通用且轻量的解决方案,通过多种图相似性度量筛选异常并恢复受损图结构,并将保护机制直接嵌入聚合函数,适用于任何消息传递型GNN。实验表明,在3×10⁻⁵误码率(BER)下,当模型权重或节点嵌入出错时,预测准确率提升至少20%;邻接矩阵出错时提升至少10%。该方法在PyTorch Geometric中实现的执行效率与原生聚合函数相当。

原文摘要 · Abstract (English)

Graph neural networks (GNNs) have been widely applied in safety-critical applications, such as financial and medical networks, in which compromised predictions may cause catastrophic consequences. While existing research on GNN robustness has primarily focused on software-level threats, hardware-induced faults and errors remain largely underexplored. As hardware systems progress toward advanced technology nodes to meet high-performance and energy efficiency demands, they become increasingly susceptible to transient faults, which can cause bit flips and silent data corruption, a prominent issue observed by major technology companies (e.g., Meta and Google). In response, we first present a comprehensive analysis of GNN robustness against bit-flip errors, aiming to reveal system-level optimization opportunities for future reliable and efficient GNN systems. Second, we propose Ralts, a generalizable and lightweight solution to bolster GNN resilience to bit-flip errors. Specifically, Ralts exploits various graph similarity metrics to filter out outliers and recover compromised graph topology, and incorporates these protective techniques directly into aggregation functions to support any message-passing GNNs. Evaluation results demonstrate that Ralts effectively enhances GNN robustness across a range of GNN models, graph datasets, error patterns, and both dense and sparse architectures. On average, under a BER of $3\times10^{-5}$, these robust aggregation functions improve prediction accuracy by at least 20\% when errors present in model weights or node embeddings, and by at least 10\% when errors occur in adjacency matrices. Ralts is also optimized to deliver execution efficiency comparable to built-in aggregation functions in PyTorch Geometric.

图神经网络硬件鲁棒性位翻转聚合机制

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。