A Bird's-Eye View of Iterative Reward Design
cs.LG, cs.AI, cs.RO
Submitted: 2026-10-03
Updated: 2026-10-03
Comments: 30 pages
Code: https://github.com/safety-research/bird
License: http://creativecommons.org/licenses/by/4.0/
The gist: Designing effective reward functions in RL typically requires substantial expertise and trial and error.
Abstract
Designing effective reward functions in RL typically requires substantial expertise and trial and error. Recent work automates this process with LLM-based systems that generate and iteratively improve reward code using policy feedback. However, these methods are often hard to compare because they differ in implementation details, feedback assumptions, and evaluation environments. To address this, we introduce a Benchmark for Iterative Reward Design (BIRD) that expresses existing methods in a unified configuration and evaluation space. This lets us compare algorithms directly, ablate individual design choices, and prototype new components under matched feedback conditions and policy-training budgets. Across MuJoCo, Meta-World, Assistax, and HumanoidBench, we identify a small set of simple design choices that consistently improve performance. Combining these choices yields significantly better performance than the evaluated methods from prior work. Our results highlight the strength of simple baselines and motivate further study of when additional algorithmic complexity improves iterative reward design. Code is available at https://github.com/safety-research/bird.
Sources
- Concrete Problems in AI Safety
- Predictive Sampling: Real-time Behaviour Synthesis with MuJoCo
- Hyperspherical Normalization for Scalable Deep Reinforcement Learning
- Evolution through Large Models
- Illuminating search spaces by mapping elites
- Proximal Policy Optimization Algorithms
- FastTD3: Simple, Fast, and Capable Reinforcement Learning for Humanoid Control
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks