Summary (Overview)

  • ACT3D is a vision-language model (VLM) that learns to actively explore 3D environments through sequential egocentric interactions, rather than receiving complete 3D representations as input. The model iteratively reasons, navigates, and reorients its viewpoint before committing to a final answer.
  • The framework uses a two-stage training procedure: trajectory-supervised fine-tuning (SFT) to establish basic interaction competence, followed by outcome-driven reinforcement learning (GRPO) where rewards are driven primarily by final-answer correctness — with no direct supervision over intermediate viewpoints or actions.
  • ACT3D achieves an average accuracy of 53.2% across six 3D benchmarks, improving its base Qwen model by 22.0% and surpassing proprietary Gemini 3.6 Flash by 1.0%, while using 50–70% fewer input frames than existing open-source 3D methods.
  • The model exhibits adaptive, question-conditioned exploration: performance gains over the base model increase from 0.6% on questions answerable from the initial view to 16.3% on those requiring extensive exploration.
  • RL-trained policies demonstrate emergent behaviors including searching for occluded targets, avoiding unnecessary exploration when evidence is visible, and acquiring complementary viewpoints for spatial comparisons.

Introduction and Theoretical Foundation

Background and Motivation

Traditional 3D vision-language models assume observations are specified a priori, providing models with complete RGB-D scans, multi-view images, videos, or explicit 3D representations (point clouds, meshes). However, under partial observability, a fundamental challenge remains: the model must not only reason over currently available evidence, but also determine how to act to acquire missing evidence.

The central research question is: Can a vision-language model learn to actively explore and acquire task-relevant visual evidence as an integral part of the 3D reasoning process?

Problem Formulation as POMDP

Reasoning in 3D is formalized as a partially observable Markov decision process (POMDP). A task instance w=(M,q,y⋆)∼Dw = ( \mathcal { M } , q , y ^ { \star } ) \sim \mathcal { D } consists of:

  • A reconstructed 3D scene M\mathcal{M}
  • A question qq
  • Ground-truth answer y⋆=g(M,q)∈Yy^{\star} = g(\mathcal{M}, q) \in \mathcal{Y}

At step tt, the environment state is st=(M,ct)\boldsymbol{s}_t = (\mathcal{M}, \boldsymbol{c}_t), where ct=(et,ft)c_t = (e_t, f_t) specifies camera position et∈R3e_t \in \mathbb{R}^3 and viewing direction ft∈S2f_t \in \mathbb{S}^2. The camera up vector is held parallel to z^\hat{z} (vertical axis), giving ctc_t five degrees of freedom (no roll).

The policy observes rendered egocentric views ot=Render(M,ct)o_t = \mathrm{Render}(\mathcal{M}, c_t) and the resulting camera configuration ctc_t, while the scene M\mathcal{M} remains fixed and hidden throughout the episode.

Action Space

Relative parameterization (adopted): A navigation action at=(ξt,nt)∈Anav=U×{1,…,8}a_t = (\xi_t, n_t) \in \mathcal{A}_{\mathrm{nav}} = \mathcal{U} \times \{1, \dots, 8\} pairs a motion primitive with an integer multiplier, giving ∣Anav∣=80|\mathcal{A}_{\mathrm{nav}}| = 80 navigation actions. The set U\mathcal{U} contains:

  • Six translations: forward/backward, left/right, up/down
  • Four rotations: turn_left/turn_right, turn_up/turn_down

Each primitive has a unit step δξ\delta_\xi (1 m for forward/backward, 0.6 m for other translations, 30° for rotations). Camera dynamics are deterministic:

(et+1,ft+1)={(ΠB(et+ntδξtut),ft),at is a translation,(et,Rotkt(ntδξt)ft),at is a rotation,(1)(e_{t+1}, f_{t+1}) = \left\{ \begin{array}{l l} (\Pi_{\mathcal{B}} (e_{t} + n_{t} \delta_{\xi_{t}} u_{t}), f_{t}), & a_{t} \text{ is a translation}, \\ (e_{t}, \mathrm{Rot}_{k_{t}}(n_{t} \delta_{\xi_{t}}) f_{t}), & a_{t} \text{ is a rotation}, \end{array} \right.\tag{1}

where Rotk(α)\mathrm{Rot}_k(\alpha) rotates a vector by angle α\alpha about unit axis kk, and ΠB\Pi_{\mathcal{B}} projects onto the scene's bounding box (no collision checking).

Absolute parameterization (compared but not adopted): actions name target pose directly as (pt,ℓt)(p_t, \ell_t), requiring prediction of coordinates in a global reference frame that is not directly observed.

The full action set augments navigation with terminal answer actions:

Aˉ=Anav∪Astop.(3)\bar{\mathcal{A}} = \mathcal{A}_{\mathrm{nav}} \cup \mathcal{A}_{\mathrm{stop}}.\tag{3}

Objective

The policy conditions on the complete interaction history hth_t (including intermediate reasoning ztz_t) and is optimized for expected finite-horizon, undiscounted return:

max⁡θJ(θ)=Ew∼DEτ∼πθ⊗E[R(τ)],(5)\max_{\theta} J(\theta) = \mathbb{E}_{w \sim \mathcal{D}} \mathbb{E}_{\tau \sim \pi_{\theta} \otimes \mathcal{E}} [R(\tau)],\tag{5}

where E\mathcal{E} is the deterministic interactive environment and RR is the reward function.


Methodology

Stage 1: Trajectory-Supervised Policy Initialization (SFT)

  • Trajectory curation: GPT-5.4 generates reason–act–observe trajectories in the environment. After filtering (correct answers, valid interactions, well-formed responses, sufficient visible geometry), the corpus contains 5,712 trajectories, 20,603 rendered observations, and 830 scenes.
  • Supervised objective: Minimize negative log-likelihood over model-generated tokens only (reasoning, actions, final answer), masking environment observations and prompt tokens:
LSFT(θ)=−Eτ⋆∼Dtraj∑ℓ∈I(τ⋆)log⁡πθ(τℓ⋆∣τ<ℓ⋆).(7)\mathcal{L}_{\mathrm{SFT}}(\theta) = -\mathbb{E}_{\tau^{\star} \sim \mathcal{D}_{\mathrm{traj}}} \sum_{\ell \in \mathcal{I}(\tau^{\star})} \log \pi_{\theta}(\tau_{\ell}^{\star} \mid \tau_{<\ell}^{\star}).\tag{7}

Stage 2: Outcome-Driven Reinforcement Learning (GRPO)

Training data: RL requires only question–answer pairs and valid initial viewpoints, enabling broader data collection: 51,543 questions from ScanQA, MP3D, and generated QAs over ScanNet and ARKitScenes.

Verifiable Reward: For a rollout τ\tau with final answer yy:

R(τ)=λjudgeRjudge+λEMREM⏟answer correctness+λintRjudgec(τ)⏟interaction reward−λfmtRfmt⏟output format,(8)R(\tau) = \underbrace{\lambda_{\text{judge}} R_{\text{judge}} + \lambda_{\text{EM}} R_{\text{EM}}}_{\text{answer correctness}} + \underbrace{\lambda_{\text{int}} R_{\text{judge}} c(\tau)}_{\text{interaction reward}} - \underbrace{\lambda_{\text{fmt}} R_{\text{fmt}}}_{\text{output format}},\tag{8}

where:

  • Rjudge∈{0,1}R_{\text{judge}} \in \{0,1\}: LLM judge verdict on semantic equivalence of answer to ground truth
  • REM∈{0,1}R_{\text{EM}} \in \{0,1\}: exact match with annotated GT answers
  • Rfmt∈{0,1}R_{\text{fmt}} \in \{0,1\}: malformed output indicator

The interaction credit term:

c(τ)={Nmax⁡,Rgnd=1,min⁡{nint,Nmax⁡},otherwise,(9)c(\tau) = \left\{ \begin{array}{l l} N_{\max}, & R_{\text{gnd}} = 1, \\ \min\{n_{\text{int}}, N_{\max}\}, & \text{otherwise}, \end{array} \right.\tag{9}

where nintn_{\text{int}} is the number of interactions and RgndR_{\text{gnd}} indicates whether the annotated answer object was visible in some rendered view. The design pays for evidence rather than for looking: a correct rollout that observes the answer object receives full interaction credit at once, while further calls earn nothing once the needed view is obtained.

Policy optimization uses GRPO with trajectory-level advantages:

A^i=R(τi)−meanjR(τj)stdjR(τj).(10)\hat{A}_i = \frac{R(\tau_i) - \mathrm{mean}_j R(\tau_j)}{\mathrm{std}_j R(\tau_j)}.\tag{10}

The same advantage is assigned to all model-generated tokens, with environment observations excluded from optimization.

Training Configuration

  • Base model: Qwen3.5-9B
  • Two configurations: ScanQA-only (25,563 questions) and mixed-data (51,543 questions from ScanQA, MP3D, and curated QA)
  • SFT: 2 epochs, batch size 16, learning rate 10−510^{-5}
  • GRPO: 64 prompts/step, mini-batch 16, G=8G=8 rollouts per prompt, learning rate 2×10−62 \times 10^{-6}, temperature 0.7, ϵ=0.2\epsilon = 0.2, β=0.005\beta = 0.005
  • Reward weights: (λjudge,λEM,λfmt,λint)=(0.3,0.2,0.2,0.05)(\lambda_{\text{judge}}, \lambda_{\text{EM}}, \lambda_{\text{fmt}}, \lambda_{\text{int}}) = (0.3, 0.2, 0.2, 0.05), Nmax⁡=12N_{\max} = 12
  • Maximum 12 interaction steps per episode, context length 24,576 tokens

Empirical Validation / Results

Main Results

ACT3D (mixed-data) achieves the highest average accuracy of 53.2% across six benchmarks, surpassing all evaluated baselines:

ModelScanQASQA3DSPB MVSPB SIMP3DARKitAvg.
Passive perception
Video-R1-7B30.841.142.039.642.663.443.2
ViLaSR-7B33.347.652.643.434.666.046.2
SpatialLadder-3B29.340.461.245.245.258.746.7
InternVL3.5-38B36.247.036.938.751.175.447.6
SpaceR-7B31.644.752.641.052.070.148.7
Ross3D50.762.632.031.955.271.550.7
Active interaction
Qwen2.5-VL-72B16.826.820.819.126.746.826.2
Qwen3.5-9B36.733.521.324.730.940.131.2
Qwen3.5-27B27.540.233.231.433.833.833.3
InternVL3.5-38B30.941.543.241.650.155.843.9
Gemini 3.6 Flash43.353.845.544.453.473.052.2
ScanQA only
SFT init39.446.047.341.244.768.347.8
ACT3D (ours)45.549.847.642.350.767.650.6
Mixed data
SFT init39.347.439.237.761.865.948.6
ACT3D (ours)42.149.047.337.463.380.053.2

Learning Dynamics

  • RL improves average accuracy from 48.6% to 53.2% (+4.6%) over SFT init in mixed-data setting, with largest gains on ARKit (+14.1%) and SPBench-MV (+8.1%).
  • Average number of interactions per episode increases from ~3.3 to ~8.3 during mixed-data training.
  • Cross-domain generalization: ScanQA-only training improves average accuracy on other five benchmarks from 49.5% to 51.6% (+2.1%), with substantial gains on MP3D (+6.0%) and SQA3D (+3.8%).

Adaptive Exploration

Performance gains stratified by estimated exploration demand (geometry-based measure independent of model behavior):

  • Combined SFT+RL improvements increase from 0.6% (lowest-demand group) to 16.3% (highest-demand group)
  • RL contributes an additional 10.9% over SFT in the most demanding group

Ablation Results

Initial observation: Single rendered view achieves 41.0% on ScanQA, closely matching 41.4% with BEV + 4 rendered frames, despite using only one image instead of five.

Rendering vs. retrieval: Pose-aligned rendering consistently outperforms nearest-view real-image retrieval across all 13 evaluation checkpoints, achieving 10.6% higher accuracy on average, highlighting the importance of action–observation consistency.

Action space: Relative actions achieve 41.4% accuracy vs. 36.7% for absolute pose prediction.

Supervised initialization: Without SFT, RL alone improves accuracy from 28.9% to 41.4% after 470 steps but with only ~2.0 interactions/episode. SFT-initialized RL achieves 42.7% with 8.7 interactions/episode, suggesting SFT facilitates adaptation and accelerates RL optimization.

Interaction reward: Adding per-interaction reward increases average interactions from 5.1–6.3 to 9.4–10.1 per episode, improving held-out benchmarks (SPBench-MV +6.4%) but slightly reducing training-domain performance (0.3–2.3%).


Theoretical and Practical Implications

Theoretical Significance

  1. Outcome-based RL suffices for learning exploration: The paper demonstrates that task-level supervision alone — without any intermediate viewpoint or action supervision — can induce task-directed visual information acquisition during 3D reasoning. This addresses a fundamental question about the sufficiency of outcome-based credit assignment for learning active perception policies.

  2. Emergent question-conditioned exploration: The model learns adaptive strategies that are conditioned on the question and current evidence, including searching for occluded targets, avoiding unnecessary exploration, and acquiring complementary viewpoints — behaviors not explicitly programmed or supervised.

  3. Partial observability as a training signal: By treating the 3D scene as an external interactive environment rather than providing complete representations, the formulation preserves native visual encoding of VLMs (single images) while enabling learning of evidence acquisition as an integral part of reasoning.

Practical Implications

  1. Efficiency: ACT3D achieves superior accuracy while using 50–70% fewer input frames and lower-resolution observations (640×480) than existing methods, suggesting that active evidence acquisition can be more efficient than passive provision of complete observations.

  2. Generalization: Gains extend beyond training domains, with an average improvement of 5.9% over supervised initialization across four out-of-domain benchmarks, indicating transferable exploration capabilities.

  3. Interface design principles: The ablation studies provide practical guidance — action–observation consistency matters more than raw visual fidelity (rendering > retrieval), relative camera-centric actions outperform absolute coordinate prediction, and single-view initialization is sufficient.


Conclusion

ACT3D presents a framework for learning to think and explore in 3D by treating 3D representations as interactive environments rather than assumed complete inputs. Starting from a single egocentric observation, the model iteratively reasons, acts, and acquires visual evidence through interaction. The two-stage training — trajectory-supervised initialization followed by verifiable RL — enables the model to learn not only how to reason over visual evidence, but also which evidence to acquire and when.

Key contributions:

  1. A POMDP formulation for VLM-based 3D reasoning under partial observability with a relative, camera-centric action space
  2. A two-stage training procedure combining SFT initialization with outcome-driven GRPO
  3. Empirical demonstration of emergent, question-conditioned exploration behaviors
  4. State-of-the-art results across six 3D benchmarks with improved efficiency

Future directions suggested by this work include:

  • Extending beyond direct camera control to full embodied navigation with physical constraints
  • Scaling to larger, more diverse environments and question types
  • Investigating whether RL can learn even more sophisticated exploration strategies with longer horizons or richer action spaces
  • Exploring the interaction between exploration and higher-level spatial reasoning capabilities

Related papers