渡线
计算机科学
粒度
图形
进化算法
人工智能
进化计算
人工神经网络
理论计算机科学
卷积神经网络
机器学习
操作系统
作者
Yun Huang,Chaobo Zhang,Junli Wang
标识
DOI:10.1109/smc53654.2022.9945338
摘要
Recently, Graph Neural Networks (GNNs) have shown great promise in addressing various tasks with non-Euclidean data. Encouraged by the successful application on discovering convolutional and recurrent neural networks, Neural Architecture Search (NAS) is extended to alleviate the complexity of designing appropriate task-specific GNNs. Unfortunately, existing graph NAS methods are usually susceptible to unscalable depth, redundant computation, constrained search space and some other limitations. In this paper, we present an evolutionary graph neural network architecture search strategy, involving inheritance, crossover and mutation operators based on fine-grained atomic operations. Specifically, we design two novel crossover operators at different granularity levels, GNNCross and LayerCross. Experiments on three different graph learning tasks indicate that the neural architectures generated by our method exhibit comparable performance to the handcrafted and automated baseline GNN models.
科研通智能强力驱动
Strongly Powered by AbleSci AI