Robotics · arXiv:2610.25961 v2 · submitted 19 Oct 2026 · 23 references
PaceVLA: Adaptive Temporal Action Quantization in Vision-Language-Action Models
The paper says
“Fast and reliable manipulation is crucial for practical robot deployment. Although Vision-Language-Action (VLA) models have recently shown remarkable progress as generalist robot policies, their execution often remains temporally inefficient.”
more of the abstract
A key source of this inefficiency is that policies learn fine-grained temporal patterns from teleoperated demonstrations, requiring many low-level action steps. Temporal action quantization offers a simple way to accelerate execution by aggregating consecutive low-level actions into temporally coarser actions. However, applying action quantization without considering when fine-grained control is required introduces a speed-accuracy trade-off: accelerated actions may efficiently reduce redundant steps in some phases, while discarding critical motion details in precision-sensitive interactions. To address this, we propose PaceVLA, a unified framework for adaptive temporal execution in VLAs that integrates two coupled components: (1) mode-specific action decoders built on a shared action expert, supporting multiple temporal granularities and prediction horizons, and (2) a quantizability-guided mode selection scheme which decides whether coarse execution is appropriate, and a context-conditioned router that selects an execution mode at each inference step. Experiments across three multi-task simulation benchmarks and six real-world tasks show that PaceVLA improves execution efficiency while maintaining task success rate across multiple embodiments, including long-horizon and dexterous manipulation.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 22 Oct 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. PaceVLA is a genuine contribution — treating temporal granularity as a routable policy decision — whose large, consistent gains rest on an unvalidated LVLM-judge supervision pipeline; fixable in revision, worth refereeing. This line is wrong
3 major objections · 3 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 23 references say.
The paper says, at 3.3; C.5; E
The review did not quote this passage.
Pith says: Objection 1 of 3 · major
The quantizability judge is load-bearing: Table 5a shows that removing it drops ES from 1.14 to 1.01, so the entire efficiency gain over the router-only variant depends on the quality of the LVLM-generated labels. However, Appendix C.5 only says that the labels come from Gemini 3.8 Flash annotations, that Claude Opus 5 helped develop the criteria, and that per-task success rates under fixed quantization were used as “task-level cues.”
more of objection 1
Moreover, every prompt in Appendix E instructs the model to treat “computed facts derived from the demonstration” as true, without ever defining what those facts contain. This creates two concrete risks: (i) the facts may encode information that is not available to the judge at inference from Φ_t, making the regression target in Eq. (3) partially unachievable; and (ii) the labels may be noisy or systematically biased in ways that no experiment in the paper detects. I ask the authors to specify the computed facts, verify that they depend only on quantities available at inference time, and provide label-quality evidence (e.g., human agreement on a held-out set, noise analysis, or an ablation that removes the computed facts from the prompts). This is a correctness-risk concern, not a minor reproducibility issue, because the central speed-success claim depends on this component.
The paper says, at Appendix C.3
The review did not quote this passage.
Pith says: Objection 2 of 3 · major
The threshold δ that decides when the judge’s predicted score selects the quantized group is never reported. This threshold directly controls the speed-accuracy trade-off and is a free parameter of the method. Without giving its value, or the procedure used to choose it (fixed across benchmarks? tuned per task? selected on a validation set?), the main tables cannot be reproduced, …
more of objection 2
… and the reader cannot exclude the possibility that δ was tuned to maximize success rate or speedup on the evaluation tasks. Please report δ for each benchmark and any tuning procedure.
The paper says, at Table 2; Section 4.2
The review did not quote this passage.
Pith says: Objection 3 of 3 · major
The real-world “maintaining task success” claim is supported by differences on the order of 1–3 percentage points on 32-trial evaluations, e.g., Pick-and-Place 81.3% vs. 84.4% and Table Sweeping 62.5% vs. 59.4%. With 32 Bernoulli trials, these differences are within sampling noise, yet the paper presents them as evidence that success is preserved.
more of objection 3
The paper should either report confidence intervals or per-task statistical tests, or soften the success-preservation claim to “no clear degradation” given the trial counts. The wall-clock speed gains are robust, but the success-rate component of the central claim needs appropriate uncertainty quantification.
3 minor objections
The paper says, at Appendix E
Pith says: minor objection 1 of 3
The prompt heading “Real-World: Allex Conveyer Package Handling Task” misspells “Conveyor” and uses inconsistent capitalization for ALLEX; the main text and Table 4 use “Conveyor.” Please unify the terminology.
The paper says, at Table 1; Appendix B
Pith says: minor objection 2 of 3
The ES and TPR metrics count action steps, implicitly assuming wall-clock time is proportional to the number of executed steps. Since quantized commands are larger per step, the paper should state explicitly that the simulation controller runs at a fixed control frequency so that step counts and wall-clock time are equivalent; otherwise the reported speedups may overstate wall-clock gains.
show 1 more
The paper says, at Figure 4
Pith says: minor objection 3 of 3
The qualitative analysis in Figure 4 is based on a single demonstration. A quantitative summary of judge scores across phases and tasks (e.g., mean score by phase label) would strengthen the claim that the annotations capture phase-level precision requirements.
What would settle it
Disclose the computed-facts template and run a controlled annotation study on a fixed sample of about 100 chunks per benchmark: generate Gemini labels with the current prompt including the facts, and again with the facts block removed. Measure per-check agreement between the two label sets (e.g., Cohen's kappa or mean absolute difference). Then retrain the judge using only the no-facts labels and rerun the RoboCasa-Kitchen evaluation from Table 5a. If ES stays near 1.14, the supervision is observationally grounded; if agreement is low or ES drops materially, the current judge is trained on a target that depends on undisclosed or privileged information, and the real-robot gains cannot be attributed to the published adaptive-selection mechanism. In the same pass, check whether any computed fact is derived from future frames, which would settle the leakage question directly.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 22 Oct 2026
- Reader holds up, with conditions
- Skeptic agrees
- Editor wrote the verdict above
- Referee major revision: 3 major objections, 3 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
Two things to know. First, this is a real contribution: treating temporal granularity and prediction horizon as a routable policy decision, with mode-specific decoders on a shared action expert plus a judge and router, is genuinely not in the cited prior work. DemoSpeedUp and SAIL derive acceleration from action statistics; Mixture of Horizons gates multi-horizon heads without changing granularity. Second, the load-bearing link is the LVLM-generated quantizability supervision, and the paper never validates those labels. That gap, not the architecture, is what needs fixing.
The paper does a lot well. The SO(3)-aware aggregation in Appendix A is correct and careful — composing rotational increments via Exp/Log instead of summing them — and the delta/absolute distinction is handled properly. The ES metric with the full-episode failure penalty is defensible, and the numbers are internally consistent: ES above 1.0 in all but one setting, up to 1.31, 37–45% wall-clock cuts on the Franka tasks, and 3.6 to 6.3 packages per minute on ALLEX. The ablations are informative: Table 5a shows both the decoders and the judge matter, and removing the judge drops TPR from 2.75 to 2.01. The failure analysis in D.3 is honest, attributing most failures to perception, and they disclose the one ES-below-1 setting rather than hiding it. Prompts and hyperparameters are released.
The soft spots are proportionate. The judge supervision is the one I would push on. Appendix C.5 says each annotation prompt includes 'computed facts derived from the demonstration' that the LVLM is told to treat as true, but the paper never says what these facts are. If they encode future or ground-truth quantities, the judge's training target is partly unachievable from its inference-time context, and its deployment accuracy is simply untested. There is no human agreement study, no noise analysis, and no ablation over label quality. The bootstrap from per-task success rates is disclosed and is moderate circularity, not fatal — the headline numbers come from genuine rollouts — but the judge's whole job is to transfer the label structure to deployment, and that transfer is unmeasured. Smaller issues: no error bars anywhere, with real-world conclusions resting on 32 trials per task; and controller gains are tuned for the accelerated methods while the base keeps defaults, which slightly mixes policy and controller effects. These are standard for the subfield and neither falsifies the central claim.
This is for people working on VLA efficiency, action chunking, and faster-than-demonstration execution. It deserves a serious referee: the idea is sound, the effects are large, and the label-validation gap is addressable in revision — define the computed facts, add a human agreement study or label-noise ablation, and report error bars. I would engage with it.
The strongest objection
The most load-bearing link in the central claim is the quantizability-judge supervision pipeline (Sec. 3.3, App. C.5, App. E). Table 5a shows that removing the judge drops ES from 1.14 to 1.01, so the efficiency gain above the router-only variant rests entirely on the judge's ability to identify phases that tolerate coarse execution. That ability is only as good as the Gemini 3.8 Flash labels, and the paper provides no validation of them: no human agreement study, no noise analysis, and no definition of the 'computed facts' injected into every prompt in Appendix E. Because those facts are described as measurements derived from the demonstration that the model must treat as true, the labels may encode information unavailable to the judge at inference (for example, ground-truth or future quantities), making the supervision target partly unachievable from the conditioning context Phi_t. If the labels are noisy or depend on privileged facts, the judge selects the wrong granularity group in deployment and the claimed success-maintaining speedup collapses. The authors acknowledge perception-related limitations (b351-b355) but not this validation gap, and releasing prompts alone does not pin down the supervision signal that the whole adaptive-selection mechanism depends on.
The reader's weakest assumption is the same one I would isolate. The central claim is empirical: substantial execution speedup while maintaining task success. The mechanism that produces adaptive speed is the judge and router, and Table 5a quantifies that the judge is load-bearing: removing it lowers TPR from 2.75 to 2.01 and ES from 1.14 to 1.01. The judge's training signal consists of LVLM-generated per-chunk quantizability scores; if that signal does not track phase-level precision requirements, the judge cannot select the correct group and the method degrades toward a router that favors easy-to-quantize targets. Appendix C.5 and E make the prompt structure transparent but leave the computed-facts input undefined and provide no evidence that the Gemini ratings are reliable. This is not an objection to using an LVLM; it is a missing control on the pipeline's load-bearing input. I also considered the controller-gain asymmetry (Sec. 3.5, C.3) as an alternative primary concern, since the base model uses default gains while accelerated methods get tuned gains. That is a real secondary issue for the real-world success comparison, but the simulation speedups are step-count based and the adaptive-selection mechanism is still governed by the judge, so the label-validation gap is more central. The proposed check directly settles whether the supervision is grounded in observations: if labels change when computed facts are removed, or downstream ES drops, the published pipeline is not reproducible and the claimed mechanism is unsupported. Because the concern has not yet been shown to falsify the measured results, the reader's CONDITIONAL verdict remains appropriate, and I would not change it.
The referee's report
If the mechanism is sound, this is a practical and conceptually clean contribution: it treats temporal granularity and prediction horizon as policy decisions, which is a natural extension of chunked VLA inference, and it validates the idea across two action representations (delta and absolute) and three embodiments. The paper has real strengths: the SO(3)-aware aggregation rules in Appendix A are mathematically correct for delta-pose actions; the flow-matching objectives are conventional and clearly specified; the TPR and ES metrics are sensible because ES charges failures with the full episode budget; and the ablations in Table 5 isolate the contributions of the decoders, judge, and loss terms. The main risk is not in the architecture but in the supervision pipeline that makes the judge work: Table 5a shows that removing the judge reduces ES from 1.14 to 1.01, so the efficiency gain above the router-only variant rests entirely on the unvalidated LVLM-generated labels. Because the authors do not define the “computed facts” injected into every annotation prompt and report no human-agreement or noise analysis, the central mechanism currently rests on an unexamined component.
Pith's reading of the paper (a machine's summary, not the authors')
Robot policies trained by imitation learn to copy the slow, cautious tempo of teleoperated demonstrations, so they carry out many redundant, fine-grained action steps even where faster motion is safe. This paper argues that the fix is to let the policy itself decide, at each inference step, how coarsely to act: merge several low-level actions into one larger command when the current phase of the task tolerates it, and fall back to fine-grained steps during precision-sensitive moments such as grasping and placement. Its proposed framework, PaceVLA, couples a shared action expert with four mode-specific decoders (two fine-grained, two quantized, at different prediction horizons), a quantization judge that decides whether coarse execution is appropriate, and a context-conditioned router that picks the decoder to use. The paper reports that this adaptive scheme keeps base-model success rates while achieving effective speedups above 1x in all but one simulation setting, 37 to 45 percent wall-clock reductions on real Franka robot tasks, and faster package throughput on a humanoid robot. If correct, the result is a lightweight way to speed up already-trained VLA policies without retraining on accelerated demonstrations or reinforcement-learning fine-tuning, which matters because execution time is a central obstacle to practical robot deployment.
What carries the argument. The framework stands on three coupled objects. First, temporal action quantization with representation-aware aggregation: each source segment of $H_k$ demonstrated actions is collapsed into $T_k$ commands, retaining the final command of each block for absolute actions, while delta translations are summed in a fixed Cartesian frame and rotational increments are composed on SO(3) as $\varphi^{-1}(\mathrm{Log}(R_{s_i} \cdots R_{s_{i-1}+1}))$ so the net commanded rotation survives merging. Second, a shared flow-matching action expert (a diffusion transformer backbone) with four lightweight mode-specific decoders: two fine-grained modes with $q_k = 1$ and two quantized modes with $q_k > 1$, each offered at a longer and a shorter source horizon. Third, the mode-selection layer: a quantization judge $J_\psi$ regresses an LVLM-annotated per-step quantizability score $y \in [0,1]$ and gates between the fine and quantized groups at threshold $\delta$, while an MLP router outputs mode probabilities $\alpha_t$ trained under a KL-tempered objective that favors whichever decoder has lower prediction error, plus a balance term that prevents collapse onto a single mode. The judge supplies the "when to accelerate" decision that fixed quantization lacks, and the router supplies the "how coarsely" decision; together they encode the paper's thesis that precision demand is a property of the robot's interaction with the scene, not of the action statistics.
Core claim. PaceVLA's central claim is that both temporal granularity and prediction horizon should be treated as policy decisions, adapted online from visual and language context, rather than fixed by the data-collection frequency or by a uniform quantization ratio. A pretrained VLA is fine-tuned so that a quantization judge predicts a per-step quantizability score -- whether the upcoming stretch of motion tolerates coarser commands -- and a router selects among decoders trained at different granularities $q_k = H_k/T_k$ and source horizons. The experiments assert that this adaptive scheme preserves the base policy's success rate where fixed ratio-2 quantization and entropy- or kinematic-rule-based accelerators lose 10 to 30 percentage points: on the Air Fryer task, execution drops from 24.6 s to 14.6 s at unchanged 81.3 percent success, and on the ALLEX conveyor task throughput rises from 3.6 to 6.3 packages per minute while success rises from 86 to 94 percent. The ablations support the two-component design, showing that removing the judge lowers effective speedup from 1.14 to 1.01 and removing the dedicated decoders lowers it to 1.00, so the claimed gains depend on both the "when to accelerate" signal and the separately learned coarse decoders.
The premise it rests on. The entire efficiency gain rests on the quantization judge, and the judge is only as trustworthy as the per-step quantizability labels generated by a large vision-language model from prompt criteria that the paper never validates against human judgment, noise analysis, or any independent measurement of phase-level precision demand.
If the paper is right (Pith's inferences, not the authors')
Effective speedup lands above 1x in all but one simulation setting across two VLA backbones, meaning throughput per unit wall-clock time rises even after failed trials are charged their full episode budget.
Real Franka gripper tasks finish 37 to 45 percent faster at comparable or higher success, with the long-horizon Air Fryer task cut from 24.6 s to 14.6 s.
The mechanism transfers across embodiments: on the ALLEX humanoid conveyor task, throughput rises from 3.6 to 6.3 packages per minute while success rises from 86 to 94 percent.
Both core components are needed: removing the quantizability judge drops effective speedup from 1.14 to 1.01, and removing the dedicated coarse decoders drops it to 1.00.
The added per-step inference cost is roughly 5 percent (42.2 ms versus 40.1 ms on the benchmark GPU), so the wall-clock gains come from executing fewer, larger actions rather than from cheaper inference.
The judge's label source is the untested link: nothing reported shows that the LVLM ratings track true precision demand, so a direct test would be training the same judge on cheap geometric proxies (distance to the contact surface, gripper aperture relative to object size) and checking whether the effective speedup survives.
The threshold $\delta$ on the judge's score acts as a deployment-time safety knob: operators could tune this single scalar to trade speed against conservatism per environment, which fixed quantization cannot offer.
Because quantized targets are defined by representation-specific aggregation rules, the method transfers most cleanly to policies sharing the same controller conventions; a different action parameterization would require re-deriving the aggregation.
The paper's own failure analysis attributes most residual failures to perception rather than temporal decisions, which suggests that adding depth or tactile sensing could widen the speedup obtainable without sacrificing success.
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.
How Pith checks papers · The full audit of this paper · Review history (2 versions)
The paper
Abstract
Fast and reliable manipulation is crucial for practical robot deployment. Although Vision-Language-Action (VLA) models have recently shown remarkable progress as generalist robot policies, their execution often remains temporally inefficient. A key source of this inefficiency is that policies learn fine-grained temporal patterns from teleoperated demonstrations, requiring many low-level action steps. Temporal action quantization offers a simple way to accelerate execution by aggregating consecutive low-level actions into temporally coarser actions. However, applying action quantization without considering when fine-grained control is required introduces a speed-accuracy trade-off: accelerated actions may efficiently reduce redundant steps in some phases, while discarding critical motion details in precision-sensitive interactions. To address this, we propose PaceVLA, a unified framework for adaptive temporal execution in VLAs that integrates two coupled components: (1) mode-specific action decoders built on a shared action expert, supporting multiple temporal granularities and prediction horizons, and (2) a quantizability-guided mode selection scheme which decides whether coarse execution is appropriate, and a context-conditioned router that selects an execution mode at each inference step. Experiments across three multi-task simulation benchmarks and six real-world tasks show that PaceVLA improves execution efficiency while maintaining task success rate across multiple embodiments, including long-horizon and dexterous manipulation.
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-10-20
The authors' main claim, as the classifier picked it out 1.00
“Experiments across three multi-task simulation benchmarks and six real-world tasks show that PaceVLA improves execution efficiency while maintaining task success rate across multiple embodiments, including long-horizon and dexterous manipulation.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.15 · human participants 0.11 · controlled comparison 0.20 · randomized assignment 0.01 · states quantitative result 0.32 · compares with prior results 0.23 · mentions code or data availability 0.03
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 |
|---|---|---|---|---|
| Fast and reliable manipulation is crucial for practical robot deployment. | background 1.00 | 0.03 | 0.02 | asserted 1.00 |
| Although Vision-Language-Action (VLA) models have recently shown remarkable progress as generalist robot policies, their execution often remains temporally inefficient. | background 0.87 | 0.08 | 0.02 | asserted 0.98 |
| A key source of this inefficiency is that policies learn fine-grained temporal patterns from teleoperated demonstrations, requiring many low-level action steps. | background 0.94 | 0.10 | 0.02 | asserted 1.00 |
| Temporal action quantization offers a simple way to accelerate execution by aggregating consecutive low-level actions into temporally coarser actions. | background 0.98 | 0.06 | 0.03 | asserted 0.92 |
| However, applying action quantization without considering when fine-grained control is required introduces a speed-accuracy trade-off: accelerated actions may efficiently reduce redundant steps in some phases, while discarding critical motion details in precision-sensitive interactions. | background 0.50 | 0.10 | 0.04 | hedged possibility 0.70 |
| To address this, we propose PaceVLA, a unified framework for adaptive temporal execution in VLAs that integrates two coupled components: (1) mode-specific action decoders built on a shared action expert, supporting multiple temporal granularities and prediction horizons, and (2) a quantizability-guided mode selection scheme which decides whether coarse execution is appropriate, and a context-conditioned router that selects an execution mode at each inference step. | contribution 0.53 | 0.89 | 0.12 | asserted 0.99 |
| Experiments across three multi-task simulation benchmarks and six real-world tasks show that PaceVLA improves execution efficiency while maintaining task success rate across multiple embodiments, including long-horizon and dexterous manipulation. | result 1.00 | 0.97 | 0.86 | asserted 1.00 |
What kind of paper the classifier reports this is: method or tool 1.00 · evidence from observation or experiment 0.96
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-10-20: 1 request, 5,766 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
References (23)
- [3] Lucas Beyer, Andreas Steiner, André Susano Pinto, Alexander Kolesnikov, Xiao Wang, Daniel Salz, Maxim Neumann, Ibrahim Alabdulmohsin, Michael Tschannen, Emanuele Bugliarello, et al. Paligemma: A versatile 3b vlm for transfer.arXiv preprint arXiv:2407.07726, on PithPith's reviewarXiv
- [4] Accessed: 2025-09-09. Kevin Black, Manuel Galliker, and Sergey Levine. Real-time execution of action chunking flow policies.Advances in Neural Information Processing Systems, 38:33383–33407, on Pith
- [5] Xi Chen, Josip Djolonga, Piotr Padlewski, Basil Mustafa, Soravit Changpinyo, Jialin Wu, Carlos Riquelme Ruiz, Sebastian Goodman, Xiao Wang, Yi Tay, et al. Pali-x: On scaling up a multilingual vision and language model. arXiv preprint arXiv:2305.18565, on PithPith's reviewarXiv
- [7] URLhttps://deepmind. google/models/model-cards/gemini-3-8-flash/. Lingxiao Guo, Zhengrong Xue, Zijing Xu, and Huazhe Xu. Demospeedup: Accelerating visuomotor policies via entropy-guided demonstration acceleration.arXiv preprint arXiv:2506.05064, on PithPith's reviewarXiv
- [8] Physical Intelligence, Kevin Black, Noah Brown, James Darpinian, Karan Dhabalia, Danny Driess, Adnan Esmail, Michael Equi, Chelsea Finn, Niccolo Fusai, et al.𝜋0.5: a vision-language-action model with open-world generalization.arXiv preprint arXiv:2504.16054, on PithPith's reviewarXiv
- [9] Peng Jin, Bo Zhu, Li Yuan, and Shuicheng Yan. Moh: Multi-head attention as mixture-of-head attention.arXiv preprint arXiv:2410.11842, on PitharXiv
- [11] Alexander Khazatsky, Karl Pertsch, Suraj Nair, Ashwin Balakrishna, Sudeep Dasari, Siddharth Karamcheti, Soroush Nasiriany, Mohan Kumar Srirama, Lawrence Yunliang Chen, Kirsty Ellis, et al. Droid: A large-scale in-the-wild robot manipulation dataset.arXiv preprint arXiv:2403.12945, on PithPith's reviewarXiv
- [12] Dongyoung Kim, Huiwon Jang, Myungkyu Koo, Suhyeok Jang, Taeyoung Kim, Beomjun Kim, Byungjun Yoon, Changsung Jang, Daewon Choi, Dongsu Han, et al. Rldx-1 technical report.arXiv preprint arXiv:2605.03269, on PithPith's reviewarXiv
- [13] Qixiu Li, Yaobo Liang, Zeyu Wang, Lin Luo, Xi Chen, Mozheng Liao, Fangyun Wei, Yu Deng, Sicheng Xu, Yizhong Zhang, et al. Cogact: A foundational vision-language-action model for synergizing cognition and action in robotic manipulation.arXiv preprint arXiv:2411.19650, on PithPith's reviewarXiv
- [14] Yaron Lipman, Ricky TQ Chen, Heli Ben-Hamu, Maximilian Nickel, and Matt Le. Flow matching for generative modeling.arXiv preprint arXiv:2210.02747, on PithPith's reviewarXiv
- [16] 11 PaceVLA: Adaptive Temporal Action Quantization in Vision-Language-Action Models Karl Pertsch, Kyle Stachowicz, Brian Ichter, Danny Driess, Suraj Nair, Quan Vuong, Oier Mees, Chelsea Finn, and Sergey Levine. Fast: Efficient action tokenization for vision-language-action mode... on PithPith's reviewarXiv
- [17] Jiaming Tang, Yufei Sun, Yilong Zhao, Shang Yang, Yujun Lin, Zhuoyang Zhang, James Hou, Yao Lu, Zhijian Liu, and Song Han. Vlash: Real-time vlas via future-state-aware asynchronous inference.arXiv preprint arXiv:2512.01031, on PithPith's reviewarXiv
- [18] Hanwen Wang, Weizhi Zhao, Xiangyu Wang, Siyuan Huang, He Lin, Boyuan Zheng, Rongtao Xu, Gang Wang, Yao Mu, He Wang, et al. Dexjoco: A benchmark and toolkit for task-oriented dexterous manipulation on mujoco.arXiv preprint arXiv:2605.16257, on PithPith's reviewarXiv
- [19] Tony Z Zhao, Vikash Kumar, Sergey Levine, and Chelsea Finn. Learning fine-grained bimanual manipulation with low-cost hardware.arXiv preprint arXiv:2304.13705, on PithPith's reviewarXiv
- [20] 12 PaceVLA: Adaptive Temporal Action Quantization in Vision-Language-Action Models A. Temporal Action Quantization Details The aggregation rule depends on the action representation. For a source segment of𝐻 actions quantized into 𝑇 commands, let0 =𝑠 0 < 𝑠1 <···< 𝑠 𝑇 =𝐻 denote ... on Pith
- [21] OpenArm.OpenArm is a bimanual platform with two 7-DoF arms, each equipped with a 6-DoF Inspire RH56F1 hand. A ZED stereo camera is mounted on the neck, and its left and right views are used as visual inputs. We collect demonstrations by controlling the arms with ExoArm-7, a we... on Pith
- [22] For ALLEX, we use a longer source horizon, so the fine-grained modes are(24,24) and (12,12); the other embodiments use(16,16) and (8,8). On Franka, Pick-and-Place is trained for 20k iterations, while Air Fryer and Stack Cup are trained for 30k iterations. Controller configurat... on Pith
- [23] on the same GR00T-N1.5 and RLDX-1-IMG backbones used in our experiments. We follow the original implementation and hyperparameters, with three changes to keep the comparison fair. First, we parameterize action chunks as end-effector deltas to match the delta control interface ... on Pith
- [2018] Ajay Mandlekar, Danfei Xu, Josiah Wong, Soroush Nasiriany, Chen Wang, Rohun Kulkarni, Li Fei-Fei, Silvio Savarese, YukeZhu, andRobertoMartín-Martín. Whatmattersinlearningfromofflinehumandemonstrations for robot manipulation.arXiv preprint arXiv:2108.03298, on PithPith's reviewarXiv
- [2023] Danny Driess, Fei Xia, Mehdi SM Sajjadi, Corey Lynch, Aakanksha Chowdhery, Brian Ichter, Ayzaan Wahid, Jonathan Tompson, Quan Vuong, Tianhe Yu, et al. Palm-e: An embodied multimodal language model.arXiv preprint arXiv:2303.03378, on PithPith's reviewarXiv
show 3 more
- [2024] Dong Jing, Gang Wang, Jiaqi Liu, Weiliang Tang, Zelong Sun, Yunchao Yao, Zhenyu Wei, Yunhui Liu, Zhiwu Lu, and Mingyu Ding. Mixture of horizons in action chunking.arXiv preprint arXiv:2511.19433, on PithPith's reviewarXiv
- [2025] Shuai Bai, Yuxuan Cai, Ruizhe Chen, Keqin Chen, Xionghui Chen, Zesen Cheng, Lianghao Deng, Wei Ding, Chang Gao, Chunjiang Ge, et al. Qwen3-vl technical report.arXiv preprint arXiv:2511.21631, on PithPith's reviewarXiv
- [2026] URL https://www.anthropic.com/ claude-opus-5-system-card. Nadun Ranawaka Arachchige, Zhenyang Chen, Wonsuhk Jung, Woo Chul Shin, Rohan Bansal, Pierre Barroso, Yu Hang He, Yingyang Celine Lin, Benjamin Joffe, Shreyas Kousik, et al. Sail: Faster-than-demonstration execution of i... on PithPith's reviewarXiv
Cited by 1 Pith paper
Reviewed papers on Pith that cite this one. The full citation record
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