Robotics · arXiv:2608.14379 v1 · submitted 14 Aug 2026 · 22 references
Reflex: Enabling Fast and Predictive Vision-Language-Action Models for Reaction-Critical Manipulation
The paper says
“Vision-Language-Action (VLA) models have recently achieved promising performance in robotic manipulation. However, existing benchmarks mainly evaluate generalization on static manipulation tasks and largely overlook dynamic interaction scenarios. To address this gap, we present ReflexBench, a benchmark for reaction-critical manipulation.”
more of the abstract
ReflexBench contains six dynamic tasks and introduces an evaluation framework that decouples simulator stepping from robot control while supporting configurable latency under synchronous and asynchronous inference. Building upon ReflexBench, we propose ReflexVLA, an efficient VLA model designed for reaction-critical manipulation without large-scale robot-data pretraining. ReflexVLA enhances temporal reasoning through latent future prediction and multi-frame temporal fusion within the vision backbone, while reducing deployment latency through batched visual encoding and CUDA Graph replay. Experiments show that ReflexVLA consistently improves dynamic manipulation performance while maintaining competitive accuracy on standard static manipulation benchmarks, and real-world experiments further demonstrate its effectiveness under practical deployment conditions. Project website: https://reflexvla.github.io
from the abstract
Pith says
Machine review · deepseek-v4-flash · 27 Aug 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
Holds up, with conditions. A genuinely useful latency-aware benchmark and a plausible compact VLA, but the main result's margin is thin and the latency protocol is under-specified in the key experiments. This line is wrong
4 major objections · 5 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 22 references say.
The paper says, at V-A, Table I, Section III-C
The review did not quote this passage.
Pith says: Objection 1 of 4 · major
The main ReflexBench comparison does not report per-policy end-to-end latencies, RTF values, or any statement that the RTF-converted delays of Eq. (1) were actually injected into the evaluation. Section V-A states only that all policies use asynchronous inference with chunk size 8, horizon 2, on one RTX 5880 Ada GPU, and Figure 5 fixes the inference frequency at 30 Hz.
more of objection 1
If every model is simply run at a prescribed 30 Hz, then slower models such as PUMA and OpenVLA are evaluated at a control frequency they could not physically sustain, which undermines the benchmark's claim of realistic latency modeling. The resulting 0.2 percentage point average advantage over PUMA (50.4% vs 50.2%) is therefore not demonstrably a real-world improvement. This issue is load-bearing for the abstract's claim of 'consistently improves' and must be resolved by reporting the actual latency protocol used for Table I, including per-policy latency measurements and the exact delay injection procedure.
The paper says, at Table I, per-task rows
The review did not quote this passage.
Pith says: Objection 2 of 4 · major
The claim that ReflexVLA 'consistently improves dynamic manipulation performance' is not supported by the per-task data in Table I. ReflexVLA trails PUMA on Rolling Ball Interception (77.1 vs 85.1) and Ball Throwing (31.7 vs 33.8), and underperforms DynamicVLA on Rotating Peg Insertion (12.4 vs 16.7) and Ball Throwing (31.7 vs 36.2).
more of objection 2
The only large gains over PUMA are on Conveyor Belt Pick-and-Place (73.8 vs 67.4) and Ball Catching (7.3 vs 4.0), both of which are low or noisy. The authors should either qualify the claim to 'higher average success rate' or provide statistical evidence that the average difference is robust given the reported standard deviations (the 50.4 vs 50.2 difference is within one standard deviation of most rows).
The paper says, at III-B, V-A
The review did not quote this passage.
Pith says: Objection 3 of 4 · major
The benchmark is self-referential: the tasks, demonstrations, and evaluation choices in ReflexBench are all created by the same group that proposes ReflexVLA, and the demonstration pipeline described in Section III-B uses a planner that predicts future trajectories from real-time position and velocity, plus task-specific RL policies for complex interactions.
more of objection 3
This pipeline may systematically encode exactly the future-tracking and multi-frame behavior that ReflexVLA is designed to exploit, while baseline models are trained on demonstrations that may not expose the same inductive bias. The paper provides no check for this, such as evaluating all methods on an existing independently-created dynamic benchmark (e.g., those in [4], [5], or [6]). Because the central claim is that ReflexVLA outperforms existing VLA approaches on reaction-critical manipulation, the absence of such a comparison is a correctness risk that should be addressed, at minimum by discussing the potential bias and by adding a cross-benchmark evaluation if feasible.
The paper says, at Table III
The review did not quote this passage.
Pith says: Objection 4 of 4 · major
The progressive ablation in Table III reports only single success-rate values with no standard deviations, no number of trials, and no explicit statement of which task(s) the results correspond to (the text suggests Conveyor Belt Pick-and-Place, but the table header is ambiguous).
more of objection 4
The claimed jump from 36.8% to 62.8% from switching to a frozen future-prediction target, and from 71.7% to 73.8% from latency optimization, cannot be assessed statistically. Given that the paper emphasizes careful measurement in other places, the ablation should include at least the same three-seed mean±std protocol used in Table I, or state clearly that only one task is considered and justify that choice.
5 minor objections
The paper says, at Abstract and Section I
Pith says: minor objection 1 of 5
There are several typographical issues, including 'we presentReflexBench' (missing space) in the abstract and 'a 1B-parameter model' being described as 'Reflex' in the title while the model is called ReflexVLA; please harmonize the naming throughout.
The paper says, at Figures 4 and 5
Pith says: minor objection 2 of 5
Figure 5 heatmaps would benefit from a colorbar and explicit axis tick labels, since the numerical values inside cells are difficult to read and the color scale is not defined.
show 3 more
The paper says, at Section V-A
Pith says: minor objection 3 of 5
The paper does not state how the 150 evaluation episodes per task are generated (initial state distributions, random seeds, whether the same episodes are used for all models), which is needed to interpret the reported standard deviations.
The paper says, at Table II
Pith says: minor objection 4 of 5
The LIBERO results are reported as point accuracies without standard deviations or number of runs; while this is common in the literature, the authors should specify the evaluation protocol (e.g., one rollout per task per seed) to allow comparison with their own three-seed protocol on ReflexBench.
The paper says, at Section IV-C, Eq. (11)
Pith says: minor objection 5 of 5
The notation G(x_text, x_vision, x_state) is used for the CUDA Graph, but the arguments are not defined in the text; please define x_text, x_vision, and x_state explicitly.
What would settle it
Request the authors to release per-policy end-to-end latency measurements, RTF values per task, and the exact simulation-desynchronization script, then rerun Table I in two modes: (a) with RTF-injected per-policy latency as described in Section III-C, and (b) with a fixed 30 Hz frequency. If the ReflexVLA versus PUMA average margin differs by more than 3 percentage points between modes, or if the ranking flips, the headline claim is not robust. Additionally, report standard deviations for the six-task average to test whether 50.4% versus 50.2% is statistically significant.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 27 Aug 2026
- Reader holds up, with conditions
- Skeptic partly agrees
- Editor wrote the verdict above
- Referee major revision: 4 major objections, 5 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
Here's my read on Reflex (2608.14379). The strongest contribution is ReflexBench itself: a six-task dynamic manipulation benchmark that decouples simulator stepping from policy control and models synchronous/asynchronous inference with configurable latency. That is a real gap in the current evaluation culture, and the protocol is thoughtfully described. I also think the model is a reasonable first pass at combining latent future prediction, multi-frame temporal fusion, and system-level latency optimization. The internal evidence supports the central claim: ReflexVLA improves average success on ReflexBench over its VLA-Adapter backbone from 30.3% to 50.4%, and it stays competitive on LIBERO (97.2%). Those are new numbers, not fitted constants, and the paper does not oversell the model size story.
That said, the soft spots are real and they matter. The stress-test note captures the biggest one: the main experiments (Table I) report only that all policies run asynchronously at a fixed 30 Hz, with chunk size 8 and horizon 2. There is no per-policy end-to-end latency, no RTF value, and no statement that RTF-converted delays were actually injected. If the benchmark's signature feature is the latency-aware protocol, the headline comparison needs to show it was used. Right now it reads as a fixed-frequency async eval, which is weaker and not demonstrably more realistic than what others do.
The second issue is overclaiming. ReflexVLA's 50.4% average beats PUMA's 50.2% by 0.2 points, and PUMA wins on Rolling Ball Interception (85.1 vs 77.1) and Ball Throwing (33.8 vs 31.7). The abstract's "consistently improves" is not supported by per-task data. The margin is fragile, and the conclusion should be phrased as "comparable or slightly better on average," not "consistently better."
Third, no code or data are released, and there is no evaluation on existing dynamic benchmarks (e.g., the ones cited as [4], [5], [6]). That makes external validation impossible right now, especially for a self-authored benchmark. The ablation also lacks error bars, and the trainable-future-prediction variant collapsing to 4.9% success is a detail that needs more explanation than one sentence about unstable supervision.
None of this is fatal. The paper is methodologically coherent, the internal comparisons are consistent, and the limitations section is honest about the fine-tuning-only scope. I would happily referee this. But I would ask the authors to report the actual latency protocol used, release artifacts, soften the consistency claim, and add at least one external dynamic benchmark. Who is this for? Researchers working on VLA efficiency and reactive manipulation, and anyone who cares about honest latency-aware evaluation. Worth a reading group slot when the code is out, and worth citing once the protocol details are clarified.
My recommendation: send to peer review, but treat the current version as conditional on the authors addressing the protocol transparency and the overclaim.
The strongest objection
Section III-C motivates a latency-aware protocol in which real-world policy latency is converted to a simulation delay via RTF = t_sim/t_wall (Eq. 1), with synchronous and asynchronous blocking. Yet the main experiments (Section V-A) specify only that all policies use asynchronous inference, chunk size 8, horizon 2, on one RTX 5880 Ada GPU; Figure 5 fixes inference frequency at 30 Hz. No per-policy end-to-end latencies, no RTF values, and no statement that RTF-converted delays were actually injected are reported for Table I. If the protocol instead runs every model at a prescribed 30 Hz, then slower models such as PUMA and OpenVLA are granted a control frequency they could not physically sustain, breaking the realism the benchmark claims. The headline margin is also fragile: ReflexVLA's 50.4% average exceeds PUMA's 50.2% by 0.2 percentage points, and ReflexVLA trails PUMA on Rolling Ball Interception (77.1 vs 85.1) and Ball Throwing (31.7 vs 33.8), so the abstract's 'consistently improves' is not supported by per-task data. The missing protocol details make the central claim unverifiable.
The reader's weakest assumption points to the fidelity of the RTF-based latency conversion and the synchronous/asynchronous protocols. My stress-test narrows this to a specific internal-consistency gap: the main experimental setup does not report whether per-policy latencies were actually converted and injected, and instead appears to use a fixed 30 Hz inference frequency. This is load-bearing because the central claim—that a compact model outperforms larger VLAs on reaction-critical tasks—depends on the benchmark faithfully reproducing real-world latency effects. If the fixed-frequency protocol was used, slower baselines receive an unrealistic advantage, and the 0.2 percentage point margin over PUMA is meaningless. However, this is a missing-detail concern rather than a demonstrated error: the paper's internal ablations and real-world experiments are suggestive, and the authors could satisfy the concern by providing the protocol details and rerunning the comparison. The reader's CONDITIONAL verdict already requests per-policy latency reporting and artifact release, so no verdict change is needed; the condition should explicitly include the RTF-injection check. I do not see grounds for REJECT because the paper's own data do not contradict the claim, and the missing information could plausibly confirm it. I also credit the progressive ablation (Table III) and the real-world experiments as evidence that the design direction has merit, even though the main simulation claim is currently under-specified.
The referee's report
If the results hold, the contribution is valuable: it addresses a real gap in VLA evaluation by making latency an explicit part of the benchmark, and it shows that a compact 1B model can compete with much larger models on dynamic manipulation without large-scale robot-data pretraining. The paper also contains useful empirical studies of how inference frequency, chunk size, and action horizon affect success in dynamic tasks, and the progressive ablation with measured latency gives insight into the contribution of each component. However, the strength of the central claim depends on the fairness and faithful implementation of the benchmark protocol, which is not fully documented, and on the representativeness of a benchmark built entirely by the same group that proposes the method. The thin 0.2 pp average margin over PUMA and the absence of error bars in the ablation further limit confidence. The paper includes machine-checked experimental comparisons in the sense that tables are internally consistent, but no code or data is released, so reproducibility cannot be independently verified.
Pith's reading of the paper (a machine's summary, not the authors')
This paper argues that fast, reaction-critical manipulation is a distinct capability that small vision-language-action models can acquire without large-scale robot-data pretraining, and it provides both a benchmark and a model to demonstrate that claim. ReflexBench measures six dynamic tasks under simulated inference latency, with the simulated world continuing to move while the policy computes. ReflexVLA keeps the language model's visual-token budget unchanged by fusing multiple historical frames inside the vision encoder, and it is trained to predict future visual states in a frozen semantic feature space. The paper reports a 50.4% average success rate on ReflexBench, higher than all compared baselines, while retaining 97.2% average accuracy on the static LIBERO benchmark. The broader point is that anticipation and low latency can matter more than parameter count for dynamic manipulation.
What carries the argument. The load-bearing mechanism is a masked cosine-similarity loss that makes the hidden states of learnable future tokens match features extracted by a frozen DINOv3 encoder from observations one action-chunk ahead, pulling the model's internal representations toward anticipating scene dynamics without adding inference cost. Around that core sit two supporting mechanisms: causal temporal attention over patch trajectories in the vision backbone's intermediate layer, which injects motion history without increasing the number of visual tokens the language model sees, and deployment-time optimization that batches all view-frame images into one visual-encoder call and replays the entire policy as a captured CUDA Graph, reducing end-to-end latency. ReflexBench itself is the third mechanism: it converts real inference latency into simulation delay through the Real-Time Factor and offers synchronous and asynchronous execution protocols, making latency a controllable experimental variable rather than an ignored constant.
Core claim. ReflexVLA's central claim is that a compact 1B-parameter policy can outperform much larger vision-language-action models on reaction-critical manipulation by combining an auxiliary objective that predicts future visual states as frozen DINOv3 features, temporal fusion across a short history applied to intermediate visual features, and system-level latency reduction through batched visual encoding and CUDA Graph replay. The paper reports that this combination raises the ReflexBench average success rate from 30.3% for its backbone model to 50.4%, exceeding all evaluated baselines, while LIBERO accuracy stays at 97.2%. The benchmark contribution is equally central: ReflexBench decouples simulation stepping from policy inference and injects configurable latency under synchronous and asynchronous protocols, so reported success rates reflect how delay and action staleness actually degrade performance. The reported ablations attribute the largest gains to frozen future targets, intermediate-layer temporal fusion, and latency optimization, with the latter cutting measured inference latency roughly in half on the flagship task.
The premise it rests on. The comparison stands or falls on whether ReflexBench's injected delays and its planner-and-reinforcement-learning demonstration pipeline reproduce real deployment conditions without systematically favoring ReflexVLA's own predictive and multi-frame design.
If the paper is right (Pith's inferences, not the authors')
If the 50.4% average holds up, model scale is not the binding constraint for reactive manipulation: a 1B model with temporal reasoning and low latency can outperform 4B and 7B generalist VLAs.
Because frozen future targets succeed where trainable targets collapse (62.8% vs 4.9% success in the ablation), future-prediction supervision for robot policies should target a fixed semantic representation space rather than be learned end-to-end.
The latency optimizations add success on the conveyor task while roughly halving inference time (125.1 ms to 65.0 ms), implying deployment overhead should be a controlled variable in every dynamic-manipulation evaluation.
Temporal fusion on intermediate visual features outperforms fusion on final-layer features and cross-attention fusion, suggesting motion-relevant information is concentrated in mid-level visual representations.
The 97.2% LIBERO result indicates the same recipe can be added to a generalist VLA without sacrificing static benchmark performance.
The Real-Time Factor conversion assumes a stable ratio between simulator time and wall-clock time; a natural extension would sample latency from a distribution under variable system load, which could reorder the ranking of policies whose tolerance for timing jitter differs.
Because ReflexVLA's future tokens align one-to-one with action-chunk steps, the same auxiliary loss could be extended to variable prediction horizons or multi-step returns, potentially covering tasks with longer predictive dependencies than the six ReflexBench tasks.
Temporal fusion is applied per spatial patch across frames; extending the same causal attention across camera views as well as time could improve multi-view consistency in cluttered scenes without adding language-model tokens.
Real-world validation covered three tasks; a stronger test would measure whether ReflexBench success-rate gaps predict real-world success-rate gaps across a broader task set, since the benchmark's injection of latency is only a model of deployment conditions.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
Vision-Language-Action (VLA) models have recently achieved promising performance in robotic manipulation. However, existing benchmarks mainly evaluate generalization on static manipulation tasks and largely overlook dynamic interaction scenarios. To address this gap, we present ReflexBench, a benchmark for reaction-critical manipulation. ReflexBench contains six dynamic tasks and introduces an evaluation framework that decouples simulator stepping from robot control while supporting configurable latency under synchronous and asynchronous inference. Building upon ReflexBench, we propose ReflexVLA, an efficient VLA model designed for reaction-critical manipulation without large-scale robot-data pretraining. ReflexVLA enhances temporal reasoning through latent future prediction and multi-frame temporal fusion within the vision backbone, while reducing deployment latency through batched visual encoding and CUDA Graph replay. Experiments show that ReflexVLA consistently improves dynamic manipulation performance while maintaining competitive accuracy on standard static manipulation benchmarks, and real-world experiments further demonstrate its effectiveness under practical deployment conditions. Project website: https://reflexvla.github.io
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-09-23
The authors' main claim, as the classifier picked it out 1.00
“Experiments show that ReflexVLA consistently improves dynamic manipulation performance while maintaining competitive accuracy on standard static manipulation benchmarks, and real-world experiments further demonstrate its effectiveness under practical deployment conditions.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.09 · states limitation 0.15 · human participants 0.04 · controlled comparison 0.28 · randomized assignment 0.01 · states quantitative result 0.34 · compares with prior results 0.53 · mentions code or data availability 0.44
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| Vision-Language-Action (VLA) models have recently achieved promising performance in robotic manipulation. | background 1.00 | 0.04 | 0.02 | asserted 0.93 |
| However, existing benchmarks mainly evaluate generalization on static manipulation tasks and largely overlook dynamic interaction scenarios. | gap 0.99 | 0.08 | 0.02 | asserted 1.00 |
| To address this gap, we present ReflexBench, a benchmark for reaction-critical manipulation. | contribution 1.00 | 0.92 | 0.05 | asserted 0.99 |
| ReflexBench contains six dynamic tasks and introduces an evaluation framework that decouples simulator stepping from robot control while supporting configurable latency under synchronous and asynchronous inference. | contribution 0.51 | 0.92 | 0.04 | asserted 1.00 |
| Building upon ReflexBench, we propose ReflexVLA, an efficient VLA model designed for reaction-critical manipulation without large-scale robot-data pretraining. | contribution 0.90 | 0.90 | 0.06 | asserted 0.97 |
| ReflexVLA enhances temporal reasoning through latent future prediction and multi-frame temporal fusion within the vision backbone, while reducing deployment latency through batched visual encoding and CUDA Graph replay. | method 0.96 | 0.90 | 0.07 | asserted 1.00 |
| Experiments show that ReflexVLA consistently improves dynamic manipulation performance while maintaining competitive accuracy on standard static manipulation benchmarks, and real-world experiments further demonstrate its effectiveness under practical deployment conditions. | result 1.00 | 0.97 | 0.87 | asserted 1.00 |
| Project website: https://reflexvla.github.io | contribution 0.41 | 0.08 | 0.01 | unclear 0.98 |
What kind of paper the classifier reports this is: dataset or benchmark 0.72 · evidence from observation or experiment 0.99
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,178 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Figures (6)
Figures are the authors', reproduced from the paper.
References (22)
- [4] H. Xie, B. Wen, J. Zheng, Z. Chen, F. Hong, H. Diao, and Z. Liu, “Dynamicvla: A vision-language-action model for dynamic object ma- nipulation,” arXiv preprint arXiv:2601.22153, 2026 on PithPith's reviewarXiv
- [5] H. Fang, S. Li, S. Wang, X. Xi, D. Liang, and X. Bai, “Towards generalizable robotic manipulation in dynamic environments,” arXiv preprint arXiv:2603.15620, 2026 on PithPith's reviewarXiv
- [6] Y . Zhang, C. Song, V . Singh, X. Li, K. Ye, Z. Hu, Z. Pu, Y . Yin, and V . Chaudhary, “Overcoming dynamics-blindness: Training-free pace- and-path correction for vla models,” arXiv preprint arXiv:2605.11459, 2026 on PithPith's reviewarXiv
- [1] A. Brohan, N. Brown, J. Carbajal et al., “Rt-2: Vision-language-action models transfer web knowledge to robotic control,” arXiv preprint arXiv:2307.15818, 2023 on PithPith's reviewarXiv
- [2] M. J. Kim, K. Pertsch, S. Karamcheti et al., “Openvla: An open-source vision-language-action model,” arXiv preprint arXiv:2406.09246, 2024 on PithPith's reviewarXiv
- [3] K. Black, N. Brown, D. Driess et al., “π0: A vision-language- action flow model for general robot control, 2024,” arXiv preprint arXiv:2410.24164, 2024 on PithPith's reviewarXiv
- [7] Y . Lu, Z. Liu, X. Fan, Z. Yang, J. Hou, J. Li, K. Ding, and H. Zhao, “Faster: Rethinking real-time flow vlas,” arXiv preprint arXiv:2603.19199, 2026 on PithPith's reviewarXiv
- [8] M. Shukor, D. Aubakirova, F. Capuano et al., “Smolvla: A vision- language-action model for affordable and efficient robotics,” arXiv preprint arXiv:2506.01844, 2025 on PithPith's reviewarXiv
- [9] Y . Ma, Y . Zhou, Y . Yang, T. Wang, and H. Fan, “Running vlas at real- time speed,” arXiv preprint arXiv:2510.26742, 2025 on PitharXiv
- [10] Y . Wang, P. Ding, L. Li, C. Cui, Z. Ge, X. Tong, W. Song, H. Zhao, W. Zhao, P. Hou et al., “Vla-adapter: An effective paradigm for tiny-scale vision-language-action model,” in Proceedings of the AAAI conference on artificial intelligence, vol. 40, no. 22, 2026, pp. 18 638– 18 646 on Pith
- [11] J. Tang, Y . Sun, Y . Zhao, S. Yang, Y . Lin, Z. Zhang, J. Hou, Y . Lu, Z. Liu, and S. Han, “Vlash: Real-time vlas via future-state-aware asynchronous inference,” arXiv preprint arXiv:2512.01031, 2025 on PithPith's reviewarXiv
- [12] B. Liu, Y . Zhu, C. Gao, Y . Feng, Q. Liu, Y . Zhu, and P. Stone, “Libero: Benchmarking knowledge transfer for lifelong robot learning,” in Advances in Neural Information Processing Systems, vol. 36, 2023, pp. 44 776–44 791 on Pith
- [13] S. Tao, F. Xiang, A. Shukla et al., “Maniskill3: Gpu parallelized robotics simulation and rendering for generalizable embodied ai,” arXiv preprint arXiv:2410.00425, 2024 on PithPith's reviewarXiv
- [14] T. Yu, D. Quillen, Z. He, R. Julian, K. Hausman, C. Finn, and S. Levine, “Meta-world: A benchmark and evaluation for multi-task and meta reinforcement learning,” in Conference on robot learning. PMLR, 2020, pp. 1094–1100 on Pith
- [15] C. Li, R. Zhang, J. Wong, C. Gokmen, S. Srivastava, R. Mart ´ın-Mart´ın, C. Wang, G. Levine, M. Lingelbach, J. Sun et al., “Behavior-1k: A benchmark for embodied ai with 1,000 everyday activities and realistic simulation,” in Conference on Robot Learning. PMLR, 2023, pp. 80– 93 on Pith
- [16] M. Oquab, T. Darcet, T. Moutakanni, H. V o, M. Szafraniec, V . Khalidov, P. Fernandez, D. Haziza, F. Massa, A. El-Nouby et al., “Dinov2: Learning robust visual features without supervision,” Transactions on Machine Learning Research Journal, 2024 on Pith
- [17] X. Zhai, B. Mustafa, A. Kolesnikov, and L. Beyer, “Sigmoid loss for language image pre-training,” in Proceedings of the IEEE/CVF international conference on computer vision, 2023, pp. 11 975–11 986 on Pith
- [18] A. Yang, B. Yang, B. Zhang et al., “Qwen2.5 technical report,” arXiv preprint arXiv:2412.15115, 2024 on PithPith's reviewarXiv
- [19] O. Sim ´eoni, H. V . V o, M. Seitzer, F. Baldassarre, M. Oquab, C. Jose, V . Khalidov, M. Szafraniec, S. Yi, M. Ramamonjisoa et al., “Dinov3,” arXiv preprint arXiv:2508.10104, 2025 on PithPith's reviewarXiv
- [20] M. J. Kim, C. Finn, and P. Liang, “Fine-tuning vision-language- action models: Optimizing speed and success,” arXiv preprint arXiv:2502.19645, 2025 on PithPith's reviewarXiv
show 2 more
- [21] K. Black, N. Brown et al., “π 0.5: a vision-language-action model with open-world generalization,” in Proceedings of The 9th Conference on Robot Learning, vol. 305, 27–30 Sep 2025, pp. 17–40 on Pith
- [22] K. Black, M. Galliker, and S. Levine, “Real-time execution of action chunking flow policies,” in Advances in Neural Information Processing Systems, vol. 38, 2025, pp. 33 383–33 407 on Pith
Cited by 4 Pith papers
Reviewed papers on Pith that cite this one. The full citation record
- Time-Indexed Skill Success Models for Latency-Aware Skill Selection and Timing in Dynamic Manipulation cs.RO · Nov 2026
- VLALagBench: Understanding When and Why VLA Inference Latency Matters cs.RO · Nov 2026
- LIBERO-Dynamic: Benchmarking Robotic Manipulation in Dynamic Environments cs.RO · Oct 2026
- Neuro Inspired Robotics: What Robot Learning Can Borrow from the Sensorimotor Brain cs.RO · Nov 2026
How the literature uses it
What this paper does with the arXiv papers it cites
What it cites · 13 sentences without a confident label
Uses the method or tool of 2 papers
-
We encode each future observation using a frozen DINOv3 [ref] model: [equation]
DINOv3 · Latent Future Prediction · 1.00
-
The language backbone is a Qwen2.5-0.5B [ref] causal transformer.
Qwen2.5 Technical Report · ReflexVLA · 1.00
Compares with 4 papers
-
We compare ReflexVLA with two representative baselines, SmolVLA [ref] and PUMA [ref] , with all policies trained using teleoperation demonstrations.
SmolVLA: A Vision-Language-Action Model for Affordable and Efficient Robotics · Real-World Experiments · 1.00
-
We compare ReflexVLA with two representative baselines, SmolVLA [ref] and PUMA [ref] , with all policies trained using teleoperation demonstrations.
Towards Generalizable Robotic Manipulation in Dynamic Environments · Real-World Experiments · 1.00
-
Specifically, we include the lightweight models VLA-Adapter [ref] and SmolVLA [ref] , the dynamic manipulation methods DynamicVLA [ref] and PUMA [ref] , and the large-scale VLA models OpenVLA-OFT [ref] and $π_0.5$ [ref] .
DynamicVLA: A Vision-Language-Action Model for Dynamic Object Manipulation · Setup · 1.00
Cites as support 1 paper
-
[ref] further reveals that current VLA models remain highly sensitive to environmental dynamics.
Overcoming Dynamics-Blindness: Training-Free Pace-and-Path Correction for VLA Models · Benchmarks for Dynamic Manipulation · 0.96
Cites as background 5 papers
-
[ref] focuses on object motion and perception-execution latency, while [ref] studies spatiotemporal reasoning across 35 dynamic manipulation tasks.
DynamicVLA: A Vision-Language-Action Model for Dynamic Object Manipulation · Benchmarks for Dynamic Manipulation · 0.84
-
[ref] focuses on object motion and perception-execution latency, while [ref] studies spatiotemporal reasoning across 35 dynamic manipulation tasks.
Towards Generalizable Robotic Manipulation in Dynamic Environments · Benchmarks for Dynamic Manipulation · 0.84
-
Meanwhile, considerable effort is devoted to improving the efficiency of VLA inference through architectural optimization, model compression, and system-level acceleration techniques, with the goal of reducing latency and enabling deployment in real-time robotic applications [ref] [ref] .
SmolVLA: A Vision-Language-Action Model for Affordable and Efficient Robotics · Introduction · 0.83
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment