What Does a ProcGen Generalization Gap Measure? Action Rules, Residual Entropy, and the Missing Random Floor
cs.LG, cs.AI
Submitted: 2026-09-26
Updated: 2026-10-02
License: http://creativecommons.org/licenses/by/4.0/
The gist: A generalization gap in reinforcement learning, return on training levels minus return on held-out levels, is usually reported without a reference point.
Terminology
Abstract
A generalization gap in reinforcement learning, return on training levels minus return on held-out levels, is usually reported without a reference point. We argue that it should be read against a measured random floor: the return of a uniform-random policy on the same levels under the same evaluation harness. On eight ProcGen environments with PPO at a compute-limited budget (8M steps, 16 parallel environments; three games extended to 25M), the floor changes what standard numbers mean. The test-time action rule decides which policy is measured: in miner, the sampled policy scores 5.1x the floor on held-out levels while its argmax scores below it in every run, and greedy evaluation places two environments significantly below the floor. Used as a convergence diagnostic, raw policy entropy flags six of eight environments, but 32-66% of that entropy lies on actions with identical effects; against the floor, five of eight sampled policies are clearly above it on held-out levels and heist's is not distinguishable from it. An audit of twelve ProcGen codebases finds that nine sample test-time actions with no explicit choice at the evaluation call site. We recommend that every reported gap state its action rule, seed its evaluation and specify its tests before analysis, and report the floor on both level sets.
Sources
- Preventing Learning Stagnation in PPO by Scaling to 1 Million Parallel Environments
- Reliability of CKA as a Similarity Measure in Deep Learning
- Improving Generalization on the ProcGen Benchmark with Simple Architectural Changes and Scale
- Proximal Policy Optimization with Adaptive Exploration
- Measuring Sample Efficiency and Generalization in Reinforcement Learning Benchmarks: NeurIPS 2020 Procgen Benchmark
- Analyzing Reinforcement Learning Benchmarks with Random Weight Guessing
- PPO-BR: Dual-Signal Entropy-Reward Adaptation for Trust Region Policy Optimization
- Robust Policy Optimization in Deep Reinforcement Learning
- Impoola: The Power of Average Pooling for Image-Based Deep Reinforcement Learning
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