REVIEW 4 major objections 5 minor 145 references
This paper argues that test-time action diversity from reinforcement-learned steering helps only when the base robot policy is failing, and that gating steering on a failure detector yields gains up to +17.3% on out-of-domain tasks.
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
T0 review · deepseek-v4-flash
2026-08-01 10:18 UTC pith:GADTS5BF
load-bearing objection A practical, well-built adaptive steering method whose 'scaling law' foundation is thinner than it looks — worth refereeing, but the central asymmetry claim needs direct validation. the 4 major comments →
RL²-VLA: Adaptive RL Latent Compositional Steering with Test-Time Scaling for Vision-Language-Action Models
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The central claim is a pair of test-time scaling laws. With an oracle verifier, generating more action candidates from a flow-matching VLA reduces normalized action error as a power law in the number of samples. The law is not uniform, however: RL-based compositional steering is the strongest reducer of action error on failure tuples and among the worst on success tuples, where it unnecessarily perturbs accurate actions. The paper reads this asymmetry as evidence that inference-time steering should be adaptive—switched on only when the base policy is predicted to fail—and reports that this adaptive rule outperforms both the base policy and always-on steering across two simulation benchmarks,
What carries the argument
Compositional steering of flow velocities. In a flow-matching VLA, actions are generated by following a velocity field that carries noise onto action trajectories. The paper combines the frozen VLA's velocity field with that of a lightweight offline RL steering policy—both conditioned on latents (internal feature vectors) from the VLA action expert—as a weighted average, with the weight drawn from a Gaussian. This composes the imitation prior with RL-induced diversity. The RL policy is trained offline with an adjoint-matching Q-learning objective. A separate lightweight failure detector, calibrated by conformal prediction, decides when to activate the composition; an external verifier ranks
Load-bearing premise
The load-bearing assumption is that the states where the base policy is about to fail can be recognized at run time: the scaling law is derived with an oracle that knows the ground-truth action, while deployment relies on a learned failure detector making the same distinction.
What would settle it
On an out-of-domain task with success/failure defined by task completion, compare always-on composition, adaptive composition, and the base policy using the same verifier. If a perfect failure oracle does not outperform always-on steering, or if compositional steering reduces action error on success states when failure labels come from task outcome rather than action NRMSE, the central asymmetry claim is refuted.
If this is right
- Adaptive steering beats always-on steering in the paper's experiments, implying that fixed test-time intervention wastes its benefit on states where the base policy already succeeds.
- Latent-conditioned RL steering outperforms behavior-cloned steering and raw-observation-conditioned steering, implying that internal VLA features carry the state information needed for recovery.
- Scaling the number of action samples and the number of language rephrases both improve success rates, and compositional steering adds to gains from either form of scaling.
- The gains transfer from simulation to a real manipulator (+17.5% over the strongest baseline), suggesting the gating logic is not an artifact of the simulator.
Where Pith is reading between the lines
- The paper's scaling law labels failure states using ground-truth actions that exist only in the offline dataset; re-deriving the law with failure defined by actual task outcomes would test whether the adaptive trigger gives the same benefit in deployment.
- The conditional-steering recipe is generic: any large policy with internal latents and a flow or diffusion head could gate resampling or self-correction on predicted failure instead of applying it unconditionally.
- The failure detector is trained on collected rollouts, so failures identified by the external verifier during deployment could become new labels for the detector, making the steering increasingly selective over time.
- The conformal-threshold sweep could be replaced by learning to schedule the threshold online from reward feedback, removing the per-task calibration step.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proposes RL2, an inference-time steering framework for vision-language-action (VLA) models. A lightweight offline RL flow-matching policy is trained on latents extracted from a frozen VLA action expert, and its velocity field is composed with the VLA's flow velocity during action generation. A failure detector (SAFE) with conformal prediction is used to trigger this compositional steering only when the base VLA is predicted to fail; otherwise, the base VLA samples are used. The paper reports a scaling-law analysis on BridgeV2 claiming that compositional steering reduces action error under high-NRMSE 'failure' tuples and degrades under low-NRMSE 'success' tuples. Based on this, it argues for adaptive steering. Experiments on SIMPLER, PolaRiS, and a real PiperX manipulator report success-rate gains over repeated and rephrased sampling baselines, with ablations on RL training, latent conditioning, and the failure-detection trigger.
Significance. If the central scaling-law asymmetry held for deployment-time failure states, the adaptive gating idea would be a meaningful contribution to test-time scaling for VLAs, since existing methods apply a uniform intervention at every timestep. The paper has clear strengths: it evaluates across three VLAs, two simulation benchmarks, and real hardware; reports timing overhead; and provides detailed hyperparameters. The real-robot gains (+17.5% over Rephrase, +14.2% over non-adaptive) are encouraging. However, the 'when to steer' insight is currently derived from an oracle NRMSE-based partition of BridgeV2 tuples, not from the task-outcome failure states that SAFE sees at deployment, and the scaling-law measurements lack error bars and quantitative fits. These gaps are load-bearing because the adaptivity is the paper's main novelty. The claimed results may be salvageable with additional analyses, but the evidence presented does not yet establish the central claim.
major comments (4)
- [Sec. IV and Sec. V-C] The scaling law is established on tuples partitioned by NRMSE between pi0 actions and ground-truth expert actions (top/bottom 1,024 BridgeV2 tuples), not on actual task success or failure. A high-NRMSE state need not be a state where the base policy will fail the task: demonstrations are multimodal, and a low-NRMSE action can still be followed by downstream failure. At deployment, RL2 uses SAFE, a learned binary failure predictor trained on online rollouts with task outcomes. No analysis is provided showing that SAFE-triggered states coincide with the NRMSE-defined failure set, or that the scaling-law asymmetry persists when states are labeled by true success/failure. This is load-bearing because the adaptive-vs-always comparison is the paper's headline. Concretely, I would like to see the scaling-law analysis repeated on rollout states labeled by actual task outcomes, and/or an analysis
- [Sec. IV, Eq. (2)] The paper claims the action-error curves follow an 'exponential power law,' but no functional form, fitted parameters, residuals, or confidence intervals are provided. It is also unclear whether the NRMSE at sample count N is the oracle-selection error (minimum over N candidates) or an average over the N candidates; this distinction determines whether a decreasing curve is meaningful at all. Please state the aggregation rule explicitly and report the fitted law with error bars. Without this, the scaling-law claim is a qualitative description rather than a quantitative result.
- [Sec. VI-C2, Table II] The ablation supporting the use of VLA latents compares a QAM policy conditioned on latents (39.3% for OpenVLA) with a V-GPS/CQL policy conditioned on raw observations (0.5%). These two conditions differ not only in the conditioning signal but also in the RL algorithm, network architecture, training procedure, and base VLA being steered. This is not a controlled ablation of the latent representation. A clean test would hold the RL algorithm fixed and vary only the conditioning (latents vs. raw observations), or at least add a V-GPS/CQL-on-latents condition.
- [Sec. VI-C1, Table III] The comparison of SAFE with CoVer as a trigger may be unfair because CoVer is a contrastive action verifier, not a failure-detection model; the paper itself shows that CoVer success/failure scores are highly correlated. The more important issue is whether the SAFE trigger realizes the Sec. IV scaling-law asymmetry. The current results show only that SAFE-gated steering improves average success over always steering. This could happen even if the scaling-law asymmetry does not hold, e.g., if SAFE selects states where the verifier happens to rank the RL-policy samples highly. I recommend reporting success-rate improvements of RL2-Adaptive over Repeated/Rephrase separately on SAFE-positive and SAFE-negative timesteps, or gating with true outcome labels, to directly test the claimed mechanism.
minor comments (5)
- [Eq. (2)] The notation in the NRMSE formula is ambiguous: N is said to be the number of flattened action dimensions, while T is also referenced in the denominator as 'max_T a*_i' and in the surrounding text as the set of tuples. Please define all symbols precisely.
- [Fig. 20] The caption states that the PolaRiS Pan Cleaning task is run with pi0 [4], but Sec. VI and Table I indicate PolaRiS experiments use pi0.5 [5]. This inconsistency should be corrected.
- [Sec. IV] The phrase 'exponential power law' is used repeatedly, but an exponential law and a power law are different functional forms. The authors should state the intended model explicitly.
- [Sec. VII] The self-stated limitations are substantial: the failure detector requires online rollout collection and per-task calibration, and the alpha-selection heuristic needs test-time evaluation. In particular, the real-world experiments had to collect new rollouts to retrain SAFE for the real environment. These points should be reflected in the abstract and conclusion, which currently describe RL2 as practically deployable without qualification.
- [Reproducibility] The paper says code will be released with the final paper, but no code or checkpoints are currently provided. Given the number of modules (QAM training, SAFE, CP calibration, verifier integration), releasing code and evaluation scripts is important for reproducibility of the reported gains.
Circularity Check
The headline scaling-law 'discovery' is defined on the paper's own NRMSE-based success/failure split, so the asymmetry that motivates adaptive steering is partly constructed rather than independently established.
specific steps
-
self definitional
[Sec. IV (Inference-Time Scaling Law), Eq. (2); Abstract]
"Using π0 [4] as our base VLA, we first generate the policy actions for each tuple(s, a∗, I)within the validation set of the large-scale BridgeV2 dataset [36]. We then compute the normalized root-mean-squared error (NRMSE) between policy and ground truth actions, and extract the top and bottom 1,024 tuples based on NRMSE to define the failure and success tuple sets respectively. ... For failure tuples, RL2 compositional steering exhibits the strongest scaling behavior with significantly lower action error ... In contrast, under success tuples, most methods exhibit the opposite trend."
The 'failure' and 'success' states are literally the top and bottom 1,024 validation tuples ranked by the NRMSE of the base VLA's actions against ground-truth actions, and the scaling law is then reported as average NRMSE on those same tuples under an oracle verifier. The label used to partition the data is the same outcome metric used to measure improvement, so the claimed asymmetry ('steering improves failure states, degrades success states') is partly guaranteed by selection on the outcome variable: high-error tuples have mechanical room for error reduction, while low-error tuples are near the floor and perturbation tends to worsen min-error. The paper then invokes this asymmetry to justify SAFE-gated adaptive steering, making the central 'when to steer' rationale depend on a self-defin
full rationale
The main circularity is confined to the framing of the scaling-law insight. The paper defines 'failure' and 'success' tuples by base-VLA NRMSE against ground truth, then 'discovers' that steering reduces NRMSE on the failure set and degrades it on the success set; that reduction is an artifact of selecting extreme values of the very metric being averaged. The subsequent claim that action diversity is most useful when the base VLA is likely to fail inherits this construction, so the adaptive-gating motivation is partially circular. The rest of the paper is substantially independent and externally grounded: the RL steering policy is trained on BridgeV2/DROID with QAM, evaluated against RoboMonkey and CoVer verifiers on SIMPLER and PolaRiS, and validated on real hardware, so those benchmark gains do not reduce to the paper's own definitions. The reliance on SAFE is not scored as load-bearing self-citation because the paper directly trains SAFE, reports ROC-AUC, and ablates against an alternative trigger; however, the real-world section acknowledges that SAFE 'could not generalize similarly' after simulation-only training, which is a robustness gap rather than a circularity. Overall, the central empirical results are real, but the headline scaling-law discovery reduces by construction, yielding a partial-circularity score of 6.
Axiom & Free-Parameter Ledger
free parameters (4)
- Composition weight distribution w ~ N(0.5, 0.25) =
mu=0.5, sigma=0.25
- Conformal prediction significance level alpha =
selected per task via balanced-accuracy heuristic (top-3 among 0.05..0.50 by 0.05)
- Offline RL inverse temperature tau =
0.1 for pi0, 0.02 for pi0.5
- Positive reward steps H (3) =
3
axioms (4)
- domain assumption VLA internal feature embeddings e_t are informative enough to train an effective RL steering policy and failure detector.
- domain assumption An oracle or proxy verifier can reliably rank the generated action candidates.
- domain assumption The flow-matching VLA velocity field can be guided by the RL policy's velocity with no representational conflict.
- domain assumption BridgeV2/DROID ground-truth action NRMSE is a valid proxy for policy success/failure in deployment.
read the original abstract
Despite the impressive visuomotor capabilities enabled by Vision-Language-Action (VLA) models, their performance often degrades on challenging and out-of-domain tasks. Recent test-time steering and scaling methods improve performance without extensive data collection and retraining, but action samples often remain concentrated around similar behaviors and therefore inherit correlated failure modes. Moreover, existing methods apply the same intervention strategy at every timestep, regardless of whether the base policy is already likely to succeed. To address these limitations, we introduce $RL^2$, an adaptive inference-time steering framework that leverages Reinforcement Learning on VLA Latents. First, we train a lightweight offline RL policy conditioned on expressive latents extracted from the VLA action expert and compose its flow velocity with that of the frozen VLA during inference. This compositional steering strategy combines the behavioral priors of large-scale imitation learning with the action diversity induced by offline RL beyond dominant demonstration modes. We further discover that inference-time steering follows fundamentally different scaling laws under success and failure states, revealing that action diversity is most beneficial when the base VLA is likely to fail, but can unnecessarily perturb already-accurate actions when success is likely. Building on this insight, $RL^2$ activates compositional steering only when failure is predicted. Across the SIMPLER and PolaRiS benchmarks, $RL^2$ improves success rates by up to +17.3% in out-of-domain settings, while ablations and scaling studies demonstrate the importance of latent representations and RL training. Finally, real-world experiments demonstrate that these gains transfer beyond simulation, establishing $RL^2$ as a practical and modular steering framework for VLA deployment.
Figures
Reference graph
Works this paper leans on
-
[1]
I. Fang, J. Zhang, S. Tong, and C. Feng, “From intention to execution: Probing the generalization boundaries of vision-language-action mod- els,”arXiv preprint arXiv2506.09930, 2025
Pith/arXiv arXiv 2025
-
[2]
Interleave-VLA: Enhancing robot ma- nipulation with image-text interleaved instructions,
C. Fan, X. Jia, Y . Sun, Y . Wang, J. Wei, Z. Gong, X. Zhao, M. Tomizuka, X. Yang, J. Yan, and M. Ding, “Interleave-VLA: Enhancing robot ma- nipulation with image-text interleaved instructions,” inThe Fourteenth International Conference on Learning Representations, 2026
2026
-
[3]
Openvla: An open-source vision-language-action model,
M. J. Kim, K. Pertsch, S. Karamcheti, T. Xiao, A. Balakrishna, S. Nair, R. Rafailov, E. P. Foster, P. R. Sanketiet al., “Openvla: An open-source vision-language-action model,” inProceedings of The 8th Conference on Robot Learning, 2025
2025
-
[4]
π 0: A vision-language-action flow model for general robot control,
K. Black, N. Brown, D. Driess, A. Esmail, M. Equi, C. Finn, N. Fusai, L. Groom, K. Hausmanet al., “π 0: A vision-language-action flow model for general robot control,”arXiv preprint arXiv:2410.24164, 2026
Pith/arXiv arXiv 2026
-
[5]
π 0.5: a vision- language-action model with open-world generalization,
K. Black, N. Brown, J. Darpinian, K. Dhabalia, D. Driess, A. Esmail, M. R. Equi, C. Finn, N. Fusai, M. Y . Gallikeret al., “π 0.5: a vision- language-action model with open-world generalization,” inProceedings of The 9th Conference on Robot Learning, 2025
2025
-
[6]
Molmoact: Action reasoning models that can reason in space,
J. Lee, J. Duan, H. Fang, Y . Deng, S. Liu, B. Li, B. Fang, J. Zhang, Y . R. Wang, S. Leeet al., “Molmoact: Action reasoning models that can reason in space,”arXiv preprint arXiv:2508.07917, 2025
Pith/arXiv arXiv 2025
-
[7]
Open x-embodiment: Robotic learning datasets and rt-x models
A. O’Neill, A. Rehman, A. Maddukuri, A. Gupta, A. Padalkar, A. Lee, A. Pooley, A. Gupta, A. Mandlekar, A. Jainet al., “Open x-embodiment: Robotic learning datasets and rt-x models.” in2024 IEEE International Conference on Robotics and Automation, 2024
2024
-
[8]
GRAPE: Generalizing robot policy via preference alignment,
Z. Zhang, K. Zheng, Z. Chen, J. Jang, Y . Li, S. Han, C. Wang, M. Ding, D. Fox, and H. Yao, “GRAPE: Generalizing robot policy via preference alignment,” inarXiv preprint arXiv:2411.19309, 2025
Pith/arXiv arXiv 2025
-
[9]
Robotic control via embodied chain-of-thought reasoning,
M. Zawalski, W. Chen, K. Pertsch, O. Mees, C. Finn, and S. Levine, “Robotic control via embodied chain-of-thought reasoning,” inProceed- ings of The 8th Conference on Robot Learning, 2024
2024
-
[10]
Fast ecot: Efficient embodied chain-of-thought via thoughts reuse,
Z. Duan, Y . Zhang, S. Geng, G. Liu, J. Boedecker, and C. X. Lu, “Fast ecot: Efficient embodied chain-of-thought via thoughts reuse,”IEEE International Conference on Robotics and Automation, 2025
2025
-
[11]
Steering your generalists: Improving robotic foundation models via value guidance,
M. Nakamoto, O. Mees, A. Kumar, and S. Levine, “Steering your generalists: Improving robotic foundation models via value guidance,” Proceedings of The 8th Conference on Robot Learning, 2024
2024
-
[12]
Robomonkey: Scaling test-time sampling and verifi- cation for vision-language-action models,
J. Kwok, C. Agia, R. Sinha, M. Foutter, S. Li, I. Stoica, A. Mirhoseini, and M. Pavone, “Robomonkey: Scaling test-time sampling and verifi- cation for vision-language-action models,” inProceedings of The 9th Conference on Robot Learning, 2025
2025
-
[13]
Scaling verification can be more effective than scaling policy learning for vision-language-action alignment,
J. Kwok, X. Zhang, M. Xu, Y . Liu, A. Mirhoseini, C. Finn, and M. Pavone, “Scaling verification can be more effective than scaling policy learning for vision-language-action alignment,” inEuropean Conference on Computer Vision, 2026
2026
-
[14]
From foresight to fore- thought: Vlm-in-the-loop policy steering via latent alignment,
Y . Wu, R. Tian, G. Swamy, and A. Bajcsy, “From foresight to fore- thought: Vlm-in-the-loop policy steering via latent alignment,”Robotics: Science and Systems (RSS), 2025
2025
-
[15]
Do what you say: Steering vision-language-action models via runtime reasoning-action alignment verification,
Y . Wu, A. Li, T. Hermans, F. Ramos, A. Bajcsy, and C. P´erez-D’Arpino, “Do what you say: Steering vision-language-action models via runtime reasoning-action alignment verification,”2026 IEEE International Con- ference on Robotics & Automation, 2026
2026
-
[16]
Dynaguide: Steering diffusion policies with active dynamic guidance,
M. Du and S. Song, “Dynaguide: Steering diffusion policies with active dynamic guidance,” inThe Thirty-ninth Conference on Neural Information Processing Systems, 2026
2026
-
[17]
VLS: Steering pretrained robot policies via vision-language models,
S. Liu, I. S. Singh, Y . Xu, J. Duan, and R. Krishna, “VLS: Steering pretrained robot policies via vision-language models,”arXiv preprint arXiv:2602.03973, 2026
arXiv 2026
-
[18]
Z. Li, J. Liu, Z. Dong, T. Teng, Q. Rouxel, D. Caldwell, and F. Chen, “Towards deploying vla without fine-tuning: Plug-and-play inference- time vla policy steering via embodied evolutionary diffusion,”arXiv preprint arXiv:2511.14178, 2026
Pith/arXiv arXiv 2026
-
[19]
Compose your policies! improving diffusion-based or flow-based robot policies via test-time distribution- level composition,
J. Cao, Y . Huang, H. Guo, Q. Zhang, R. Zhang, W. Mai, M. Nan, J. Wang, H. Cheng, J. Sunet al., “Compose your policies! improving diffusion-based or flow-based robot policies via test-time distribution- level composition,” inThe Fourteenth International Conference on Learning Representations, 2026
2026
-
[20]
Safe: Multitask failure detection for vision-language-action models,
Q. Gu, Y . Ju, S. Sun, I. Gilitschenski, H. Nishimura, M. Itkina, and F. Shkurti, “Safe: Multitask failure detection for vision-language-action models,”Advances in Neural Information Processing Systems, 2026
2026
-
[21]
Evaluating real-world robot manipulation policies in simulation,
X. Li, K. Hsu, J. Gu, K. Pertsch, O. Mees, H. R. Walke, C. Fu, I. Lunawat, I. Siehet al., “Evaluating real-world robot manipulation policies in simulation,”arXiv preprint arXiv:2405.05941, 2024
Pith/arXiv arXiv 2024
-
[22]
Polaris: Scalable real-to-sim evaluations for generalist robot policies,
A. Jain, M. Zhang, K. Arora, W. Chen, M. Torne, M. Z. Irshad, S. Zakharov, Y . Wanget al., “Polaris: Scalable real-to-sim evaluations for generalist robot policies,”arXiv preprint arXiv:2512.16881, 2025
arXiv 2025
-
[23]
π ∗ 0.6: a vla that learns from experience,
P. Intelligence, A. Amin, R. Aniceto, A. Balakrishna, K. Black, K. Con- ley, G. Connors, J. Darpinian, K. Dhabalia, J. DiCarlo, D. Driess et al., “π ∗ 0.6: a vla that learns from experience,”arXiv preprint arXiv:2511.14759, 2026
Pith/arXiv arXiv 2026
-
[24]
SimpleVLA-RL: Scaling VLA training via reinforcement learning,
H. Li, Y . Zuo, J. Yu, Y . Zhang, Y . Zhaohui, K. Zhang, X. Zhu, Y . Zhang, T. Chen, G. Cuiet al., “SimpleVLA-RL: Scaling VLA training via reinforcement learning,” inThe Fourteenth International Conference on Learning Representations, 2026
2026
-
[25]
Conrft: A reinforced fine-tuning method for vla models via consistency policy,
Y . Chen, S. Tian, S. Liu, Y . Zhou, H. Li, and D. Zhao, “Conrft: A reinforced fine-tuning method for vla models via consistency policy,” in Proceedings of Robotics: Science and Systems, RSS, 2025
2025
-
[26]
Policy decorator: Model-agnostic online refinement for large policy model,
X. Yuan, T. Mu, S. Tao, Y . Fang, M. Zhang, and H. Su, “Policy decorator: Model-agnostic online refinement for large policy model,” in Thirteenth International Conference on Learning Representations, 2025
2025
-
[27]
Self-improving vision-language-action models with data generation via residual RL,
W. Xiao, H. Lin, A. Peng, H. Xue, T. He, Z. Luo, Y . Xie, F. Hu, L. Fan, G. Shi, and Y . Zhu, “Self-improving vision-language-action models with data generation via residual RL,” inThe Fourteenth International Conference on Learning Representations, 2026
2026
-
[28]
Steering your diffusion policy with latent space reinforcement learning,
A. Wagenmaker, M. Nakamoto, Y . Zhang, S. Park, W. Yagoub, A. Naga- bandi, A. Gupta, and S. Levine, “Steering your diffusion policy with latent space reinforcement learning,”Proceedings of The 9th Conference on Robot Learning, 2025
2025
-
[29]
Rl token: Bootstrapping online rl with vision-language-action models,
C. Xu, J. T. Springenberg, M. Equi, A. Amin, A. Esmail, S. Levine, and L. Ke, “Rl token: Bootstrapping online rl with vision-language-action models,”arXiv preprint arXiv:2604.23073, 2026
Pith/arXiv arXiv 2026
-
[30]
OnetwoVLA: A unified vision-language-action model with adaptive reasoning,
F. Lin, R. Nai, Y . Hu, J. You, J. Zhao, and Y . Gao, “OnetwoVLA: A unified vision-language-action model with adaptive reasoning,” inThe Fourteenth International Conference on Learning Representations, 2026
2026
-
[31]
Y . Tur, J. Naghiyev, H. Fang, W.-C. Tsai, J. Duan, D. Fox, and R. Krishna, “Recurrent-depth vla: Implicit test-time compute scaling of vision-language-action models via latent iterative reasoning,”arXiv preprint arXiv:2602.07845, 2026
arXiv 2026
-
[32]
Vla- attc: Adaptive test-time compute for vla models with relative action critic model,
W. Li, X. Su, Y . Cao, H. Xu, X. Xia, S. You, Y . Chen, and C. Xu, “Vla- attc: Adaptive test-time compute for vla models with relative action critic model,”arXiv preprint arXiv2605.01194, 2026
Pith/arXiv arXiv 2026
-
[33]
Scale: Self-uncertainty conditioned adaptive looking and execution for vision- language-action models,
H. Choi, D. Ahn, Y . Lee, T. Kang, S. Cho, and J. Choi, “Scale: Self-uncertainty conditioned adaptive looking and execution for vision- language-action models,” inThe Fourteenth International Conference on Learning Representations, 2026
2026
-
[34]
Diffusion models beat GANs on image synthesis,
P. Dhariwal and A. Q. Nichol, “Diffusion models beat GANs on image synthesis,” inThe Thirty-fifth Conference on Neural Information Processing Systems, 2021
2021
-
[35]
Tree-guided diffusion planner,
H. Jeon, C. Min, and J. Park, “Tree-guided diffusion planner,”Advances in Neural Information Processing Systems, 2026
2026
-
[36]
Bridgedata v2: A dataset for robot learning at scale,
H. Walke, K. Black, A. Lee, M. J. Kim, M. Du, C. Zheng, T. Zhao, P. Hansen-Estruch, Q. Vuong, Heet al., “Bridgedata v2: A dataset for robot learning at scale,” inThe 7th Conference on Robot Learning, 2023
2023
-
[37]
Q-learning with adjoint matching,
Q. Li and S. Levine, “Q-learning with adjoint matching,” inThe Fourteenth International Conference on Learning Representations, 2026
2026
-
[38]
Droid: A large-scale in-the-wild robot manipulation dataset,
A. Khazatsky, K. Pertsch, S. Nair, A. Balakrishna, S. Dasari, S. Karam- cheti, S. Nasiriany, M. K. Srirama, and L. Y . C. et al., “Droid: A large-scale in-the-wild robot manipulation dataset,”Robotics: Science and Systems (RSS), 2024
2024
-
[39]
Flow q-learning,
S. Park, Q. Li, and S. Levine, “Flow q-learning,” inForty-second International Conference on Machine Learning, 2025
2025
-
[40]
Conservative q-learning for offline reinforcement learning,
A. Kumar, A. Zhou, G. Tucker, and S. Levine, “Conservative q-learning for offline reinforcement learning,” inAdvances in Neural Information Processing Systems, 2020
2020
-
[41]
C. Xu, T. K. Nguyen, E. Dixon, C. Rodriguez, P. Miller, R. Lee, P. Shah, R. Ambrus, H. Nishimura, and M. Itkina, “Can we detect failures without failure data? uncertainty-aware runtime failure detection for imitation learning policies,”arXiv preprint arXiv2503.08558, 2024
Pith/arXiv arXiv 2024
-
[42]
Embodied red teaming for auditing robotic foundation models,
S. Karnik, Z.-W. Hong, N. Abhangi, Y .-C. Lin, T.-H. Wang, and P. Agrawal, “Embodied red teaming for auditing robotic foundation models,”arXiv preprint arXiv2411.18676, 2024
Pith/arXiv arXiv 2024
-
[43]
OGBench: Bench- marking offline goal-conditioned RL,
S. Park, K. Frans, B. Eysenbach, and S. Levine, “OGBench: Bench- marking offline goal-conditioned RL,” inThe Thirteenth International Conference on Learning Representations, 2025. 13 APPENDIX A. Additional Implementation Details In this section, we provide additional training details regard- ing our RL steering policies and failure detection models. 1)RL ...
2025
-
[51]
Continued on next page 19 TABLE IX LANGUAGEINSTRUCTIONSREPHRASES(CONTINUED FROM PREVIOUS PAGE)
Place the vegetable on the ceramic plate. Continued on next page 19 TABLE IX LANGUAGEINSTRUCTIONSREPHRASES(CONTINUED FROM PREVIOUS PAGE). Task Name Original Instruction Red-Team Instruction Generated Rephrases Spoon on Towel (SIMPLER) Put the spoon on the towel. Set the spoon exactly in the middle of the towel
-
[52]
Place the spoon in the center of the towel
-
[58]
Lay the green-handled spoon in the middle of the fabric
-
[59]
Stack Cubes (SIMPLER) Stack the green block on the yellow block
Set the spoon in the center of the towel. Stack Cubes (SIMPLER) Stack the green block on the yellow block. Arrange the lush green element atop the yellowish-orange element
-
[60]
Place the green cube on the yellow block
-
[61]
Put the grassy block on top of the yellow piece
-
[62]
Set the green block over the yellow cube
-
[63]
Stack the green piece onto the yellowish block
-
[64]
Position the lush cube above the yellow element
-
[65]
Place the green cube on the yellow cube
-
[66]
Set the green block on top of the yellow block
-
[67]
Eggplant in Basket (SIMPLER) Put eggplant into yellow basket
Put the green element over the yellow cube. Eggplant in Basket (SIMPLER) Put eggplant into yellow basket. Arrange the eggplant neatly in the yellow bin
-
[68]
Place the vegetable in the yellow rack
-
[69]
Put the eggplant in the yellow holder
-
[70]
Set the purple vegetable into the yellow bin
-
[71]
Organize the eggplant in the yellow rack
-
[72]
Position the vegetable in the yellow holder
-
[73]
Place the purple vegetable in the yellow container
-
[74]
Set the eggplant into the dish rack
-
[75]
Orange Juice on Plate (SIMPLER) Put orange juice on plate
Move the purple produce to the yellow bin. Orange Juice on Plate (SIMPLER) Put orange juice on plate. – 1. Set the carton of juice onto the dish
-
[76]
Move the orange drink to the saucer
-
[77]
Lay the juice carton on the platter
-
[78]
Position the orange juice on the dish
-
[79]
Put the drink carton on the yellow plate
-
[80]
Place the orange drink container onto the platter
-
[81]
Set the juice on the yellow saucer
-
[82]
Spoon on Towel (Google) (SIMPLER) Put the spoon on the towel google
Move the orange box to the plate. Spoon on Towel (Google) (SIMPLER) Put the spoon on the towel google. – 1. Place the spoon in the center of the towel
-
[83]
Put the utensil on the middle of the cloth
-
[84]
Position the scoop at the center of the fabric
-
[85]
Lay the green-handled spoon in the middle of the blue towel
-
[86]
Set the utensil in the central part of the towel
-
[87]
Position the spoon on the center of the blue towel
-
[88]
Set the spoon exactly in the middle of the towel
-
[89]
Toy Dinosaur on Towel (SIMPLER) Put the toy dinosaur on the towel
Set the spoon in the center of the towel. Toy Dinosaur on Towel (SIMPLER) Put the toy dinosaur on the towel. – 1. Place the toy on the cloth
-
[90]
Move the figure to the blue fabric
-
[91]
Transfer the creature to the piece of cloth
-
[92]
Lay the toy on the rag
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.