On a hand-built multiclass benchmark, (1+1)-ENAS with one-bit or bit-wise mutation finds an optimal architecture in O(rM ln(rM)) expected generations, with lower bound Omega(rM ln M), so the two mutations have nearly equal runtime.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Runtime Analysis of Evolutionary NAS for Multiclass Classification
On a hand-built multiclass benchmark, (1+1)-ENAS with one-bit or bit-wise mutation finds an optimal architecture in O(rM ln(rM)) expected generations, with lower bound Omega(rM ln M), so the two mutations have nearly equal runtime.