Maintained by Difan Deng and Marius Lindauer.
The following list considers papers related to neural architecture search. It is by no means complete. If you miss a paper on the list, please let us know.
Please note that although NAS methods steadily improve, the quality of empirical evaluations in this field are still lagging behind compared to other areas in machine learning, AI and optimization. We would therefore like to share some best practices for empirical evaluations of NAS methods, which we believe will facilitate sustained and measurable progress in the field. If you are interested in a teaser, please read our blog post or directly jump to our checklist.
Transformers have gained increasing popularity in different domains. For a comprehensive list of papers focusing on Neural Architecture Search for Transformer-Based spaces, the awesome-transformer-search repo is all you need.
2021
1601.
Huang, Yufang; Axsom, Kelly M; Lee, John; Subramanian, Lakshminarayanan; Zhang, Yiye
DICE: Deep Significance Clustering for Outcome-Aware Stratification Technical Report
2021.
@techreport{YufangHuang2021_xxi,
title = {DICE: Deep Significance Clustering for Outcome-Aware Stratification},
author = {Yufang Huang and Kelly M Axsom and John Lee and Lakshminarayanan Subramanian and Yiye Zhang},
url = {https://arxiv.org/abs/2101.02344},
year = {2021},
date = {2021-01-01},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1600.
Ma, Ailong; Wan, Yuting; Zhong, Yanfei; Wang, Junjue; Zhang, Liangpei
SceneNet: Remote sensing scene classification deep learning network using multi-objective neural evolution architecture search Technical Report
2021, ISSN: 0924-2716.
@techreport{AilongMa2021_voj,
title = {SceneNet: Remote sensing scene classification deep learning network using multi-objective neural evolution architecture search},
author = {Ailong Ma and Yuting Wan and Yanfei Zhong and Junjue Wang and Liangpei Zhang},
url = {https://www.sciencedirect.com/science/article/pii/S0924271620303361},
doi = {https://doi.org/10.1016/j.isprsjprs.2020.11.025},
issn = {0924-2716},
year = {2021},
date = {2021-01-01},
journal = {ISPRS Journal of Photogrammetry and Remote Sensing},
volume = {172},
pages = {171-188},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1599.
Yang, Hansi; Yao, Quanming; Kwok, James T
Tensorizing Subgraph Search in the Supernet Technical Report
2021.
@techreport{Yang2021_atf,
title = {Tensorizing Subgraph Search in the Supernet},
author = {Hansi Yang and Quanming Yao and James T Kwok},
url = {https://arxiv.org/abs/2101.01078},
year = {2021},
date = {2021-01-01},
volume = {abs/2101.01078},
key = {journals/corr/abs-2101-01078},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1598.
Syed, Muhtadyuzzaman; Srinivasan, Arvind Akpuram
Generalized Latency Performance Estimation for Once-For-All Neural Architecture Search Technical Report
2021.
@techreport{Syed2021_kud,
title = {Generalized Latency Performance Estimation for Once-For-All Neural Architecture Search},
author = {Muhtadyuzzaman Syed and Arvind Akpuram Srinivasan},
url = {https://arxiv.org/abs/2101.00732},
year = {2021},
date = {2021-01-01},
volume = {abs/2101.00732},
key = {journals/corr/abs-2101-00732},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1597.
Huang, Hanxun; Ma, Xingjun; Erfani, Sarah M; Bailey, James
Neural Architecture Search via Combinatorial Multi-Armed Bandit Technical Report
2021.
@techreport{Huang2021_aks,
title = {Neural Architecture Search via Combinatorial Multi-Armed Bandit},
author = {Hanxun Huang and Xingjun Ma and Sarah M Erfani and James Bailey},
url = {https://arxiv.org/abs/2101.00336},
year = {2021},
date = {2021-01-01},
volume = {abs/2101.00336},
key = {journals/corr/abs-2101-00336},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1596.
Tang, Tianqi; Yu, Xin; Dong, Xuanyi; Yang, Yi
Auto-Navigator: Decoupled Neural Architecture Search for Visual Navigation Technical Report
2021.
@techreport{Tang2021_szq,
title = {Auto-Navigator: Decoupled Neural Architecture Search for Visual Navigation},
author = {Tianqi Tang and Xin Yu and Xuanyi Dong and Yi Yang},
url = {https://openaccess.thecvf.com/content/WACV2021/html/Tang_Auto-Navigator_Decoupled_Neural_Architecture_Search_for_Visual_Navigation_WACV_2021_paper.html},
year = {2021},
date = {2021-01-01},
booktitle = {Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)},
pages = {3743-3752},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1595.
Zheng, Shuai; Wang, Yabin; Li, Baotong; Li, Xin
A Hardware-adaptive Deep Feature Matching Pipeline for Real-time 3D Reconstruction Journal Article
In: vol. 132, pp. 102984, 2021.
@article{Zheng2021_mdc,
title = {A Hardware-adaptive Deep Feature Matching Pipeline for Real-time 3D Reconstruction},
author = {Shuai Zheng and Yabin Wang and Baotong Li and Xin Li},
url = {https://www.sciencedirect.com/science/article/abs/pii/S0010448520301779},
doi = {10.1016/J.CAD.2020.102984},
year = {2021},
date = {2021-01-01},
volume = {132},
pages = {102984},
key = {journals/cad/ZhengWLL21},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
1594.
Hosseini, Ramtin; Yang, Xingyi; Xie, Pengtao
DSRNA - Differentiable Search of Robust Neural Architectures Proceedings Article
In: CVPR 2021, 2021.
@inproceedings{Hosseini2020_zbg,
title = {DSRNA - Differentiable Search of Robust Neural Architectures},
author = {Ramtin Hosseini and Xingyi Yang and Pengtao Xie},
url = {https://arxiv.org/abs/2012.06122},
year = {2021},
date = {2021-01-01},
booktitle = {CVPR 2021},
volume = {abs/2012.06122},
key = {journals/corr/abs-2012-06122},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
1593.
Ruchte, Michael; Zela, Arber; Siems, Julien Niklas; Grabocka, Josif; Hutter, Frank
NASLib: A Modular and Flexible Neural Architecture Search Library Technical Report
2021.
@techreport{MichaelRuchte2021_kjn,
title = {NASLib: A Modular and Flexible Neural Architecture Search Library},
author = {Michael Ruchte and Arber Zela and Julien Niklas Siems and Josif Grabocka and Frank Hutter},
url = {https://openreview.net/forum?id=EohGx2HgNsA},
year = {2021},
date = {2021-01-01},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1592.
Shaikh, Azhar; Sinha, Nishant
Learn to Bind and Grow Neural Structures Proceedings Article
In: pp. 119-126, 2021.
@inproceedings{Shaikh2021_sss,
title = {Learn to Bind and Grow Neural Structures},
author = {Azhar Shaikh and Nishant Sinha},
url = {https://arxiv.org/abs/2011.10568},
doi = {10.1145/3430984.3431019},
year = {2021},
date = {2021-01-01},
pages = {119-126},
key = {conf/comad/ShaikhS21},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
1591.
Lu, Hao; Han, Hu
NAS-HR: search of neural architecture for heart-rate estimation from face videos Technical Report
2021.
@techreport{Lu2021_pdu,
title = {NAS-HR: search of neural architecture for heart-rate estimation from face videos},
author = {Hao Lu and Hu Han},
url = {http://vr-ih.com/vrih/resource/latest_accept/323112704838656.pdf},
doi = {10.1016/j.vrih.2020.10.002},
year = {2021},
date = {2021-01-01},
journal = {Virtual Reality& Intelligent Hardware},
pages = {33--42},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1590.
Peng, Daiyi; Dong, Xuanyi; Real, Esteban; Tan, Mingxing; Lu, Yifeng; Liu, Hanxiao; Bender, Gabriel; Kraft, Adam; Liang, Chen; Le, Quoc V
PyGlove - Symbolic Programming for Automated Machine Learning Technical Report
2021.
@techreport{Peng2021_jau,
title = {PyGlove - Symbolic Programming for Automated Machine Learning},
author = {Daiyi Peng and Xuanyi Dong and Esteban Real and Mingxing Tan and Yifeng Lu and Hanxiao Liu and Gabriel Bender and Adam Kraft and Chen Liang and Quoc V Le},
url = {https://papers.nips.cc/paper/2020/file/012a91467f210472fab4e11359bbfef6-Paper.pdf},
year = {2021},
date = {2021-01-01},
volume = {abs/2101.08809},
key = {journals/corr/abs-2101-08809},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1589.
Liu, Jiaheng; Zhou, Shunfeng; Wu, Yichao; Chen, Ken; Ouyang, Wanli; Xu, Dong
Block Proposal Neural Architecture Search Journal Article
In: vol. 30, pp. 15-25, 2021.
@article{Liu2021_gru,
title = {Block Proposal Neural Architecture Search},
author = {Jiaheng Liu and Shunfeng Zhou and Yichao Wu and Ken Chen and Wanli Ouyang and Dong Xu},
url = {https://pubmed.ncbi.nlm.nih.gov/33035163/},
doi = {10.1109/TIP.2020.3028288},
year = {2021},
date = {2021-01-01},
volume = {30},
pages = {15-25},
key = {journals/tip/LiuZWCOX21},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
1588.
He, Xin; Wang, Shihao; Ying, Guohao; Zhang, Jiyong; Chu, Xiaowen
Efficient Multi-objective Evolutionary 3D Neural Architecture Search for COVID-19 Detection with Chest CT Scans Technical Report
2021.
@techreport{He2021_lri,
title = {Efficient Multi-objective Evolutionary 3D Neural Architecture Search for COVID-19 Detection with Chest CT Scans},
author = {Xin He and Shihao Wang and Guohao Ying and Jiyong Zhang and Xiaowen Chu},
url = {https://ieeexplore.ieee.org/abstract/document/9207545},
year = {2021},
date = {2021-01-01},
volume = {abs/2101.10667},
key = {journals/corr/abs-2101-10667},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1587.
Chu, Xiangxiang; Wang, Xiaoxing; Zhang, Bo; Lu, Shun; Wei, Xiaolin; Yan, Junchi
DARTS-: Robustly Stepping out of Performance Collapse Without Indicators Technical Report
2021.
@techreport{XiangxiangChu2021_pqn,
title = {DARTS-: Robustly Stepping out of Performance Collapse Without Indicators},
author = {Xiangxiang Chu and Xiaoxing Wang and Bo Zhang and Shun Lu and Xiaolin Wei and Junchi Yan},
url = {https://arxiv.org/abs/2009.01027},
year = {2021},
date = {2021-01-01},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1586.
Liang, Xinle; Liu, Yang; Luo, Jiahuan; He, Yuanqin; Chen, Tianjian; Yang, Qiang
Self-supervised Cross-silo Federated Neural Architecture Search Technical Report
2021.
@techreport{Liang2021_fxt,
title = {Self-supervised Cross-silo Federated Neural Architecture Search},
author = {Xinle Liang and Yang Liu and Jiahuan Luo and Yuanqin He and Tianjian Chen and Qiang Yang},
url = {https://arxiv.org/abs/2007.01500},
year = {2021},
date = {2021-01-01},
volume = {abs/2101.11896},
key = {journals/corr/abs-2101-11896},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1585.
Mittal, Govind; Korus, Pawel; Memon, Nasir D
FiFTy - Large-Scale File Fragment Type Identification Using Convolutional Neural Networks Journal Article
In: vol. 16, pp. 28-41, 2021.
@article{Mittal2021_rhn,
title = {FiFTy - Large-Scale File Fragment Type Identification Using Convolutional Neural Networks},
author = {Govind Mittal and Pawel Korus and Nasir D Memon},
url = {https://ieeexplore.ieee.org/abstract/document/9122499},
doi = {10.1109/TIFS.2020.3004266},
year = {2021},
date = {2021-01-01},
volume = {16},
pages = {28-41},
key = {journals/tifs/MittalKM21},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
1584.
Yang, Zhao; Zhang, Shengbing; Li, Ruxu; Li, Chuxi; Wang, Miao; Wang, Danghui; Zhang, Meng
Efficient Resource-Aware Convolutional Neural Architecture Search for Edge Computing with Pareto-Bayesian Optimization Journal Article
In: vol. 21, no. 2, pp. 444, 2021.
@article{Yang2021_olp,
title = {Efficient Resource-Aware Convolutional Neural Architecture Search for Edge Computing with Pareto-Bayesian Optimization},
author = {Zhao Yang and Shengbing Zhang and Ruxu Li and Chuxi Li and Miao Wang and Danghui Wang and Meng Zhang},
url = {https://arxiv.org/abs/1806.07912},
doi = {10.3390/S21020444},
year = {2021},
date = {2021-01-01},
volume = {21},
number = {2},
pages = {444},
key = {journals/sensors/YangZLLWWZ21},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
1583.
Wei, Tao; Wang, Changhu; Chen, Chang Wen
Modularized Morphing of Deep Convolutional Neural Networks - A Graph Approach Journal Article
In: vol. 70, no. 2, pp. 305-315, 2021.
@article{Wei2021_ghp,
title = {Modularized Morphing of Deep Convolutional Neural Networks - A Graph Approach},
author = {Tao Wei and Changhu Wang and Chang Wen Chen},
url = {https://arxiv.org/abs/1701.03281},
doi = {10.1109/TC.2020.2988006},
year = {2021},
date = {2021-01-01},
volume = {70},
number = {2},
pages = {305-315},
key = {journals/tc/WeiWC21},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
1582.
Song, Xingyou; Choromanski, Krzysztof; Parker-Holder, Jack; Tang, Yunhao; Peng, Daiyi; Jain, Deepali; Gao, Wenbo; Pacchiano, Aldo; Sarlós, Tamás; Yang, Yuxiang
ES-ENAS - Combining Evolution Strategies with Neural Architecture Search at No Extra Cost for Reinforcement Learning Technical Report
2021.
@techreport{Song2021_xto,
title = {ES-ENAS - Combining Evolution Strategies with Neural Architecture Search at No Extra Cost for Reinforcement Learning},
author = {Xingyou Song and Krzysztof Choromanski and Jack Parker-Holder and Yunhao Tang and Daiyi Peng and Deepali Jain and Wenbo Gao and Aldo Pacchiano and Tamás Sarlós and Yuxiang Yang},
url = {https://arxiv.org/abs/1611.01578},
year = {2021},
date = {2021-01-01},
volume = {abs/2101.07415},
key = {journals/corr/abs-2101-07415},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1581.
Rorabaugh, Ariel Keller; -, Silvina Caíno; II, Michael Wyatt R; Johnston, Travis; Taufer, Michela
PEng4NN: An Accurate Performance Estimation Engine for Efficient Automated Neural Network Architecture Search Technical Report
2021.
@techreport{ArielKellerRorabaugh2021_ncl,
title = {PEng4NN: An Accurate Performance Estimation Engine for Efficient Automated Neural Network Architecture Search},
author = {Ariel Keller Rorabaugh and Silvina Caíno - and Michael Wyatt R II and Travis Johnston and Michela Taufer},
url = {https://arxiv.org/abs/2101.04185},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.04185},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1580.
Zhang, Haokui; Gong, Chengrong; Bai, Yunpeng; Bai, Zongwen; Li, Ying
3D-ANAS: 3D Asymmetric Neural Architecture Search for Fast Hyperspectral Image Classification Miscellaneous
2021.
@misc{HaokuiZhang2021_uqt,
title = {3D-ANAS: 3D Asymmetric Neural Architecture Search for Fast Hyperspectral Image Classification},
author = {Haokui Zhang and Chengrong Gong and Yunpeng Bai and Zongwen Bai and Ying Li},
url = {https://arxiv.org/abs/2101.04287},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.04287},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
1579.
Gu, Hongyang; Fu, Guangyuan; Li, Jianmin; Zhu, Jun
Auto-ReID+: Searching for a multi-branch ConvNet for person re-identification Journal Article
In: Neurocomputing, vol. 435, pp. 53-66, 2021, ISSN: 0925-2312.
@article{HongyangGu2021_bui,
title = {Auto-ReID+: Searching for a multi-branch ConvNet for person re-identification},
author = {Hongyang Gu and Guangyuan Fu and Jianmin Li and Jun Zhu},
url = {https://www.sciencedirect.com/science/article/pii/S0925231220320178},
doi = {https://doi.org/10.1016/j.neucom.2020.12.105},
issn = {0925-2312},
year = {2021},
date = {2021-01-01},
journal = {Neurocomputing},
volume = {435},
pages = {53-66},
abstract = {In the field of person re-identification (ReID), multi-branch models are more effective in learning robust features than single-branch models. The current popular multi-branch models are based on ResNet or GoogleNet. These networks are designed initially to solve classification problems. There is an essential difference between ReID and classification problems, so it is particularly important to find a corresponding multi-branch backbone for ReID tasks. We propose to automatically search for a multi-branch convolutional neural network (CNN) for ReID tasks utilizing neural architecture search (NAS). First, we designed a multi-resolution, multi-branch macro search architecture that can extract more abundant scale information. Then in the searching process, the early stopping mechanism is proposed to improve the effectiveness and efficiency of the entire searching process. Finally, we experimentally prove on four mainstream datasets that the searched model can achieve state-of-the-art performance with only 5.7 million parameters.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In the field of person re-identification (ReID), multi-branch models are more effective in learning robust features than single-branch models. The current popular multi-branch models are based on ResNet or GoogleNet. These networks are designed initially to solve classification problems. There is an essential difference between ReID and classification problems, so it is particularly important to find a corresponding multi-branch backbone for ReID tasks. We propose to automatically search for a multi-branch convolutional neural network (CNN) for ReID tasks utilizing neural architecture search (NAS). First, we designed a multi-resolution, multi-branch macro search architecture that can extract more abundant scale information. Then in the searching process, the early stopping mechanism is proposed to improve the effectiveness and efficiency of the entire searching process. Finally, we experimentally prove on four mainstream datasets that the searched model can achieve state-of-the-art performance with only 5.7 million parameters.
1578.
He, Xin; Wang, Shihao; Chu, Xiaowen; Shi, Shaohuai; Tang, Jiangping; Liu, Xin; Yan, Chenggang; Zhang, Jiyong; Ding, Guiguang
Automated Model Design and Benchmarking of 3D Deep Learning Models for COVID-19 Detection with Chest CT Scans Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-05442,
title = {Automated Model Design and Benchmarking of 3D Deep Learning Models for COVID-19 Detection with Chest CT Scans},
author = {Xin He and Shihao Wang and Xiaowen Chu and Shaohuai Shi and Jiangping Tang and Xin Liu and Chenggang Yan and Jiyong Zhang and Guiguang Ding},
url = {https://arxiv.org/abs/2101.05442},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.05442},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1577.
Zhou, Benjia; Li, Yunan; Wan, Jun
Regional Attention with Architecture-Rebuilt 3D Network for RGB-D Gesture Recognition Technical Report
2021.
@techreport{zhou2021regional,
title = {Regional Attention with Architecture-Rebuilt 3D Network for RGB-D Gesture Recognition},
author = {Benjia Zhou and Yunan Li and Jun Wan},
url = {https://arxiv.org/abs/2102.05348},
year = {2021},
date = {2021-01-01},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1576.
Yang, Zhao; Zhang, Shengbing; Li, Ruxu; Li, Chuxi; Wang, Miao; Wang, Danghui; Zhang, Meng
Efficient Resource-Aware Convolutional Neural Architecture Search for Edge Computing with Pareto-Bayesian Optimization Journal Article
In: Sensors, vol. 21, no. 2, 2021, ISSN: 1424-8220.
@article{s21020444,
title = {Efficient Resource-Aware Convolutional Neural Architecture Search for Edge Computing with Pareto-Bayesian Optimization},
author = {Zhao Yang and Shengbing Zhang and Ruxu Li and Chuxi Li and Miao Wang and Danghui Wang and Meng Zhang},
url = {https://www.mdpi.com/1424-8220/21/2/444},
doi = {10.3390/s21020444},
issn = {1424-8220},
year = {2021},
date = {2021-01-01},
journal = {Sensors},
volume = {21},
number = {2},
abstract = {With the development of deep learning technologies and edge computing, the combination of them can make artificial intelligence ubiquitous. Due to the constrained computation resources of the edge device, the research in the field of on-device deep learning not only focuses on the model accuracy but also on the model efficiency, for example, inference latency. There are many attempts to optimize the existing deep learning models for the purpose of deploying them on the edge devices that meet specific application requirements while maintaining high accuracy. Such work not only requires professional knowledge but also needs a lot of experiments, which limits the customization of neural networks for varied devices and application scenarios. In order to reduce the human intervention in designing and optimizing the neural network structure, multi-objective neural architecture search methods that can automatically search for neural networks featured with high accuracy and can satisfy certain hardware performance requirements are proposed. However, the current methods commonly set accuracy and inference latency as the performance indicator during the search process, and sample numerous network structures to obtain the required neural network. Lacking regulation to the search direction with the search objectives will generate a large number of useless networks during the search process, which influences the search efficiency to a great extent. Therefore, in this paper, an efficient resource-aware search method is proposed. Firstly, the network inference consumption profiling model for any specific device is established, and it can help us directly obtain the resource consumption of each operation in the network structure and the inference latency of the entire sampled network. Next, on the basis of the Bayesian search, a resource-aware Pareto Bayesian search is proposed. Accuracy and inference latency are set as the constraints to regulate the search direction. With a clearer search direction, the overall search efficiency will be improved. Furthermore, cell-based structure and lightweight operation are applied to optimize the search space for further enhancing the search efficiency. The experimental results demonstrate that with our method, the inference latency of the searched network structure reduced 94.71% without scarifying the accuracy. At the same time, the search efficiency increased by 18.18%.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
With the development of deep learning technologies and edge computing, the combination of them can make artificial intelligence ubiquitous. Due to the constrained computation resources of the edge device, the research in the field of on-device deep learning not only focuses on the model accuracy but also on the model efficiency, for example, inference latency. There are many attempts to optimize the existing deep learning models for the purpose of deploying them on the edge devices that meet specific application requirements while maintaining high accuracy. Such work not only requires professional knowledge but also needs a lot of experiments, which limits the customization of neural networks for varied devices and application scenarios. In order to reduce the human intervention in designing and optimizing the neural network structure, multi-objective neural architecture search methods that can automatically search for neural networks featured with high accuracy and can satisfy certain hardware performance requirements are proposed. However, the current methods commonly set accuracy and inference latency as the performance indicator during the search process, and sample numerous network structures to obtain the required neural network. Lacking regulation to the search direction with the search objectives will generate a large number of useless networks during the search process, which influences the search efficiency to a great extent. Therefore, in this paper, an efficient resource-aware search method is proposed. Firstly, the network inference consumption profiling model for any specific device is established, and it can help us directly obtain the resource consumption of each operation in the network structure and the inference latency of the entire sampled network. Next, on the basis of the Bayesian search, a resource-aware Pareto Bayesian search is proposed. Accuracy and inference latency are set as the constraints to regulate the search direction. With a clearer search direction, the overall search efficiency will be improved. Furthermore, cell-based structure and lightweight operation are applied to optimize the search space for further enhancing the search efficiency. The experimental results demonstrate that with our method, the inference latency of the searched network structure reduced 94.71% without scarifying the accuracy. At the same time, the search efficiency increased by 18.18%.
1575.
Weng, Yu; Chen, Zehua; Zhou, Tianbao
Improved differentiable neural architecture search for single image super-resolution Journal Article
In: Peer-to-Peer Networking and Applications, 2021.
@article{journals/PPNA/Weng21,
title = {Improved differentiable neural architecture search for single image super-resolution},
author = {Yu Weng and Zehua Chen and Tianbao Zhou},
url = {https://doi.org/10.1007/s12083-020-01048-4},
doi = {10.1007/s12083-020-01048-4},
year = {2021},
date = {2021-01-01},
journal = {Peer-to-Peer Networking and Applications},
abstract = {Deep learning has shown prominent superiority over other machine learning algorithms in Single Image Super-Resolution (SISR). In order to reduce the efforts and resources cost on manually designing deep architecture, we use differentiable neural architecture search (DARTS) on SISR. Since neural architecture search was originally used for classification tasks, our experiments show that direct usage of DARTS on super-resolutions tasks will give rise to many skip connections in the search architecture, which results in the poor performance of final architecture. Thus, it is necessary for DARTS to have made some improvements for the application in the field of SISR. According to characteristics of SISR, we remove redundant operations and redesign some operations in the cell to achieve an improved DARTS. Then we use the improved DARTS to search convolution cells as a nonlinear mapping part of super-resolution network. The new super-resolution architecture shows its effectiveness on benchmark datasets and DIV2K dataset.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Deep learning has shown prominent superiority over other machine learning algorithms in Single Image Super-Resolution (SISR). In order to reduce the efforts and resources cost on manually designing deep architecture, we use differentiable neural architecture search (DARTS) on SISR. Since neural architecture search was originally used for classification tasks, our experiments show that direct usage of DARTS on super-resolutions tasks will give rise to many skip connections in the search architecture, which results in the poor performance of final architecture. Thus, it is necessary for DARTS to have made some improvements for the application in the field of SISR. According to characteristics of SISR, we remove redundant operations and redesign some operations in the cell to achieve an improved DARTS. Then we use the improved DARTS to search convolution cells as a nonlinear mapping part of super-resolution network. The new super-resolution architecture shows its effectiveness on benchmark datasets and DIV2K dataset.
1574.
Liu, Jia; Jin, Yaochu
Multi-objective Search of Robust Neural Architectures against Multiple Types of Adversarial Attacks Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-06507,
title = {Multi-objective Search of Robust Neural Architectures against Multiple Types of Adversarial Attacks},
author = {Jia Liu and Yaochu Jin},
url = {https://arxiv.org/abs/2101.06507},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.06507},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1573.
Wu, Yan; Huang, Zhiwu; Kumar, Suryansh; Sukthanker, Rhea Sanjay; Timofte, Radu; Gool, Luc Van
Trilevel Neural Architecture Search for Efficient Single Image Super-Resolution Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-06658,
title = {Trilevel Neural Architecture Search for Efficient Single Image Super-Resolution},
author = {Yan Wu and Zhiwu Huang and Suryansh Kumar and Rhea Sanjay Sukthanker and Radu Timofte and Luc Van Gool},
url = {https://arxiv.org/abs/2101.06658},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.06658},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1572.
Alparslan, Yigit; Moyer, Ethan Jacob; Isozaki, Isamu Mclean; Schwartz, Daniel; Dunlop, Adam; Dave, Shesh; Kim, Edward
Towards Searching Efficient and Accurate Neural Network Architectures in Binary Classification Problems Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-06511,
title = {Towards Searching Efficient and Accurate Neural Network Architectures in Binary Classification Problems},
author = {Yigit Alparslan and Ethan Jacob Moyer and Isamu Mclean Isozaki and Daniel Schwartz and Adam Dunlop and Shesh Dave and Edward Kim},
url = {https://arxiv.org/abs/2101.06511},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.06511},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1571.
Lee, Sanghyeop; Kim, Junyeob; Kang, Hyeon; Kang, Do-Young; Park, Jangsik
Genetic Algorithm Based Deep Learning Neural Network Structure and Hyperparameter Optimization Journal Article
In: Applied Sciences, vol. 11, no. 2, 2021, ISSN: 2076-3417.
@article{app11020744,
title = {Genetic Algorithm Based Deep Learning Neural Network Structure and Hyperparameter Optimization},
author = {Sanghyeop Lee and Junyeob Kim and Hyeon Kang and Do-Young Kang and Jangsik Park},
url = {https://www.mdpi.com/2076-3417/11/2/744},
doi = {10.3390/app11020744},
issn = {2076-3417},
year = {2021},
date = {2021-01-01},
journal = {Applied Sciences},
volume = {11},
number = {2},
abstract = {Alzheimer’s disease is one of the major challenges of population ageing, and diagnosis and prediction of the disease through various biomarkers is the key. While the application of deep learning as imaging technologies has recently expanded across the medical industry, empirical design of these technologies is very difficult. The main reason for this problem is that the performance of the Convolutional Neural Networks (CNN) differ greatly depending on the statistical distribution of the input dataset. Different hyperparameters also greatly affect the convergence of the CNN models. With this amount of information, selecting appropriate parameters for the network structure has became a large research area. Genetic Algorithm (GA), is a very popular technique to automatically select a high-performance network architecture. In this paper, we show the possibility of optimising the network architecture using GA, where its search space includes both network structure configuration and hyperparameters. To verify the performance of our Algorithm, we used an amyloid brain image dataset that is used for Alzheimer’s disease diagnosis. As a result, our algorithm outperforms Genetic CNN by 11.73% on a given classification task.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Alzheimer’s disease is one of the major challenges of population ageing, and diagnosis and prediction of the disease through various biomarkers is the key. While the application of deep learning as imaging technologies has recently expanded across the medical industry, empirical design of these technologies is very difficult. The main reason for this problem is that the performance of the Convolutional Neural Networks (CNN) differ greatly depending on the statistical distribution of the input dataset. Different hyperparameters also greatly affect the convergence of the CNN models. With this amount of information, selecting appropriate parameters for the network structure has became a large research area. Genetic Algorithm (GA), is a very popular technique to automatically select a high-performance network architecture. In this paper, we show the possibility of optimising the network architecture using GA, where its search space includes both network structure configuration and hyperparameters. To verify the performance of our Algorithm, we used an amyloid brain image dataset that is used for Alzheimer’s disease diagnosis. As a result, our algorithm outperforms Genetic CNN by 11.73% on a given classification task.
1570.
Jiang, Hanliang; Shen, Fuhao; Gao, Fei; Han, Weidong
Learning efficient, explainable and discriminative representations for pulmonary nodules classification Journal Article
In: Pattern Recognition, vol. 113, pp. 107825, 2021, ISSN: 0031-3203.
@article{JIANG2021107825,
title = {Learning efficient, explainable and discriminative representations for pulmonary nodules classification},
author = {Hanliang Jiang and Fuhao Shen and Fei Gao and Weidong Han},
url = {https://www.sciencedirect.com/science/article/pii/S0031320321000121},
doi = {https://doi.org/10.1016/j.patcog.2021.107825},
issn = {0031-3203},
year = {2021},
date = {2021-01-01},
journal = {Pattern Recognition},
volume = {113},
pages = {107825},
abstract = {Automatic pulmonary nodules classification is significant for early diagnosis of lung cancers. Recently, deep learning techniques have enabled remarkable progress in this field. However, these deep models are typically of high computational complexity and work in a black-box manner. To combat these challenges, in this work, we aim to build an efficient and (partially) explainable classification model. Specially, we use neural architecture search (NAS) to automatically search 3D network architectures with excellent accuracy/speed trade-off. Besides, we use the convolutional block attention module (CBAM) in the networks, which helps us understand the reasoning process. During training, we use A-Softmax loss to learn angularly discriminative representations. In the inference stage, we employ an ensemble of diverse neural networks to improve the prediction accuracy and robustness. We conduct extensive experiments on the LIDC-IDRI database. Compared with previous state-of-the-art, our model shows highly comparable performance by using less than 1/40 parameters. Besides, empirical study shows that the reasoning process of learned networks is in conformity with physicians’ diagnosis. Related code and results have been released at: https://github.com/fei-hdu/NAS-Lung.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Automatic pulmonary nodules classification is significant for early diagnosis of lung cancers. Recently, deep learning techniques have enabled remarkable progress in this field. However, these deep models are typically of high computational complexity and work in a black-box manner. To combat these challenges, in this work, we aim to build an efficient and (partially) explainable classification model. Specially, we use neural architecture search (NAS) to automatically search 3D network architectures with excellent accuracy/speed trade-off. Besides, we use the convolutional block attention module (CBAM) in the networks, which helps us understand the reasoning process. During training, we use A-Softmax loss to learn angularly discriminative representations. In the inference stage, we employ an ensemble of diverse neural networks to improve the prediction accuracy and robustness. We conduct extensive experiments on the LIDC-IDRI database. Compared with previous state-of-the-art, our model shows highly comparable performance by using less than 1/40 parameters. Besides, empirical study shows that the reasoning process of learned networks is in conformity with physicians’ diagnosis. Related code and results have been released at: https://github.com/fei-hdu/NAS-Lung.
1569.
Alparslan, Yigit; Moyer, Ethan Jacob; Kim, Edward
Evaluating Online and Offline Accuracy Traversal Algorithms for k-Complete Neural Network Architectures Journal Article
In: CoRR, vol. abs/2101.06518, 2021.
@article{DBLP:journals/corr/abs-2101-06518,
title = {Evaluating Online and Offline Accuracy Traversal Algorithms for k-Complete Neural Network Architectures},
author = {Yigit Alparslan and Ethan Jacob Moyer and Edward Kim},
url = {https://arxiv.org/abs/2101.06518},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.06518},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
1568.
Vaccaro, Lorenzo; Sansonetti, Giuseppe; Micarelli, Alessandro
An Empirical Review of Automated Machine Learning Journal Article
In: Computers, vol. 10, no. 1, 2021, ISSN: 2073-431X.
@article{computers10010011,
title = {An Empirical Review of Automated Machine Learning},
author = {Lorenzo Vaccaro and Giuseppe Sansonetti and Alessandro Micarelli},
url = {https://www.mdpi.com/2073-431X/10/1/11},
doi = {10.3390/computers10010011},
issn = {2073-431X},
year = {2021},
date = {2021-01-01},
journal = {Computers},
volume = {10},
number = {1},
abstract = {In recent years, Automated Machine Learning (AutoML) has become increasingly important in Computer Science due to the valuable potential it offers. This is testified by the high number of works published in the academic field and the significant efforts made in the industrial sector. However, some problems still need to be resolved. In this paper, we review some Machine Learning (ML) models and methods proposed in the literature to analyze their strengths and weaknesses. Then, we propose their use—alone or in combination with other approaches—to provide possible valid AutoML solutions. We analyze those solutions from a theoretical point of view and evaluate them empirically on three Atari games from the Arcade Learning Environment. Our goal is to identify what, we believe, could be some promising ways to create truly effective AutoML frameworks, therefore able to replace the human expert as much as possible, thereby making easier the process of applying ML approaches to typical problems of specific domains. We hope that the findings of our study will provide useful insights for future research work in AutoML.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In recent years, Automated Machine Learning (AutoML) has become increasingly important in Computer Science due to the valuable potential it offers. This is testified by the high number of works published in the academic field and the significant efforts made in the industrial sector. However, some problems still need to be resolved. In this paper, we review some Machine Learning (ML) models and methods proposed in the literature to analyze their strengths and weaknesses. Then, we propose their use—alone or in combination with other approaches—to provide possible valid AutoML solutions. We analyze those solutions from a theoretical point of view and evaluate them empirically on three Atari games from the Arcade Learning Environment. Our goal is to identify what, we believe, could be some promising ways to create truly effective AutoML frameworks, therefore able to replace the human expert as much as possible, thereby making easier the process of applying ML approaches to typical problems of specific domains. We hope that the findings of our study will provide useful insights for future research work in AutoML.
1567.
Li, Qing; Wu, Xia; Liu, Tianming
Differentiable Neural Architecture Search for Optimal Spatial/Temporal Brain Function Network Decomposition Journal Article
In: Medical Image Analysis, pp. 101974, 2021, ISSN: 1361-8415.
@article{LI2021101974,
title = {Differentiable Neural Architecture Search for Optimal Spatial/Temporal Brain Function Network Decomposition},
author = {Qing Li and Xia Wu and Tianming Liu},
url = {https://www.sciencedirect.com/science/article/pii/S1361841521000207},
doi = {https://doi.org/10.1016/j.media.2021.101974},
issn = {1361-8415},
year = {2021},
date = {2021-01-01},
journal = {Medical Image Analysis},
pages = {101974},
abstract = {ABSTRACT
It has been a key topic to decompose the brain's spatial/temporal function networks from 4D functional magnetic resonance imaging (fMRI) data. With the advantages of robust and meaningful brain pattern extraction, deep neural networks have been shown to be more powerful and flexible in fMRI data modeling than other traditional methods. However, the challenge of designing neural network architecture for high-dimensional and complex fMRI data has also been realized recently. In this paper, we propose a new spatial/temporal differentiable neural architecture search algorithm (ST-DARTS) for optimal brain network decomposition. The core idea of ST-DARTS is to optimize the inner cell structure of the vanilla recurrent neural network (RNN) in order to effectively decompose spatial/temporal brain function networks from fMRI data. Based on the evaluations on all seven fMRI tasks in human connectome project (HCP) dataset, the ST-DARTS model is shown to perform promisingly, both spatially (i.e., it can recognize the most stimuli-correlated spatial brain network activation that is very similar to the benchmark) and temporally (i.e., its temporal activity is highly positively correlated with the task-design). To further improve the efficiency of ST-DARTS model, we introduce a flexible early-stopping mechanism, named as ST-DARTS±, which further improves experimental results significantly. To our best knowledge, the proposed ST-DARTS and ST-DARTS+ models are among the early efforts in optimally decomposing spatial/temporal brain function networks from fMRI data with neural architecture search strategy and they demonstrate great promise.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
ABSTRACT
It has been a key topic to decompose the brain's spatial/temporal function networks from 4D functional magnetic resonance imaging (fMRI) data. With the advantages of robust and meaningful brain pattern extraction, deep neural networks have been shown to be more powerful and flexible in fMRI data modeling than other traditional methods. However, the challenge of designing neural network architecture for high-dimensional and complex fMRI data has also been realized recently. In this paper, we propose a new spatial/temporal differentiable neural architecture search algorithm (ST-DARTS) for optimal brain network decomposition. The core idea of ST-DARTS is to optimize the inner cell structure of the vanilla recurrent neural network (RNN) in order to effectively decompose spatial/temporal brain function networks from fMRI data. Based on the evaluations on all seven fMRI tasks in human connectome project (HCP) dataset, the ST-DARTS model is shown to perform promisingly, both spatially (i.e., it can recognize the most stimuli-correlated spatial brain network activation that is very similar to the benchmark) and temporally (i.e., its temporal activity is highly positively correlated with the task-design). To further improve the efficiency of ST-DARTS model, we introduce a flexible early-stopping mechanism, named as ST-DARTS±, which further improves experimental results significantly. To our best knowledge, the proposed ST-DARTS and ST-DARTS+ models are among the early efforts in optimally decomposing spatial/temporal brain function networks from fMRI data with neural architecture search strategy and they demonstrate great promise.
It has been a key topic to decompose the brain's spatial/temporal function networks from 4D functional magnetic resonance imaging (fMRI) data. With the advantages of robust and meaningful brain pattern extraction, deep neural networks have been shown to be more powerful and flexible in fMRI data modeling than other traditional methods. However, the challenge of designing neural network architecture for high-dimensional and complex fMRI data has also been realized recently. In this paper, we propose a new spatial/temporal differentiable neural architecture search algorithm (ST-DARTS) for optimal brain network decomposition. The core idea of ST-DARTS is to optimize the inner cell structure of the vanilla recurrent neural network (RNN) in order to effectively decompose spatial/temporal brain function networks from fMRI data. Based on the evaluations on all seven fMRI tasks in human connectome project (HCP) dataset, the ST-DARTS model is shown to perform promisingly, both spatially (i.e., it can recognize the most stimuli-correlated spatial brain network activation that is very similar to the benchmark) and temporally (i.e., its temporal activity is highly positively correlated with the task-design). To further improve the efficiency of ST-DARTS model, we introduce a flexible early-stopping mechanism, named as ST-DARTS±, which further improves experimental results significantly. To our best knowledge, the proposed ST-DARTS and ST-DARTS+ models are among the early efforts in optimally decomposing spatial/temporal brain function networks from fMRI data with neural architecture search strategy and they demonstrate great promise.
1566.
Song, Xingyou; Choromanski, Krzysztof; -, Jack Parker; Tang, Yunhao; Peng, Daiyi; Jain, Deepali; Gao, Wenbo; Pacchiano, Aldo; ó, Tamás Sarl; Yang, Yuxiang
ES-ENAS: Combining Evolution Strategies with Neural Architecture Search at No Extra Cost for Reinforcement Learning Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-07415,
title = {ES-ENAS: Combining Evolution Strategies with Neural Architecture Search at No Extra Cost for Reinforcement Learning},
author = {Xingyou Song and Krzysztof Choromanski and Jack Parker - and Yunhao Tang and Daiyi Peng and Deepali Jain and Wenbo Gao and Aldo Pacchiano and Tamás Sarl ó and Yuxiang Yang},
url = {https://arxiv.org/abs/2101.07415},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.07415},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1565.
Wu, Haiwei; Zhou, Jiantao
GIID-Net: Generalizable Image Inpainting Detection via Neural Architecture Search and Attention Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-07419,
title = {GIID-Net: Generalizable Image Inpainting Detection via Neural Architecture Search and Attention},
author = {Haiwei Wu and Jiantao Zhou},
url = {https://arxiv.org/abs/2101.07419},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.07419},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1564.
Fu, Chaoyou; Hu, Yibo; Wu, Xiang; Shi, Hailin; Mei, Tao; He, Ran
CM-NAS: Rethinking Cross-Modality Neural Architectures for Visible-Infrared Person Re-Identification Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-08467,
title = {CM-NAS: Rethinking Cross-Modality Neural Architectures for Visible-Infrared Person Re-Identification},
author = {Chaoyou Fu and Yibo Hu and Xiang Wu and Hailin Shi and Tao Mei and Ran He},
url = {https://arxiv.org/abs/2101.08467},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.08467},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1563.
Abdelfattah, Mohamed S; Mehrotra, Abhinav; Dudziak, Lukasz; Lane, Nicholas D
Zero-Cost Proxies for Lightweight NAS Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-08134,
title = {Zero-Cost Proxies for Lightweight NAS},
author = {Mohamed S Abdelfattah and Abhinav Mehrotra and Lukasz Dudziak and Nicholas D Lane},
url = {https://arxiv.org/abs/2101.08134},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.08134},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1562.
Benmeziane, Hadjer; Maghraoui, Kaoutar El; Ouarnoughi, Hamza; ï, Sma; Wistuba, Martin; Wang, Naigang
A Comprehensive Survey on Hardware-Aware Neural Architecture Search Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-09336,
title = {A Comprehensive Survey on Hardware-Aware Neural Architecture Search},
author = {Hadjer Benmeziane and Kaoutar El Maghraoui and Hamza Ouarnoughi and Sma ï and Martin Wistuba and Naigang Wang},
url = {https://arxiv.org/abs/2101.09336},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.09336},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1561.
He, Xin; Wang, Shihao; Ying, Guohao; Zhang, Jiyong; Chu, Xiaowen
Efficient Multi-objective Evolutionary 3D Neural Architecture Search for COVID-19 Detection with Chest CT Scans Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-10667,
title = {Efficient Multi-objective Evolutionary 3D Neural Architecture Search for COVID-19 Detection with Chest CT Scans},
author = {Xin He and Shihao Wang and Guohao Ying and Jiyong Zhang and Xiaowen Chu},
url = {https://arxiv.org/abs/2101.10667},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.10667},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1560.
Zhao, Jiakun; Zhang, Ruifeng; Zhou, Zheng; Chen, Si; Jin, Ju; Liu, Qingfang
A Neural Architecture Search Method Based on Gradient Descent for Remaining Useful Life Estimation Journal Article
In: Neurocomputing, 2021, ISSN: 0925-2312.
@article{ZHAO2021,
title = {A Neural Architecture Search Method Based on Gradient Descent for Remaining Useful Life Estimation},
author = {Jiakun Zhao and Ruifeng Zhang and Zheng Zhou and Si Chen and Ju Jin and Qingfang Liu},
url = {https://www.sciencedirect.com/science/article/pii/S092523122100148X},
doi = {https://doi.org/10.1016/j.neucom.2021.01.072},
issn = {0925-2312},
year = {2021},
date = {2021-01-01},
journal = {Neurocomputing},
abstract = {Remaining useful life is the estimated continuous normal working time of a component or system from the current moment to the potential failure. The traditional methods have high trial-and-error costs and poor migration capabilities. Fortunately, the neural architecture search (NAS) that has emerged partially solves the problem of automatic construction of network models. However, the search strategy for NAS is reinforcement learning or evolutionary algorithms, which essentially search in discrete space and treating the objective function as a black box, which is very time-consuming. To solve this problem, we proposed a gradient-based neural architecture search method. This method regards a cell in the search space as a directed acyclic graph (DAG) containing N ordered nodes. Each node is a latent representation, and the directed edges represent the conversion operation of two nodes. By mixing the candidate operations (ReLU, tanh) with the softmax function, the search space becomes a continuous space and the objective function becomes a differentiable function, so gradient-based optimization methods can be used to find the optimal structure. A neural architecture search method based on gradient descent for RUL estimation, with extensive experiments showing apparently, outperforms traditional approaches as well as Long Short-Term Memory (LSTM), and it takes much less computing resources than the reinforcement neural architecture search method.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Remaining useful life is the estimated continuous normal working time of a component or system from the current moment to the potential failure. The traditional methods have high trial-and-error costs and poor migration capabilities. Fortunately, the neural architecture search (NAS) that has emerged partially solves the problem of automatic construction of network models. However, the search strategy for NAS is reinforcement learning or evolutionary algorithms, which essentially search in discrete space and treating the objective function as a black box, which is very time-consuming. To solve this problem, we proposed a gradient-based neural architecture search method. This method regards a cell in the search space as a directed acyclic graph (DAG) containing N ordered nodes. Each node is a latent representation, and the directed edges represent the conversion operation of two nodes. By mixing the candidate operations (ReLU, tanh) with the softmax function, the search space becomes a continuous space and the objective function becomes a differentiable function, so gradient-based optimization methods can be used to find the optimal structure. A neural architecture search method based on gradient descent for RUL estimation, with extensive experiments showing apparently, outperforms traditional approaches as well as Long Short-Term Memory (LSTM), and it takes much less computing resources than the reinforcement neural architecture search method.
1559.
Kertész, Gábor; Szénási, Sándor; Vámossy, Zoltán
Comparative analysis of image projection-based descriptors in Siamese neural networks Journal Article
In: Advances in Engineering Software, vol. 154, pp. 102963, 2021, ISSN: 0965-9978.
@article{KERTESZ2021102963,
title = {Comparative analysis of image projection-based descriptors in Siamese neural networks},
author = {Gábor Kertész and Sándor Szénási and Zoltán Vámossy},
url = {https://www.sciencedirect.com/science/article/pii/S0965997820310097},
doi = {https://doi.org/10.1016/j.advengsoft.2020.102963},
issn = {0965-9978},
year = {2021},
date = {2021-01-01},
journal = {Advances in Engineering Software},
volume = {154},
pages = {102963},
abstract = {Low-level object matching can be done using projection signatures. In case of a large number of projections, the matching algorithm has to deal with less significant slices. A trivial approach would be to do statistical analysis or apply machine learning to determine the significant features. To take adjacent values of the projection matrices into account, a convolutional neural network should be used. To compare two matrices, a Siamese-structure of convolutional heads can be applied. In this paper, an experiment is designed and implemented to analyze the object matching performance of Siamese Convolutional Neural Networks based on multi-directional image projection data. A backtracking search-based Neural Architecture Generation method is used to create convolutional architectures, and a Master/Worker structured distributed processing with highly efficient scheduling based on the Longest Processing Times-heuristics is used for parallel training and evaluation of the models. Results show that the projection-based methods are Pareto optimal in terms of one-shot classification accuracy and memory consumption.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Low-level object matching can be done using projection signatures. In case of a large number of projections, the matching algorithm has to deal with less significant slices. A trivial approach would be to do statistical analysis or apply machine learning to determine the significant features. To take adjacent values of the projection matrices into account, a convolutional neural network should be used. To compare two matrices, a Siamese-structure of convolutional heads can be applied. In this paper, an experiment is designed and implemented to analyze the object matching performance of Siamese Convolutional Neural Networks based on multi-directional image projection data. A backtracking search-based Neural Architecture Generation method is used to create convolutional architectures, and a Master/Worker structured distributed processing with highly efficient scheduling based on the Longest Processing Times-heuristics is used for parallel training and evaluation of the models. Results show that the projection-based methods are Pareto optimal in terms of one-shot classification accuracy and memory consumption.
1558.
Zhang, Xuanyang; Hou, Pengfei; Zhang, Xiangyu; Sun, Jian
Neural Architecture Search with Random Labels Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-11834,
title = {Neural Architecture Search with Random Labels},
author = {Xuanyang Zhang and Pengfei Hou and Xiangyu Zhang and Jian Sun},
url = {https://arxiv.org/abs/2101.11834},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.11834},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1557.
Liang, Xinle; Liu, Yang; Luo, Jiahuan; He, Yuanqin; Chen, Tianjian; Yang, Qiang
Self-supervised Cross-silo Federated Neural Architecture Search Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-11896,
title = {Self-supervised Cross-silo Federated Neural Architecture Search},
author = {Xinle Liang and Yang Liu and Jiahuan Luo and Yuanqin He and Tianjian Chen and Qiang Yang},
url = {https://arxiv.org/abs/2101.11896},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.11896},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1556.
Yang, Yibo; You, Shan; Li, Hongyang; Wang, Fei; Qian, Chen; Lin, Zhouchen
Towards Improving the Consistency, Efficiency, and Flexibility of Differentiable Neural Architecture Search Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-11342,
title = {Towards Improving the Consistency, Efficiency, and Flexibility of Differentiable Neural Architecture Search},
author = {Yibo Yang and Shan You and Hongyang Li and Fei Wang and Chen Qian and Zhouchen Lin},
url = {https://arxiv.org/abs/2101.11342},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.11342},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1555.
Lu, Longfei; Lyu, Bo
Reducing energy consumption of Neural Architecture Search: An inference latency prediction framework Journal Article
In: Sustainable Cities and Society, vol. 67, pp. 102747, 2021, ISSN: 2210-6707.
@article{LU2021102747,
title = {Reducing energy consumption of Neural Architecture Search: An inference latency prediction framework},
author = {Longfei Lu and Bo Lyu},
url = {https://www.sciencedirect.com/science/article/pii/S221067072100041X},
doi = {https://doi.org/10.1016/j.scs.2021.102747},
issn = {2210-6707},
year = {2021},
date = {2021-01-01},
journal = {Sustainable Cities and Society},
volume = {67},
pages = {102747},
abstract = {Benefit from the success of NAS (Neural Architecture Search) in deep learning, humans are hopefully been released from the tremendous labor of manual tuning of structure and hyper-parameters. However, the success of NAS comes at the cost of much more computational resource consumption, thousands of times more computational power than ordinary training of manual-designed models, especially for the resource-aware multi-objective NAS, which must be serialized as a sequential loop of sampling, training, deployment, and inference. Recent research has shown that deep learning leads to huge energy consumption and CO2 emission (training of the namely Transformer can emit CO2 as much as five cars in their lifetimes Strubell et al. (2019)). Aiming to alleviate this issue, we propose the end-to-end inference latency prediction framework to empower the NAS process with a direct resource-aware efficiency indicator. Namely, we first propose the end-to-end latency prediction framework, which can predict latency quickly and accurately based on the dataset collected by ourselves. Eventually, we experimentally show that with the encoding scheme we designed, our proposed best model, LSTM-GBDT Latency Predictor(LGLP) achieves an excellent result of 0.9349 MSE, 0.5249 MAE, 0.9842 R2, and 0.9925 corrcoef. In other words, our limited dataset and encoding scheme already provide the precise knowledge representation of this large search space. By equipping NAS with the proposed framework, taking NEMO for example, it will save 1588 kWh⋅PUE energy, 1515 pounds CO2 emissions, and $3176 cloud compute cost of AWS. For NAS is now widely exploited in research or industry applications, this will bring incalculable benefits to society and the environment.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Benefit from the success of NAS (Neural Architecture Search) in deep learning, humans are hopefully been released from the tremendous labor of manual tuning of structure and hyper-parameters. However, the success of NAS comes at the cost of much more computational resource consumption, thousands of times more computational power than ordinary training of manual-designed models, especially for the resource-aware multi-objective NAS, which must be serialized as a sequential loop of sampling, training, deployment, and inference. Recent research has shown that deep learning leads to huge energy consumption and CO2 emission (training of the namely Transformer can emit CO2 as much as five cars in their lifetimes Strubell et al. (2019)). Aiming to alleviate this issue, we propose the end-to-end inference latency prediction framework to empower the NAS process with a direct resource-aware efficiency indicator. Namely, we first propose the end-to-end latency prediction framework, which can predict latency quickly and accurately based on the dataset collected by ourselves. Eventually, we experimentally show that with the encoding scheme we designed, our proposed best model, LSTM-GBDT Latency Predictor(LGLP) achieves an excellent result of 0.9349 MSE, 0.5249 MAE, 0.9842 R2, and 0.9925 corrcoef. In other words, our limited dataset and encoding scheme already provide the precise knowledge representation of this large search space. By equipping NAS with the proposed framework, taking NEMO for example, it will save 1588 kWh⋅PUE energy, 1515 pounds CO2 emissions, and $3176 cloud compute cost of AWS. For NAS is now widely exploited in research or industry applications, this will bring incalculable benefits to society and the environment.
1554.
Pinos, Michal; Mrazek, Vojtech; á, Luk
Evolutionary Neural Architecture Search Supporting Approximate Multipliers Technical Report
2021.
@techreport{DBLP:journals/corr/abs-2101-11883,
title = {Evolutionary Neural Architecture Search Supporting Approximate Multipliers},
author = {Michal Pinos and Vojtech Mrazek and Luk á},
url = {https://arxiv.org/abs/2101.11883},
year = {2021},
date = {2021-01-01},
journal = {CoRR},
volume = {abs/2101.11883},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
1553.
Lyu, B; Yuan, H; Lu, L; Zhang, Y
Resource-constrained Neural Architecture Search on Edge Devices Journal Article
In: IEEE Transactions on Network Science and Engineering, pp. 1-1, 2021.
@article{9336306,
title = {Resource-constrained Neural Architecture Search on Edge Devices},
author = {B Lyu and H Yuan and L Lu and Y Zhang},
url = {https://ieeexplore.ieee.org/document/9336306},
doi = {10.1109/TNSE.2021.3054583, keywords-NAS},
year = {2021},
date = {2021-01-01},
journal = {IEEE Transactions on Network Science and Engineering},
pages = {1-1},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
1552.
Gomez-Rosero, Santiago; Capretz, Miriam A M; Mir, Syed
Transfer Learning by Similarity Centred Architecture Evolution for Multiple Residential Load Forecasting Journal Article
In: Smart Cities, vol. 4, no. 1, pp. 217–240, 2021, ISSN: 2624-6511.
@article{smartcities4010014,
title = {Transfer Learning by Similarity Centred Architecture Evolution for Multiple Residential Load Forecasting},
author = {Santiago Gomez-Rosero and Miriam A M Capretz and Syed Mir},
url = {https://www.mdpi.com/2624-6511/4/1/14},
doi = {10.3390/smartcities4010014},
issn = {2624-6511},
year = {2021},
date = {2021-01-01},
journal = {Smart Cities},
volume = {4},
number = {1},
pages = {217--240},
abstract = {The development from traditional low voltage grids to smart systems has become extensive and adopted worldwide. Expanding the demand response program to cover the residential sector raises a wide range of challenges. Short term load forecasting for residential consumers in a neighbourhood could lead to a better understanding of low voltage consumption behaviour. Nevertheless, users with similar characteristics can present diversity in consumption patterns. Consequently, transfer learning methods have become a useful tool to tackle differences among residential time series. This paper proposes a method combining evolutionary algorithms for neural architecture search with transfer learning to perform short term load forecasting in a neighbourhood with multiple household load consumption. The approach centres its efforts on neural architecture search using evolutionary algorithms. The neural architecture evolution process retains the patterns of the centre-most house, and later the architecture weights are adjusted for each house in a multihouse set from a neighbourhood. In addition, a sensitivity analysis was conducted to ensure model performance. Experimental results on a large dataset containing hourly load consumption for ten houses in London, Ontario showed that the performance of the proposed approach performs better than the compared techniques. Moreover, the proposed method presents the average accuracy performance of 3.17 points higher than the state-of-the-art LSTM one shot method.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The development from traditional low voltage grids to smart systems has become extensive and adopted worldwide. Expanding the demand response program to cover the residential sector raises a wide range of challenges. Short term load forecasting for residential consumers in a neighbourhood could lead to a better understanding of low voltage consumption behaviour. Nevertheless, users with similar characteristics can present diversity in consumption patterns. Consequently, transfer learning methods have become a useful tool to tackle differences among residential time series. This paper proposes a method combining evolutionary algorithms for neural architecture search with transfer learning to perform short term load forecasting in a neighbourhood with multiple household load consumption. The approach centres its efforts on neural architecture search using evolutionary algorithms. The neural architecture evolution process retains the patterns of the centre-most house, and later the architecture weights are adjusted for each house in a multihouse set from a neighbourhood. In addition, a sensitivity analysis was conducted to ensure model performance. Experimental results on a large dataset containing hourly load consumption for ten houses in London, Ontario showed that the performance of the proposed approach performs better than the compared techniques. Moreover, the proposed method presents the average accuracy performance of 3.17 points higher than the state-of-the-art LSTM one shot method.