Hyperparameter and Neural Architecture Search via Evolutionary Optimization for Reinforcement Learning: HPNAS-RL
Authors: Nihal Acharya Adde, Hanno Gottschalk
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.
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
Figure 1: Simulated three-lane track used for RL-based AD training in Unity3D. Top left: Drone view of road with agent. Top right: Front camera view, later converted to a semantic segmentation image and used as the network input. Bottom: Driving behavior based on predicted trajectory points.
Figure 2: Overview of the EMNAS pipeline. Multi-objective evolutionary optimization combines Early-Exit Population Initialization (EEPI) and Optimized Transfer Learning (OTL) for efficient RL architecture discovery.
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
Table 1: Search space used for normal and reduction cells in EMNAS.
Hyperparameter
Range
Description
Batch Size
64−512
Number of samples per gradient update
Discount Factor ( γ )
0.95−0.999
Weighting of future rewards
Learning Rate
10−5−10−2
Step size for gradient updates
Time Horizon
32−256
Number of steps per trajectory segment
Table 2: Tuned Hyperparameters and Ranges
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
Table 3: Comparison of EMNAS and HPNAS across multiple experiments
Figure 3: Reward–Parameter evolution across generations. Blue and red points represent NAS and HPNAS respectively, shaded from light (early generations) to dark (later generations).
Figure 4: Hyperparameter evolution over generations for Experiment 6 (15 generations, 20 population). Each subplot visualizes one hyperparameter, shaded from light (early generations) to dark (later generations).
We present AutoResearch-RL, a framework in which a reinforcement learning agent conducts open-ended neural architecture and hyperparameter research without human supervision, running perpetually until a termination oracle signals convergence or resource exhaustion. At each step the agent proposes a code modification to a target training script, executes it under a fixed wall clock time budget, observes a scalar reward derived from validation bits-per-byte (val-bpb), and updates its policy via Proximal Policy Optimisation (PPO). The key design insight is the separation of three concerns: (i) a frozen environment (data pipeline, evaluation protocol, and constants) that guarantees fair cross-experiment comparison; (ii) a mutable target file (train.py) that represents the agent's editable state; and (iii) a meta-learner (the RL agent itself) that accumulates a growing trajectory of experiment outcomes and uses them to inform subsequent proposals. We formalise this as a Markov Decision Process, derive convergence guarantees under mild assumptions, and demonstrate empirically on a single GPU nanochat pretraining benchmark that AutoResearch-RL discovers configurations that match or exceed hand-tuned baselines after approximately 300 overnight iterations, with no human in the loop.
End-to-end planning has emerged as a dominant paradigm for autonomous driving, where recent models often adopt a scoring-selection framework to choose trajectories from a large set of candidates, with diffusion-based decoding showing strong promise. However, directly selecting from the entire candidate space remains difficult to optimize, and Gaussian perturbations used in diffusion often introduce unrealistic trajectories that complicate the denoising process. In addition, for training these models, reinforcement learning (RL) has shown promise, but existing end-to-end RL approaches typically rely on a single coupled reward without structured signals, limiting optimization effectiveness. To address these challenges, we propose HAD, an end-to-end planning framework with a Hierarchical Diffusion Policy that decomposes planning into a coarse-to-fine process. To improve trajectory generation, we introduce Structure-Preserved Trajectory Expansion, which produces realistic candidates while maintaining kinematic structure. For policy learning, we develop Metric-Decoupled Policy Optimization (MDPO) to enable structured RL optimization across multiple driving objectives. Extensive experiments show that HAD achieves new state-of-the-art performance on both NAVSIM and HUGSIM, outperforming prior arts by a huge margin: +2.3 EPDMS on NAVSIM and +4.9 Route Completion on HUGSIM.
End-to-end autonomous driving is typically built upon imitation learning (IL), yet its performance is constrained by the quality of human demonstrations. To overcome this limitation, recent methods incorporate reinforcement learning (RL) through sequential fine-tuning. However, such a paradigm remains suboptimal: sequential RL fine-tuning can introduce policy drift and often leads to a performance ceiling due to its dependence on the pretrained IL policy. To address these issues, we propose PaIR-Drive, a general Parallel framework for collaborative Imitation and Reinforcement learning in end-to-end autonomous driving. During training, PaIR-Drive separates IL and RL into two parallel branches with conflict-free training objectives, enabling fully collaborative optimization. This design eliminates the need to retrain RL when applying a new IL policy. During inference, RL leverages the IL policy to further optimize the final plan, allowing performance beyond prior knowledge of IL. Furthermore, we introduce a tree-structured trajectory neural sampler to group relative policy optimization (GRPO) in the RL branch, which enhances exploration capability. Extensive analysis on NAVSIMv1 and v2 benchmark demonstrates that PaIR-Drive achieves Competitive performance of 91.2 PDMS and 87.9 EPDMS, building upon Transfuser and DiffusionDrive IL baselines. PaIR-Drive consistently outperforms existing RL fine-tuning methods, and could even correct human experts' suboptimal behaviors. Qualitative results further confirm that PaIR-Drive can effectively explore and generate high-quality trajectories.
Zhexi Lian, Haoran Wang, Xuerun Yan +4
Tongji University · Nanyang Technological University · Chery Automobile