mlsanityData to 7 Oct 2026

The Impact of Task Underspecification in Evaluating Deep Reinforcement Learning

arXiv 2210.08607 ↗First posted 16 Oct 2022cs.LG cs.AI cs.ROcited by 10

Not on the map. Why?

Abstract (arXiv)

Evaluations of Deep Reinforcement Learning (DRL) methods are an integral part of scientific progress of the field. Beyond designing DRL methods for general intelligence, designing task-specific methods is becoming increasingly prominent for real-world applications. In these settings, the standard evaluation practice involves using a few instances of Markov Decision Processes (MDPs) to represent the task. However, many tasks induce a large family of MDPs owing to variations in the underlying environment, particularly in real-world contexts. For example, in traffic signal control, variations may stem from intersection geometries and traffic flow levels. The select MDP instances may thus inadvertently cause overfitting, lacking the statistical power to draw conclusions about the method's true performance across the family. In this article, we augment DRL evaluations to consider parameterized families of MDPs. We show that in comparison to evaluating DRL methods on select MDP instances, evaluating the MDP family often yields a substantially different relative ranking of methods, casting doubt on what methods should be considered state-of-the-art. We validate this phenomenon in standard control benchmarks and the real-world application of traffic signal control. At the same time, we show that accurately evaluating on an MDP family is nontrivial. Overall, this work identifies new challenges for empirical rigor in reinforcement learning, especially as the outcomes of DRL trickle into downstream decision-making.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 23 of its 56 references that are in the map. First posted on arXiv 16 Oct 2022.

Builds on

23 of 56 references.

References · 23

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2015Trust Region Policy Optimizationcited by 2,503
  3. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  4. 2018DeepMind Control Suitecited by 935
  5. 2021Deep Reinforcement Learning at the Edge of the Statistical Precipicecited by 781
  6. 2017Deep Reinforcement Learning that Matterscited by 727
  7. 2019Model-Based Reinforcement Learning for Ataricited by 495
  8. 2020MOT20: A benchmark for multi object tracking in crowded scenescited by 355
  9. 2019Transfer Learning in Biomedical Natural Language Processing: An Evaluation of BERT and ELMo on Ten Benchmarking Datasetscited by 298
  10. 2020Implementation Matters in Deep Policy Gradients: A Case Study on PPO and TRPOcited by 184
  11. 2020What Matters In On-Policy Reinforcement Learning? A Large-Scale Empirical Studycited by 157
  12. 2021Why Generalization in RL is Difficult: Epistemic POMDPs and Implicit Partial Observabilitycited by 102
11 more
  1. 2019Learning Phase Competition for Traffic Signal Controlcited by 84
  2. 2013Hidden Parameter Markov Decision Processes: A Semiparametric Regression Approach for Discovering Latent Task Parametrizationscited by 68
  3. 2020AttendLight: Universal Attention-Based Reinforcement Learning Model for Traffic Signal Controlcited by 60
  4. 2019Measuring the Reliability of Reinforcement Learning Algorithmscited by 49
  5. 2022Contextualize Me -- The Case for Context in Reinforcement Learningcited by 41
  6. 2020Evaluating the Performance of Reinforcement Learning Algorithmscited by 35
  7. 2020Learning to Locomote: Understanding How Environment Design Matters for Deep Reinforcement Learningcited by 27
  8. 2021Is High Variance Unavoidable in RL? A Case Study in Continuous Controlcited by 26
  9. 2021CARL: A Benchmark for Contextual and Adaptive Reinforcement Learningcited by 21
  10. 2019Learning an Interpretable Traffic Signal Control Policycited by 20
  11. 2022Learning Eco-Driving Strategies at Signalized Intersectionscited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 5; 2025: 0; 2026: 2.

10 papers.