Go to file
ZW-ZHANG 21c2d1a8c7 fix bug 2023-01-19 21:23:34 +08:00
nas-bench-graph tune 2022-08-13 15:43:47 +08:00
LICENSE Initial commit 2022-06-09 20:21:19 +08:00
README.md fix bug 2023-01-19 21:23:34 +08:00
README_en.md Add Chinese readme 2023-01-19 21:20:56 +08:00
setup.py Create setup.py 2022-08-13 15:38:58 +08:00

README_en.md

NAS-Bench-Graph

This repository provides the official codes and all evaluated architectures for NAS-Bench-Graph, a tailored benchmark for graph neural architecture search.

Yijian Qin, Ziwei Zhang, Xin Wang, Zeyang Zhang, Wenwu Zhu, NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search (NeurIPS 2022)

Install from PyPI

You can directly install our benchmark by pip install nas_bench_graph

Usage

First, read the benchmark of a certain dataset by specifying the name. The nine supported datasets are: cora, citeseer, pubmed, cs, physics, photo, computers, arxiv, and proteins. For example, for the Cora dataset:

from nas_bench_graph import lightread
bench = lightread('cora')

The data is stored as a dict in Python.

Then, an architecture needs to be specified by its macro space and operations. We consider the macro space as a directed acyclic graph (DAG) and constrain the DAG to have only one input node for each intermediate node. Therefore, the macro space can be specificed by a list of integers, indicating the input node index for each computing node (0 for the raw input, 1 for the first computing node, etc.). Then, the operations can be specified by a list of strings with the same length. For example, we provide the code to specify the architecture in the following figure: arch

from nas_bench_graph import Arch
arch = Arch([0, 1, 2, 1], ['gcn', 'gin', 'fc', 'cheb'])
# 0 means the inital computing node is connected to the input node
# 1 means the next computing node is connected to the first computing node
# 2 means the next computing node is connected to the second computing node 
# 1 means there is another computing node connected to the first computing node

Notice that we assume all leaf nodes (i.e., nodes without descendants) are connected to the output, so there is no need to specific the output node.

Besides, the list can be specified in any order, e.g., the following code can specific the same architecture:

arch = Arch([0, 1, 1, 2], ['gcn', 'cheb', 'gin', 'fc'])

The benchmark data can be obtained by a look-up table. In this repository, we only provide the validation and test performance, the latency, and the number of parameters as follows:

info = bench[arch.valid_hash()]
info['valid_perf']   # validation performance
info['perf']         # test performance
info['latency']      # latency
info['para']         # number of parameters

For the complete benchmark, please downloadfrom https://figshare.com/articles/dataset/NAS-bench-Graph/20070371, which contains the training/validation/testing performance at each epoch. Since we run each dataset with three random seeds, each dataset has 3 files, e.g.,

from nas_bench_graph import read
bench = read('cora0.bench')   # cora1.bench and cora2.bench 

The full metric for any epoch can be obtained as follows.

info = bench[arch.valid_hash()]
epoch = 50
info['dur'][epoch][0]   # training performance
info['dur'][epoch][1]   # validation performance
info['dur'][epoch][2]   # testing performance
info['dur'][epoch][3]   # training loss
info['dur'][epoch][4]   # validation loss
info['dur'][epoch][5]   # testing loss
info['dur'][epoch][6]   # best performance

Example usage of NNI and AutoGL

NAS-Bench-Graph can be used together with other libraries such AutoGL and NNI.

For the usage of AutoGL, please refer to the agnn branch.

You can also refer to runnni.py to use the benchmark together with NNI.

Citation

If you find that NAS-Bench-Graph helps your research, please consider citing it:

@inproceedings{qin2022nas,
  title     = {NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search},
  author    = {Qin, Yijian and Zhang, Ziwei and Wang, Xin and Zhang, Zeyang and Zhu, Wenwu},
  booktitle = {Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track}
  year      = {2022}
}