mlsanityData to 14 Oct 2026

Adaptive Multi-Fidelity Reinforcement Learning for Variance Reduction in Engineering Design Optimization

arXiv 2503.18229 ↗First posted 23 Mar 2025cs.LG cs.AIcited by 0

On the map: Deep reinforcement learning methods → RL theory and sample complexity

Abstract (arXiv)

Multi-fidelity Reinforcement Learning (RL) frameworks efficiently utilize computational resources by integrating analysis models of varying accuracy and costs. The prevailing methodologies, characterized by transfer learning, human-inspired strategies, control variate techniques, and adaptive sampling, predominantly depend on a structured hierarchy of models. However, this reliance on a model hierarchy can exacerbate variance in policy learning when the underlying models exhibit heterogeneous error distributions across the design space. To address this challenge, this work proposes a novel adaptive multi-fidelity RL framework, in which multiple heterogeneous, non-hierarchical low-fidelity models are dynamically leveraged alongside a high-fidelity model to efficiently learn a high-fidelity policy. Specifically, low-fidelity policies and their experience data are adaptively used for efficient targeted learning, guided by their alignment with the high-fidelity policy. The effectiveness of the approach is demonstrated in an octocopter design optimization problem, utilizing two low-fidelity models alongside a high-fidelity simulator. The results demonstrate that the proposed approach substantially reduces variance in policy learning, leading to improved convergence and consistent high-quality solutions relative to traditional hierarchical multi-fidelity RL methods. Moreover, the framework eliminates the need for manually tuning model usage schedules, which can otherwise introduce significant computational overhead. This positions the framework as an effective variance-reduction strategy for multi-fidelity RL, while also mitigating the computational and operational burden of manual fidelity scheduling.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 8 of its 41 references that are in the map. First posted on arXiv 23 Mar 2025.

Builds on

8 of 41 references.

References · 8

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  3. 2018Survey of multifidelity methods in uncertainty propagation, inference, and optimizationcited by 142
  4. 2019A Deep Reinforcement Learning Approach for Global Routingcited by 20
  5. 2023A Latent Variable Approach for Non-Hierarchical Multi-Fidelity Adaptive Samplingcited by 10
  6. 2022Learning to design without prior data: Discovering generalizable design strategies using deep learning and tree searchcited by 5
  7. 2023Fairness- and uncertainty-aware data generation for data-driven designcited by 2
  8. 2023On the Effects of Heterogeneous Errors on Multi-fidelity Bayesian Optimizationcited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024Adaptive Learning of Design Strategies over Non-Hierarchical Multi-Fidelity Models via Policy Alignment
  2. 2025A Multi-Fidelity Control Variate Approach for Policy Gradient Estimation
  3. 2025Multi-Fidelity Hybrid Reinforcement Learning via Information Gain Maximization
  4. 2024Multi-Fidelity Reinforcement Learning for Time-Optimal Quadrotor Re-planning
  5. 2026Multi-Fidelity Policy Gradients Stabilize Data-Scarce Reinforcement Learning
  6. 2025Multi-fidelity Reinforcement Learning Control for Complex Dynamical Systems
  7. 2025Surrogate Fitness Metrics for Interpretable Reinforcement Learning
  8. 2026Beyond Static Datasets: Robust Offline Policy Optimization via Vetted Synthetic Transitions