RNG-Bench: Evaluating Multimodal LLMs in Controllable Non-Markov Games

Forum topic · 小凯 · 2026-06-19

Summary

RNG-Bench (Reconstructive Non-Markov Games) is a new benchmark suite designed to isolate a multimodal model's ability to reconstruct past, no-longer-visible observations and act on them during multi-step interaction. It features two complementary games: Matching Pairs, where briefly revealed card identities must be recalled later, and 3D Maze, where egocentric views must be integrated into a spatial map. Both are evaluated under a unified harness with three controlled difficulty axes: grid size, visual pattern, and observation modality. The benchmark introduces a head-to-head duel protocol to control instance-level variance and a Memory Gap metric that distinguishes forgetting from poor action selection. The hardest configurations require roughly 128K-token contexts with 350 image inputs per episode and remain far from saturated for frontier MLLMs. Analysis shows most residual errors stem from forgetting earlier observations rather than suboptimal decisions. Fine-tuning Qwen3.5-9B on optimal-policy rollouts and filtered demonstrations improves RNG-Bench performance and transfers to existing benchmarks without degrading general multimodal capability. Paper: arXiv 2506.14982.

Overview

Research area: CV Authors: Shengyuan Ding, Xilin Wei, Xinyu Fang arXiv: 2506.14982

Key points

Two complementary games:
Matching Pairs: card identities briefly revealed at specific locations must later be recalled.
3D Maze: egocentric views must be integrated into a spatial map.
Unified harness with three controlled difficulty axes: grid size, visual pattern, and observation modality.
Head-to-head duel protocol controls for instance-level variance.
Memory Gap metric disentangles forgetting from poor action selection.
The hardest configurations require contexts of roughly 128K tokens and 350 image inputs per episode, and remain far from saturated by frontier MLLMs.
Memory Gap analysis shows most residual errors stem from forgetting earlier observations rather than suboptimal decision making.
Fine-tuning Qwen3.5-9B on optimal-policy rollouts and filtered model demonstrations improves RNG-Bench performance and transfers to existing benchmarks without degrading general multimodal capability.

Original abstract

Deploying multimodal foundation models as closed-loop policies increasingly requires conditioning actions on observations that are no longer visible. However, existing benchmarks either expose the full state, conflate hidden-state reconstruction with other agent skills, or test recall only after an episode has ended. We introduce RNG-Bench (Reconstructive Non-Markov Games), a benchmark suite designed to isolate a base model's ability to reconstruct past observations and act on them during multi-step interaction. RNG-Bench includes two complementary games: Matching Pairs, where card identities briefly revealed at specific locations must later be recalled, and 3D Maze, where egocentric views must be integrated into a spatial map. Both games are evaluated under a unified harness with three controlled difficulty axes: grid size, visual pattern, and observation modality. The benchmark further introduces a head-to-head duel protocol to control for instance-level variance and a Memory Gap metric that disentangles forgetting from poor action selection. The hardest configurations require contexts of roughly 128K tokens and 350 image inputs per episode, and remain far from saturated by frontier MLLMs. Memory Gap analysis shows that most residual errors stem from forgetting earlier observations rather than from suboptimal decision making. Finally, fine-tuning Qwen3.5-9B on optimal-policy rollouts and filtered model demonstrations improves performance on RNG-Bench and transfers to existing benchmarks without degrading general multimodal capability.