通过融合图结构与模型无关特征,高效筛选高风险测试样本。
Toward Efficient Testing of Graph Neural Networks via Test Input Prioritization
- 引入模型无关特征并利用图结构聚合邻居信息提升属性质量。
- 结合二分类器迭代训练,实现测试输入的精准优先排序。
- 在有限标注预算下显著提升故障发现效率,适合GNN可靠性测试。
图神经网络(GNN)在处理图结构数据方面表现出色,但部署后可能失效,导致严重后果。因此,部署前进行充分测试对保障GNN可靠性至关重要。然而,全面测试需大量人工标注的测试数据。为降低标注成本,战略性地优先标注高质量未标注输入成为关键,可在有限标注预算下揭示更多模型缺陷。现有测试输入优先级技术或忽略图结构中的有价值信息,或过度依赖目标模型提取的模型感知特征,而后者质量波动大。为此,我们提出一种名为GraphRank的新测试输入优先级框架。GraphRank引入模型无关特征以弥补模型感知特征的不足,并利用图结构信息聚合邻近节点的属性,从而增强模型感知与模型无关特征。此外,GraphRank将上述特征与二分类器结合,作为排序模型进行输入优先级排序。该分类器通过迭代训练,可从每轮反馈中学习并持续优化性能。大量实验表明,GraphRank在多个数据集上均优于现有方法。
原文摘要 · Abstract (English)
Graph Neural Networks (GNNs) have demonstrated remarkable efficacy in handling graph-structured data; however, they exhibit failures after deployment, which can cause severe consequences. Hence, conducting thorough testing before deployment becomes imperative to ensure the reliability of GNNs. However, thorough testing requires numerous manually annotated test data. To mitigate the annotation cost, strategically prioritizing and labeling high-quality unlabeled inputs for testing becomes crucial, which facilitates uncovering more model failures with a limited labeling budget. Unfortunately, existing test input prioritization techniques either overlook the valuable information contained in graph structures or are overly reliant on attributes extracted from the target model, i.e., model-aware attributes, whose quality can vary significantly. To address these issues, we propose a novel test input prioritization framework, named GraphRank, for GNNs. GraphRank introduces model-agnostic attributes to compensate for the limitations of the model-aware ones. It also leverages the graph structure information to aggregate attributes from neighboring nodes, thereby enhancing the model-aware and model-agnostic attributes. Furthermore, GraphRank combines the above attributes with a binary classifier, using it as a ranking model to prioritize inputs. This classifier undergoes iterative training, which enables it to learn from each round's feedback and improve its performance accordingly. Extensive experiments demonstrate GraphRank's superiority over existing techniques.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。