Hardware-aware neural architecture search (NAS) requires jointly optimizing predictive accuracy and device-specific latency over discrete search spaces. While multi-objective swarm optimizers show promise, continuous formulations such as the Multi-Objective White Shark Optimizer (MOWSO) can suffer from quantization noise when rounded to integer-encoded architecture vectors. To address this limitation, we propose MOSHO (Multi-Objective Shark Hunting Optimization), a native discrete metaheuristic that replaces continuous motion equations with discrete architecture-editing operators. MOSHO integrates adaptive operator scheduling, energy-regulated restarts, and deferred crowding-distance truncation to enhance exploration and search efficiency. On the merged NAS-Bench-201/HW-NAS-Bench benchmark across 18 contexts, MOSHO achieves a median normalized hypervolume of 0.9987 and IGD+ of 0.0064, yielding Pareto fronts competitive with NSGA-II while reducing search runtime by 96.4% (0.64 s vs. 17.72 s). These results demonstrate that tailored discrete search mechanisms can enable swarm optimizers to achieve high-quality multi-objective solution quality with substantially lower search cost in hardware-aware NAS.
Figures & tables
Figure 1: State-of-the-art landscape considered before focusing on shark-inspired optimization for hardware-aware multi-objective NAS
Figure 2: Example NAS-Bench-201 cell (NONE: zeroize ), encoded as x=(3,1,0,0,2,4) with indices 0 : zeroize , 1 : skip-connect , 2 : conv 1×1 , 3 : conv 3×3 , 4 : avg-pool 3×3 .
Figure 3: System architecture of MOSHO. Dashed green arrows denote the archive-driven feedback loops that distinguish MOSHO from its ancestors.
Figure 4: Workflow diagram of the MOSHO search cycle.
Metric
Description
Goal
HV
Measures both convergence and diversity by computing the objective volume dominated by the approximation front P^ relative to a reference point (r1,r2) offset by ε=10−9 from P∗
↑
nHV
Normalizes HV by the hypervolume of the exact Pareto front ( HV(P)/HVmax ) to enable fair comparison across contexts and scales
↑
IGD+
Evaluates both proximity and coverage by computing the average minimum modified distance from P∗ to P^ while preserving weak Pareto compliance
↓
Spacing ( S )
Evaluates the uniformity of distribution between adjacent non-dominated solutions via the standard deviation of nearest-neighbour distances di
↓
Execution Time
Measures computational efficiency and algorithmic overhead via median wall-clock runtime across complete search runs at each budget level
↓
Note: ↑ means maximize; ↓ means minimize.
Table 1: Summary of Evaluation Metrics
Param
Description
Range
Value
Param
Description
Range
Value
N
Population size
{20,30,50,80,100}
50
γ
Energy reset factor
[0,1]
0.50
M
Archive capacity
[10,N]
50
Ppatrol
Patrol probability
[0,1]
0.20
e0
Initial energy/agent
[0.5,2.0]
0.818
Pscent
Scent probability
[0,1]
0.25
emin
Restart energy thresh.
[0.05,0.5]
0.500
Pcircle
Circle probability
[0,1]
0.15
emax
Energy cap
[0.5,2.0]
1.699
Pburst
Burst probability
[0,1]
0.10
δ
Energy decay (rejection)
[0,0.1]
0.0968
Pcrossover
Crossover probability
[0,1]
0.20
Table 2: MOSHO hyperparameter settings after Optuna tuning.
Single-unit ablations
Grouped variants
Rem.
Name
Var.
Rem.
Name
Var.
U01
Discrete operator kernels
ABL-U01
U01+U02
Search core removal
G-SEARCH
U02
Explicit acceptance policy
ABL-U02
U05+U06+U07
Adaptive block removal
G-ADAPT
U03
Energy-regulated restarts
ABL-U03
U08
K-means leader-selection removal
G-ARCHIVE
U04
Dual adaptive signal
ABL-U04
U08+U09
No-advance mode
G-NOADV
U05
Active archive feedback
ABL-U05
U01–U07
Core mechanism removal
G-NOBASE
Table 3: Ablation units and tested grouped variants.
Figure 5: Ablation study results across all tested variants. Top: median nHV, IGD + , spacing, and execution time over 30 independent runs per variant across the 18 benchmark contexts. Middle: Vargha–Delaney A12 effect sizes for IGD + (left) and nHV (right); values above 0.5 favor MOSHO, values below 0.5 favor the ablated variant, dashed line marks the no-effect threshold of 0.5. Bottom: Wilcoxon signed-rank p -values for IGD + (left) and nHV (right); values below the significance threshold ( α=0.05 , dashed line) indicate a statistically significant difference from MOSHO.
Figure 6: Comparison of MOSHO with several multi-objective optimization algorithms across 18 contexts. Median nHV and IGD + (top), and execution time and spacing (bottom), are reported over 30 runs with a budget of 15000 evaluations.
Figure 7: Sensitivity analysis of MOSHO with respect to the two primary hyperparameters. For visualization purposes, each metric is independently normalized to the interval [0,1] , allowing the relative evolution of nHV, IGD + , spacing, and runtime to be compared on a common scale.
Figure 8: Data inflation procedure applied to the NAS-Bench-201 search space. A new intermediate node is inserted into the DAG, adding 4 new edges and expanding the architecture space from 56=15,625 to 510=9,765,625 candidate architectures.
Metric
MOSHO
NSGA-III
MOEA/D
nHV
0.9658
0.9350
0.9070
IGD +
0.042
0.063
0.066
Spacing
0.628
4.248
7.702
Runtime (s)
0.68
2.23
0.80
Table 4: Comparison of MOSHO against NSGA-III and MOEA/D across 18 contexts.
Appendix figures & tables3 assets
Supplementary material from the paper’s appendix.
Appendix
Dimension
WSO
MOWSO
SSO
MOSHO
Objective type
Single
Multi
Single
Multi
Search space
Continuous
Continuous
Continuous
Discrete (native)
Search mechanism
Velocity–position, factor μ
Velocity–position with post-hoc rounding
Gradient-following with rotational search
Six discrete operator kernels
Crossover
None
None
None
Uniform, then mutation ( p=0.3 )
Archive strategy
None
Pareto archive, True Distance
None
Pareto archive, crowding distance
Truncation timing
N/A
Per candidate
N/A
End of iteration (batch)
Appendix
Table 5: Structural comparison between MOSHO and its ancestor methods.
B
HV
IGD +
Spacing
Runtime (s)
Best Latency
1,000
0.9881
0.1120
3.2454
0.0538
0.3571
2,000
0.9935
0.0674
3.0531
0.1150
0.3568
5,000
0.9974
0.0258
2.8476
0.3066
0.3567
7,000
0.9979
0.0162
2.8126
0.4265
0.3566
10,000
0.9989
0.0110
2.7859
0.6289
0.3567
15,000
0.9992
0.0069
2.7634
0.9779
0.3566
Appendix
Table 6: Effect of evaluation budget B on raw median metrics ( N=50 fixed).
N
HV
IGD +
Spacing
Runtime (s)
Best Latency
20
0.9992
0.0089
3.8056
0.8921
0.3565
30
0.9993
0.0067
3.2879
0.9756
0.3566
50
0.9992
0.0069
2.7634
1.0047
0.3566
80
0.9994
0.0092
2.7539
0.9571
0.3566
100
0.9993
0.0070
2.7348
0.9914
0.3566
Appendix
Table 7: Effect of population size N on raw median metrics ( B=15,000 fixed).
Neural architecture search (NAS) automates the discovery of neural networks that meet specified criteria, yet its evaluation procedures are often hardcoded, limiting the ability to introduce new metrics. This issue is especially pronounced in hardware-aware NAS, where objectives depend on target devices such as edge hardware. To address this limitation, we propose SEval-NAS, a metric-evaluation mechanism that converts architectures to strings, embeds them as vectors, and predicts performance metrics. Using NATS-Bench and HW-NAS-Bench, we evaluated accuracy, latency, and memory. Kendall's τ correlations showed stronger latency and memory predictions than accuracy, indicating the suitability of SEval-NAS as a hardware cost predictor. We further integrated SEval-NAS into FreeREA to evaluate metrics not originally included. The method successfully ranked FreeREA-generated architectures, maintained search time, and required minimal algorithmic changes. Our implementation is available at: https://github.com/Analytics-Everywhere-Lab/neural-architecture-search
Neural Architecture Search (NAS) has become a pivotal technique in automated machine learning. Evolutionary Algorithm (EA)-based methods demonstrate superior search quality but suffer from prohibitive computational costs, while gradient-based approaches like DARTS offer high efficiency but are prone to premature convergence and performance collapse. To bridge this gap, we propose G-ICSO-NAS, a hybrid framework implementing a three-stage optimization strategy. The Warm-up Phase pre-trains supernet weights (w) via differentiable methods while architecture parameters (α) remain frozen. The Exploration Phase adopts a hybrid co-optimization mechanism: an Improved Competitive Swarm Optimizer (ICSO) with diversity-aware fitness navigates the architecture space to update α, while gradient descent concurrently updates w. The Stability Phase employs fine-grained gradient-based search with early stopping to converge to the optimal architecture. By synergizing ICSO's global navigation capability with differentiable methods' efficiency, G-ICSO-NAS achieves remarkable performance with minimal cost. In the context of the DARTS search space, an accuracy of 97.46% is achieved on CIFAR-10 with a computational budget of just 0.15 GPU-Days. The method also exhibits strong transfer potential, recording accuracies of 83.1% (CIFAR-100) and 75.02% (ImageNet). Furthermore, regarding the NAS-Bench-201 benchmark, G-ICSO-NAS is shown to deliver state-of-the-art results across all evaluated datasets.
Xingbang Du, Enzhi Zhang, Rui Zhong +2
Information Systems Design Laboratory, Hokkaido University, Sapporo, Japan · Information Initiative Center, Hokkaido University, Sapporo, Japan
Edge AI deployment demands neural architectures that are simultaneously accurate, computationally efficient, and hardware-deployable - a challenge addressed by hardware-aware Neural Architecture Search (NAS). While recent works incorporate quantization directly into the NAS loop, these approaches expand search complexity and tightly couple architecture and quantization design. The simpler post-search quantization strategy has received little analytical attention: the effects of Post-Training Quantization (PTQ) on the NAS-discovered Pareto structure remain uncharacterised, and no framework combines quantized architecture mapping onto reconfigurable accelerators with automated hardware exploration. This paper addresses both gaps. First, a three-stage pipeline is proposed: a hardware-agnostic Pareto rank surrogate frontend on NAS-Bench-201, a quantization bridge with Pareto-aware filtering and feedback control, and an evolutionary Domain Space Exploration (DSE) backend on CGRA4ML for optimal hardware mapping. Second, an empirical study characterises how INT4 PTQ perturbs the NAS-Bench-201 Pareto space through formal stability metrics on ground-truth data for all 15,625 architectures, and demonstrates that an FP32 zero-shot surrogate outperforms a dedicated INT4-trained surrogate in Pareto space coverage across two standard search strategies.
Eleftherios Mylonas, Angelos Kouprizas, Michael Birbas +1