arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.06608cs.LG
收藏

图神经网络的聚集邻域搜索

Search to aggregate neighborhood for graph neural network

Paradigm Inc.(第四范式公司);Tsinghua University(清华大学)

Huan Zhao, Quanming Yao, Weiwei Tu

摘要:

近年来,图神经网络(GNN)在各种场景中得到了普及和成功。为了获得数据特定的GNN架构,研究人员转向神经架构搜索(NAS),它在发现卷积神经网络中的有效架构方面取得了令人印象深刻的成功。然而,由于搜索空间设计中的挑战和现有NAS方法的昂贵搜索成本,将NAS方法应用于GNN是不平凡的。在这项工作中,为了获得特定于数据的GNN架构并解决NAS方法所面临的计算挑战,我们提出了一个框架,该框架试图搜索聚合邻域(SANE),以自动设计特定于数据的GNN架构。通过设计一个新颖的和有表现力的搜索空间,我们提出了一个可微的搜索算法,这是更有效的比以前的强化学习的方法。在四个任务和七个真实数据集上的实验结果表明,SANE与现有的GNN模型和NAS方法相比,在有效性和效率方面具有优越性。(Code可在以下网址获得:https://github.com/AutoML-4Paradigm/SANE)。

英文摘要:

Recent years have witnessed the popularity and success of graph neural networks (GNN) in various scenarios. To obtain data-specific GNN architectures, researchers turn to neural architecture search (NAS), which has made impressive success in discovering effective architectures in convolutional neural networks. However, it is non-trivial to apply NAS approaches to GNN due to challenges in search space design and the expensive searching cost of existing NAS methods. In this work, to obtain the data-specific GNN architectures and address the computational challenges facing by NAS approaches, we propose a framework, which tries to Search to Aggregate NEighborhood (SANE), to automatically design data-specific GNN architectures. By designing a novel and expressive search space, we propose a differentiable search algorithm, which is more efficient than previous reinforcement learning based methods. Experimental results on four tasks and seven real-world datasets demonstrate the superiority of SANE compared to existing GNN models and NAS approaches in terms of effectiveness and efficiency. (Code is available at: https://github.com/AutoML-4Paradigm/SANE).

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

↑