A Method for Evaluating Hyperparameter Sensitivity in Reinforcement Learning

Jacob Adkins, Michael Bowling, Adam White
2/3/2026

No official code found. Best implementation: jadkins99/hyperparameter_sensitivity (2 stars, MIT, last commit 2024-11-11).

Abstract

The performance of modern reinforcement learning algorithms critically relies on tuning ever-increasing numbers of hyperparameters. Often, small changes in a hyperparameter can lead to drastic changes in performance, and different environments require very different hyperparameter settings to achieve state-of-the-art performance reported in the literature. We currently lack a scalable and widely accepted approach to characterizing these complex interactions. This work proposes a new empirical methodology for studying, comparing, and quantifying the sensitivity of an algorithm's performance to hyperparameter tuning for a given set of environments. We then demonstrate the utility of this methodology by assessing the hyperparameter sensitivity of several commonly used normalization variants of PPO. The results suggest that several algorithmic performance improvements may, in fact, be a result of an increased reliance on hyperparameter tuning.

View on arXivView PDF

Code Implementations(1)

MIT
20PythonOct 30, 20241 years agoMIT

Similar Papers

Cite this paper

@article{adkins2026method,
  title  = {A Method for Evaluating Hyperparameter Sensitivity in Reinforcement Learning},
  author = {Jacob Adkins and Michael Bowling and Adam White},
  year   = {2026},
  eprint = {2412.07165},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2412.07165},
  url    = {https://arxiv.org/abs/2412.07165},
  journal = {NEURIPS 2024 2024}
}

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/2412.07165.svg)](https://codeofpaper.com/paper/2412.07165)

Discussion