Path-Based Computation Encoder for Neural Architecture Search
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Recently, neural architecture search (NAS) has received increasing attention as it can replace human experts indesigning the architecture of neural networks for different tasks and has achieved remarkable results in manychallenging tasks. In this study, a path-based computation neural architecture encoder (PCE) was proposed. Our PCE first encodes the computation of information on each path in a neural network, and then aggregatesthe encodings on all paths together through an attention mechanism, simulating the process of informationcomputation along paths in a neural network and encoding the computation on the neural network instead ofthe structure of the graph, which is more consistent with the computational properties of neural networks. Weperformed an extensive comparison with eight encoding methods on two commonly used NAS search spaces(NAS-Bench-101 and NAS-Bench-201), which included a comparison of the predictive capabilities of performancepredictors and search capabilities based on two search strategies (reinforcement learning-based andBayesian optimization-based) when equipped with different encoders. Experimental evaluation shows that PCEis an efficient encoding method that effectively ranks and predicts neural architecture performance, therebyimproving the search efficiency of neural architectures.
Abstract
Recently, neural architecture search (NAS) has received increasing attention as it can replace human experts indesigning the architecture of neural networks for different tasks and has achieved remarkable results in manychallenging tasks. In this study, a path-based computation neural architecture encoder (PCE) was proposed. Our PCE first encodes the computation of information on each path in a neural network, and then aggregatesthe encodings on all paths together through an attention mechanism, simulating the process of informationcomputation along paths in a neural network and encoding the computation on the neural network instead ofthe structure of the graph, which is more consistent with the computational properties of neural networks. Weperformed an extensive comparison with eight encoding methods on two commonly used NAS search spaces(NAS-Bench-101 and NAS-Bench-201), which included a comparison of the predictive capabilities of performancepredictors and search capabilities based on two search strategies (reinforcement learning-based andBayesian optimization-based) when equipped with different encoders. Experimental evaluation shows that PCEis an efficient encoding method that effectively ranks and predicts neural architecture performance, therebyimproving the search efficiency of neural architectures.
참고문헌 (10)
- C. White, "Bananas : Bayesian optimization with neural architectures for neural architecture search", Proceedings of the 35th AAAI Conference on Artificial Intelligence, pp.10293~10301 (2021)
- "Operation embeddings for neural architecture search" (2021)[URL]
- C. Ying, "Nas-bench-101 : towards reproducible neural architecture search", Proceedings of the 36th International Conference on Machine Learning, 97, pp.7105~7114 (2019)
- "Nas-bench-201: Extending the scope of reproducible neural architecture search" (2020)[URL]
- X. Zhang, "Discriminative learning of imaginary data for few-shot classification", Neurocomputing, 467, pp.406~417 (2022)
- W. Wen, "Computer Vision – ECCV 2020", pp.660~676 (2020), Springer
- C. White, "A study on encodings for neural architecture search", Advances in Neural Information Processing Systems, 33, pp.20309~20319 (2020)
- H. Shi, "Bridging the gap between sample-based and one-shot neural architecture search with BONAS", Advances in Neural Information Processing Systems, 33, pp.1808~1819 (2020)
- X. Ning, "Computer Vision - ECCV 2020", pp.189~204 (2020), Springer
- M. Zhang, "D-VAE : a variational autoencoder for directed acyclic graphs", Advances in Neural Information Processing Systems, 32, pp.1586~1598 (2019)
