<p>Graph neural networks (GNNs) have become a prevalent framework for graph tasks. Many recent studies have proposed the use of graph convolution methods over the numerous subgraphs of each graph, known as <i>subgraph graph neural networks</i>. Despite their impressive performance, subgraph GNNs face challenges of both storage and computational inefficiencies due to the vast number and large size of subgraphs. In response to this problem, this paper introduces <Emphasis Type="Underline">E</Emphasis>go-<Emphasis Type="Underline">N</Emphasis>ets-<Emphasis Type="Underline">F</Emphasis>it-<Emphasis Type="Underline">A</Emphasis>ll (ENFA), a model that uniformly takes the small <i>ego nets</i> as subgraphs, thereby providing greater storage and computational efficiency, while at the same time guarantees identical outputs to the original subgraph GNNs. Experiments reveal that ENFA can reduce storage space by 29.0% to 84.5% and improve training efficiency by up to 1.66 ×.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Exact acceleration of subgraph graph neural networks by eliminating computation redundancy

  • Qian Tao,
  • Xiyuan Wang,
  • Muhan Zhang,
  • Shuxian Hu,
  • Wenyuan Yu,
  • Jingren Zhou

摘要

Graph neural networks (GNNs) have become a prevalent framework for graph tasks. Many recent studies have proposed the use of graph convolution methods over the numerous subgraphs of each graph, known as subgraph graph neural networks. Despite their impressive performance, subgraph GNNs face challenges of both storage and computational inefficiencies due to the vast number and large size of subgraphs. In response to this problem, this paper introduces Ego-Nets-Fit-All (ENFA), a model that uniformly takes the small ego nets as subgraphs, thereby providing greater storage and computational efficiency, while at the same time guarantees identical outputs to the original subgraph GNNs. Experiments reveal that ENFA can reduce storage space by 29.0% to 84.5% and improve training efficiency by up to 1.66 ×.