用测试时增强提升图数据主动学习的可靠性与效率
GATTA: Graph Active Learning with Test-Time Augmentation

- 通过多视图预测聚合增强不确定性估计
- 简单方法如熵值法经增强后媲美复杂高耗时方法
- 适合追求高效部署的图学习实践者
测试时增强(TTA)在计算机视觉中已被证明能提升模型鲁棒性与不确定性估计,但在图结构数据上的应用仍不充分。本文提出GATTA(Graph Active Learning with Test-Time Augmentation),通过聚合多个增强视图的预测结果,获得更可靠的不确定性估计。为应对标签保持型图增强的挑战,GATTA引入基于一致性的过滤机制,剔除产生不可靠预测的增强视图。我们在多个图数据集、GNN架构和采样策略下系统评估GATTA。结果表明,简单的不确定性方法(如熵值、最小置信度)最受益于TTA,性能达到甚至超越更复杂且计算成本更高的方法。GATTA在不同架构间具有泛化能力,优于模型侧集成方法(如MC Dropout)。此外,其在集成规模和图大小上均表现出良好可扩展性。对增强类型、优势及过滤策略的深入分析提供了实用部署指南。研究显示,通过TTA增强简单方法,比设计复杂采样函数更能高效实现强主动学习性能,使从业者以更低计算开销和更少实现复杂度获得优异结果。
原文摘要 · Abstract (English)
Test-time augmentation (TTA) has proven effective for improving model robustness and uncertainty estimation in computer vision, yet its application to graph-structured data remains largely unexplored. We introduce GATTA (Graph Active Learning with Test-Time Augmentation), a framework for enhancing active learning by aggregating predictions across multiple augmented views to produce more reliable uncertainty estimates. To address the challenge of label-preserving graph augmentations, GATTA incorporates a consistency-based filtering mechanism that discards augmented views yielding unreliable predictions. We systematically evaluate GATTA across multiple graph datasets, GNN architectures, and acquisition strategies. Our results show that simple uncertainty-based methods, such as Entropy and Least Confidence, benefit most from TTA, achieving performance competitive with more sophisticated and computationally expensive approaches. GATTA generalizes across architectures, outperforms model-side ensemble methods such as MC Dropout. We further show that GATTA scales efficiently with both ensemble size and graph size. Extensive analysis of augmentation types, strengths, and filtering strategies provides practical guidelines for effective deployment. Our findings demonstrate that augmenting simple methods with TTA offers a more efficient path to strong active learning performance than engineering complex acquisition functions, enabling practitioners to achieve competitive results with lower computational overhead and reduced implementation complexity.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。