Efficient Heteroscedastic Bayesian Optimization for Risk-Aware AutoRL

Mingxuan Che, Tsung-Yuan Tseng, Theresa Eimer, Marius Lindauer, Alexander von Rohr
7/29/2026
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Reinforcement learning (RL) has shown remarkable success across a wide range of complex tasks. However, RL outcomes can be highly stochastic, and both expected performance and variability often depend on hyperparameter (HP) configurations. We propose efficient and risk-averse heteroscedastic Bayesian Optimization (ERAHBO), a Bayesian optimization method that models both the mean and variance of learning outcomes as functions of the HP configurations. ERAHBO aims to identify HP configurations that achieve high average return while reducing variability across training runs, and it improves the sample efficiency of the HP optimization via adaptive re-sampling rather than a fixed budget per HP. Empirical evaluations across diverse RL algorithms and environments demonstrate that ERAHBO generally outperforms both risk-neutral and risk-averse baselines, delivering improved sample efficiency for risk-averse returns.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{che2026efficient,
  title  = {Efficient Heteroscedastic Bayesian Optimization for Risk-Aware AutoRL},
  author = {Mingxuan Che and Tsung-Yuan Tseng and Theresa Eimer and Marius Lindauer and Alexander von Rohr},
  year   = {2026},
  eprint = {2607.26680},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2607.26680v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2607.26680.svg)](https://codeofpaper.com/paper/2607.26680)

Discussion