Pith. sign in

REVIEW 3 cited by

POPGym: Benchmarking Partially Observable Reinforcement Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.01859 v1 pith:6CDGNWCB submitted 2023-03-03 cs.LG cs.AIcs.RO

classification cs.LGcs.AIcs.RO
keywords memorypopgymobservablepartiallytrainingbaselinesbenchmarksdiverse
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Real world applications of Reinforcement Learning (RL) are often partially observable, thus requiring memory. Despite this, partial observability is still largely ignored by contemporary RL benchmarks and libraries. We introduce Partially Observable Process Gym (POPGym), a two-part library containing (1) a diverse collection of 15 partially observable environments, each with multiple difficulties and (2) implementations of 13 memory model baselines -- the most in a single RL library. Existing partially observable benchmarks tend to fixate on 3D visual navigation, which is computationally expensive and only one type of POMDP. In contrast, POPGym environments are diverse, produce smaller observations, use less memory, and often converge within two hours of training on a consumer-grade GPU. We implement our high-level memory API and memory baselines on top of the popular RLlib framework, providing plug-and-play compatibility with various training algorithms, exploration strategies, and distributed training paradigms. Using POPGym, we execute the largest comparison across RL memory models to date. POPGym is available at https://github.com/proroklab/popgym.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Benchmarking Massively Parallelized Multi-Task Reinforcement Learning for Robotics Tasks

    cs.RO 2025-07 conditional novelty 6.0 of 10

    The paper introduces MTBench, a GPU-accelerated benchmark for massively parallel multi-task RL, and reports experiments suggesting on-policy methods outperform off-policy baselines while value learning limits MTRL per...

  2. How Far Can LLMs Improve from Experience? Measuring Test-Time Learning Ability in LLMs with Human Comparison

    cs.CL 2025-06 conditional novelty 6.0 of 10

    LLMs improve only slightly and unstably from test-time experience on semantic reasoning games, while humans learn much faster.

  3. ASK in the Dark: Uncertainty-Gated LLM Assistance under Partial Observability

    cs.AI 2026-07 accept novelty 5.5 of 10

    Stateful trajectory-aware prompts turn uncertainty-gated small LMs into useful consultants for POMDP policies, with prompt design dominating model scale.

Pith tools