Evaluating the Adversarial Robustness of Evolutionary Neural Architecture Search

Evolutionary algorithms have demonstrated effectiveness in neural architecture search (NAS). However, previous studies mainly focus on the clean performance of evolutionary neural architecture search algorithms (ENAS), neglecting attention to their robustness against adversarial attacks. Additionally, the training-free performance metrics show their promise in NAS by offering a means of estimating network performance at trivial costs. This paper comprehensively evaluates the robustness of ENAS algorithms under various settings. Specifically, we implement both single-objective ENAS and multi-objective ENAS algorithms. Different training-based and training-free metrics are employed for each algorithm. The results obtained from extensive experiments conducted on well-known NAS benchmarks, including NAS-Bench-201, NAS-Bench-Suite-Zero, and the Robustness dataset, yield two insightful findings. First, utilizing training-free performance metrics for finding robust network architectures is more efficient and promising compared to utilizing training-based ones. Second, conducting NAS runs with multi-objective ENAS allows for figuring out multiple networks that exhibit diversity in both robustness and characteristics.

Authors

Publication Details

Published
2024-08-15
DOI
https://doi.org/10.1109/mapr63514.2024.10660719
Citations
2
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
0.69
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Evaluating the Adversarial Robustness of Evolutionary Neural Architecture Search

Quan Phan, Ngoc Hoang Luong, Van Bich Nguyen, Hieu Trung Nguyen
2 citations
Adversarial Robustness in Machine Learning
0.69
article

Evaluating the Adversarial Robustness of Evolutionary Neural Architecture Search

Quan Phan, Ngoc Hoang Luong, Van Bich Nguyen, Hieu Trung Nguyen
article en
2 citations

Abstract

Evolutionary algorithms have demonstrated effectiveness in neural architecture search (NAS). However, previous studies mainly focus on the clean performance of evolutionary neural architecture search algorithms (ENAS), neglecting attention to their robustness against adversarial attacks. Additionally, the training-free performance metrics show their promise in NAS by offering a means of estimating network performance at trivial costs. This paper comprehensively evaluates the robustness of ENAS algorithms under various settings. Specifically, we implement both single-objective ENAS and multi-objective ENAS algorithms. Different training-based and training-free metrics are employed for each algorithm. The results obtained from extensive experiments conducted on well-known NAS benchmarks, including NAS-Bench-201, NAS-Bench-Suite-Zero, and the Robustness dataset, yield two insightful findings. First, utilizing training-free performance metrics for finding robust network architectures is more efficient and promising compared to utilizing training-based ones. Second, conducting NAS runs with multi-objective ENAS allows for figuring out multiple networks that exhibit diversity in both robustness and characteristics.

Openalex Percentile: Top 24%
Adversarial Robustness in Machine Learning
0.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.