Bayesian Optimization for Policy Search in High-Dimensional Systems via Automatic Domain Selection
Not on the map. Why?
Abstract (arXiv)
Bayesian Optimization (BO) is an effective method for optimizing expensive-to-evaluate black-box functions with a wide range of applications for example in robotics, system design and parameter optimization. However, scaling BO to problems with large input dimensions (>10) remains an open challenge. In this paper, we propose to leverage results from optimal control to scale BO to higher dimensional control tasks and to reduce the need for manually selecting the optimization domain. The contributions of this paper are twofold: 1) We show how we can make use of a learned dynamics model in combination with a model-based controller to simplify the BO problem by focusing onto the most relevant regions of the optimization domain. 2) Based on (1) we present a method to find an embedding in parameter space that reduces the effective dimensionality of the optimization problem. To evaluate the effectiveness of the proposed approach, we present an experimental evaluation on real hardware, as well as simulated tasks including a 48-dimensional policy for a quadcopter.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Jan 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.
- 2024Learning Based NMPC Adaptation for Autonomous Driving using Parallelized Digital Twincited by 2
- 2025Local Entropy Search over Descent Sequences for Bayesian Optimizationcited by 1
- 2025Model-free Reinforcement Learning for Model-based Control: Towards Safe, Interpretable and Sample-efficient Agentscited by 0
- 2025Local Entropy Search over Descent Sequences for Bayesian Optimization24 Nov 2025
- 2025Model-free Reinforcement Learning for Model-based Control: Towards Safe, Interpretable and Sample-efficient Agents17 Jul 2025
- 2024Learning Based NMPC Adaptation for Autonomous Driving using Parallelized Digital Twin26 Feb 2024