Pith. sign in

REVIEW 2 minor 379 cited by

OpenAI Gym

T0 review · 0 major / 2 minor · reviewed 2026-05-11 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A toolkit supplies benchmark problems for reinforcement learning through a shared interface along with a website for comparing algorithm results.

desk verdict OpenAI Gym is a practical announcement of a shared RL benchmark suite with a common interface, and the paper's value is in describing a working implementation that the field has used. read the letter →

arxiv 1606.01540 v1 pith:QYSKLZTX submitted 2016-06-05 cs.LG cs.AI

Greg Brockman , Vicki Cheung , Ludwig Pettersson , Jonas Schneider , John Schulman , Jie Tang , Wojciech Zaremba This is my paper · ORCID
classification cs.LGcs.AI
keywords reinforcementlearningbenchmarkenvironmentscommoninterfacealgorithmcomparisontoolkitsimulationbenchmarksresultsharingresearchinfrastructure
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper presents a toolkit that contains a collection of benchmark problems, each exposing the same interface so that reinforcement learning agents can interact with environments in a consistent way. It pairs this with a website where researchers can share results and directly compare how different algorithms perform on those benchmarks. The work explains the toolkit's components and the design choices made during its creation. A reader would care because this structure could let researchers avoid repeatedly building custom test setups and instead focus on improving methods while seeing clear progress across the field.

What carries the argument

The common interface that lets any reinforcement learning algorithm interact uniformly with the benchmark environments.

What would settle it

Track whether new reinforcement learning papers begin using the toolkit's environments for evaluation and posting comparable results on the shared website; sustained low adoption would indicate the standardization has not taken hold.

Watch

Extended reading notes

Core claim

The central claim is that the toolkit, consisting of a growing collection of benchmark problems that expose a common interface and a website for sharing results, supports reinforcement learning research by enabling standardized testing and performance comparisons. The paper details the toolkit's components and the design decisions that shaped the software.

Load-bearing premise

That providing a common interface for environments plus a platform for sharing results will be sufficient to drive progress and fair comparisons in reinforcement learning.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 2 minor

Summary. The manuscript is a whitepaper introducing OpenAI Gym as a toolkit for reinforcement learning research. It describes a growing collection of benchmark environments that share a common interface, a website for sharing results to enable comparison of algorithms, and the software components along with the design decisions that shaped the implementation.

Significance. If the described components are delivered as stated, the work provides a standardized, open-source platform that lowers barriers for RL experimentation and supports reproducible benchmarking across the community. The emphasis on a common interface and public result sharing directly addresses fragmentation in RL evaluation practices.

minor comments (2)
  1. The description of the environment interface in the components section would benefit from an explicit listing of the core methods (e.g., reset, step, render) with their signatures to aid immediate implementation by readers.
  2. A brief note on the versioning or release process for the benchmark collection would clarify how new environments are added while maintaining backward compatibility.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of the OpenAI Gym whitepaper and the recommendation to accept. The referee's summary accurately captures the toolkit's purpose, the common interface for environments, the results-sharing website, and the discussion of design decisions.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: purely descriptive whitepaper with no derivation chain

full rationale

The manuscript is a software whitepaper that describes the OpenAI Gym toolkit, its environments, common interface, and result-sharing website. It contains no equations, no fitted parameters, no predictions, no formal derivations, and no load-bearing claims that reduce to self-referential inputs. The central content is expository documentation of design choices and released code; the reader's noted assumption about real-world representativeness is not used as a premise for any quantitative or derivational result. No self-citations or ansatzes are invoked in a manner that could create circularity.

Assumptions & free parameters 0 free parameters · 0 assumptions · 0 invented entities

This is a software toolkit description paper containing no mathematical derivations, fitted parameters, background axioms, or postulated entities.

how reviews work

0 comments
Cite this review

Pith. "Pith review of OpenAI Gym." pith.science (2026). https://pith.science/paper/QYSKLZTX

@misc{pith2026160601540,
  author       = {Pith},
  title        = {Pith review of: OpenAI Gym},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QYSKLZTX}},
  note         = {Machine review of arXiv:1606.01540}
}
read the original abstract

OpenAI Gym is a toolkit for reinforcement learning research. It includes a growing collection of benchmark problems that expose a common interface, and a website where people can share their results and compare the performance of algorithms. This whitepaper discusses the components of OpenAI Gym and the design decisions that went into the software.

Discussion (0). Continue with ORCID to comment.

Forward citations

Showing 60 of 379 Pith papers that cite this

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. See all 379 Pith citations

  1. Provably Sub-Linear Two-Timescale NeuroEvolution with Online Plasticity

    cs.NE 2026-06 unverdicted novelty 8.0 of 10

    NEOL decouples neuroevolution into outer architecture search and inner online weight adaptation, proving sublinear regret under mild conditions and showing empirical gains over pure NEAT on control benchmarks.

  2. The Rise of AI Teammates in Software Engineering (SE) 3.0: How Autonomous Coding Agents Are Reshaping Software Engineering

    cs.SE 2025-07 conditional novelty 8.0 of 10

    AIDev is a new open dataset of 456k AI-agent pull requests showing agents submit code faster than humans but with lower acceptance rates and simpler changes.

  3. BEHAVIOR-1K: A Human-Centered, Embodied AI Benchmark with 1,000 Everyday Activities and Realistic Simulation

    cs.RO 2024-03 accept novelty 8.0 of 10

    BEHAVIOR-1K introduces a benchmark of 1,000 human everyday activities in realistic simulated scenes together with the OMNIGIBSON physics simulator to evaluate embodied AI.

  4. Decision Transformer: Reinforcement Learning via Sequence Modeling

    cs.LG 2021-06 accept novelty 8.0 of 10

    Decision Transformer casts RL as autoregressive sequence modeling conditioned on desired returns, past states and actions, matching or exceeding offline RL baselines on Atari, Gym and Key-to-Door tasks.

  5. Double Reinforcement Learning for Efficient Off-Policy Evaluation in Markov Decision Processes

    cs.LG 2019-08 conditional novelty 8.0 of 10

    The paper derives the semiparametric efficiency bound for off-policy evaluation in MDPs and introduces a doubly robust, cross-fitted estimator (DRL) that achieves it.

  6. DungeonBench: A Benchmark for Rules-Rich Tactical Reasoning in Dungeons & Dragons Combat

    cs.AI 2026-07 conditional novelty 7.0 of 10

    DungeonBench scores LLM tactical play on D&D combat, finding frontier policies clear ~80% of single encounters but only 40% of linked multi-encounter days.

  7. Low-power analogue neural networks with trainable nonlinear connections for continuous control

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    Placing trainable nonlinear functions on connections in analogue networks enables efficient representation of smooth continuous targets with hardware transfer at projected 30 microwatt power.

  8. ENPIRE: Agentic Robot Policy Self-Improvement in the Real World

    cs.AI 2026-06 unverdicted novelty 7.0 of 10

    ENPIRE supplies four modules (Environment, Policy Improvement, Rollout, Evolution) that turn real-world robot training into an autonomous optimization loop driven by coding agents.

  9. Expected Free Energy-based Planning as Variational Inference

    cs.AI 2026-06 unverdicted novelty 7.0 of 10

    EFE-based planning is formulated as variational free energy minimization with epistemic priors, decomposing into expected plan costs plus a complexity term.

  10. What Type of Inference is Active Inference?

    cs.AI 2026-06 unverdicted novelty 7.0 of 10

    Proper EFE-based planning is VFE plus planning and epistemic entropy corrections, realized by channel-reparameterized message passing that captures novelty.

  11. Task-Induced Representational Invariances Depend on Learning Objective in Deep RL

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    In navigation tasks, DQN learns MDP-homomorphism-invariant representations while PPO learns action-symmetric ones despite comparable performance, with effects on transfer and in LLMs.

  12. FedQHD: Closed-Form Function-Space Federated Reinforcement Learning

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    FedQHD achieves closed-form federated Q-learning via hyperdimensional encoders with linear readouts, formalizes the federation gap under heterogeneous encoders, and reports competitive performance on continuous-state ...

  13. Stochastic MeanFlow Policies: One-Step Generative Control with Entropic Mirror Descent

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    Stochastic MeanFlow Policies enable one-step generative control in off-policy mirror descent by mapping noise through a MeanFlow transform, yielding tractable entropy and improved MuJoCo performance over Gaussian and ...

  14. Proximal State Nudging: Reducing Skill Atrophy from AI Assistance

    cs.RO 2026-05 unverdicted novelty 7.0 of 10

    Proximal State Nudging (PSN) jointly optimizes skill development and task performance in shared autonomy, outperforming baselines in LunarLander simulation and yielding up to 7x larger unassisted skill gains with 50% ...

  15. ARC-RL: A Reinforcement Learning Playground Inspired by ARC Raiders

    cs.RO 2026-05 unverdicted novelty 7.0 of 10

    ARC-RL provides four new MuJoCo continuous-control environments with hexapod and quadruped morphologies inspired by ARC Raiders, a unified multi-component reward without motion capture, CPG expert demonstrators, and e...

  16. Randomized Advantage Transformation (RAT): Computing Natural Policy Gradients via Direct Backpropagation

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    RAT reformulates regularized natural policy gradients as vanilla gradients with a transformed advantage, computed efficiently via randomized block Kaczmarz iterations on on-policy data.

  17. NeuroTrain: Surveying Local Learning Rules for Spiking Neural Networks with an Open Benchmarking Framework

    cs.NE 2026-05 unverdicted novelty 7.0 of 10

    A taxonomy of SNN training algorithms is presented with the release of NeuroTrain, an open benchmarking framework for reproducible comparisons across datasets and architectures.

  18. Distributionally Robust Multi-Task Reinforcement Learning via Adaptive Task Sampling

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    DRATS derives a minimax objective from a feasibility formulation of MTRL to adaptively sample tasks with the largest return gaps, leading to better worst-task performance on MetaWorld benchmarks.

  19. Matrix-Space Reinforcement Learning for Reusing Local Transition Geometry

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    MSRL represents trajectory segments as PSD matrices to prove additive composition properties and bootstrap value functions for better transfer, reaching 0.73 AUC versus 0.57-0.65 baselines.

  20. IGT-OMD: Implicit Gradient Transport for Decision-Focused Learning under Delayed Feedback

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    IGT-OMD reduces gradient transport error from quadratic to linear in delay length for delayed bilevel optimization and achieves sublinear regret with adaptive steps.

  21. gym-invmgmt: An Open Benchmarking Framework for Inventory Management Methods

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    gym-invmgmt is a new benchmarking framework that evaluates inventory policies across optimization and learning methods, finding stochastic programming strongest among non-oracle approaches and PPO-Transformer best amo...

  22. Revisiting Mixture Policies in Entropy-Regularized Actor-Critic

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    A new marginalized reparameterization estimator allows low-variance training of mixture policies in entropy-regularized actor-critic algorithms, matching or exceeding Gaussian policy performance in several continuous ...

  23. Flow Gym: A framework for the development, benchmarking, training, and deployment of flow-field quantification methods

    physics.flu-dyn 2025-12 accept novelty 7.0 of 10

    Flow Gym supplies a JAX-based framework with standardized interfaces, modular components, and utilities to develop, benchmark, train, and deploy flow-field quantification methods such as PIV on both synthetic and expe...

  24. Action-Constrained Imitation Learning

    cs.RO 2025-08 unverdicted novelty 7.0 of 10

    DTWIL creates a surrogate demonstration set by aligning expert and constrained state trajectories through model predictive control and dynamic time warping, then trains an imitator on it.

  25. Adaptive Ensemble Aggregation for Actor-Critics

    cs.LG 2025-07 unverdicted novelty 7.0 of 10

    AEA dynamically aggregates ensembles in off-policy actor-critics from training dynamics, with proofs of convergence to an error-minimizing equilibrium, bias shrinkage with ensemble size, and monotonic policy improvement.

  26. Geometry of Neural Reinforcement Learning in Continuous State and Action Spaces

    cs.LG 2025-07 conditional novelty 7.0 of 10

    For wide two-layer linearized neural policies in deterministic continuous RL, the locally attainable states concentrate on a manifold of dimension at most 2da+1, independent of the state dimension.

  27. Efficient Multi-Task Reinforcement Learning with Cross-Task Policy Guidance

    cs.LG 2025-07 conditional novelty 7.0 of 10

    A per-task guide policy selects other tasks' control policies to generate training trajectories, boosting multi-task RL performance across five baselines.

  28. Steering Your Diffusion Policy with Latent Space Reinforcement Learning

    cs.RO 2025-06 unverdicted novelty 7.0 of 10

    DSRL steers pretrained diffusion policies for robotics by applying RL to their latent noise inputs, achieving sample-efficient real-world adaptation with only black-box access.

  29. Demystifying the Paradox of Importance Sampling with an Estimated History-Dependent Behavior Policy in Off-Policy Evaluation

    cs.LG 2025-05 conditional novelty 7.0 of 10

    Estimating the behavior policy from longer histories provably reduces the asymptotic variance of importance-sampling based off-policy evaluation estimators at the cost of increased finite-sample bias, with different e...

  30. STITCH-OPE: Trajectory Stitching with Guided Diffusion for Off-Policy Evaluation

    cs.RO 2025-05 conditional novelty 7.0 of 10

    STITCH-OPE uses stitched diffusion-generated sub-trajectories with negative behavior-policy guidance to perform off-policy evaluation in high-dimensional, long-horizon tasks.

  31. Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation

    cs.LG 2025-05 conditional novelty 7.0 of 10

    PURE achieves an Õ(√(d_R+d_F)/√N) suboptimality gap, up to horizon factors, in continuous-time RL with general function approximation, and adds low-switching and low-rollout variants.

  32. ImagineBench: Evaluating Reinforcement Learning with Large Language Model Rollouts

    cs.LG 2025-05 conditional novelty 7.0 of 10

    A benchmark for offline RL with LLM-generated imaginary rollouts shows existing algorithms reach only 35.44% success on hard tasks versus 64.37% when trained on real rollouts.

  33. Measuring General Intelligence with Generated Games

    cs.AI 2025-05 conditional novelty 7.0 of 10

    An LLM-generated suite of novel two-player games with self-play-trained opponents gives state-of-the-art reasoning models winrates of only 31-36%.

  34. Deep Reinforcement Learning for Automated Web GUI Testing

    cs.SE 2025-04 conditional novelty 7.0 of 10

    WebRLED uses deep reinforcement learning with grid-based action values, an online-trained action discriminator, and an episodic plus global curiosity reward to improve automated web GUI testing coverage and failure detection.

  35. CaRL: Learning Scalable Planning Policies with Simple Rewards

    cs.LG 2025-04 accept novelty 7.0 of 10

    A route-completion reward with episode termination and multiplicative soft penalties enables PPO to scale to 300M CARLA and 500M nuPlan samples, reaching 64 DS on longest6 v2 and 91 CLS on Val14.

  36. Recursive Deep Inverse Reinforcement Learning

    cs.LG 2025-04 conditional novelty 7.0 of 10

    RDIRL is an online deep inverse reinforcement learning method that updates a learned cost after each expert demonstration with a Kalman-style second-order Newton step, and it outperforms batch IRL baselines in simulat...

  37. WFCRL: A Multi-Agent Reinforcement Learning Benchmark for Wind Farm Control

    cs.LG 2025-01 conditional novelty 7.0 of 10

    WFCRL is an open multi-agent RL benchmark for wind farm control, interfacing FLORIS and FAST.Farm with 10 layouts and baseline results for IPPO and MAPPO.

  38. Online Preference-based Reinforcement Learning with Self-augmented Feedback from Large Language Model

    cs.LG 2024-12 conditional novelty 7.0 of 10

    RL-SaLLM-F uses an LLM to both label trajectory preferences and generate self-augmented imagined trajectories, achieving MetaWorld success rates comparable to privileged-reward teachers without using any privileged in...

  39. Stealing That Free Lunch: Exposing the Limits of Dyna-Style Reinforcement Learning

    cs.LG 2024-12 conditional novelty 7.0 of 10

    Dyna-style model-based RL methods (MBPO, ALM) that add synthetic rollouts help in OpenAI Gym but significantly degrade performance on most DeepMind Control Suite tasks.

  40. On the Linear Speedup of Personalized Federated Reinforcement Learning with Shared Representations

    cs.LG 2024-11 conditional novelty 7.0 of 10

    The paper proves that personalized federated temporal-difference learning with a shared linear representation converges at rate O(1/(N^{2/3} T^{2/3})), yielding linear speedup in the number of agents under Markovian noise.

  41. Syllabus: Portable Curricula for Reinforcement Learning Agents

    cs.AI 2024-11 conditional novelty 7.0 of 10

    Syllabus provides a portable curriculum learning library with a unified API, reproduces prior baselines, and shows that standard automatic curricula do not transfer to NetHack and Neural MMO.

  42. A Generalist Agent

    cs.AI 2022-05 accept novelty 7.0 of 10

    Gato is a multi-modal, multi-task, multi-embodiment generalist policy using one transformer network to handle text, vision, games, and robotics tasks.

  43. Mitigating Value Hallucination in Dyna Planning via Multistep Predecessor Models

    cs.LG 2020-06 unverdicted novelty 7.0 of 10

    Introduces multistep predecessor models for Dyna planning to mitigate value hallucination by avoiding real-state updates from simulated values.

  44. Dota 2 with Large Scale Deep Reinforcement Learning

    cs.LG 2019-12 accept novelty 7.0 of 10

    OpenAI Five achieved superhuman performance in Dota 2 by defeating the world champions using scaled self-play reinforcement learning.

  45. Benchmarking Model-Based Reinforcement Learning

    cs.LG 2019-07 accept novelty 7.0 of 10

    Introduces a benchmark suite of over 18 MBRL environments, evaluates multiple algorithms under consistent settings, and identifies three core challenges: dynamics bottleneck, planning horizon dilemma, and early-termin...

  46. Learning the Arrow of Time

    cs.LG 2019-07 unverdicted novelty 7.0 of 10

    Introduces a learned arrow of time in MDPs that aligns with the Jordan-Kinderlehrer-Otto notion for stochastic processes and enables practical RL utilities like reachability and side-effect detection.

  47. Exploring Model-based Planning with Policy Networks

    cs.LG 2019-06 unverdicted novelty 7.0 of 10

    POPLIN combines policy networks with model-predictive planning by optimizing either action sequences or policy parameters, yielding 3x better sample efficiency than PETS, TD3 and SAC on MuJoCo locomotion tasks.

  48. Soft Actor-Critic Algorithms and Applications

    cs.LG 2018-12 unverdicted novelty 7.0 of 10

    SAC extends maximum-entropy RL into a stable off-policy actor-critic method with constrained temperature tuning, outperforming prior algorithms in sample efficiency and consistency on locomotion and manipulation tasks.

  49. Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor

    cs.LG 2018-01 accept novelty 7.0 of 10

    Soft Actor-Critic is an off-policy maximum-entropy actor-critic algorithm that achieves state-of-the-art performance and high stability on continuous control benchmarks.

  50. Deep reinforcement learning from human preferences

    stat.ML 2017-06 accept novelty 7.0 of 10

    Reinforcement learning agents solve complex tasks without access to the reward function by training a reward predictor from human comparisons of trajectory segments, requiring feedback on less than 1% of interactions.

  51. A Transdiagnostic Space of Disorder Like Phenotypes in Reinforcement Learning Agents

    cs.LG 2026-07 conditional novelty 6.5 of 10

    Seven disorder-like phenotypes in PPO agents emerge from single appraisal/reward knobs, organize into a two-dimensional affective space, and split into remitting vs treatment-resistant classes.

  52. A Deep RL based Framework for Targeted White Matter Tractography

    cs.CV 2026-08 conditional novelty 6.0 of 10

    A GPT-based model trained on RL trajectories refines and fuses tract-specific tractography policies, improving Dice and overlap on public datasets while depending on atlas-derived reference fibers.

  53. One Frozen Simulator Is Not Enough: Simulator Collapse in Multi-Agent RL

    cs.CL 2026-08 conditional novelty 6.0 of 10

    Multi-turn RL against a single frozen LLM simulator collapses the policy onto a mode-exploiting strategy; verbalized sampling and population co-training restore held-out and real-user transfer.

  54. A Factor Graph Approach to Scalable Multi-Output Gaussian Process Regression

    cs.LG 2026-08 conditional novelty 6.0 of 10

    An LMC multi-output GP is approximated by a one-dimensional chain model on which exact Gaussian message passing delivers linear-time inference and native partial-observation handling.

  55. Graph-Guided Safe Diffuser: Topological Graph Guidance for Safe Diffusion Planning

    cs.RO 2026-08 conditional novelty 6.0 of 10

    A hierarchical planner that routes through a safety-pruned latent graph and generates conditioned diffusion bridges reports 98% collision-free maze success versus 40-50% for guidance-based diffusion baselines.

  56. V-Simba: Unleashing the Architectural Potential of RL in Visual Continuous Control

    cs.LG 2026-08 conditional novelty 6.0 of 10

    V-Simba, a visual RL architecture combining layer normalization, weight decay, and a distributional critic, matches or outperforms complex baselines on 29 continuous control tasks while using less compute.

  57. PACE: Primitive-Aware Code Evolution for Automated Algorithm Design

    cs.SE 2026-08 conditional novelty 6.0 of 10

    PACE decouples reusable code components from host algorithms in LLM-based evolution, preserving them across generations, and reports stronger results than prior AAD methods on four tasks.

  58. Joint UAV Flight and Opportunistic Routing under Reinforcement Learning for Delay-Tolerant Networks

    cs.AI 2026-08 conditional novelty 6.0 of 10

    A CTDE-PPO agent that jointly selects UAV headings and store-carry-forward routing actions improves simulated DTN delivery ratios over PRoPHET, MaxProp, and Q-learning baselines.

  59. Explore Beyond the Boundary Using Entropic Information

    cs.LG 2026-07 conditional novelty 6.0 of 10

    ENTINEX identifies exploration boundaries using the entropy of a novelty-based action distribution and outperforms baseline exploration methods on sparse and delayed MuJoCo tasks.

  60. Collaborative Weighting with Pessimistic Critic for Mitigating Overestimation in Off-Policy Reinforcement Learning

    cs.LG 2026-07 conditional novelty 6.0 of 10

    A new actor-critic variant that reweights samples by TD-error and uncertainty and uses pessimistic sampled values improves continuous-control RL benchmark performance.

See all 379 Pith citations

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages · cited by 379 Pith papers (see all)

  1. [1]

    Dynamic programming and optimal control

    Dimitri P Bertsekas, Dimitri P Bertsekas, Dimitri P Bertsekas, and Dimitri P Bertsekas. Dynamic programming and optimal control. Athena Scientific Belmont, MA, 1995

    work page 1995

  2. [2]

    V . Mnih, K. Kavukcuoglu, D. Silver, A. A. Rusu, J. Veness, M. G. Bellemare, A. Graves, M. Riedmiller, A. K. Fidjeland, G. Ostrovski, S. Petersen, Sadik Beattie, C., Antonoglou A., H. I., King, D. Kumaran, D. Wierstra, S. Legg, and D. Hassabis. Human-level control through deep reinforcement learning. Nature, 518(7540):529–533, 2015

    work page 2015

  3. [3]

    Schulman, S

    J. Schulman, S. Levine, P. Abbeel, M. I. Jordan, and P. Moritz. Trust region policy optimization. In ICML, pages 1889–1897, 2015

    work page 2015

  4. [4]

    Asynchronous Methods for Deep Reinforcement Learning

    V olodymyr Mnih, Adria Puigdomenech Badia, Mehdi Mirza, Alex Graves, Timothy P Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu. Asynchronous methods for deep reinforcement learning. arXiv preprint arXiv:1602.01783, 2016

    work page Pith review arXiv 2016

  5. [5]

    M. G. Bellemare, Y . Naddaf, J. Veness, and M. Bowling. The Arcade Learning Environment: An evaluation platform for general agents. J. Artif. Intell. Res., 47:253–279, 2013

    work page 2013

  6. [6]

    Benchmarking deep reinforcement learning for continuous control

    Yan Duan, Xi Chen, Rein Houthooft, John Schulman, and Pieter Abbeel. Benchmarking deep reinforcement learning for continuous control. arXiv preprint arXiv:1604.06778, 2016

    work page Pith review arXiv 2016

  7. [7]

    Geramifard, C

    A. Geramifard, C. Dann, R. H. Klein, W. Dabney, and J. P. How. RLPy: A value-function-based reinforcement learning framework for education and research. J. Mach. Learn. Res., 16:1573–1578, 2015

    work page 2015

  8. [8]

    Tanner and A

    B. Tanner and A. White. RL-Glue: Language-independent software for reinforcement-learning experiments. J. Mach. Learn. Res., 10:2133–2136, 2009

    work page 2009

Show all 15 references
  1. [9]

    Schaul, J

    T. Schaul, J. Bayer, D. Wierstra, Y . Sun, M. Felder, F. Sehnke, T. R¨uckstieß, and J. Schmidhuber. PyBrain. J. Mach. Learn. Res., 11:743–746, 2010

    2010

  2. [10]

    Abeyruwan

    S. Abeyruwan. RLLib: Lightweight standard and on/off policy reinforcement learning library (C++). http://web.cs.miami.edu/home/saminda/rilib.html, 2013

    2013

  3. [11]

    The reinforcement learning competition 2014

    Christos Dimitrakakis, Guangliang Li, and Nikoalos Tziortziotis. The reinforcement learning competition 2014. AI Magazine, 35(3):61–65, 2014

    2014

  4. [12]

    R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction . MIT Press, 1998

    1998

  5. [13]

    Pachi: State of the art open source go program

    Petr Baudi ˇs and Jean-loup Gailly. Pachi: State of the art open source go program. In Advances in Computer Games, pages 24–38. Springer, 2011

    2011

  6. [14]

    Mujoco: A physics engine for model-based control

    Emanuel Todorov, Tom Erez, and Yuval Tassa. Mujoco: A physics engine for model-based control. In Intelligent Robots and Systems (IROS), 2012 IEEE/RSJ International Conference on , pages 5026–5033. IEEE, 2012

    2012

  7. [15]

    Vizdoom: A doom-based ai research platform for visual reinforcement learning

    Michał Kempka, Marek Wydmuch, Grzegorz Runc, Jakub Toczek, and Wojciech Ja´skowski. Vizdoom: A doom-based ai research platform for visual reinforcement learning. arXiv preprint arXiv:1605.02097, 2016. 4

    2016

Pith tools

Reviewed May 11, 2026 · model on record in the stance chip above.