Paper deep dive
Act with Intent: Distilling Behavior Intent for Vision-Language-Action Models
Sangoh Lee, Sangwoo Mo, Wook-Shin Han
Intelligence
Status: not_run | Model: - | Prompt: - | Confidence: 0%
Entities (0)
Relation Signals (0)
No relation signals yet.
Cypher Suggestions (0)
No Cypher suggestions yet.
Abstract
Abstract:Vision-Language-Action (VLA) models can turn multimodal context into robot actions, but their action decoders are still trained largely by behavior cloning. This supervises which motor command was demonstrated while leaving implicit the local objective served by the behavior under the instruction. Future-based supervision enriches action learning with frames, latent observations, trajectories, or motion representations, but these signals capture particular realizations of what may happen rather than the shared semantic objective of the forthcoming behavior. We propose Intention Distillation (INDI), which distills behavior-level intent into the action decoder. During training, a frozen teacher VLM interprets a demonstrated segment from the current observation, instruction, coarse action summary, and corresponding execution video. From its standard inputs, the deployed VLA recovers the resulting multimodal intent representation at an intermediate decoder layer and uses it to organize action prediction together with representations of how the behavior unfolds and what it achieves. On SimplerEnv-Bridge, INDI improves GR00T-N1.7 from 64.3% to 84.7%, and on RoboCasa Kitchen it improves the controlled GR00T-N1.7 baseline from 64.1% to 70.3%, with consistent gains on $\pi_{0.5}$ across both benchmarks. In real-world tasks, INDI improves average success from 62.0% to 68.7%, with gains of up to 12.0 pp on longer-horizon tasks. Further analyses show that the recovered latent is used by the decoder, captures behavior objective and execution progress, and organizes downstream predictions in an objective-dependent manner. These results show that action decoders benefit from explicitly modeling the semantic objective of the behavior they generate.
Tags
Links
- Source: https://arxiv.org/abs/2608.23478v1
- Canonical: https://arxiv.org/abs/2608.23478v1
Trouble viewing inline? Open PDF directly →
Full Text
127,614 characters extracted from source content.
Expand or collapse full text
11footnotetext: Corresponding authors. Act with Intent: Distilling Behavior Intent for Vision-Language-Action Models Sangoh Lee Affiliation: GSAI, POSTECH Sangwoo Mo Affiliation: IME, POSTECH Affiliation: solee,wshan@dblab.postech.ac.kr sangwoo.mo@postech.ac.kr Wook-Shin Han Affiliation: GSAI, POSTECH Abstract Vision-Language-Action (VLA) models can turn multimodal context into robot actions, but their action decoders are still trained largely by behavior cloning. This supervises which motor command was demonstrated while leaving implicit the local objective served by the behavior under the instruction. Future-based supervision enriches action learning with frames, latent observations, trajectories, or motion representations, but these signals capture particular realizations of what may happen rather than the shared semantic objective of the forthcoming behavior. We propose Intention Distillation (Indi), which distills behavior-level intent into the action decoder. During training, a frozen teacher VLM interprets a demonstrated segment from the current observation, instruction, coarse action summary, and corresponding execution video. From its standard inputs, the deployed VLA recovers the resulting multimodal intent representation at an intermediate decoder layer and uses it to organize action prediction together with representations of how the behavior unfolds and what it achieves. On SimplerEnv-Bridge, Indi improves GR00T-N1.7 from 64.3%64.3\% to 84.7%84.7\%, and on RoboCasa Kitchen it improves the controlled GR00T-N1.7 baseline from 64.1%64.1\% to 70.3%70.3\%, with consistent gains on π0.5 _0.5 across both benchmarks. In real-world tasks, Indi improves average success from 62.0%62.0\% to 68.7%68.7\%, with gains of up to 12.012.0 p on longer-horizon tasks. Further analyses show that the recovered latent is used by the decoder, captures behavior objective and execution progress, and organizes downstream predictions in an objective-dependent manner. These results show that action decoders benefit from explicitly modeling the semantic objective of the behavior they generate. Project page: https://leesangoh.github.io/indi-project-page/ 1 Introduction Recent Vision-Language-Action (VLA) models and robot foundation models have advanced rapidly by scaling vision-language backbones, action decoders, and robot demonstrations (Zitkovich et al., 2023; Kim et al., 2025; Black et al., 2025b; Black et al., 2025a; Physical Intelligence et al., 2026; NVIDIA et al., 2025; NVIDIA, 2026; Gemini Robotics Team et al., 2025; Li et al., 2024). These models show that Internet-scale visual and linguistic knowledge can be transferred to robot control, and that specialized action decoders can turn multimodal context into continuous motor commands. Yet action-level training remains largely imitation-based. Behavior cloning tells the decoder which motor command to reproduce for a given observation and instruction, but not what that behavior is supposed to achieve under the instruction. As a result, the decoder can learn a strong context-to-action mapping while leaving the purpose of each behavior implicit. To go beyond action-only supervision, a growing line of work augments VLA policies with future-based supervision. Some methods use future scene states, including generated frames, subgoal images, and latent observations (Wu et al., 2024; Black et al., 2024; Hu et al., 2025; Zheng et al., 2025b). Others represent how the forthcoming interaction unfolds through trajectories, motion fields, point tracks, or structured world dynamics (Zhao et al., 2025; Zhang et al., 2025; Xu et al., 2024; Bharadhwaj et al., 2024). These signals provide valuable information about what the future may look like or how motion may unfold, but they supervise particular realizations of behavior rather than the objective those realizations serve. This distinction matters because similar stages of manipulation can serve different objectives across tasks, while the same objective can be realized through diverse executions. To give the forthcoming action sequence its meaning under the instruction, the action decoder must represent the local objective it serves. This objective guides the decoder in translating the scene and instruction context encoded by the VLA’s vision-language module into coherent, temporally extended behavior. We therefore argue that the decoder should recover a behavior-level intent that organizes action together with diverse representations of how the behavior unfolds and what it achieves. Figure 1: From behavior cloning to intent distillation. (a) Behavior cloning directly supervises actions. (b) Future-based supervision adds representations of future states or motion. (c) Indi distills behavior-level intent from executed behavior into the action decoder, where it organizes action and representations of how the behavior unfolds and what it achieves. Right: GR00T-N1.7 results on SimplerEnv-Bridge and RoboCasa. To operationalize this principle, we propose Intention Distillation (Indi), which distills behavior-level intent into the action decoder. We define intent as the local objective that the forthcoming behavior should achieve under the instruction. During training, a frozen teacher VLM interprets an executed behavior segment from the current observation, instruction, a coarse action summary, and the execution video. The student decoder learns to recover the resulting multimodal intent representation from the current observation, instruction, and proprioceptive state, and uses it as an intermediate semantic state for action prediction. Concretely, Indi realizes this behavior-level intent supervision through three components. (1) Intent from executed behavior. The teacher VLM identifies what object or relation changes, what local objective the segment serves, and how it advances the instruction. We use the teacher’s multimodal representation formed during this interpretation as the intent target, together with a generated purpose statement and an endpoint visual feature as complementary groundings. (2) Intent recovery inside the action decoder. Learnable intent queries recover the teacher target at an intermediate decoder layer, after which the remaining layers jointly complete action, latent visual and textual grounding predictions. (3) Intent-aware decoding. The recovered intent participates in action and grounding prediction, making it a functional intermediate representation rather than an auxiliary alignment target. At deployment, the teacher and all target-generation modules are removed. We evaluate whether behavior-level intent improves action decoding and whether the recovered representation exhibits the expected structure of intent. On SimplerEnv-Bridge (Li et al., 2025b), Indi improves GR00T-N1.7 from 64.3% to 84.7%. On RoboCasa Kitchen (Nasiriany et al., 2024), it improves the controlled GR00T-N1.7 baseline from 64.1% to 70.3% across 24 tasks, with consistent gains on π0.5 _0.5 across both benchmarks. In real-world tasks, Indi improves success from 62.0% to 68.7% and generalizes to held-out objects and distractors. Representation analyses and closed-loop interventions further show that the recovered intent is used by the decoder, captures behavior objective and execution progress, and organizes downstream predictions in an objective-dependent manner. Together, these results show that behavior-level semantic supervision improves policy performance and generalization while inducing an internal representation that functions as intent. Contributions. Our contributions are as follows: • We identify behavior-level intent as a missing supervision target for VLA action decoders. Beyond imitating actions or predicting future states and motion, the decoder should model the local objective served by its action sequence. • We propose Indi, which distills a teacher VLM’s multimodal understanding of executed behavior into intermediate action-decoder states. The recovered intent organizes action prediction and representations of how the behavior unfolds and what it achieves, with no teacher-side modules at deployment. • Across VLA backbones, SimplerEnv-Bridge (Li et al., 2025b), RoboCasa (Nasiriany et al., 2024), and real-world manipulation, Indi improves performance and OOD generalization. Analyses and interventions further show that the recovered latent functions as intent by encoding behavior objective and progress and organizing downstream predictions. 2 Related Work VLA models. VLA models combine large multimodal backbones with robot demonstrations to map observations and instructions to actions (Brohan et al., 2023; Zitkovich et al., 2023; Kim et al., 2025; Octo Model Team et al., 2024; Black et al., 2025b; Black et al., 2025a; Physical Intelligence et al., 2026; NVIDIA et al., 2025; NVIDIA, 2026; Gemini Robotics Team et al., 2025; Li et al., 2024). Their progress has been supported by large robot datasets spanning diverse tasks, scenes, and embodiments (Open X-Embodiment Collaboration et al., 2024; Khazatsky et al., 2024; Walke et al., 2023; Fang et al., 2024). Recent systems increasingly pair pretrained vision-language modules with action decoders trained using flow-matching or diffusion objectives (Black et al., 2025b; Black et al., 2025a; NVIDIA et al., 2025; Li et al., 2024; Liu et al., 2025; Wen et al., 2025; Kim et al., 2026a). While these advances improve action modeling, decoder supervision remains dominated by imitation of demonstrated motor commands. Indi instead supervises the local objective served by the action sequence. Future-based and structured supervision. Prior work augments robot policies with generated future frames, subgoal images, and visual reasoning frames (Wu et al., 2024; Black et al., 2024; Zhao et al., 2025). Other methods learn predictive visual features, future latent states, world-action representations, or structured world knowledge as intermediate signals for action decoding (Hu et al., 2025; Tian et al., 2025; Zheng et al., 2025b; Zhang et al., 2025; Xu et al., 2026; Sun et al., 2026; Luo et al., 2026; Won et al., 2026). Related approaches represent spatial, motion, or semantic structure through optical flow, point tracks, visual traces, grounding masks, affordance chains, and embodied reasoning traces (Xu et al., 2024; Bharadhwaj et al., 2024; Zheng et al., 2025a; Huang et al., 2025b; Zawalski et al., 2025; Huang et al., 2025a; Li et al., 2025a). These methods demonstrate the value of intermediate supervision beyond motor commands, but define the decoder interface through a particular future state, motion structure, or reasoning representation. Indi instead supervises the behavior-level objective that organizes action and its diverse realizations. Intent and latent plans in robot policies. Related methods derive deployment-time latent plans from trajectories, with Play-LMP learning continuous plans from play and LADS learning language-regularized discrete plans from trajectory segments (Lynch et al., 2020; Jiang et al., 2025). Their latents are reconstruction codes learned jointly with the policy, whereas Indi distills a fixed teacher’s semantic interpretation of the behavior. Prior work also operationalizes intent through trajectory abstractions, action priors, and virtual targets (Huang et al., 2026; Zhong et al., 2026; Pang et al., 2026), through temporal context or predicted scene structure (Lian et al., 2026; Chen et al., 2026; Fan et al., 2026; Xu et al., 2026), or through human cues such as demonstrations, gaze, and indirect instructions (Gupta et al., 2026; Xie et al., 2026; Tay et al., 2026; Li et al., 2026a; Pani and Yang, 2026; Zuo et al., 2026; Chen et al., 2025). Indi instead defines intent as the local objective served by executed behavior under the instruction. A training-only teacher derives a multimodal intent target from the segment, distilled into intermediate decoder states and grounded in visual outcome and textual purpose. The deployed policy recovers it from standard VLA inputs. Figure 2: Overview of Indi. A training-only teacher VLM derives multimodal intent and textual-purpose targets from executed behavior, while a frozen visual encoder supplies the endpoint-visual target. The VLA decoder recovers intent at an intermediate layer and jointly predicts actions and latent visual and textual groundings, denoted by V^t V_t and R^t R_t. Dashed lines indicate training-only supervision, and all target-generation modules are removed at deployment. 3 Methodology We propose Indi, which distills behavior-level intent into a pretrained VLA action decoder. During training, a frozen teacher VLM interprets multimodal evidence of the demonstrated behavior under the instruction, producing an intent target. The decoder recovers this target at an intermediate layer from its standard inputs and uses the recovered intent in subsequent action and visual and textual grounding prediction. The overall framework is illustrated in Figure 2. 3.1 Problem Formulation We consider a pretrained VLA policy with a frozen vision-language module ℱvlmF_vlm and a trainable flow-matching action decoder. At time t, the VLA receives an RGB observation oto_t, a language instruction ℓ , and a proprioceptive state qtq_t. The VLM produces context tokens Bt=ℱvlm(ot,ℓ)B_t=F_vlm(o_t, ). Our goal is to train the action decoder to predict AtA_t while forming an intermediate intent state ItI_t that represents the local objective served by the action under the instruction. Standard behavior cloning models pθ(At∣Bt,qt)p_θ(A_t B_t,q_t), leaving this objective implicit. Let ItI_t denote the recovered intent state at the intermediate decoder layer. At each policy query, ItI_t is deterministically recovered from BtB_t and qtq_t, and the decoder models (At,Vt,Rt)∼pθ(At,Vt,Rt∣Bt,qt,It).(A_t,V_t,R_t) p_θ(A_t,V_t,R_t B_t,q_t,I_t). (1) Here, AtA_t, VtV_t, and RtR_t denote the action, visual-outcome, and textual-purpose supervision targets, while hats denote their decoder predictions. 3.2 Intent Supervision from Executed Behavior Since robot demonstrations do not explicitly label the local objective, we derive intent supervision using a frozen teacher VLM. For an H-step demonstrated behavior segment tW_t, let cA(t)c_A(W_t) denote a coarse textual summary of its demonstrated actions. Under a functional-intent prompt, a teacher VLM processes ℰt=(ot,ℓ,cA(t),vidt:t+H)E_t= (o_t, ,c_A(W_t),vid_t:t+H ) and then generates a functional-purpose statement with token span tS_t. We cache the hidden states of both spans from the same autoregressive pass. Target extraction. We extract the intent target from a middle teacher layer to retain both multimodal grounding and semantic abstraction before higher layers specialize toward language generation (Kim et al., 2026a). The textual-purpose target uses the final-layer representation of the generated statement, while the visual-outcome target uses a separate frozen encoding of the endpoint observation: It⋆=poolKI(Tℰt(ℓI)),Rt⋆=poolKR(Tt(ℓR)),Vt⋆=poolKV(Φvis(ot+H)). I_t =pool_K_I\! (T_E_t^( _I) ), R_t =pool_K_R\! (T_S_t^( _R) ), V_t =pool_K_V\! ( _vis(o_t+H) ). (2) Here T(ℓ)T_X^( ) denotes teacher hidden states over token span X at layer ℓ , and Φvis _vis is the frozen visual encoder used for endpoint features. Thus, It⋆I_t retains the multimodal representation formed while the teacher interprets the executed behavior, whereas Rt⋆R_t provides its linguistic realization. Visual and textual groundings. The endpoint visual target grounds intent in the resulting scene change, while the textual-purpose target grounds it in the functional meaning of the behavior. These choices build on prior work using predictive visual supervision (Wu et al., 2024; Black et al., 2024; Hu et al., 2025; Zhang et al., 2025) and language or reasoning traces for robot policies (Zawalski et al., 2025; Huang et al., 2025a; Li et al., 2025a; Sumers et al., 2023). 3.3 Intent-Aware Action Decoding To make intent a functional intermediate state rather than an auxiliary readout, the decoder must recover it from the current VLA inputs before final action prediction and make it available to both action and grounding streams. We therefore augment the pretrained flow-matching action decoder with intent queries and visual and textual grounding rows. Let Qt=Eq(qt)Q_t=E_q(q_t) denote the proprioceptive-state representation, and let QIQ^I denote KIK_I clean learnable intent queries. The decoder processes [Qt,Atλ,ZtV,λ,ZtR,λ,QI],[\,Q_t,\;A_t^λ,\;Z_t^V,λ,\;Z_t^R,λ,\;Q^I\,], where AtλA_t^λ is the noised action input and ZtV,λZ_t^V,λ and ZtR,λZ_t^R,λ are self-conditioned visual and textual grounding inputs. The clean targets It⋆I_t , Vt⋆V_t , and Rt⋆R_t are used only for supervision. Recovering intent. We supervise intent at an intermediate layer so that the recovered representation can shape the remaining decoder computation. Following intermediate representation alignment in VLA decoders (Zheng et al., 2025b), we read the contextualized intent-query states HI,tLtapH_I,t^L_tap, project them into the teacher feature space, and optimize ℒI=1KI∑k=1KI[1−cos(PI(HI,t,kLtap),sg(It,k⋆))],L_I= 1K_I _k=1^K_I [1- (P_I(H_I,t,k^L_tap),sg(I_t,k ) ) ], (3) where PIP_I is a projection head and sgsg denotes stop-gradient. The decoder-space states HI,tLtapH_I,t^L_tap constitute the recovered intent used by the remaining layers. Action and grounding prediction. The action stream retains the flow-matching objective of the pretrained VLA (Black et al., 2025a; NVIDIA et al., 2025). Given noise ϵA _A and flow time λ, let Atλ=(1−λ)ϵA+λAtA_t^λ=(1-λ) _A+λ A_t and uA=At−ϵA.u_A=A_t- _A. The decoder predicts u^A u_A using ℒA=λ,ϵA[‖u^A−uA‖22].L_A=E_λ, _A [ \| u_A-u_A \|_2^2 ]. (4) The grounding streams must remain available during decoding without receiving clean grounding targets that are unavailable at deployment. A no-gradient pass first predicts clean decoder-space grounding states Z¯tV Z_t^V and Z¯tR Z_t^R. We detach and re-noise these predictions at the sampled flow time: ZtV,λ=(1−λ)ϵV+λsg(Z¯tV),ZtR,λ=(1−λ)ϵR+λsg(Z¯tR).Z_t^V,λ=(1-λ) _V+λ\,sg( Z_t^V), Z_t^R,λ=(1-λ) _R+λ\,sg( Z_t^R). Rather than training separate flow generators in each target space, we align the final grounding states with their targets using representation alignment (Yu et al., 2025). For G∈V,RG∈\V,R\, ℒG=λ,ϵG[1KG∑k=1KG(1−cos(PG(HG,t,kLout,λ),sg(Gt,k⋆)))].L_G=E_λ, _G [ 1K_G _k=1^K_G (1- (P_G(H_G,t,k^L_out,λ),sg(G_t,k ) ) ) ]. (5) Action and grounding rows are jointly processed by the same decoder, allowing the recovered intent to organize their subsequent prediction. Intent-dependent information flow. To make the recovered intent a functional intermediate state, we organize downstream decoding around it. All rows are processed jointly, but with asymmetric attention. Intent queries attend to QtQ_t, the VLA context BtB_t, and one another, while remaining isolated from the noised action and grounding rows. Grounding rows attend to the recovered intent and one another, whereas action rows attend to both intent and grounding rows. Furthermore, a binary gate α controls direct BtB_t access from non-intent rows. During training, we sample α∼Bernoulli(0.5)α (0.5), and updates with α=0α=0 require contextual information to pass through the intent queries. For these intent-mediated updates, we further require downstream prediction to depend on the content of the recovered intent. We compare decoder continuations under the matched intent states HI,tLtapH_I,t^L_tap and batch-shifted states H~I,tLtap H_I,t^L_tap. Let rightD_right and swapD_swap denote the corresponding downstream action and grounding losses. We optimize ℒmis=max(0,m+right−swap),L_mis= (0,\,m+D_right-D_swap ), (6) which forces matched intent to yield lower downstream loss than mismatched intent by margin m. Training objective and deployment. The full objective is ℒ=ℒA+λIℒI+λVℒV+λRℒR+λmisℒmis.L=L_A+ _IL_I+ _VL_V+ _RL_R+ _misL_mis. (7) At deployment, we set α=1α=1 and remove the teacher, cached targets, alignment projections, and intent-mismatch branch. The policy receives the original VLA inputs and internally forms intent and grounding states together with the action stream. Table 1: Results on SimplerEnv-Bridge. Success rates (%) on the four evaluated tasks. Controlled variants report mean ± sample standard deviation over three evaluation runs, while published baselines retain their originally reported values. Bold marks the best mean in each column, and underline marks the runner-up. Method Spoon Carrot Stack EP-Basket Avg. General-purpose VLA policies Octo-base (Octo Model Team et al., 2024) 12.5 8.3 0.0 43.1 16.0 Octo-small (Octo Model Team et al., 2024) 47.2 9.7 4.2 56.9 29.5 OpenVLA (Kim et al., 2025) 0.0 0.0 0.0 4.1 1.0 RoboVLMs (Li et al., 2026b) 29.2 25.0 12.5 58.3 31.3 SpatialVLA (Qu et al., 2025) 16.7 25.0 29.2 100.0 42.7 π0 _0 (Black et al., 2025b) 46.7 38.7 42.7 39.3 41.8 π0 _0-FAST (Pertsch et al., 2025) 59.0 79.0 65.0 33.0 59.0 GR00T-N1.5 (NVIDIA GEAR Team, 2025) 30.0 28.0 16.0 42.7 29.2 Action abstraction and semantic reasoning LAPA (Ye et al., 2025) 70.8 45.8 54.2 58.3 57.3 UniVLA (Bu et al., 2025) 52.8 55.6 2.8 80.6 47.9 ECoT (Zawalski et al., 2025; Zhang et al., 2026) 40.2 11.7 0.0 28.4 20.1 Controlled backbone comparisons GR00T-N1.7 (NVIDIA, 2026) 84.7¯±3.1 84.7 \,± 3.1 79.3¯±9.9 79.3 \,± 9.9 57.3±8.157.3 \,± 8.1 36.0±6.036.0 \,± 6.0 64.3±3.364.3 \,± 3.3 GR00T-N1.7 + future supervision 81.3±2.381.3 \,± 2.3 73.3±4.273.3 \,± 4.2 56.7±3.156.7 \,± 3.1 60.7±4.260.7 \,± 4.2 68.0¯±1.0 68.0 \,± 1.0 GR00T-N1.7 + Indi (Ours) 88.7±1.288.7 \,± 1.2 84.7±6.184.7 \,± 6.1 69.3±5.069.3 \,± 5.0 96.0¯±4.0 96.0 \,± 4.0 84.7±0.884.7 \,± 0.8 Δ (Ours −- baseline) +4.0+4.0 +5.4+5.4 +12.0+12.0 +60.0+60.0 +20.4+20.4 π0.5 _0.5 (Black et al., 2025a) 78.0±3.578.0 \,± 3.5 72.7±7.672.7 \,± 7.6 32.0±3.532.0 \,± 3.5 26.7±4.226.7 \,± 4.2 52.3±2.352.3 \,± 2.3 π0.5 _0.5 + Indi (Ours) 81.3±4.281.3 \,± 4.2 76.0±4.076.0 \,± 4.0 39.3±5.039.3 \,± 5.0 38.7±3.138.7 \,± 3.1 58.8±3.358.8 \,± 3.3 Δ (Ours −- baseline) +3.3+3.3 +3.3+3.3 +7.3+7.3 +12.0+12.0 +6.5+6.5 4 Experiments We evaluate Indi across simulation and real-world manipulation settings to answer three questions: whether behavior-intent supervision improves policy performance across benchmarks and VLA backbones, whether its benefits extend to real-world and out-of-distribution conditions, and whether the recovered latent functions as intent rather than generic additional capacity. Our evaluation covers SimplerEnv-Bridge and RoboCasa Kitchen in simulation, together with real-world tabletop tasks involving held-out objects and distractors. 4.1 Experimental Setup Benchmarks. We evaluate Indi on two simulation benchmarks and a real-world manipulation setting. SimplerEnv-Bridge (Li et al., 2025b) covers four tabletop tasks, while RoboCasa Kitchen (Nasiriany et al., 2024) contains 24 household tasks spanning pick-and-place, articulated-object manipulation, and appliance interaction. Our real-world evaluation contains four tabletop tasks under standard scenes, held-out objects, and distractor conditions. Dataset, robot-platform, and evaluation-protocol details are provided in Appendix A. Baselines. Our primary comparisons use GR00T-N1.7 (NVIDIA, 2026) and π0.5 _0.5 (Black et al., 2025a), with each baseline trained using the same demonstrations, optimization budget, and evaluation protocol as its corresponding Indi model. We additionally report published benchmark results for context. On RoboCasa Kitchen, GR00T checkpoints trained with 3,000 demonstrations per task are included only as data-scale references, rather than matched baselines. For real-world tasks, we compare against the GR00T-N1.7 under the same rollout protocol. Descriptions and comparison settings for all baselines are provided in Section A.3. Implementation details. We retain each backbone’s optimizer, learning rate, and vision-language freezing configuration, and use the same Indi configuration across benchmarks unless stated otherwise. By default, we use KI=8K_I=8, KR=8K_R=8, KV=16K_V=16 per camera view, an intent-alignment tap at 50%50\% of the decoder depth, margin m=0.05m=0.05, context-dropout rate 0.50.5, and Cosmos-Reason2-8B (NVIDIA, 2025a) as the teacher VLM. Full hyperparameters, target-construction details, and implementation choices are provided in Appendix A. 4.2 Results on Simulation Benchmarks We first test whether behavior-intent supervision improves pretrained VLA policies across distinct simulation benchmarks and backbone architectures. SimplerEnv-Bridge. Table 1 reports success rates on four SimplerEnv-Bridge tasks. On GR00T-N1.7, Indi improves average success from 64.3%64.3\% to 84.7%84.7\%, a +20.4+20.4 p gain. The improvement holds across all four tasks, including tasks where the baseline is already strong. The largest gain occurs on EP-Basket, where success increases from 36.0%36.0\% to 96.0%96.0\%, while Spoon, Carrot, and Stack improve by 4.04.0, 5.45.4, and 12.012.0 p, respectively. Excluding EP-Basket, the remaining three tasks improve by 7.17.1 p on average. The future-supervision variant reaches 68.0%68.0\%, while Indi reaches 84.7%84.7\%, a further +16.7+16.7 p improvement. Among the reported results on this task suite, Indi achieves the highest average success. The improvement also transfers to π0.5 _0.5, increasing average success from 52.3%52.3\% to 58.8%58.8\%, a +6.5+6.5 p gain, with improvements on every task. Table 2: Results on RoboCasa Kitchen. Success rates (%) on the 24-task benchmark. GnG_n denotes n demonstrations per task. The G3000G_3000 checkpoints provide single-value data-scale references, while controlled G100G_100 variants report mean ± sample standard deviation over three evaluation runs. Success rates are averaged within each task category, while Avg. is the macro-average across all 24 tasks. Bold marks the best mean in each column, and underline marks the runner-up. Method Pick-and Place Open-or Close Others Avg. GR00T-N1.6 (NVIDIA, 2025b) (G3000G_3000) 43.2 81.0 75.8 66.2 GR00T-N1.7 (NVIDIA, 2026) (G3000G_3000) 53.0 80.8 79.0 70.8 GR00T-N1.7 (G100G_100) 39.4±1.039.4 \,± 1.0 75.9±3.475.9 \,± 3.4 76.7±0.976.7 \,± 0.9 64.1±1.664.1 \,± 1.6 GR00T-N1.7 + future supervision (G100G_100) 47.0±4.447.0 \,± 4.4 80.3±2.380.3 \,± 2.3 72.1±2.072.1 \,± 2.0 65.8±0.865.8 \,± 0.8 GR00T-N1.7 + Indi (G100G_100, Ours) 49.8¯±2.3 49.8 \,± 2.3 82.8±1.382.8 \,± 1.3 79.1±1.579.1 \,± 1.5 70.3¯±1.7 70.3 \,± 1.7 Δ (Ours −- baseline) +10.4+10.4 +6.9+6.9 +2.4+2.4 +6.2+6.2 π0.5 _0.5 (Black et al., 2025a) 14.0±1.714.0 \,± 1.7 55.1±7.455.1 \,± 7.4 39.5±0.939.5 \,± 0.9 34.9±2.034.9 \,± 2.0 π0.5 _0.5 + Indi (Ours) 15.3±1.415.3 \,± 1.4 56.1±3.656.1 \,± 3.6 53.5±2.453.5 \,± 2.4 41.4±1.441.4 \,± 1.4 Δ (Ours −- baseline) +1.3+1.3 +1.0+1.0 +14.0+14.0 +6.5+6.5 Table 3: Reported RoboCasa Kitchen results. Average success rates (%). Method Demos/task Avg. Base VLA policies GR00T-N1 (NVIDIA et al., 2025) 300 49.6 π0 _0 (Black et al., 2025b) 300 62.5 π0 _0-FAST (Pertsch et al., 2025) 300 63.6 GR00T-N1.5 (NVIDIA GEAR Team, 2025) 300 65.7 Future and video-based methods DreamGen (Jang et al., 2025) 300 57.6 DUST (Won et al., 2026) 300 58.5 Video Policy (Liang et al., 2025) 300 66.0 FLARE (Zheng et al., 2025b) 300 66.4 History and representation methods HAMLET (Koo et al., 2026) 300 66.4 RS-CL (Kim et al., 2026b) 300 69.7 Behavior-intent supervision Indi (Ours) 100 70.3 RoboCasa Kitchen. Table 2 reports controlled comparisons on the 24-task RoboCasa Kitchen benchmark. With GR00T-N1.7 trained on 100100 demonstrations per task, Indi improves average success from 64.1%64.1\% to 70.3%70.3\%, with gains across all three task categories. The future-supervision variant reaches 65.8%65.8\%, whereas the full method reaches 70.3%70.3\%, an additional +4.5+4.5 p gain. The improvement again transfers to π0.5 _0.5, increasing average success from 34.9%34.9\% to 41.4%41.4\%, including a +14.0+14.0 p gain on the Others. Moreover, Indi trained with 100100 demonstrations per task reaches 70.3%70.3\% average success, within 0.50.5 p of the reported GR00T-N1.7 checkpoint trained with 3,0003,000 demonstrations per task. Table 3 further compares against reported RoboCasa Kitchen results from prior methods. Among these reported results, Indi achieves the highest average success rates. Together, the results show that Indi consistently improves two backbones across different simulation environments. 4.3 Results on Real-world Benchmarks Table 4: Results on real-world tasks. Success rates (%) over 50 trials. ID clean uses training objects without distractors, held-out substitutes unseen objects of the same functional role, and distractors add unrelated items to the scene. Bold marks the better result within each condition. ID clean Held-out Distractors Task Base + Indi Base + Indi Base + Indi Threading 92.0 96.0 86.0 84.0 70.0 82.0 Basket Nesting 94.0 92.0 84.0 90.0 76.0 84.0 Cross-Bin Stacking 74.0 80.0 62.0 72.0 58.0 64.0 Drawer Storage 24.0 36.0 16.0 26.0 8.0 18.0 Average 71.0 76.0 62.0 68.0 53.0 62.0 Table 4 reports success rates on the four real-world tasks. Indi improves the baseline from 71.0%71.0\% to 76.0%76.0\% under ID clean, and the gain persists under held-out objects (62.0%62.0\% to 68.0%68.0\%) and distractors (53.0%53.0\% to 62.0%62.0\%). Relative retention is comparable under held-out objects (87.3%87.3\% vs. 89.5%89.5\%) and higher for Indi under distractors (74.6%74.6\% vs. 81.6%81.6\%), indicating that the improvement persists as the scene shifts from training conditions. The gains are concentrated in the longer tasks. Averaged across the three conditions, Cross-Bin Stacking and Drawer Storage improve by 7.37.3 and 10.710.7 p, respectively, whereas Threading and Basket Nesting improve by 4.74.7 and 4.04.0 p. Table 5 localizes these differences under ID clean. On Cross-Bin Stacking, both policies retrieve the base cube at the same rate (96.0%96.0\%) and remain similar after centering (90.0%90.0\% vs. 92.0%92.0\%), but Indi retains higher completion when retrieving the top cube (82.0%82.0\% to 86.0%86.0\%) and completing the stack (74.0%74.0\% to 80.0%80.0\%). Drawer Storage exhibits a different pattern: the gap is already present at grasping (50.0%50.0\% to 70.0%70.0\%) and persists through the subsequent stages. The two shorter tasks remain near ceiling under ID clean and show only small, mixed differences. Table 5: Stage-level completion. Fraction of trials (%) reaching each stage under ID clean (cumulative). Task Stage Base + Indi Threading Pole centered 100.0 100.0 Ring grasped 96.0 100.0 Inserted 92.0 96.0 Basket Nest. Lifted 100.0 96.0 Nested 94.0 92.0 Cross-Bin Base retrieved 96.0 96.0 Base centered 90.0 92.0 Top retrieved 82.0 86.0 Stacked 74.0 80.0 Drawer Grasped 50.0 70.0 Transferred 50.0 70.0 Opened 40.0 56.0 Placed inside 26.0 38.0 Closed 24.0 36.0 The stage profiles reveal two different sources of improvement on the longer tasks. On Cross-Bin Stacking, the policies remain nearly indistinguishable through centering the base cube, and the main gap appears when execution must move from the completed first subgoal to retrieving and stacking the second cube. This provides the clearest real-world evidence that Indi improves behavior across a stage transition. Drawer Storage differs: Indi already improves grasping and transfer from 50.0%50.0\% to 70.0%70.0\%, and this advantage persists through opening (40.0%40.0\% to 56.0%56.0\%), placement (26.0%26.0\% to 38.0%38.0\%), and closure (24.0%24.0\% to 36.0%36.0\%). Thus, its gain cannot be attributed solely to a single transition, but instead reflects more reliable execution across the multi-stage sequence. By contrast, Threading and Basket Nesting have high early-stage completion and little separation under ID clean, leaving less room for improvement. Together, these results indicate that the benefit of intent supervision becomes more pronounced when successful execution must remain organized across multiple stages, while not requiring every gain to arise from the same failure mode. 4.4 Analysis and Controlled Studies We isolate the source of the gain, test whether the recovered state functions as intent, and measure deployment cost. Unless stated otherwise, controlled analyses use GR00T-N1.7 on a fixed SimplerEnv-Bridge evaluation run shared across all variants. The main benchmark tables separately report means over three evaluation runs. Table 6: Controlled analyses on SimplerEnv-Bridge. (a) compares supervision and capacity controls under the same backbone, demonstrations, budget, and evaluation run. Intent only removes the grounding streams, while future supervision replaces the teacher-intent target with an endpoint visual representation. (b) reports closed-loop success after replacing the task- or phase-discriminative coordinates of the intent and grounding representations. All values are success rates (%). Method Spoon Carrot Stack EP-Basket Avg. GR00T-N1.7 82.0 68.0 66.0 30.0 61.5 + Groundings only 88.0 82.0 38.0 32.0 60.0 + Future supervision 84.0 70.0 56.0 62.0 68.0 + Free latent 78.0 76.0 48.0 26.0 57.0 + Intent only 86.0 84.0 70.0 64.0 76.0 Indi (Ours) 90.0 78.0 74.0 100.0 85.5 (a) Supervision controls. Injected objective Forced phase Task Spoon Carrot Stack EP-Basket Early Late Noise Spoon 88.0 62.0 58.0 24.0 19.0 0.0 4.0 Carrot 50.0 84.0 56.0 32.0 6.0 18.0 0.0 Stack 48.0 42.0 72.0 36.0 4.0 4.0 0.0 EP-Basket 42.0 48.0 44.0 94.0 0.0 0.0 0.0 Avg. (diag/off-diag) 84.5 / 45.2 7.3 5.5 1.0 (b) Objective and phase interventions. Is the gain specific to behavior-intent supervision? To distinguish teacher-derived intent from grounding supervision, future visual alignment, and additional latent capacity, we compare controlled variants in Table 6(a). Groundings only and free latent remain below the action-only baseline, while future supervision reaches 68.0%68.0\%. Intent supervision alone reaches 76.0%76.0\%, exceeding the baseline by 14.514.5 p and future supervision by 8.08.0 p. Adding visual and textual groundings further raises success to 85.5%85.5\%, including a gain from 64.0%64.0\% to 100.0%100.0\% on EP-Basket. Thus, teacher-derived intent drives the main improvement, while groundings provide complementary gains on average. Further details are provided in Section B.1. (a) Objective structure. A task-discriminative projection separates recovered intents by behavior objective across real and simulation rollouts. (b) Progress structure. A phase-discriminative projection organizes intents from different tasks by execution stage. Figure 3: Semantic structure of recovered intent. The representation retains both the local objective and progress through the manipulation sequence. Does the recovered representation function as behavioral intent? The preceding controls identify intent supervision as the main source of the gain, so we next test whether the recovered state actually functions as intent by examining its objective and stage structure, its use by downstream decoding, and the behavioral effect of changing its content. As shown in Figure 3, recovered intents separate by behavior objective across real demonstrations and simulation rollouts and organize by early, middle, and late execution stages. Further analyses show that downstream decoding depends on the recovered state, quantify its objective and progress structure, and distinguish it from the particular action sequence used to realize the behavior (Sections B.3, 12 and 6). We next test whether this content causally affects execution by editing the task- or phase-discriminative components of the intent and grounding representations. Same-objective interventions retain 84.5%84.5\% success, compared with 45.2%45.2\% for cross-objective interventions and 1.0%1.0\% under Gaussian corruption (Table 6(b)). The uneven cross-objective effects are consistent with recovered-intent task geometry, where Spoon and Carrot form the closest pair and EP-Basket is the most separated (Figure 7). Phase forcing reduces success to 7.3%7.3\% for early content and 5.5%5.5\% for late content, while producing stage-consistent behaviors such as approaching without grasping or attempting placement with an empty gripper (Figures 8, 9 and 10). Together, these results show that recovered intent represents objective and progress beyond the particular action sequence and causally organizes downstream execution. Additional protocols and readouts are provided in Sections B.3 and B.4. What is the additional computational cost? Teacher inference and target construction are performed once offline, and all teacher-side modules are removed at deployment, so runtime overhead comes only from the additional decoder representations. Indi increases GR00T-N1.7 from 3.463.46B to 3.503.50B parameters and inference time from 56.156.1 to 61.561.5 ms per policy query. For π0.5 _0.5, the corresponding changes are 3.623.62B to 3.643.64B parameters and 24.424.4 to 29.729.7 ms. Full training-time and resource measurements are reported in Sections A.7 and 7. 5 Conclusion We presented Indi, a framework for distilling behavior-level intent into pretrained VLA action decoders. While behavior cloning supervises executed actions and future-based objectives supervise particular realizations, neither directly identifies the local objective served by the behavior. During training, a frozen teacher VLM interprets demonstrated behavior, and the decoder learns to recover the resulting intent from standard VLA inputs and use it to organize action and grounding prediction. Across SimplerEnv-Bridge, RoboCasa Kitchen, and real-world manipulation tasks, Indi improves strong VLA backbones without requiring the teacher at deployment. Controlled studies further show that the gains arise specifically from intent supervision and that the recovered state represents objective and progress, is used by the policy, and influences closed-loop execution. These results position behavior intent as a compact intermediate representation that shifts VLA learning from reproducing executions toward understanding what each behavior should accomplish. References Bai et al. (2025) S. Bai, Y. Cai, R. Chen, K. Chen, X. Chen, Z. Cheng, L. Deng, W. Ding, C. Gao, C. Ge, W. Ge, Z. Guo, Q. Huang, J. Huang, F. Huang, B. Hui, S. Jiang, Z. Li, M. Li, M. Li, K. Li, Z. Lin, J. Lin, X. Liu, J. Liu, C. Liu, Y. Liu, D. Liu, S. Liu, D. Lu, R. Luo, C. Lv, R. Men, L. Meng, X. Ren, X. Ren, S. Song, Y. Sun, J. Tang, J. Tu, J. Wan, P. Wang, P. Wang, Q. Wang, Y. Wang, T. Xie, Y. Xu, H. Xu, J. Xu, Z. Yang, M. Yang, J. Yang, A. Yang, B. Yu, F. Zhang, H. Zhang, X. Zhang, B. Zheng, H. Zhong, J. Zhou, F. Zhou, J. Zhou, Y. Zhu, and K. Zhu Qwen3-vl technical report. arXiv preprint arXiv:2511.21631. External Links: 2511.21631 Cited by: §B.5. Bharadhwaj et al. (2024) H. Bharadhwaj, R. Mottaghi, A. Gupta, and S. Tulsiani Track2Act: predicting point tracks from internet videos enables generalizable robot manipulation. In European Conference on Computer Vision, p. 306–324. External Links: Document Cited by: §1, §2. Black et al. (2025a) K. Black, N. Brown, J. Darpinian, K. Dhabalia, D. Driess, A. Esmail, M. R. Equi, C. Finn, N. Fusai, M. Y. Galliker, D. Ghosh, L. Groom, K. Hausman, b. ichter, S. Jakubczak, T. Jones, L. Ke, D. LeBlanc, S. Levine, A. Li-Bell, M. Mothukuri, S. Nair, K. Pertsch, A. Z. Ren, L. X. Shi, L. Smith, J. T. Springenberg, K. Stachowicz, J. Tanner, Q. Vuong, H. Walke, A. Walling, H. Wang, L. Yu, and U. Zhilinsky π0.5 _0.5: a Vision-Language-Action Model with Open-World Generalization. In Proceedings of The 9th Conference on Robot Learning, Proceedings of Machine Learning Research, Vol. 305, p. 17–40. External Links: Link Cited by: 7th item, §A.1, §A.6, §1, §2, §3.3, Table 1, §4.1, Table 2. Black et al. (2025b) K. Black, N. Brown, D. Driess, A. Esmail, M. R. Equi, C. Finn, N. Fusai, L. Groom, K. Hausman, B. Ichter, S. Jakubczak, T. Jones, L. Ke, S. Levine, A. Li-Bell, M. Mothukuri, S. Nair, K. Pertsch, L. X. Shi, L. Smith, J. Tanner, Q. Vuong, A. Walling, H. Wang, and U. Zhilinsky π0 _0: A Vision-Language-Action Flow Model for General Robot Control. In Proceedings of Robotics: Science and Systems, Los Angeles, CA, USA. External Links: Document Cited by: 5th item, §1, §2, Table 1, Table 3. Black et al. (2024) K. Black, M. Nakamoto, P. Atreya, H. Walke, C. Finn, A. Kumar, and S. Levine Zero-shot robotic manipulation with pre-trained image-editing diffusion models. In International Conference on Learning Representations, Cited by: §1, §2, §3.2. Brohan et al. (2023) A. Brohan, N. Brown, J. Carbajal, Y. Chebotar, J. Dabis, C. Finn, K. Gopalakrishnan, K. Hausman, A. Herzog, J. Hsu, J. Ibarz, B. Ichter, A. Irpan, T. Jackson, S. Jesmonth, N. Joshi, R. Julian, D. Kalashnikov, Y. Kuang, I. Leal, K. Lee, S. Levine, Y. Lu, U. Malla, D. Manjunath, I. Mordatch, O. Nachum, C. Parada, J. Peralta, E. Perez, K. Pertsch, J. Quiambao, K. Rao, M. S. Ryoo, G. Salazar, P. R. Sanketi, K. Sayed, J. Singh, S. Sontakke, A. Stone, C. Tan, H. Tran, V. Vanhoucke, S. Vega, Q. H. Vuong, F. Xia, T. Xiao, P. Xu, S. Xu, T. Yu, and B. Zitkovich RT-1: robotics transformer for real-world control at scale. In Proceedings of Robotics: Science and Systems, Daegu, Republic of Korea. External Links: Document Cited by: §2. Bu et al. (2025) Q. Bu, Y. Yang, J. Cai, S. Gao, G. Ren, M. Yao, P. Luo, and H. Li Learning to act anywhere with task-centric latent actions. In Proceedings of Robotics: Science and Systems, Cited by: 13rd item, Table 1. Chen et al. (2025) Y. Chen, K. Gu, Y. Wen, Y. Zhao, T. Wang, and L. Nie IntentionVLA: generalizable and efficient embodied intention reasoning for human-robot interaction. arXiv preprint arXiv:2510.07778. Cited by: §2. Chen et al. (2026) Y. Chen, Y. Ge, H. Zhou, M. Ding, Y. Ge, and X. Liu DIAL: decoupling intent and action via latent world modeling for end-to-end vla. arXiv preprint arXiv:2603.29844. Cited by: §2. Fan et al. (2026) L. Fan, Z. Xu, C. Cao, W. Zhang, M. Yuan, and J. Chen AIM: intent-aware unified world action modeling with spatial value maps. arXiv preprint arXiv:2604.11135. Cited by: §2. Fang et al. (2024) H. Fang, H. Fang, Z. Tang, J. Liu, C. Wang, J. Wang, H. Zhu, and C. Lu RH20T: a comprehensive robotic dataset for learning diverse skills in one-shot. In 2024 IEEE International Conference on Robotics and Automation (ICRA), p. 653–660. External Links: Document Cited by: §2. Gemini Robotics Team et al. (2025) Gemini Robotics Team, S. Abeyruwan, J. Ainslie, J. Alayrac, M. G. Arenas, T. Armstrong, A. Balakrishna, et al. Gemini robotics: bringing ai into the physical world. arXiv preprint arXiv:2503.20020. Cited by: §1, §2. Gupta et al. (2026) H. Gupta, G. Shi, and W. Yuan LUCID: learning embodiment-agnostic intent models from unstructured human videos for scalable dexterous robot skill acquisition. arXiv preprint arXiv:2606.11628. Cited by: §2. Hu et al. (2025) Y. Hu, Y. Guo, P. Wang, X. Chen, Y. Wang, J. Zhang, K. Sreenath, C. Lu, and J. Chen Video prediction policy: a generalist robot policy with predictive visual representations. In Proceedings of the 42nd International Conference on Machine Learning, Proceedings of Machine Learning Research, Vol. 267, p. 24328–24346. External Links: Link Cited by: §1, §2, §3.2. Huang et al. (2025a) C. Huang, Y. Wu, M. Chen, Y. F. Wang, and F. Yang ThinkAct: vision-language-action reasoning via reinforced visual latent planning. In Advances in Neural Information Processing Systems, Vol. 38. Cited by: §2, §3.2. Huang et al. (2025b) H. Huang, X. Chen, Y. Chen, H. Li, X. Han, Z. Wang, T. Wang, J. Pang, and Z. Zhao RoboGround: robotic manipulation with grounded vision-language priors. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, p. 22540–22550. Cited by: §2. Huang et al. (2026) R. Huang, C. Zeng, W. Tang, J. Cai, C. Lu, and P. Cai Mimic intent, not just trajectories. arXiv preprint arXiv:2602.08602. Cited by: §2. Jang et al. (2025) J. Jang, S. Ye, Z. Lin, J. Xiang, J. Bjorck, Y. Fang, F. Hu, S. Huang, K. Kundalia, Y. Lin, L. Magne, A. Mandlekar, A. Narayan, Y. L. Tan, G. Wang, J. Wang, Q. Wang, Y. Xu, X. Zeng, K. Zheng, R. Zheng, M. Liu, L. Zettlemoyer, D. Fox, J. Kautz, S. Reed, Y. Zhu, and L. Fan DreamGen: unlocking generalization in robot learning through video world models. In Proceedings of The 9th Conference on Robot Learning, J. Lim, S. Song, and H. Park (Eds.), Proceedings of Machine Learning Research, Vol. 305, p. 5170–5194. External Links: Link Cited by: 15th item, Table 3. Jiang et al. (2025) H. Jiang, J. Wang, and Z. Lu Discrete latent plans via semantic skill abstractions. In The Thirteenth International Conference on Learning Representations, Cited by: §2. Khazatsky et al. (2024) A. Khazatsky, K. Pertsch, S. Nair, A. Balakrishna, et al. DROID: a large-scale in-the-wild robot manipulation dataset. Robotics: Science and Systems. Cited by: §2. Kim et al. (2026a) D. Kim, H. Jang, M. Koo, S. Jang, T. Kim, B. Kim, B. Yoon, C. Jang, D. Choi, D. Han, et al. RLDX-1 technical report. arXiv preprint arXiv:2605.03269. External Links: Link Cited by: §2, §3.2. Kim et al. (2025) M. J. Kim, K. Pertsch, S. Karamcheti, T. Xiao, A. Balakrishna, S. Nair, R. Rafailov, E. P. Foster, P. R. Sanketi, Q. Vuong, T. Kollar, B. Burchfiel, R. Tedrake, D. Sadigh, S. Levine, P. Liang, and C. Finn OpenVLA: an open-source vision-language-action model. In Proceedings of The 8th Conference on Robot Learning, Proceedings of Machine Learning Research, Vol. 270, p. 2679–2713. External Links: Link Cited by: 2nd item, §1, §2, Table 1. Kim et al. (2026b) T. Kim, J. Lee, M. Koo, D. Kim, K. Lee, C. Kim, Y. Seo, and J. Shin Contrastive representation regularization for vision-language-action models. In International Conference on Machine Learning, External Links: 2510.01711, Link Cited by: 20th item, Table 3. Koo et al. (2026) M. Koo, D. Choi, T. Kim, K. Lee, C. Kim, Y. Seo, and J. Shin HAMLET: switch your vision-language-action model into a history-aware policy. In International Conference on Learning Representations, Cited by: 19th item, Table 3. Li et al. (2026a) C. Li, K. Xiong, Y. Xu, L. Qian, Y. Wang, and W. Zhu GazeVLA: learning human intention for robotic manipulation. arXiv preprint arXiv:2604.22615. Cited by: §2. Li et al. (2025a) J. Li, Y. Zhu, Z. Tang, J. Wen, M. Zhu, X. Liu, C. Li, R. Cheng, Y. Peng, Y. Peng, and F. Feng CoA-VLA: improving vision-language-action models via visual-text chain-of-affordance. In Proceedings of the IEEE/CVF International Conference on Computer Vision, p. 9759–9769. Cited by: §2, §3.2. Li et al. (2024) Q. Li, Y. Liang, Z. Wang, L. Luo, X. Chen, M. Liao, F. Wei, Y. Deng, S. Xu, Y. Zhang, X. Wang, B. Liu, J. Fu, J. Bao, D. Chen, Y. Shi, J. Yang, and B. Guo CogACT: a foundational vision-language-action model for synergizing cognition and action in robotic manipulation. arXiv preprint arXiv:2411.19650. Cited by: §1, §2. Li et al. (2026b) X. Li, P. Li, L. Qian, M. Liu, D. Wang, J. Liu, B. Kang, X. Ma, X. Wang, D. Guo, T. Kong, H. Zhang, and H. Liu What matters in building vision–language–action models for generalist robots. Nature Machine Intelligence 8, p. 158–172. External Links: Document Cited by: 3rd item, Table 1. Li et al. (2025b) X. Li, K. Hsu, J. Gu, O. Mees, K. Pertsch, H. R. Walke, C. Fu, I. Lunawat, I. Sieh, S. Kirmani, S. Levine, J. Wu, C. Finn, H. Su, Q. Vuong, and T. Xiao Evaluating real-world robot manipulation policies in simulation. In Proceedings of The 8th Conference on Robot Learning, Proceedings of Machine Learning Research, Vol. 270, p. 3705–3728. External Links: Link Cited by: §A.2, 3rd item, §1, §4.1. Lian et al. (2026) S. Lian, B. Yu, X. Lin, Z. Shen, L. T. Yang, Y. Jin, H. Liu, C. Wu, H. Yuan, C. Huang, and K. Chen IntentVLA: short-horizon intent modeling for aliased robot manipulation. arXiv preprint arXiv:2605.14712. Cited by: §2. Liang et al. (2025) J. Liang, P. Tokmakov, R. Liu, S. Sudhakar, P. Shah, R. Ambrus, and C. Vondrick Video generators are robot policies. arXiv preprint arXiv:2508.00795. Cited by: 17th item, Table 3. Liu et al. (2025) S. Liu, L. Wu, B. Li, H. Tan, H. Chen, Z. Wang, K. Xu, H. Su, and J. Zhu RDT-1B: a diffusion foundation model for bimanual manipulation. In International Conference on Learning Representations, Cited by: §2. Luo et al. (2026) H. Luo, W. Zhang, Y. Feng, S. Zheng, H. Xu, C. Xu, Z. Xi, Y. Fu, and Z. Lu Being-H0.7: a latent world-action model from egocentric videos. arXiv preprint arXiv:2605.00078. Cited by: §2. Lynch et al. (2020) C. Lynch, M. Khansari, T. Xiao, V. Kumar, J. Tompson, S. Levine, and P. Sermanet Learning latent plans from play. In Proceedings of the Conference on Robot Learning, Proceedings of Machine Learning Research, Vol. 100, p. 1113–1132. Cited by: §2. Nasiriany et al. (2024) S. Nasiriany, A. Maddukuri, L. Zhang, A. Parikh, A. Lo, A. Joshi, A. Mandlekar, and Y. Zhu RoboCasa: large-scale simulation of everyday tasks for generalist robots. In Robotics: Science and Systems, Cited by: §A.2, 3rd item, §1, §4.1. NVIDIA et al. (2025) NVIDIA, J. Bjorck, F. Castañeda, N. Cherniadev, X. Da, R. Ding, L. Fan, Y. Fang, D. Fox, F. Hu, S. Huang, J. Jang, Z. Jiang, J. Kautz, K. Kundalia, L. Lao, Z. Li, Z. Lin, K. Lin, G. Liu, E. Llontop, L. Magne, A. Mandlekar, A. Narayan, S. Nasiriany, S. Reed, Y. L. Tan, G. Wang, Z. Wang, J. Wang, Q. Wang, J. Xiang, Y. Xie, Y. Xu, Z. Xu, S. Ye, Z. Yu, A. Zhang, H. Zhang, Y. Zhao, R. Zheng, and Y. Zhu GR00T n1: an open foundation model for generalist humanoid robots. arXiv preprint arXiv:2503.14734. Cited by: 8th item, §1, §2, §3.3, Table 3. NVIDIA GEAR Team (2025) NVIDIA GEAR Team GR00T N1.5: an improved open foundation model for generalist humanoid robots. Note: NVIDIA Research project page External Links: Link Cited by: 9th item, Table 1, Table 3. NVIDIA (2025a) NVIDIA Cosmos-Reason2: physical ai common sense and embodied reasoning models. Note: GitHub repositoryReleased December 19, 2025 External Links: Link Cited by: §A.4, §B.5, §4.1. NVIDIA (2025b) NVIDIA GR00T n1.6: an improved open foundation model for generalist humanoid robots. Note: NVIDIA Research project page External Links: Link Cited by: 10th item, Table 2. NVIDIA (2026) NVIDIA NVIDIA isaac gr00t n1.7: a foundation model for generalist robots. Note: GitHub repositoryEarly access release External Links: Link Cited by: 11st item, §A.1, §A.6, §1, §2, Table 1, §4.1, Table 2. Octo Model Team et al. (2024) Octo Model Team, D. Ghosh, H. Walke, K. Pertsch, K. Black, O. Mees, S. Dasari, J. Hejna, C. Xu, J. Luo, T. Kreiman, and S. Levine Octo: an open-source generalist robot policy. In Proceedings of Robotics: Science and Systems, External Links: Document Cited by: 1st item, §2, Table 1, Table 1. Open X-Embodiment Collaboration et al. (2024) Open X-Embodiment Collaboration, A. O’Neill, A. Rehman, A. Maddukuri, A. Gupta, A. Padalkar, A. Lee, A. Pooley, A. Gupta, A. Mandlekar, et al. Open x-embodiment: robotic learning datasets and rt-x models. In 2024 IEEE International Conference on Robotics and Automation (ICRA), p. 6892–6903. External Links: Document Cited by: §2. Pang et al. (2026) C. Pang, J. Huang, Z. Zhao, Y. Wang, K. Xu, and X. Ding InDex: empowering VLA models with intent-conditioned arm-hand coordination for dexterous manipulation. arXiv preprint arXiv:2606.12109. Cited by: §2. Pani and Yang (2026) A. Pani and Y. Yang Gaze-regularized vision-language-action models for robotic manipulation. arXiv preprint arXiv:2603.23202. Cited by: §2. Pertsch et al. (2025) K. Pertsch, K. Stachowicz, B. Ichter, D. Driess, S. Nair, Q. Vuong, O. Mees, C. Finn, and S. Levine FAST: efficient action tokenization for vision-language-action models. arXiv preprint arXiv:2501.09747. Cited by: 6th item, Table 1, Table 3. Physical Intelligence et al. (2026) Physical Intelligence, B. Ai, A. Amin, R. Aniceto, A. Balakrishna, K. Black, D. Driess, C. Finn, K. Hausman, B. Ichter, S. Levine, K. Pertsch, Q. Vuong, et al. π0.7 _0.7: a Steerable Generalist Robotic Foundation Model with Emergent Capabilities. arXiv preprint arXiv:2604.15483. Cited by: §1, §2. Physical Intelligence (2025) Physical Intelligence openpi: open-source models and packages for robotics. Note: https://github.com/Physical-Intelligence/openpi Cited by: §A.1, §A.6. Qu et al. (2025) D. Qu, H. Song, Q. Chen, Y. Yao, X. Ye, Y. Ding, Z. Wang, J. Gu, B. Zhao, D. Wang, and X. Li SpatialVLA: exploring spatial representations for visual-language-action model. In Robotics: Science and Systems, Cited by: 4th item, Table 1. Qwen Team (2026) Qwen Team Qwen3.5-9B. Note: Hugging Face model repository External Links: Link Cited by: §B.5. Sumers et al. (2023) T. Sumers, K. Marino, A. Ahuja, R. Fergus, and I. Dasgupta Distilling internet-scale vision-language models into embodied agents. In International Conference on Machine Learning, Cited by: §3.2. Sun et al. (2026) J. Sun, W. Zhang, Z. Qi, S. Ren, Z. Liu, H. Zhu, G. Sun, X. Jin, and Z. Chen VLA-JEPA: enhancing vision-language-action model with latent world model. arXiv preprint arXiv:2602.10098. Cited by: §2. Tay et al. (2026) T. Y. H. Tay, X. Yan, J. Ouyang, D. Wu, W. Jiang, J. Kao, and Y. Cui Intent at a glance: gaze-guided robotic manipulation via foundation models. arXiv preprint arXiv:2601.05336. Cited by: §2. Tian et al. (2025) Y. Tian, S. Yang, J. Zeng, P. Wang, D. Lin, H. Dong, and J. Pang Predictive inverse dynamics models are scalable learners for robotic manipulation. In International Conference on Learning Representations, Cited by: §2. Walke et al. (2023) H. R. Walke, K. Black, T. Z. Zhao, Q. Vuong, C. Zheng, P. Hansen-Estruch, A. W. He, V. Myers, M. J. Kim, M. Du, A. Lee, K. Fang, C. Finn, and S. Levine BridgeData v2: a dataset for robot learning at scale. In Proceedings of The 7th Conference on Robot Learning, Proceedings of Machine Learning Research, Vol. 229, p. 1723–1736. Cited by: §A.2, §2. Wen et al. (2025) J. Wen, M. Zhu, Y. Zhu, Z. Tang, J. Li, Z. Zhou, C. Li, X. Liu, Y. Peng, C. Shen, and F. Feng Diffusion-vla: scaling robot foundation models via unified diffusion and autoregression. In International Conference on Machine Learning, Cited by: §2. Won et al. (2026) J. Won, K. Lee, H. Jang, D. Kim, and J. Shin Dual-stream diffusion for world-model augmented vision-language-action model. In International Conference on Machine Learning, External Links: 2510.27607, Link Cited by: 16th item, §2, Table 3. Wu et al. (2024) H. Wu, Y. Jing, C. Cheang, G. Chen, J. Xu, X. Li, M. Liu, H. Li, and T. Kong Unleashing large-scale video generative pre-training for visual robot manipulation. In International Conference on Learning Representations, Cited by: §1, §2, §3.2. Xie et al. (2026) Y. Xie, Y. Wang, G. Chen, J. Liu, Y. Sun, and W. Ding Learning human-intention priors from large-scale human demonstrations for robotic manipulation. arXiv preprint arXiv:2604.24681. Cited by: §2. Xu et al. (2024) M. Xu, Z. Xu, Y. Xu, C. Chi, G. Wetzstein, M. Veloso, and S. Song Flow as the cross-domain manipulation interface. In Proceedings of the Conference on Robot Learning, Cited by: §1, §2. Xu et al. (2026) X. Xu, H. Li, J. Ye, Y. Chen, J. Zeng, X. Chen, L. Xu, D. Lin, W. Li, and J. Pang FutureVLA: joint visuomotor prediction for vision-language-action model. arXiv preprint arXiv:2603.10712. Cited by: §2, §2. Ye et al. (2025) S. Ye, J. Jang, B. Jeon, S. Joo, J. Yang, B. Peng, A. Mandlekar, R. Tan, Y. Chao, B. Y. Lin, L. Liden, K. Lee, J. Gao, L. Zettlemoyer, D. Fox, and M. Seo Latent action pretraining from videos. In International Conference on Learning Representations, Cited by: 12nd item, Table 1. Yu et al. (2025) S. Yu, S. Kwak, H. Jang, J. Jeong, J. Huang, J. Shin, and S. Xie Representation alignment for generation: training diffusion transformers is easier than you think. In International Conference on Learning Representations, Cited by: §3.3. Zawalski et al. (2025) M. Zawalski, W. Chen, K. Pertsch, O. Mees, C. Finn, and S. Levine Robotic control via embodied chain-of-thought reasoning. In Proceedings of The 8th Conference on Robot Learning, Proceedings of Machine Learning Research, Vol. 270, p. 3157–3181. Cited by: 14th item, §2, §3.2, Table 1. Zhang et al. (2025) W. Zhang, H. Liu, Z. Qi, Y. Wang, X. Yu, J. Zhang, R. Dong, J. He, H. Wang, Z. Zhang, L. Yi, W. Zeng, and X. Jin DreamVLA: a vision-language-action model dreamed with comprehensive world knowledge. In Advances in Neural Information Processing Systems, Vol. 38. Cited by: §1, §2, §3.2. Zhang et al. (2026) Y. Zhang, C. Sun, S. Liang, D. Liu, C. Ji, W. Zhang, and T. Liu Bridging scale discrepancies in robotic control via language-based action representations. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 40, p. 18809–18817. Cited by: Table 1. Zhao et al. (2025) Q. Zhao, Y. Lu, M. J. Kim, Z. Fu, Z. Zhang, Y. Wu, Z. Li, Q. Ma, S. Han, C. Finn, A. Handa, T. Lin, G. Wetzstein, M. Liu, and D. Xiang CoT-vla: visual chain-of-thought reasoning for vision-language-action models. In Proceedings of the Computer Vision and Pattern Recognition Conference, p. 1702–1713. Cited by: §1, §2. Zheng et al. (2025a) R. Zheng, Y. Liang, S. Huang, J. Gao, H. Daumé I, A. Kolobov, F. Huang, and J. Yang TraceVLA: visual trace prompting enhances spatial-temporal awareness for generalist robotic policies. In International Conference on Learning Representations, Cited by: §2. Zheng et al. (2025b) R. Zheng, J. Wang, S. Reed, J. Bjorck, Y. Fang, F. Hu, J. Jang, K. Kundalia, Z. Lin, L. Magne, A. Narayan, Y. L. Tan, G. Wang, Q. Wang, J. Xiang, Y. Xu, S. Ye, J. Kautz, F. Huang, Y. Zhu, and L. Fan FLARE: robot learning with implicit world modeling. In Proceedings of The 9th Conference on Robot Learning, J. Lim, S. Song, and H. Park (Eds.), Proceedings of Machine Learning Research, Vol. 305, p. 3952–3971. External Links: Link Cited by: 18th item, §1, §2, §3.3, Table 3. Zhong et al. (2026) L. Zhong, Y. Liu, Y. Wei, Z. Xiong, M. Yao, S. Liu, and G. Ren ACoT-VLA: action chain-of-thought for vision-language-action models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, External Links: 2601.11404, Link Cited by: §2. Zitkovich et al. (2023) B. Zitkovich, T. Yu, S. Xu, P. Xu, T. Xiao, F. Xia, J. Wu, P. Wohlhart, S. Welker, A. Wahid, Q. Vuong, V. Vanhoucke, H. Tran, R. Soricut, A. Singh, J. Singh, P. Sermanet, P. R. Sanketi, G. Salazar, M. S. Ryoo, K. Reymann, K. Rao, K. Pertsch, I. Mordatch, H. Michalewski, Y. Lu, S. Levine, L. Lee, T. E. Lee, I. Leal, Y. Kuang, D. Kalashnikov, R. Julian, N. J. Joshi, A. Irpan, B. Ichter, J. Hsu, A. Herzog, K. Hausman, K. Gopalakrishnan, C. Fu, P. Florence, C. Finn, K. A. Dubey, D. Driess, T. Ding, K. M. Choromanski, X. Chen, Y. Chebotar, J. Carbajal, N. Brown, A. Brohan, M. G. Arenas, and K. Han RT-2: vision-language-action models transfer web knowledge to robotic control. In Proceedings of The 7th Conference on Robot Learning, Proceedings of Machine Learning Research, Vol. 229, p. 2165–2183. External Links: Link Cited by: §1, §2. Zuo et al. (2026) K. Zuo, G. Li, B. Lyu, Y. Lu, B. Ma, S. Han, X. Zhou, X. Yuan, C. Zhou, J. Bai, G. Li, and J. Yang Gaze2Act: gaze-conditioned vision-language-action policies for interactive robot manipulation. arXiv preprint arXiv:2605.30282. Cited by: §2. Appendix A Experimental Details Figure 4: Real-robot teleoperation and evaluation platform. We specify the leader and follower robot arm setups, consisting of 5-DoF arms with 1-DoF grippers, along with the multi-camera views. A.1 Model Details Backbone VLAs. We instantiate Indi on two flow-matching VLA backbones, GR00T-N1.7-3B (NVIDIA, 2026) and π0.5 _0.5 (Black et al., 2025a; Physical Intelligence, 2025), using their official implementations. For both models, we freeze the pretrained vision-language module and fine-tune the action decoder together with the newly introduced Indi parameters. Indi integration. For GR00T-N1.7, we append self-conditioned visual and textual grounding rows and clean intent queries QIQ^I to the pretrained DiT token stream. The grounding rows follow the backbone’s time-conditioned normalization, while the intent queries use standard layer normalization and are never noised. The recovered intent is supervised at block 16 of 32. For π0.5 _0.5, the action-expert suffix is organized as [Qt,Atλ,ZtV,λ,ZtR,λ,QI],[Q_t,A_t^λ,Z_t^V,λ,Z_t^R,λ,Q^I], where QtQ_t is the proprioceptive-state representation, AtλA_t^λ is the noised action sequence, ZtV,λZ_t^V,λ and ZtR,λZ_t^R,λ are self-conditioned visual and textual grounding inputs, and QIQ^I contains the clean intent queries. The recovered intent is supervised at layer 9 of 18. We apply the same asymmetric information-flow pattern during training and sampling. Intent queries attend to the frozen VLA context, proprioceptive state, and one another while remaining isolated from the noised action and grounding rows. Visual and textual grounding rows attend to the recovered intent and one another, whereas action rows attend to the intent together with both grounding streams. For π0.5 _0.5, we cache the frozen prefix keys and values during training. Trainable and frozen components. The vision-language modules, including their visual encoders, remain frozen for both backbones. We optimize the complete action decoder together with the added intent and grounding parameters. These parameters include intent-query embeddings, positional and camera-view embeddings, and three-layer SiLU MLPs for encoding and projecting the target representations. The visual target has width dV=2048d_V=2048, the teacher targets have width dT=4096d_T=4096, and the added representations are mapped to the backbone-specific decoder width dDd_D. Checkpoint-tensor counting gives 3.455B parameters for the GR00T-N1.7 baseline and 3.502B for GR00T-N1.7+Indi, corresponding to 46.4M additional parameters or a 1.3%1.3\% increase. For π0.5 _0.5, the corresponding counts are 3.617B and 3.640B, giving 23.1M additional parameters or a 0.64%0.64\% increase. Model dimensions. Unless stated otherwise, we use KI=8K_I=8 intent queries, KR=8K_R=8 textual grounding rows, and KV=16K_V=16 visual grounding rows per camera. Bridge uses one camera and therefore 16 visual rows, while RoboCasa Kitchen uses three cameras and therefore 48 visual rows. We use an intent-mismatch margin of m=0.05m=0.05 and a context-dropout probability of 0.50.5. A.2 Datasets SimplerEnv-Bridge. We evaluate on SimplerEnv-Bridge (Li et al., 2025b), a simulation benchmark for evaluating real-world manipulation policies trained on BridgeData V2 (Walke et al., 2023). We use the LeRobot conversion of BridgeData V2, which contains 53,192 episodes and 1,893,026 frames recorded at 5 Hz. Each sample contains a primary RGB observation at 256×256256× 256 resolution, an 8-dimensional robot state, and a 7-dimensional action. We evaluate four WidowX manipulation tasks: spoon on towel, carrot on plate, stack cube, and put eggplant in basket. Our controlled GR00T-N1.7 and π0.5 _0.5 comparisons use three independent evaluation runs with 50 episodes per task in each run. We report the mean and sample standard deviation of the three run-level success rates. Published baseline results follow their original evaluation protocols. RoboCasa Kitchen. RoboCasa Kitchen (Nasiriany et al., 2024) is a simulation benchmark for household manipulation in diverse kitchen environments. We use its machine-generated dataset with 100 demonstrations for each of 24 tasks, giving 2,400 episodes and 689,595 frames recorded at 20 Hz. Each sample contains left, right, and wrist RGB observations at 256×256256× 256 resolution, a 53-dimensional robot state, and a 12-dimensional action. The benchmark contains 8 pick-and-place tasks, 6 open-or-close tasks, and 10 additional appliance and interaction tasks. We use three independent evaluation runs with 50 episodes per task and run for both GR00T-N1.7 and π0.5 _0.5. Category and overall averages are computed within each run and then summarized by their mean and sample standard deviation across the three runs. Figure 5: Real-world task suite. Four tabletop tasks used for real-world experiments. Real-world platform. As shown in Figure 4, we use a teleoperation setup consisting of SO-101 robot arms for both the leader and follower, equipped with 1-DoF grippers. Three camera views are provided: an egocentric view mounted on the head structure and two local views on the wrists. On this platform, we design four tabletop tasks as illustrated in Figure 5, each targeting a distinct capability and ordered by horizon length. For each task, we collect 100 demonstrations and train a single multitask policy per method on identical data. • Threading (bimanual) has the left arm bring a pole to the center, after which the right arm inserts a specified ring onto it, testing precise alignment. • Basket Nesting (bimanual) lifts a small basket with both arms into a larger one, testing simultaneous cooperation on a shared object that a single arm cannot lift. • Cross-Bin Stacking (bimanual) has the left arm place a cube from the left bin at the center, after which the right arm stacks a cube from the right bin on top. • Drawer Storage (bimanual) has the left arm pass an object to the right arm, which then opens the specified drawer of a two-tier unit, places the object inside, and closes it. A.3 Baselines We briefly describe the baseline methods included in our evaluations. • Octo (Octo Model Team et al., 2024) is a transformer-based generalist policy trained on cross-embodiment robot data with a diffusion-based action head. • OpenVLA (Kim et al., 2025) fine-tunes a pretrained vision-language model to autoregressively predict discretized action tokens. • RoboVLMs (Li et al., 2026b) studies the integration of pretrained vision-language models with continuous and discrete action-prediction architectures. • SpatialVLA (Qu et al., 2025) incorporates explicit 3D spatial information through Ego3D positional encoding and adaptive action grids. • π0 _0 (Black et al., 2025b) combines a pretrained vision-language prefix with a flow-matching action expert for continuous action generation. • π0 _0-FAST (Pertsch et al., 2025) predicts actions autoregressively using frequency-space action tokenization. • π0.5 _0.5 (Black et al., 2025a) extends the π0 _0 family toward open-world generalization and serves as our second backbone. • GR00T-N1 (NVIDIA et al., 2025) combines a vision-language module with a flow-matching diffusion-transformer action decoder. • GR00T-N1.5 (NVIDIA GEAR Team, 2025) improves the architecture, training data, and post-training procedure of GR00T-N1. • GR00T-N1.6 (NVIDIA, 2025b) further updates the GR00T pretraining mixture and post-training recipe. • GR00T-N1.7 (NVIDIA, 2026) is our primary backbone. • LAPA (Ye et al., 2025) learns discrete latent actions between video frames and pretrains a vision-language model to predict these representations before robot-action fine-tuning. • UniVLA (Bu et al., 2025) learns task-centric latent actions from cross-embodiment videos and decodes the predicted latent actions into embodiment-specific robot trajectories. • ECoT (Zawalski et al., 2025) generates embodied reasoning traces before predicting robot actions. • DreamGen (Jang et al., 2025) generates synthetic robot trajectories with a video world model and recovers corresponding pseudo-actions. • DUST (Won et al., 2026) jointly predicts future observations and actions using interacting diffusion streams with decoupled flow-matching objectives. • Video Policy (Liang et al., 2025) combines behavior-video generation and action prediction within an end-to-end robot policy. • FLARE (Zheng et al., 2025b) aligns intermediate action-decoder representations with latent features of future observations. • HAMLET (Koo et al., 2026) incorporates observation history through moment tokens and a temporal memory module. • RS-CL (Kim et al., 2026b) regularizes vision-language representations with a contrastive objective supervised by distances between robot proprioceptive states. Our controlled comparisons use GR00T-N1.7 and π0.5 _0.5 baselines trained with the same demonstrations, optimization budgets, and evaluation protocols as their corresponding Indi models. Moreover, future supervision replaces the teacher-intent target with FLARE-style alignment of mid-depth decoder representations to latent features of the future observation, under the same backbone and training budget. The exact configurations of the supervision and capacity controls are provided in Section B.1. A.4 Target Construction Teacher inputs and prompt. We use the frozen Cosmos-Reason2-8B model (NVIDIA, 2025a) as the teacher. For each H-step demonstrated behavior segment tW_t, the teacher receives the current observation, language instruction, a coarse textual action summary cA(t)c_A(W_t), and the corresponding execution video. In a single autoregressive generation pass, the teacher first processes this multimodal evidence and then generates a functional-purpose statement describing what the executed behavior accomplishes under the instruction. The prompt asks the teacher to reason in at most four sentences about the state change occurring during the segment and how it advances the instruction. It then requests exactly one sentence of approximately 30 to 50 tokens that describes the object-level state change or immediate local subgoal. Low-level control values, camera motion, references to the video, and additional labels or explanations are explicitly excluded. We use the same prompt template for Bridge and RoboCasa Kitchen. Prompt for Teacher Target Construction System Prompt You are a robot manipulation reasoning model. You will see a short video of an approximately 1.6-second segment from a longer robot task, a short multi-step segment that may include contact, object motion, or clear setup for the next contact, plus a coarse summary of the commanded robot motion. First write a brief reasoning block inside <think>...</think>, using at most four sentences. In the reasoning, infer what changes over this segment: which object or relation is acted on, what state transition occurs, and why this segment advances the episode instruction. Immediately after </think>, write exactly one sentence of roughly 30–50 tokens. This sentence is the segment’s functional intent: the object-level outcome that the behavior accomplishes or clearly progresses toward. Describe the intended object-level state change, not low-level motion, camera appearance, or the video itself. State only changes that are visible or strongly implied by the segment. If contact or object motion has not happened yet, describe the immediate setup or alignment achieved by the segment. Do not mention “the video,” “the clip,” “frames,” “I,” or “the robot intends.” Do not add a label, bullet, prefix, or explanation after </think>. Output only the one sentence after </think>. User Prompt Episode instruction: instruction Coarse commanded motion over this segment: action_summary The video frames show an approximately 1.6-second multi-step segment with n frames. Identify the functional intent of this behavior segment by stating the object-level outcome it accomplishes or clearly progresses toward under the episode instruction. Action and video preprocessing. We convert each continuous action segment into a compact textual representation before providing it to the teacher. For each action dimension, we compute dataset-specific percentile boundaries from the training set and map the continuous values to coarse discrete motion bins. The resulting sequence of bucketed values is serialized as a short description of the translational, rotational, and gripper behavior over the segment. The gripper dimension is interpreted using the open and close convention of each dataset rather than assuming a shared sign convention across embodiments. This representation provides the teacher with the overall motion pattern while avoiding long sequences of raw floating-point values. The execution video covers the same temporal interval as the summarized action segment. On Bridge, we use the 8 frames corresponding to an 8-step segment recorded at 5 Hz. On RoboCasa Kitchen, each target covers a 32-step segment recorded at 20 Hz, from which we uniformly sample 16 frames. Both therefore represent an approximately 1.6-second behavior window. The current observation, action segment, and video clip are matched using their episode identifier and segment start index, ensuring that all teacher inputs describe the same executed behavior. Intent and textual-purpose targets. Let ℰtE_t denote the teacher-input span containing the current observation, instruction, coarse action summary, and execution video. Let tS_t denote only the final functional-purpose statement generated after the reasoning span. During the same autoregressive pass, we cache the hidden states produced while processing ℰtE_t and while generating tS_t. We construct the intent target It⋆I_t from the layer-18 hidden states over ℰtE_t, corresponding to the midpoint of the teacher. Given the input-span hidden states Hℰt(18)H_E_t^(18), we partition the token sequence into KI=8K_I=8 approximately equal contiguous regions and average the hidden states within each region: It,k⋆=1|I,k|∑i∈I,kHℰt,i(18),k=1,…,KI.I_t,k = 1|G_I,k| _i _I,kH_E_t,i^(18), k=1,…,K_I. This preserves the coarse ordering of the multimodal teacher-input representation while producing a fixed number of target slots. We construct the textual-purpose target Rt⋆R_t from the final-layer hidden states over tS_t. The statement tokens are likewise partitioned into KR=8K_R=8 contiguous regions and mean-pooled: Rt,k⋆=1|R,k|∑i∈R,kHt,i(final),k=1,…,KR.R_t,k = 1|G_R,k| _i _R,kH_S_t,i^(final), k=1,…,K_R. Both targets have hidden width dT=4096d_T=4096. Thus, It⋆I_t is the evidence-side multimodal representation formed while the teacher interprets the demonstrated behavior, whereas Rt⋆R_t captures its final linguistic realization. Generated-response intent target for the target-source ablation. We additionally construct an alternative intent target from the teacher-generated response. Let tY_t denote the complete response span generated after processing ℰtE_t, including both the reasoning block and the final functional-purpose statement. Using the same teacher layer as the default intent target, we partition the hidden states over tY_t into KI=8K_I=8 approximately equal contiguous regions and mean-pool each region: It,k⋆,resp=1|resp,k|∑i∈resp,kHt,i(18),k=1,…,KI.I_t,k ,resp= 1|G_resp,k| _i _resp,kH_Y_t,i^(18), k=1,…,K_I. This alternative preserves the same target width and number of slots as the default evidence-side target, while replacing the representation formed over the multimodal evidence with one formed over the teacher’s complete generated interpretation. Visual-outcome target. We construct the visual-outcome target Vt⋆V_t from the observation at the endpoint of the behavior segment. Specifically, the endpoint is ot+8o_t+8 for Bridge and ot+32o_t+32 for RoboCasa Kitchen, matching the temporal window used for the corresponding teacher target. We encode this observation using the frozen visual encoder of Cosmos-Reason2-2B. The encoder produces 64 regional features with hidden width dV=2048d_V=2048, which we reduce to KV=16K_V=16 ordered target slots using fixed 64-to-16 spatial pooling. For multi-camera observations, each view is encoded and pooled independently. Bridge uses one camera and therefore produces 16 visual target slots. RoboCasa Kitchen uses left, right, and wrist cameras and therefore produces 48 slots in total. Samples that do not contain a valid endpoint observation near an episode boundary are excluded from the visual-alignment loss. All teacher and visual targets are generated once offline and reused across policy-training runs. A.5 Implementation Decoder augmentation. We preserve the native state and action representations of each backbone and append self-conditioned visual grounding rows ZtV,λZ_t^V,λ, self-conditioned textual grounding rows ZtR,λZ_t^R,λ, and clean intent queries QIQ^I to the action-decoder sequence. For GR00T-N1.7, the added rows are incorporated into the diffusion-transformer stream. For π0.5 _0.5, they are appended to the action-expert suffix following the frozen vision-language prefix. All added rows use learned positional embeddings, and visual rows additionally use camera-view embeddings. For π0.5 _0.5, we cache the frozen prefix keys and values during training. Asymmetric information flow. Intent queries attend to the robot state, frozen VLA context, and one another, but not to the noised action or grounding rows. Visual and textual grounding rows attend to the recovered intent and one another, while action rows attend to the recovered intent and both grounding streams. Direct context access from action and grounding rows is controlled by a binary gate α, whereas intent queries always retain access to the VLA context. During training, we sample α∼Bernoulli(0.5)α (0.5), so updates with α=0α=0 require the downstream rows to obtain contextual information through the intent queries. For π0.5 _0.5, this gate is applied to the image and language prefix tokens, while access to the state representation remains available. We use the same information-flow structure during training and sampling and set α=1α=1 at deployment. Intent alignment. We extract the contextualized intent-query states HI,tLtapH_I,t^L_tap at the midpoint of the decoder, using block 16 for GR00T-N1.7 and layer 9 for π0.5 _0.5. A three-layer SiLU MLP projects each intent state to the teacher feature space. The projected rows are aligned one-to-one with the eight teacher intent targets It⋆I_t using cosine distance, with stop-gradient applied to the targets. The decoder-space states HI,tLtapH_I,t^L_tap, rather than their projected teacher-space representations, are used as the recovered intent by the remaining decoder layers. Intent-mismatch training. For updates with α=0α=0, we construct mismatched intent states by cyclically shifting the recovered intent representations within the batch. Starting from the intent-alignment layer, the remaining decoder blocks are evaluated once with the original intent and once with the mismatched intent. We optimize ℒmis=max(0,m+right−swap),L_mis= (0,m+D_right-D_swap ), where rightD_right and swapD_swap denote the combined downstream action and grounding losses, and m=0.05m=0.05. The mismatched donor representations are detached so that gradients do not propagate through the donor examples. Grounding self-conditioning and deployment. Clean teacher targets are used only as supervision and are never supplied as decoder inputs. A no-gradient forward pass first estimates clean decoder-space visual and textual grounding states. These estimates are detached, re-noised at the sampled flow time, and used as grounding inputs to the gradient pass. During inference, the visual and textual states are carried across denoising steps using the same self-conditioning convention. The teacher VLM, target representations, alignment projections, and intent-mismatch branch are used only during training. The deployed policy receives the original VLA inputs and internally forms intent and grounding states together with the action stream. A.6 Training Details Optimization and learning-rate schedules. We follow the official fine-tuning implementations of GR00T-N1.7 (NVIDIA, 2026) and π0.5 _0.5 (Black et al., 2025a; Physical Intelligence, 2025). For each backbone, the baseline and Indi variant use the same benchmark-specific training budget. For GR00T-N1.7, we use AdamW with a learning rate of 10−410^-4. We train for 60,000 steps with a global batch size of 480 on RoboCasa Kitchen and for 20,000 steps with a global batch size of 1,536 on Bridge. For π0.5 _0.5, we use AdamW with a maximum gradient norm of 1.0 and linearly warm up the learning rate for 1,000 steps to 5×10−55× 10^-5, which is held constant for the remainder of training. We use the same benchmark-specific batch sizes and training steps as in the corresponding GR00T-N1.7 experiments. All models are trained with bfloat16 computation, while loss values are accumulated in float32. The global batch sizes are distributed across three GPUs without gradient accumulation. Loss configuration. We set λI=λV=λR=0.5 _I= _V= _R=0.5, λmis=0.1 _mis=0.1, and the intent-mismatch margin to m=0.05m=0.05. The weights of the visual and textual grounding losses are linearly increased from zero to their final values during the first 1,000 training steps. The action and intent-alignment losses are active from the beginning of training. We use a context-dropout probability of 0.5. Backbone-specific training configurations. For both backbones, we freeze the pretrained vision-language module and optimize the action decoder together with the newly introduced Indi parameters. The teacher targets are defined over an approximately 1.6-second behavior window, corresponding to H=8H=8 steps on Bridge and H=32H=32 steps on RoboCasa Kitchen. For GR00T-N1.7, the decoder retains its native 40-step output sequence, while the action and auxiliary losses are applied to the benchmark-valid segment of 8 steps on Bridge and 32 steps on RoboCasa Kitchen. For π0.5 _0.5, we retain its native 10-step action horizon and mask the action loss to the valid action dimensions, excluding dimensions introduced only by zero padding. The teacher behavior window is defined independently of the backbone-native policy horizon. We cache the keys and values of the frozen π0.5 _0.5 prefix during training. Checkpoint selection. On RoboCasa Kitchen, we evaluate the final checkpoint obtained after 60,000 training steps. On Bridge, we evaluate checkpoints at 5,000, 10,000, 15,000, and 20,000 steps using two validation rollout seeds and apply the same selection procedure to both backbones. Controlled ablation protocol. The mechanism, policy-level teacher, and intent-target-source ablations use GR00T-N1.7 on SimplerEnv-Bridge. Unless stated otherwise, all variants use the same demonstrations, student architecture, optimization budget, checkpoint-selection procedure, and fixed evaluation run as the controlled analyses in Section 4.4. Only the component or target source identified by each ablation is changed. A.7 Computational Resources All experiments are conducted on a single node with three NVIDIA B200 GPUs, each with 183 GB of memory. Teacher targets are generated once offline and reused across all subsequent policy-training runs. We summarize parameter counts, inference time per policy query, and benchmark-specific training time in Table 7. All inference-time measurements are obtained on a single NVIDIA B200 GPU. Table 7: Modification cost across VLA backbones. We report checkpoint-tensor parameter counts, inference time per policy query, and end-to-end training time. Inference is measured on a single NVIDIA B200 GPU, while training uses three NVIDIA B200 GPUs. Method Parameters Inference time (ms) Bridge training (h) RoboCasa training (h) GR00T-N1.7 3.455B 56.1 (1.00×)(1.00×) ∼ 17 ∼ 17 +Indi 3.502B (+46.4M,+1.3%)(+46.4M,+1.3\%) 61.5 (1.10×)(1.10×) ∼ 19 ∼ 19 π0.5 _0.5 3.617B 24.4 (1.00×)(1.00×) ∼ 23 ∼ 23 +Indi 3.640B (+23.1M,+0.64%)(+23.1M,+0.64\%) 29.7 (1.21×)(1.21×) ∼ 29 ∼ 26 Appendix B Additional Ablations and Diagnostics Unless stated otherwise, the following controlled analyses use GR00T-N1.7 on a fixed SimplerEnv-Bridge evaluation run shared across all variants. The main benchmark tables separately aggregate three evaluation runs. This section provides the exact control configurations, diagnostic protocols, full quantitative analyses, and additional readouts underlying Section 4.4. Results already reported in Tables 6(a), 3 and 6(b) are referenced directly rather than duplicated. B.1 Supervision and Capacity Controls We isolate whether the improvement comes from teacher-derived intent, visual and textual grounding supervision, an endpoint-informed latent, or additional latent capacity. All variants use the same GR00T-N1.7 backbone, Bridge demonstrations, optimization budget, and evaluation protocol. The groundings-only control retains the visual and textual grounding streams, ℒVL_V, ℒRL_R, and grounding self-conditioning while removing the intent queries and intent supervision. The future-supervision control retains the latent and grounding streams but replaces It⋆I_t with an endpoint visual representation. The free-latent control retains the latent queries, bottleneck context routing, context dropout, visual and textual grounding streams, alignment objectives, and self-conditioning while removing both ℒIL_I and ℒmisL_mis. The intent-only control retains teacher-intent alignment, bottleneck context routing, context dropout, and action-only intent-mismatch training while removing the visual and textual grounding streams. Table 8: Configuration of supervision and capacity controls. Task-level success rates are reported in Table 6(a). Variant Latent target V/R groundings Latent queries Groundings only – Yes No Future supervision Endpoint visual Yes Yes Free latent – Yes Yes Intent only Teacher intent No Yes Indi Teacher intent Yes Yes As shown in Table 6(a), the non-intent controls reach at most 68.0%68.0\%, whereas intent only reaches 76.0%76.0\%. Teacher-derived intent therefore provides a 14.514.5 percentage-point gain over the action-only baseline and an 8.08.0 percentage-point gain over future supervision. Adding visual and textual groundings further increases average success to 85.5%85.5\%, showing that they complement rather than replace intent supervision. Table 9: Supervision and capacity controls on SimplerEnv-Bridge. V and R denote the visual and textual grounding streams. All variants share the backbone, budget, and a fixed evaluation run. Success rates (%). Variant V R Spoon Carrot Stack EP-Basket Avg. GR00T-N1.7 – – 82.0 68.0 66.0 30.0 61.5 + Groundings only ✓ ✓ 88.0 82.0 38.0 32.0 60.0 + Future supervision ✓ ✓ 84.0 70.0 56.0 62.0 68.0 + Free latent ✓ ✓ 78.0 76.0 48.0 26.0 57.0 + Intent only – – 86.0 84.0 70.0 64.0 76.0 + Intent, V ✓ – 90.0 88.0 72.0 74.0 81.0 + Intent, R – ✓ 90.0 86.0 70.0 72.0 79.5 Indi (Ours) ✓ ✓ 90.0 78.0 74.0 100.0 85.5 Each grounding stream also contributes on its own, raising average success from 76.0%76.0\% to 81.0%81.0\% with the visual stream and 79.5%79.5\% with the textual stream. Their joint effect (+9.5+9.5) exceeds the sum of the individual gains (+8.5+8.5), and is concentrated on EP-Basket, where either stream alone reaches roughly 73%73\% but both together reach 100.0%100.0\%. The textual stream helps despite aligning only weakly with its paired target (Table 14), consistent with it acting as a downstream realization rather than a standalone readout. B.2 Intent-Dependence Mechanism Ablations We ablate the two training mechanisms introduced to make downstream decoding depend on recovered intent: bottleneck context routing and intent-mismatch training. The full model samples α∼Bernoulli(0.5)α (0.5), requiring action and grounding rows to obtain VLA context through the intent rows when α=0α=0, and applies ℒmisL_mis to encourage lower downstream loss under matched than mismatched intent. We compare the full model with variants that remove the context bottleneck, the mismatch objective, or both. Table 10: Ablation of intent-dependence mechanisms on SimplerEnv-Bridge. All variants use GR00T-N1.7, the same training budget, and the same fixed evaluation run. The context-bottleneck ablation allows action and grounding rows to access the VLA context throughout training, while the mismatch ablation sets λmis=0 _mis=0. Variant Spoon Carrot Stack EP-Basket Avg. Indi 90.0 78.0 74.0 100.0 85.5 w/o context bottleneck 88.0 76.0 60.0 56.0 70.0 w/o ℒmisL_mis 92.0 80.0 30.0 94.0 74.0 w/o both 86.0 72.0 58.0 46.0 65.5 Removing the context bottleneck reduces average success from 85.5%85.5\% to 70.0%70.0\%, while removing intent-mismatch training reduces it to 74.0%74.0\%. Removing both mechanisms further lowers success to 65.5%65.5\%. Thus, both mechanisms contribute substantially and complement one another: bottleneck routing encourages downstream decoding to obtain contextual information through the recovered intent, while ℒmisL_mis encourages that dependence to be sensitive to the intent’s specific content rather than merely to the presence of the latent pathway. B.3 Functional Role and Structure of Recovered Intent We examine whether the recovered representation is used by the action decoder, whether it retains behavior objective and execution progress across different action-sequence realizations, how this information propagates through decoder depth, and whether objective-specific edits affect closed-loop behavior. The action decoder relies on recovered intent. At the intent-alignment layer, we replace all eight recovered intent states with zero vectors while preserving the observation, instruction, proprioceptive state, action noise, grounding states, and remaining decoder computation. Table 11: Dependence on recovered intent. The zero-intent intervention replaces all intent states at the alignment layer while preserving all other policy inputs. Both conditions use the same evaluation run on SimplerEnv-Bridge. Intent state Spoon Carrot Stack EP-Basket Avg. Recovered intent 90.0 78.0 74.0 100.0 85.5 Zero intent 58.0 44.0 40.0 40.0 45.5 As shown in Table 11, zeroing recovered intent reduces average success from 85.5%85.5\% to 45.5%45.5\%, below the 61.5%61.5\% action-only baseline. The recovered state is therefore not merely an auxiliary alignment target but a representation used by downstream action decoding. Intent represents behavior objectives across domains. We collect the eight intent-row hidden states immediately before the alignment layer from 580 real demonstration segments and 202 simulation rollout segments. Each segment is represented by the flattened KIdDK_Id_D-dimensional recovered intent state. We reduce the representations to 50 dimensions using PCA and fit three shrinkage-LDA axes from the four Bridge task labels. The two-dimensional task-discriminative projection is shown in Figure 3(a). Raw-space one-nearest-neighbor classification achieves 92.0%92.0\% task purity, and episode-disjoint shrinkage LDA achieves 86.2%86.2\% accuracy. Randomly permuting the task labels gives 31.9%31.9\% mean accuracy across 20 permutations, with a maximum of 41.4%41.4\%. A classifier trained only on real-demonstration intents classifies simulation-rollout intents with 63.9%63.9\% to 80.7%80.7\% accuracy across tasks. These results show that objective information persists across episodes and transfers from real demonstrations to simulation rollouts. Intent captures progress shared across related manipulation tasks. The four Bridge tasks manipulate different objects and target relations but share an approach–grasp–transport–place structure. We divide each episode into early, middle, and late intervals and fit a phase-discriminative projection using labels pooled across tasks. As shown in Figure 3(b), segments from different tasks organize by execution stage. Three-way phase prediction achieves 77.8%77.8\% five-fold cross-validation accuracy, compared with a 33.3%33.3\% chance level. Task purity within the phase plane is 36.6%36.6\%, while task identity remains readable within the early, middle, and late intervals at 94.0%94.0\%, 90.0%90.0\%, and 90.0%90.0\%, respectively. We also fit a continuous progress direction with ridge regression and evaluate it in a leave-one-task-out setting. The held-out correlations are 0.62 for Spoon, 0.70 for Carrot, 0.72 for Stack, and 0.69 for EP-Basket, compared with an in-sample correlation of 0.88. Table 12: Objective and task-family-shared progress structure in recovered intent. The supervision control applies the same probe to the free-latent variant, which receives identical context access but no teacher-intent supervision. Property Evaluation Result Behavior objective Objective identity Raw-space task 1-N purity 92.0% Objective generalization Episode-disjoint task LDA 86.2% Supervision control Same probe, free latent (no ℒIL_I) 55.7% Cross-domain transfer Train on real, test on simulation 63.9–80.7% Objective retention Task purity in early/middle/late phases 94.0/90.0/90.0% Shared execution progress Phase readability Three-way phase prediction 77.8% Task leakage Task purity within phase plane 36.6% Cross-task transfer Leave-one-task-out progress correlation 0.62–0.72 Together, Figures 3 and 12 show complementary objective and progress structure in the recovered representation. The task-discriminative structure captures which object-level objective is being pursued, while the phase-discriminative structure captures progress shared by this family of manipulation tasks. We interpret the latter as a task-family-shared progress coordinate rather than a universal progress axis for arbitrary robot skills. Intent captures objective beyond action-sequence realization. We distinguish intent from skill by operationalizing skill as the executed action sequence. The action sequence describes how a behavior is realized, whereas intent denotes the local objective that the behavior serves. To test whether intent merely summarizes the executed sequence, we compare progress-matched episode pairs under two opposing conditions: the same objective realized by dissimilar sequences, and different objectives realized by similar sequences. We use episode-disjoint discovery and test splits, with all centering statistics and pair-selection thresholds estimated from discovery episodes. As shown in Figure 6, teacher intent targets separate by objective on held-out episodes, while a matched supervised projection of local action snippets yields weak objective separation. More importantly, the projection-free comparison shows that recovered-intent similarity remains higher for the same objective with dissimilar sequences than for different objectives with similar sequences (0.1500.150 vs. −0.017-0.017), with a gap of 0.1670.167 and a 95% episode-bootstrap confidence interval of [0.089,0.245][0.089,0.245]. Teacher targets show the same ordering (0.4700.470 vs. 0.1580.158; gap 0.3120.312, 95% CI [0.253,0.375][0.253,0.375]). Thus, the representation preserves what the behavior is meant to accomplish across changes in how it is executed, distinguishing intent from a latent code that merely summarizes the action sequence. Figure 6: Intent captures objective beyond action-sequence realization. We operationalize skill as the executed action sequence. (a) Teacher intent targets separate 14 behavior objectives on held-out episodes. (b) A matched supervised projection of local action snippets yields weak objective separation. (c) In a projection-free comparison of progress-matched episode pairs, the same objective realized by dissimilar action sequences remains more similar in intent space than different objectives realized by similar sequences. Light points show all eligible pairs, dark points show the selected contrast sets, and diamonds mark their means. Recovered policy intent exhibits the same ordering. Task information propagates from intent into the grounding streams. A one-time edit at the intent-alignment layer may be overwritten if later blocks reconstruct the original objective from other token streams. We therefore measure one-nearest-neighbor task purity for the state, action, visual-grounding, textual-grounding, and intent rows throughout the 32 decoder blocks. Table 13: Task information across decoder rows and depth. The table summarizes task information before and after the intent-alignment layer. Decoder rows Blocks 00–1515 Blocks 1919–3131 Intent 0.63→0.930.63 0.93 0.77±0.050.77± 0.05 Visual grounding Near chance Up to 0.950.95 Textual grounding Near chance Up to 0.970.97 Action and state Near chance Near chance Intent-row task purity peaks at 0.93 immediately before the alignment layer. After alignment, task information appears in the visual and textual grounding rows, reaching 0.95 and 0.97, while the action and state rows remain near chance. This pattern motivates editing both intent and grounding rows throughout the decoder tail. Editing objective-specific coordinates changes closed-loop behavior. Zeroing intent establishes that the pathway is necessary but does not isolate the effect of its objective content. We therefore edit only the task-discriminative coordinates while preserving the remaining representation. Let g∈I,Gg∈\I,G\ index the edited token group, where I contains the intent rows and G=V⊕RG=V R contains the visual and textual grounding rows. Let hg,k∈ℝpgh_g,k ^p_g denote the flattened representation after decoder block k. For task t, we compute the block-wise centroid μg,k(t)=[hg,k∣task=t] _g,k^(t)=E\! [h_g,k =t ] and form a centered matrix from the four task centroids. The columns of Ug,kU_g,k are the right singular vectors spanning the resulting between-task subspace. For an injected task tdt_d, we replace only the coordinates inside this subspace: hg,k′=hg,k+Ug,k[Ug,k⊤μg,k(td)−Ug,k⊤hg,k].h_g,k =h_g,k+U_g,k [U_g,k _g,k^(t_d)-U_g,k h_g,k ]. This sets the task-discriminative coordinates to those of the injected objective while preserving the orthogonal component. We apply the edit to the intent and grounding groups after every decoder block from 16 through 24, without modifying the action or state rows. Task centroids and bases are estimated from separate rollouts under environment seeds disjoint from intervention evaluation. Each same-objective, cross-objective, and Gaussian-noise condition uses the same intervention schedule and is evaluated over 50 episodes. Donors are captured from separate rollouts, so the same-objective condition also receives an injection of equal strength and differs from the cross-objective condition only in donor content. The resulting closed-loop success matrix is reported in Table 6(b). Same-objective interventions retain 84.5%84.5\% success on average, compared with 45.2%45.2\% for cross-objective interventions, while Gaussian corruption reduces success to 1.0%1.0\%. The dependence on which objective is injected, together with the contrast against unstructured noise, shows that the intent-mediated pathway carries content rather than acting as an undifferentiated gate. Intent geometry reflects task relatedness. The uneven effects of cross-objective intervention raise the question of whether the recovered intent space reflects which tasks are related. We therefore compare centered cosine similarity between recovered-intent centroids for the four SimplerEnv evaluation tasks. As shown in Figure 7, Spoon and Carrot form the closest pair, Stack is more distinct, and EP-Basket is the most separated from the other tasks. This organization is consistent with Spoon and Carrot sharing a closely related tabletop manipulation structure, whereas EP-Basket differs in both its objective and scene. The result provides a descriptive representation-level notion of task relatedness that may help explain why some cross-objective transfers are more compatible than others. Because scene and objective differences are not independently controlled, we do not interpret the similarity as a causal measure of transfer. Figure 7: Task relatedness in recovered-intent space. Each entry reports centered cosine similarity between the recovered-intent centroids of two SimplerEnv tasks. Spoon and Carrot form the closest pair, while EP-Basket is the most separated from the other tasks. Editing stage-specific coordinates changes which stage is executed. We repeat the procedure with Ug,kU_g,k spanning the between-phase subspace, estimated from early, middle, and late centroids pooled across tasks using the projection of Figure 3(b). All other aspects of the protocol are unchanged, so the two interventions differ only in which subspace is replaced. Forcing an early-stage donor reduces average success to 7.3%7.3\%, and forcing a late-stage donor reduces it to 5.5%5.5\%, both approaching the 1.0%1.0\% obtained under Gaussian corruption. The phase-matched control, which injects a donor from the same task at the receiver’s own stage, retains 50%50\%, 70%70\%, and 32%32\% on Spoon, Carrot, and Stack. The gap between this control and the uninjected policy reflects the cost of clamping the intent stream over the window, which varies by task. As shown in Figures 8, 9 and 10, rollouts under stage-forced injection do not fail incoherently but execute behavior consistent with the injected stage. Early forcing leaves the policy executing approach behavior without transitioning to grasp: it hovers over the target on Carrot, displaces the spoon without closing the gripper on Spoon, and fumbles at the green block without initiating the stack on Stack. Late forcing produces the opposite pattern, skipping the grasp and executing placement. This is clearest on Spoon, where the policy moves to the towel and presses down with an empty gripper. Since both conditions apply injections of equal strength and differ only in donor content, the contrast is attributable to the stage information carried by the intent pathway rather than to perturbation magnitude. Figure 8: Stage-forced intervention on Spoon. Rows show phase-matched, early-forced, and late-forced injection. Early forcing leaves the policy displacing the spoon without ever closing the gripper. Late forcing skips the grasp entirely: the policy moves to the towel and presses down with an empty gripper, executing placement as if it were already carrying the object. Figure 9: Stage-forced intervention on Carrot. Early forcing leaves the policy hovering over the carrot without transitioning to grasp. Late forcing produces open-gripper contact, as if the object were already being transported. Figure 10: Stage-forced intervention on Stack. Early forcing leaves the policy fumbling at the green block without initiating the stack. Late forcing produces brief contact followed by departure, as if the task were already complete. B.4 Visual and Textual Readout of Intent Section B.1 identifies which supervision improves policy performance, whereas this subsection localizes the resulting behavior information within the decoder. We freeze the trained policy for all readout experiments. Let I^t=PI(HI,tLtap),V^t=PV(HV,tLout),R^t=PR(HR,tLout) I_t=P_I\! (H_I,t^L_tap ), V_t=P_V\! (H_V,t^L_out ), R_t=P_R\! (H_R,t^L_out ) denote the projected intent and the final visual and textual grounding predictions. We evaluate them using nearest-neighbor retrieval and separately trained readout decoders while keeping the policy frozen. Embedding-space readout. We extract V^t V_t, R^t R_t, Vt⋆V_t , and Rt⋆R_t for approximately 10,000 held-out segments. We subtract the dataset mean before computing cosine similarity and exclude retrieval candidates from the same episode. Table 14: Embedding-space readout of the visual and textual groundings. Correct cosine measures centered similarity to the paired target. Shuffled cosine uses randomly permuted targets. Median rank is zero-indexed. Readout Correct cosine Shuffled cosine Margin Top-1 Top-10 Median rank V^t→Vt⋆ V_t→ V_t 0.650 0.003 0.647 72.6% 95.3% 0 R^t→Rt⋆ R_t→ R_t 0.158 −0.004-0.004 0.161 1.5% 5.0% 1211 The visual grounding provides a highly readable endpoint representation, retrieving the paired target at rank one in 72.6%72.6\% of held-out segments and within the top ten in 95.3%95.3\%. The textual grounding is more similar to its paired target than to shuffled targets, although its standalone nearest-neighbor geometry is less concentrated. Purpose semantics are most compactly represented in I^t I_t, while the textual grounding rows provide a downstream semantic realization used during joint decoding. Visual grounding depends on intent. We repeat the visual readout after zeroing recovered intent or replacing it with recovered intent from another task while preserving the remaining policy inputs. Table 15: Effect of intent intervention on visual grounding. Intent condition Centered margin Top-1 retrieval Recovered intent 0.647 72.6% Zero intent 0.513 59.1% Cross-task intent 0.393 41.8% Visual readout quality decreases from recovered to zero to cross-task intent. The predicted visual outcome therefore depends on the content supplied through the intent pathway. Visual-outcome retrieval. We retrieve actual endpoint frames using V^t V_t. For the intervention montage, the retrieval bank includes the designated current-task and injected-task endpoints. Figure 11: Non-parametric visual-outcome readout. Each row shows the current observation, ground-truth endpoint, and endpoint retrieved from V^t V_t under recovered, zero, and cross-task intent. Recovered intent retrieves the current behavior outcome, while cross-task intent redirects retrieval toward the injected behavior. Across the evaluated pairs, recovered intent retrieves the current endpoint in 70.5% of cases. After cross-task replacement, the injected endpoint is retrieved in 78.6% of cases, while the original endpoint remains in only 0.1%. The examples in Figure 11 show that recovered intent preserves the current object, scene, and resulting relation, while cross-task intent redirects the predicted outcome toward the injected behavior. Learned visual and textual decoding. We additionally train lightweight decoders to test whether the representations can be converted directly into an endpoint image and a functional-purpose statement. The visual decoder maps the 16 ordered visual slots to the endpoint RGB image using a transformer bottleneck and convolutional upsampling. The policy is frozen, and the decoder is trained on visual targets Vt⋆V_t and endpoint observations. On held-out data, reconstruction from Vt⋆V_t obtains a changed-region L1L_1 error of 0.0819, compared with 0.3042 for copying the current observation. For textual readout, we compare the final textual grounding R^t R_t with the projected intent I^t I_t. The intent decoder is trained on approximately 9,900 unmodified intent–statement pairs using an episode-disjoint split. We report deterministic object F1, state-change verb F1, and ROUGE-L. Table 16: Textual-purpose readout. The oracle row decodes the teacher textual target. The remaining rows decode the predicted textual grounding and recovered intent. Readout representation Object F1 Verb F1 ROUGE-L Rt⋆R_t (oracle target) 0.998 1.000 0.933 R^t R_t 0.314 0.195 0.255 I^t I_t 0.693 0.432 0.380 The recovered intent is substantially more readable than the final textual grounding, improving object F1 from 0.314 to 0.693 and verb F1 from 0.195 to 0.432. This localizes the semantic bottleneck primarily in recovered intent while retaining the textual grounding as a downstream representation used during joint decoding. Figure 12: Learned visual and textual readout of intent. Each row shows the current observation, ground-truth endpoint, visual reconstruction from Vt⋆V_t , and visual outcomes decoded from V^t V_t under recovered, zero, and cross-task intent. The text below each row shows the ground-truth purpose and statements decoded from recovered, zero, and injected intent. Recovered intent produces an outcome and purpose consistent with the current behavior, while cross-task intent redirects both modalities toward the injected behavior. The visual and textual readouts change consistently under intent intervention. These results support the intended hierarchy of Indi, in which intent stores a compact behavior-level representation and visual outcome and textual purpose provide complementary observable realizations. B.5 Teacher Quality and Intent-Target Geometry We examine whether intent distillation benefits from an arbitrary teacher, or whether the teacher target itself must have particular structure. We repeat the controlled SimplerEnv-Bridge training while changing only the teacher cache, keeping the demonstrations, student architecture, optimization budget, checkpoint selection, and evaluation protocol fixed. Teacher choice matters. Table 17 shows that teacher choice substantially changes downstream performance. Qwen3.5-9B (Qwen Team, 2026) reduces average success to 54.5%54.5\%, below the 61.5%61.5\% action-only baseline, whereas Qwen3-VL-8B-Instruct (Bai et al., 2025) reaches 73.5%73.5\% and Cosmos-Reason2-8B reaches 85.5%85.5\%. Since Cosmos-Reason2-8B (NVIDIA, 2025a) is obtained by physical-AI post-training of Qwen3-VL-8B-Instruct, this pair provides a controlled comparison of the effect of teacher-side post-training. Table 17: Controlled teacher swap on SimplerEnv-Bridge. All variants use the same GR00T-N1.7 student, demonstrations, optimization budget, and fixed evaluation run; only the teacher cache is changed. Teacher Spoon Carrot Stack EP-Basket Avg. No intent distillation 82.0 68.0 66.0 30.0 61.5 Qwen3.5-9B 84.0 78.0 40.0 16.0 54.5 Qwen3-VL-8B-Instruct 90.0 98.0 34.0 72.0 73.5 Cosmos-Reason2-8B 90.0 78.0 74.0 100.0 85.5 The difference is visible in the intent targets. We characterize each teacher’s I⋆I targets on the same 17,28817,288 valid Bridge samples. The angular budget measures the mean cosine distance of L2-normalized targets from their mean direction, and therefore how much sample-dependent directional variation is available to the cosine-alignment objective. The effective rank summarizes the spectrum of the centered target distribution, while the within-episode share measures the fraction of centered variance that occurs within episodes rather than between them. Table 18: Intent-target geometry across teachers. All statistics use the same valid Bridge samples (n=17,288n=17,288). Bridge Avg. reports the corresponding controlled policy performance. Teacher Angular budget Eff. rank Within-ep. share Bridge Avg. Qwen3.5-9B 0.0027 139.4 0.308 54.5 Qwen3-VL-8B-Instruct 0.0098 7.2 0.693 73.5 Cosmos-Reason2-8B 0.0327 3.4 0.723 85.5 Qwen3.5 produces an almost degenerate alignment signal: its angular budget is only 0.00270.0027, so a nearly constant prediction can satisfy much of the cosine-alignment objective, and only 30.8%30.8\% of its residual variation occurs within episodes. Qwen3-VL instead exhibits substantially more sample-dependent and state-resolved variation and recovers a 12.012.0-percentage-point gain over the action-only baseline. Cosmos preserves the high within-episode share while increasing the angular budget by 3.3×3.3× over Qwen3-VL, accompanied by a further 12.012.0-point downstream gain. The high effective rank of Qwen3.5 therefore does not indicate a useful teacher by itself; it describes the structure of a very small residual signal. Across the three teachers, angular budget and within-episode share increase monotonically with downstream success. Given the small number of teachers, we treat this as a diagnostic condition rather than a predictive law: useful intent supervision requires a non-degenerate target whose variation resolves moment-to-moment behavior state rather than primarily static episode identity. The causal interpretation is limited to the Qwen3-VL–Cosmos pair, where physical-AI post-training is the controlled teacher-side change. B.6 Intent-Target Source Ablation The default intent target is extracted from the intermediate hidden states over the multimodal teacher-input span ℰtE_t. We compare this evidence-side target with the generated-response target It⋆,respI_t ,resp, which pools the intermediate hidden states over the complete teacher response tY_t, including its reasoning and final functional-purpose statement. Both variants use the same teacher, KI=8K_I=8 target slots, student architecture, grounding targets, optimization budget, and evaluation protocol. The comparison therefore isolates whether policy supervision is more effective when intent is represented during multimodal evidence processing or after the teacher has synthesized that evidence into a generated response. Table 19: Intent-target source ablation on SimplerEnv-Bridge. Evidence-side and generated-response targets use the same teacher layer and KI=8K_I=8 contiguous-region pooling. Intent target Spoon Carrot Stack EP-Basket Avg. Evidence-side input span ℰtE_t 90.0 78.0 74.0 100.0 85.5 Generated-response span tY_t 76.0 86.0 76.0 80.0 79.5 The generated-response target obtains 79.5%79.5\% average success, compared with 85.5%85.5\% for the evidence-side multimodal target. Although the generated-response target substantially outperforms the 61.5%61.5\% action-only baseline, the evidence-side target provides a further 6.06.0 percentage-point gain. This result indicates that both target sources provide useful behavior-level supervision, while directly distilling the representation formed during multimodal evidence processing is more effective than using the representation formed after reasoning and response generation. Appendix C Additional Results C.1 Full Quantitative Results We provide complete RoboCasa Kitchen results to further examine the generality of Indi across VLA backbones and manipulation tasks. Table 20 reports the per-task success rates summarized by task category in the main text. The table compares Indi with controlled GR00T-N1.7 and π0.5 _0.5 baselines, the GR00T-N1.7 future-supervision variant, and off-the-shelf GR00T checkpoints trained with larger demonstration sets. The future-supervision variant exhibits substantially larger per-task variation than Indi, improving markedly on some tasks (e.g., Open Double Door, Turn Off Stove) while degrading on others where the remaining variants are near ceiling (e.g., Turn On Sink Faucet, Coffee Press Button). Its category and overall averages therefore reflect a redistribution of per-task performance rather than a uniform improvement. Table 20: Full RoboCasa Kitchen per-task results. Success rates are reported across all 24 tasks. Controlled GR00T-N1.7 variants and π0.5 _0.5 results report mean ± sample standard deviation over three evaluation runs. The GR00T G3000G_3000 columns provide single-value data-scale references. Bold marks the best controlled result within each backbone in the category-summary rows. GR00T π0.5 _0.5 Task N1.6 G3000G_3000 N1.7 G3000G_3000 N1.7 G100G_100 N1.7 + future supervision G100G_100 N1.7 + Indi G100G_100 Baseline + Indi Pick-and-Place PnP from Cab to Counter 41.0 65.0 26.0±16.026.0 \,± 16.0 44.7±1.244.7 \,± 1.2 50.0±4.050.0 \,± 4.0 18.7±2.318.7 \,± 2.3 10.7±10.110.7 \,± 10.1 PnP from Counter to Cab 47.5 60.0 37.3±3.137.3 \,± 3.1 35.3±5.035.3 \,± 5.0 58.7±10.358.7 \,± 10.3 18.7±2.318.7 \,± 2.3 23.3±7.623.3 \,± 7.6 PnP from Counter to Microwave 19.0 30.0 22.0±5.322.0 \,± 5.3 57.3±5.857.3 \,± 5.8 28.0±0.028.0 \,± 0.0 6.7±2.36.7 \,± 2.3 6.7±2.36.7 \,± 2.3 PnP from Counter to Sink 46.0 60.0 54.7±11.754.7 \,± 11.7 29.3±11.429.3 \,± 11.4 53.3±10.353.3 \,± 10.3 10.0±7.210.0 \,± 7.2 16.0±4.016.0 \,± 4.0 PnP from Counter to Stove 63.2 60.0 46.7±7.046.7 \,± 7.0 56.0±6.056.0 \,± 6.0 50.7±9.950.7 \,± 9.9 12.0±6.912.0 \,± 6.9 8.0±0.08.0 \,± 0.0 PnP from Microwave to Counter 24.5 19.0 23.3±3.123.3 \,± 3.1 26.7±2.326.7 \,± 2.3 32.0±2.032.0 \,± 2.0 8.0±0.08.0 \,± 0.0 8.0±0.08.0 \,± 0.0 PnP from Sink to Counter 50.0 65.0 50.7±8.350.7 \,± 8.3 64.7±9.964.7 \,± 9.9 62.7±3.162.7 \,± 3.1 24.7±9.924.7 \,± 9.9 21.3±2.321.3 \,± 2.3 PnP from Stove to Counter 54.5 65.0 54.7±4.254.7 \,± 4.2 62.0±3.562.0 \,± 3.5 62.7±8.162.7 \,± 8.1 13.3±2.313.3 \,± 2.3 28.7±4.228.7 \,± 4.2 Open-or-Close Close Double Door 88.5 80.0 88.0±7.288.0 \,± 7.2 60.0±5.360.0 \,± 5.3 90.0±2.090.0 \,± 2.0 57.3±25.757.3 \,± 25.7 72.0±6.972.0 \,± 6.9 Close Drawer 100.0 100.0 92.7±8.192.7 \,± 8.1 68.0±8.068.0 \,± 8.0 100.0±0.0100.0 \,± 0.0 77.3±39.377.3 \,± 39.3 98.7±2.398.7 \,± 2.3 Close Single Door 96.0 95.0 96.0±4.096.0 \,± 4.0 89.3±9.589.3 \,± 9.5 97.3±3.197.3 \,± 3.1 73.3±11.573.3 \,± 11.5 68.7±1.268.7 \,± 1.2 Open Double Door 39.0 25.0 52.0±5.352.0 \,± 5.3 94.0±6.094.0 \,± 6.0 75.3±3.175.3 \,± 3.1 32.0±5.332.0 \,± 5.3 10.7±2.310.7 \,± 2.3 Open Drawer 81.1 95.0 58.0±8.758.0 \,± 8.7 88.0±3.588.0 \,± 3.5 55.3±5.855.3 \,± 5.8 42.7±1.242.7 \,± 1.2 36.0±14.436.0 \,± 14.4 Open Single Door 81.5 90.0 68.7±3.168.7 \,± 3.1 82.7±8.182.7 \,± 8.1 78.7±7.078.7 \,± 7.0 48.0±18.348.0 \,± 18.3 50.7±6.150.7 \,± 6.1 Others Coffee Press Button 98.5 100.0 98.0±2.098.0 \,± 2.0 32.0±2.032.0 \,± 2.0 100.0±0.0100.0 \,± 0.0 20.0±8.020.0 \,± 8.0 74.7±6.174.7 \,± 6.1 Coffee Serve Mug 63.5 85.0 74.7±9.074.7 \,± 9.0 73.3±4.273.3 \,± 4.2 81.3±7.081.3 \,± 7.0 25.3±9.225.3 \,± 9.2 23.3±9.923.3 \,± 9.9 Coffee Setup Mug 31.0 30.0 32.0±10.632.0 \,± 10.6 79.3±13.379.3 \,± 13.3 30.7±1.230.7 \,± 1.2 14.7±12.214.7 \,± 12.2 4.0±0.04.0 \,± 0.0 Turn Off Microwave 96.0 95.0 99.3±1.299.3 \,± 1.2 92.7±4.292.7 \,± 4.2 99.3±1.299.3 \,± 1.2 72.0±16.072.0 \,± 16.0 90.7±4.690.7 \,± 4.6 Turn Off Sink Faucet 93.5 100.0 93.3±6.493.3 \,± 6.4 85.3±7.685.3 \,± 7.6 98.0±2.098.0 \,± 2.0 74.7±19.774.7 \,± 19.7 89.3±6.189.3 \,± 6.1 Turn Off Stove 31.0 25.0 27.3±8.127.3 \,± 8.1 93.3±5.893.3 \,± 5.8 28.7±2.328.7 \,± 2.3 22.7±22.022.7 \,± 22.0 16.7±4.216.7 \,± 4.2 Turn On Microwave 91.5 95.0 89.3±8.189.3 \,± 8.1 92.7±4.692.7 \,± 4.6 93.3±4.293.3 \,± 4.2 53.3±2.353.3 \,± 2.3 72.7±6.472.7 \,± 6.4 Turn On Sink Faucet 89.0 95.0 84.0±8.084.0 \,± 8.0 18.7±9.018.7 \,± 9.0 96.0±4.096.0 \,± 4.0 33.3±18.533.3 \,± 18.5 61.3±12.961.3 \,± 12.9 Turn On Stove 76.5 85.0 72.0±4.072.0 \,± 4.0 60.0±3.560.0 \,± 3.5 70.7±2.370.7 \,± 2.3 33.3±11.533.3 \,± 11.5 41.3±10.141.3 \,± 10.1 Turn Sink Spout 87.0 80.0 97.3±3.197.3 \,± 3.1 93.3±4.293.3 \,± 4.2 93.3±5.893.3 \,± 5.8 45.3±2.345.3 \,± 2.3 61.3±6.161.3 \,± 6.1 Pick-and-Place 43.2 53.0 39.4±1.039.4 \,± 1.0 47.0±4.447.0 \,± 4.4 49.8±2.349.8 \,± 2.3 14.0±1.714.0 \,± 1.7 15.3±1.415.3 \,± 1.4 Open-or-Close 81.0 80.8 75.9±3.475.9 \,± 3.4 80.3±2.380.3 \,± 2.3 82.8±1.382.8 \,± 1.3 55.1±7.455.1 \,± 7.4 56.1±3.656.1 \,± 3.6 Others 75.8 79.0 76.7±0.976.7 \,± 0.9 72.1±2.072.1 \,± 2.0 79.1±1.579.1 \,± 1.5 39.5±0.939.5 \,± 0.9 53.5±2.453.5 \,± 2.4 Average 66.2 70.8 64.1±1.664.1 \,± 1.6 65.8±0.865.8 \,± 0.8 70.3±1.770.3 \,± 1.7 34.9±2.034.9 \,± 2.0 41.4±1.441.4 \,± 1.4 C.2 Qualitative Results We provide representative real-world rollouts for all four tasks in Figures 13 and 14. Each filmstrip shows the third-person view together with the head and two wrist-camera views. The complete rollout videos are provided on the project page. Figure 13: Representative real-world rollouts on Threading and Basket Nesting. The filmstrips show successful execution across the third-person, head, and wrist-camera views. Figure 14: Representative real-world rollouts on Cross-Bin Stacking and Drawer Storage. The examples illustrate coordinated execution across the multiple stages required by the two longer-horizon tasks. Appendix D Limitations and Future Work Indi inherits its notion of intent from a teacher VLM, so the semantics available to the policy are bounded by what that teacher understands about physical behavior. The bound is consequential rather than cosmetic. A teacher without embodied grounding yields targets with almost no sample-dependent direction, and the resulting policy falls below the action-only baseline (Tables 17 and 18). This property can be measured before training, but the framework still has no notion of an intent being wrong and no mechanism that revises a target when execution contradicts it. Removing this ceiling requires intent that is validated against execution outcomes or acquired through the policy’s own interaction rather than read from a fixed interpreter. A second limit is that intent is recovered rather than chosen. The deployed policy reconstructs one deterministic intent at each query and immediately consumes it. Our interventions show that this state is addressable (Section B.3), yet the policy never uses that handle. It cannot hold a distribution over valid objectives when the stage is ambiguous, maintain an intent across a rollout, or accept a correction stated as what it should be trying to do. Treating intent as an interface for a planner, a human, or execution feedback is the extension we consider most consequential. Finally, intent is read from single windows of demonstrations that succeeded. Manipulation objectives are nested, and failed or corrected episodes state the objective most explicitly while accounting for much of the experience a robot can collect. Hierarchical intent and intent distilled from unsuccessful behavior are natural next steps. Appendix E Use of Large Language Models We used large-language-model-based tools, including Claude Code and Codex CLI, to assist with code navigation, experiment orchestration, and language editing. All methodological decisions, implementation changes, experimental procedures, and reported results were reviewed and verified by the authors. The Cosmos-Reason2 teacher used to construct training targets is a component of the proposed method and is distinct from the tools used during manuscript and code preparation.