Hyperparameter and Neural Architecture Search via Evolutionary Optimization for Reinforcement Learning: HPNAS-RL
Organizations: Volkswagen Group Innovation, Volkswagen AG, Berliner Ring 2, Wolfsburg, 38440, Lower Saxony, Germany. · Institute of Mathematics, TU Berlin, Straße des 17. Juni 136, Berlin, 10623, Berlin, Germany.
Abstract
In this study, we propose a dual-branch evolutionary framework that simultaneously performs Neural Architecture Search (NAS) and Hyperparameter Optimization (HPO) for Reinforcement Learning (RL) in Autonomous Driving (AD) tasks. While NAS has shown strong potential in automating architecture design for Convolutional Neural Networks (CNNs), its application to RL remains limited, especially in scenarios that require joint optimization of architectural and training dynamics. Building on our prior work on Evolutionary Multi-Objective NAS (EMNAS), the proposed framework evolves discrete network architectures and continuous hyperparameters in parallel under a unified multi-objective search strategy. In this setup, NAS targets the convolutional layers of the RL policy network - responsible for visual feature extraction, while HPO focuses on optimizing critical RL hyperparameters. To accelerate convergence and improve generalization, we incorporate parallel evaluation and a teacher-student policy transfer mechanism. Experiments in a high-fidelity driving simulator show that the joint NAS-HPO framework consistently outperforms standalone NAS, yielding policies with higher rewards, fewer parameters, and improved stability. These results highlight the benefits of jointly optimizing model structure and training dynamics for scalable and effective RL agent design.
Figures & tables
| Operation Type | Details |
|---|---|
| Convolutional Operations | 3×3 depth-wise separable convolution |
| 5×5 depth-wise separable convolution | |
| 3×3 dilated convolution | |
| 5×5 dilated convolution | |
| 3×3 inverted convolution | |
| 5×5 inverted convolution |
| Hyperparameter | Range | Description |
|---|---|---|
| Batch Size | Number of samples per gradient update | |
| Discount Factor ( ) | Weighting of future rewards | |
| Learning Rate | Step size for gradient updates | |
| Time Horizon | Number of steps per trajectory segment |
| Reward | Params (M) | FLOPs (G) | |||||
|---|---|---|---|---|---|---|---|
| Exp | Gen / Pop | NAS | HPNAS | NAS | HPNAS | NAS | HPNAS |
| 1 | 6 / 6 | 538 | 233 | 1.29 | 1.27 | 1.26 | 1.25 |
| 2 | 10 / 4 | 585 | 415 | 1.34 | 0.94 | 1.32 | 0.93 |
| 3 | 10 / 10 | 569 | 621 | 0.94 | 0.87 | 0.97 | 0.84 |
| 4 | 10 / 15 | 753 | 745 | 1.45 | 0.77 | 1.44 | 0.76 |
| 5 | 15 / 15 | 584 | 682 | 0.60 | 0.84 | 0.52 | 0.82 |
Neural Architecture Search
Neural Architecture Search automates neural network design for target tasks, resource budgets, and hardware constraints.
See all 132 papers