The reviewed record of science sign in
Pith

arxiv: 2407.19396 · v1 · pith:GD2MXFC2 · submitted 2024-07-28 · cs.LG · cs.AI

NAVIX: Scaling MiniGrid Environments with JAX

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:GD2MXFC2record.jsonopen to challenge →

classification cs.LG cs.AI
keywords environmentslearningdeepminigridnavixbecomeprogressreinforcement
0
0 comments X
read the original abstract

As Deep Reinforcement Learning (Deep RL) research moves towards solving large-scale worlds, efficient environment simulations become crucial for rapid experimentation. However, most existing environments struggle to scale to high throughput, setting back meaningful progress. Interactions are typically computed on the CPU, limiting training speed and throughput, due to slower computation and communication overhead when distributing the task across multiple machines. Ultimately, Deep RL training is CPU-bound, and developing batched, fast, and scalable environments has become a frontier for progress. Among the most used Reinforcement Learning (RL) environments, MiniGrid is at the foundation of several studies on exploration, curriculum learning, representation learning, diversity, meta-learning, credit assignment, and language-conditioned RL, and still suffers from the limitations described above. In this work, we introduce NAVIX, a re-implementation of MiniGrid in JAX. NAVIX achieves over 200 000x speed improvements in batch mode, supporting up to 2048 agents in parallel on a single Nvidia A100 80 GB. This reduces experiment times from one week to 15 minutes, promoting faster design iterations and more scalable RL model development.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Self-Supervised On-Policy Reinforcement Learning via Contrastive Proximal Policy Optimisation

    cs.LG 2026-05 unverdicted novelty 7.0

    CPPO is an on-policy contrastive RL method that derives advantages from contrastive Q-values for PPO optimization, outperforming prior CRL baselines in 14/18 tasks and matching or exceeding reward-based PPO in 12/18 tasks.

  2. Mahjax: A GPU-Accelerated Mahjong Simulator for Reinforcement Learning in JAX

    cs.AI 2026-05 conditional novelty 5.0

    Mahjax provides a GPU-accelerated JAX implementation of Riichi Mahjong achieving up to 2 million steps per second and enabling effective tabula rasa reinforcement learning.