arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.16979cs.LG
收藏

何时我们需要将图神经网络用于节点分类?

When Do We Need Graph Neural Networks for Node Classification?

McGill University(麦吉尔大学);Mila(米拉研究所);DeepMind

Sitao Luan, Chenqing Hua, Qincheng Lu, Jiaqi Zhu, Xiao-Wen Chang, Doina Precup

AI总结:

本研究针对图神经网络(GNNs)在部分节点分类任务中性能提升有限甚至不如无图神经网络的问题,基于图信号处理与统计假设检验提出两项度量指标,可通过阈值预测感知图模型相对无图模型的潜在性能优势。

摘要:

图神经网络(GNNs)基于关系归纳偏置(边偏置)额外利用图结构,而非将节点视为独立同分布(i.i.d.)样本的集合,以此对基础神经网络(NNs)进行扩展。尽管人们认为GNNs在现实任务中表现优于基础NNs,但研究发现在部分场景下,GNNs的性能提升极小,甚至表现不如不依赖图的NNs。为明确这类场景,我们基于图信号处理与统计假设检验,提出两项度量指标,用于分析特征与标签中的边偏置无法带来性能优势的情况。基于这些度量指标,可给出一个阈值,用于预测感知图的模型相较于不依赖图的模型的潜在性能优势。

英文摘要:

Graph Neural Networks (GNNs) extend basic Neural Networks (NNs) by additionally making use of graph structure based on the relational inductive bias (edge bias), rather than treating the nodes as collections of independent and identically distributed (i.i.d.) samples. Though GNNs are believed to outperform basic NNs in real-world tasks, it is found that in some cases, GNNs have little performance gain or even underperform graph-agnostic NNs. To identify these cases, based on graph signal processing and statistical hypothesis testing, we propose two measures which analyze the cases in which the edge bias in features and labels does not provide advantages. Based on the measures, a threshold value can be given to predict the potential performance advantages of graph-aware models over graph-agnostic models.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑