Pith.

Robotics · arXiv:2610.19656 v3 · submitted 14 Oct 2026

Accelerating VLA Inference with Perturbation Informed Execution

Jehun Lee, Hajun Lee, Jimin Ryu, Youhan Lee, Beomseok Kang, Jonghyun Choi, Jae-Joon Kim

The paper says

“Action-chunking vision-language-action (VLA) models predict sequences of future robot actions. Under fixed-horizon execution, the robot executes a fixedlength prefix of each predicted chunk before invoking the policy again, leaving the remaining predictions unused.”

more of the abstract

For a given number of executed actions, short execution horizons require more policy calls. Extending the execution horizon amortizes policy inference cost over more actions. However, uniformly applying long horizons across episodes can limit opportunities for precise corrections. To address this limitation, we propose PICES (Perturbation-Informed Chunk and Execution Horizon Selection), a training-free method that jointly selects an action chunk and the number of actions executed before the next policy call. Within a single policy call, the action expert generates a batch of action chunks from multiple initial noise samples and their locally perturbed counterparts, using the same conditioning features across all samples. PICES exploits differences between corresponding actions in each nominal chunk and its counterpart to determine candidate-specific execution horizons and select a nominal chunk for execution. Experiments on simulation benchmarks and real-world manipulation tasks demonstrate that PICES achieves speedup by up to 2.3x in wall-clock policy inference time on Jetson Orin and Thor relative to fixed horizon baselines while improving the success rate.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 16 Oct 2026 · of version 2 of the paper; version 3 is newer · 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 training-free, model-agnostic way to cut VLA policy calls by 25-60% and edge inference time up to 2.3x with success roughly maintained; the sensitivity mechanism is a heuristic validated only in aggregate, but the paper is honest and the evidence is solid. This line is wrong

2 major objections · 6 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the references say.

The paper says, at Sections 3.3-3.5, Eqs. (3)-(6), Appendix D

The review did not quote this passage.

A classifier read this sentence of the paper as acknowledging the concern (probability 0.77):

“This local interpretation does not provide a bound on action prediction error.”

Pith says: Objection 1 of 2 · major

PICES's central novelty is the claim that the stepwise sensitivity G_k^(n) is simultaneously a quality signal (low S_n marks trustworthy candidates via Eq. 5) and a horizon signal (the first crossing G_k^(n) > S_n sets h_n via Eq. 6). The authors correctly acknowledge in Appendix D (sentence b349) that this local-interpretation argument 'does not provide a bound on action prediction error,' so validity must come from the empirical evaluation.

more of objection 1

The current evidence is only aggregate: Figure 5 reports mean RMSE against mean selected horizon, with no per-context correlation between S_n and the reference-action RMSE of the corresponding candidate, and no per-step comparison between G_k^(n) and per-step error. Because the fixed-step curve in Figure 5 uses single-candidate chunks, the favorable RMSE of PICES at longer average horizons could reflect the benefit of drawing N=3 candidates rather than the sensitivity rule. Table 4 sharpens this concern: N=1, where the Eq. 5 filter is vacuous, already achieves 1.9-2.0x speedup, and N=3 adds only 0.2-0.3x, indicating that most of the gain comes from the horizon rule alone. I request (i) per-context correlation statistics between S_n and candidate prefix RMSE, and between the crossing offset and the offset at which per-step action error begins to rise, in the open-loop study; and (ii) closed-loop ablations that hold the N=3 pool and Eq. 6 fixed while replacing the Eq. 5 filter with random selection or with longest-horizon selection, at the same sampling budget. These controls are needed to establish that the perturbation signal, rather than multi-candidate sampling plus horizon extension, is the operative mechanism.

The paper says, at Tables 1-3, success-rate columns

The review did not quote this passage.

Pith says: Objection 2 of 2 · major

The claim that PICES improves success rate while speeding up inference is not statistically supported as stated. In Table 3, the real-world average is 93.5% over 108 rollouts versus 90.7% for Fixed (h=8); with 36 trials per task, the per-task gaps (e.g., Tape: 88.9% versus 86.1%) are within binomial sampling error.

more of objection 2

In Table 1, PICES (68.7%) is statistically indistinguishable from Fixed (h=1) (68.5%), and in Table 2 the reported LIBERO improvements are 0.8 and 1.6 percentage points over 2,000 episodes. The success-rate claims should be accompanied by confidence intervals or a per-task count breakdown, and the contribution should be phrased as maintaining success while reducing inference time unless a configuration shows a measurable improvement.

6 minor objections

The paper says, at Section 1 and Appendix G

Pith says: minor objection 1 of 6

The method A3 is attributed to Zhao et al. (2026) in Section 1 and to Chen et al. (2026) in Appendix G; both papers appear in the reference list, so the intended source is ambiguous and should be fixed (the same passages also mix 'A3' and 'A 3' spellings).

The paper says, at Table 1

Pith says: minor objection 2 of 6

The columns of Table 1 are misaligned in the current rendering: per-task success counts, average success, policy calls, and latency/speedup columns run together (visible in the Fixed (h=2) and AAC rows), making the table hard to check; please reformat.

show 4 more

The paper says, at Tables 1-2 and Figure 9

Pith says: minor objection 3 of 6

The notation for the W variants is inconsistent (PICES* with W=2 in Table 1 versus PICES** with W=8 in Table 2), and the sigma-sweep in Figure 9 reports only success-rate variation: policy-call counts and speedups at each sigma should also be reported, since sigma influences the Eq. 6 horizon estimates.

The paper says, at Table 1 caption

Pith says: minor objection 4 of 6

Table 1's caption restricts 'mean policy calls' to successful episodes, while Tables 2-3 average over all episodes; the denominator should be stated consistently or both numbers reported, because early-terminating failures could bias the policy-call reduction figures.

The paper says, at Section 3.1 and Section 4.2

Pith says: minor objection 5 of 6

Formatting and typos: the sentence defining A in Section 3.1 is missing a terminating period and has spacing issues ('R d x H To generate'), Section 4.2 contains 'achiving' (should be 'achieving'), and Section 1 contains 'exceuction' (should be 'execution').

The paper says, at Section 4.2, real-world results

Pith says: minor objection 6 of 6

The real-world speedups (1.39x/1.36x) are computed as the product of average policy calls and per-call GPU latency rather than measured wall-clock episode time; if episode wall-clock time was recorded, it should be reported directly, since the per-call latency metric excludes observation, control, and environment overhead in the loop.

What would settle it

Re-run the Appendix C open-loop protocol (1,000 Fractal contexts) while storing per-candidate records: S_n, the full profile {G_k^(n)}, and per-step reference RMSE for every candidate. Then compute (i) the Spearman correlation across candidates between S_n and prefix RMSE at h=W and at h=H; (ii) the rank correlation between the Eq. 6 horizon h_n and the first offset at which the candidate's prefix RMSE exceeds its own h=W error; and (iii) compare PICES's closed-loop success and policy calls on SimplerEnv against a control that samples N candidates and executes the longest horizon among a randomly chosen half of them. If (i) or (ii) is near zero or negative, or if the control matches Table 1, the sensitivity proxy is not the load-bearing component of PICES.

from the skeptic's reading

How the review went

4 readings by deepseek-v4-flash · 16 Oct 2026

  1. Reader holds up, with conditions confidence high
  2. Skeptic agrees 58 s · 23,657 tokens read, 5,876 written
  3. Editor wrote the verdict above 54 s · 25,295 tokens read, 841 written
  4. Referee major revision: 2 major objections, 6 minor 2 min 21 s · 24,016 tokens read, 17,784 written

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

PICES is a clean, honest, practically useful acceleration method, and the empirical work backs it up. The claim that holds: for flow-matching VLA policies you can cut policy calls by 25-60% and wall-clock inference time by 1.2-2.3x on Jetson Orin and Thor while keeping success roughly flat, and the paper shows this across three models, two simulators, and a real UR10e. That is a real result for edge deployment.

What's new is the specific mechanism: joint chunk and horizon selection driven by stepwise sensitivity of each candidate to small perturbations of its initial noise. That combination does not appear in the cited adaptive-horizon baselines (AAC uses entropy, AutoHorizon uses attention, A3 uses an extra flow-verification pass, MoH uses cross-horizon agreement). The batching-cost analysis is also good diligence: they measure arithmetic intensity against hardware ridge points and justify the candidate batch size per device, so the speedup arithmetic is internally consistent. The ablations (N sweep, sigma sweep, combination with FastV and GridS) are the right ones, and Appendix D is honest that the local sensitivity story does not bound action error.

Soft spots, in proportion. First, the sensitivity proxy is a heuristic, and the evidence for it is aggregate. The open-loop study reports mean RMSE versus mean selected horizon; it does not show a per-candidate correlation between Gk and reference-action error. The alternative reading, that a good part of the gain is just multi-candidate sampling plus longer horizons, is not fully excluded, though the N=1 result and the lowest-Sn ablation push back on it. A per-candidate correlation plot would settle this. I do not think it is fatal, because the method's value is the closed-loop outcome and the authors never claim the proxy is more than a proxy.

Second, W, the reference window, is a free parameter set to each model's default execution horizon, and the headline speedup is sensitive to it (W=2 gives 2.8x vs 2.2x in Table 1). The choice is defensible but not derived. Third, success-rate improvements over fixed baselines are small and reported without confidence intervals; the honest headline is "success maintained while calls drop," and that is plenty. Fourth, minor but real: A3 is cited to Zhao et al. in the introduction and to Chen et al. in Appendix G; one of those is wrong.

This is for people doing VLA deployment on robots and anyone comparing adaptive-horizon methods. It deserves a serious referee. I would ask for the citation fix, a per-candidate sensitivity analysis if feasible, and confidence intervals or episode-level counts on success rates, but I would expect it to come out the other side intact.

The strongest objection

The central claim depends on a specific empirical premise: the normalized difference G_k^(n) in Eq. 3 is treated both as a quality signal (low initial-window average S_n marks trustworthy candidates via Eq. 5) and as a timing signal (the first offset k at which G_k^(n) exceeds S_n marks where execution should stop via Eq. 6). The paper explicitly acknowledges in Appendix D that this local-interpretation argument 'does not provide a bound on action prediction error' (sentence b349), so the proxy must be validated empirically. The open-loop study in Section 3.5 reports only aggregate curves (mean RMSE against mean selected horizon), not a per-candidate or per-step correlation between G_k^(n) and reference-action error. The closed-loop tables show aggregate success and policy-call improvements, but they do not separate the contribution of the sensitivity signal from the trivial benefits of sampling N candidates and executing longer horizons. The unresolved possibility is that PICES succeeds because multi-candidate sampling plus horizon regularization helps, while the specific sensitivity ranking is not the operative mechanism. That would make the method's central novelty rest on an untested correlation.

The reader's weakest_assumption is exactly the assumption I find most load-bearing: that G_k^(n), and the derived S_n and h_n, track action quality and the right replanning time. The paper's own limitation statement in Appendix D (sentence b349) confirms that no analytic guarantee is offered, so the burden falls on empirical validation. Figure 5 and the closed-loop tables are suggestive, but they do not establish the correlation: the open-loop evaluation averages over contexts instead of reporting per-candidate agreement, and the closed-loop results could in principle be explained by multi-candidate sampling and longer average horizons alone. I do not see an internal inconsistency in Eqs. 3-6, and the roofline argument and batch-latency measurements are reasonable independent support for the cost side of the claim. The W sensitivity and the small success-rate differences without confidence intervals are secondary concerns; they affect tuning and reporting but not the validity of the mechanism. Because the concern is a specific missing empirical link rather than a demonstrated contradiction, the appropriate disposition remains CONDITIONAL: the reader's verdict already requests justification, and my check specifies what would settle it. No verdict change is needed.

The referee's report

The headline speedup claim is credible as reported: the numbers are internally consistent across tables (e.g., Table 1: 18.6 calls times 242.7 ms versus 46.8 calls times 209.9 ms yields approximately 2.2x), the roofline analysis in Section 3.2 and Appendix B provides a concrete cost model for batched generation of 2N chunks, results replicate across three VLA backbones, two simulators, two edge devices, and a real robot, and the paper ships code with a detailed reproducibility statement. If the mechanism claim holds, PICES is genuinely useful: it is training-free, needs no auxiliary predictor, reduces policy calls rather than per-call FLOPs, and is orthogonal to token-pruning accelerators. The central risk is that the perturbation-sensitivity signal, which is the paper's distinguishing novelty, is validated only through aggregate outcomes; the ablations needed to establish that the sensitivity ranking rather than multi-candidate sampling plus horizon extension is the operative mechanism are not present. Additionally, the success-rate improvements are statistically unquantified and often within sampling noise, so the supported claim is success parity with an inference-time speedup.

Pith's reading of the paper (a machine's summary, not the authors')

PICES attacks a specific inefficiency: a vision-language-action model that predicts a chunk of future actions is called anew every few executed actions even though the rest of the predicted chunk is discarded. The paper's proposal is to spend one batched policy call generating several candidate chunks, each from a different initial noise sample together with a locally perturbed twin, and to use the difference between each candidate and its twin as a free online signal about that candidate's quality. Candidates whose early steps react strongly to the perturbation are discarded, and for each surviving candidate the first step at which sensitivity rises above the early-window average sets how many actions to execute before replanning; the surviving candidate with the longest horizon is executed. The paper reports 25.4-60.3% fewer policy calls and 1.2-2.3x wall-clock inference speedups on Jetson Orin and Thor across GR00T and pi-0 models in simulation and on a real UR10e arm, with success rates maintained or slightly improved. If right, this means a training-free acceleration of frozen VLA policies that stacks with per-call optimizations such as token pruning, because it reduces the number of calls rather than the cost of each call.

What carries the argument. The carrier of the argument is the stepwise action-sensitivity score $G_k^{(n)}$ of Eq. 3: the squared distance between the action at offset $k$ of a nominal chunk and the corresponding action of its perturbed twin, normalized by the squared Frobenius norm of the perturbation displacement. For small perturbations the score approximates the squared norm of the directional derivative of the action-output map along the sampled noise direction, an interpretation the paper derives in Appendix D from a first-order Taylor expansion; the paper also notes there that this local interpretation carries no bound on action prediction error. Two derived quantities do the selection work: the initial-window average $S_n$ over the first $W$ steps, which serves as both a candidate-quality score (below-median candidates survive) and a per-candidate threshold, and the first-crossing rule $h_n = \min\{k \geq W : G_k^{(n)} > S_n\}$, capped at $H$, which converts the sensitivity profile into an execution horizon. The whole mechanism is training-free: no Jacobians are constructed and no extra evaluator network is trained; the only added cost is one batched forward pass over the $2N$ noise samples, with the vision-language conditioning computed once per call.

Core claim. The central claim is that, for flow-matching VLA action experts (models that transform initial noise into an action chunk by iterative denoising), local stability of an action chunk under small perturbations of its initial noise is a usable online proxy both for chunk quality and for when replanning is needed. Concretely, PICES draws $N$ independent initial-noise samples $Z^{(n)}$, builds a perturbed twin $Z^{(n)}+\sigma\epsilon^{(n)}$ for each, generates all $2N$ chunks in one batched forward pass under a single conditioning encoding, and computes the stepwise score $G_k^{(n)} = \|\tilde{a}_k^{(n)} - a_k^{(n)}\|^2/(\sigma^2\|\epsilon^{(n)}\|_F^2)$ for every action offset. The average of $G$ over the first $W$ steps, $S_n$, filters candidates to the below-median half, and for each kept candidate the first offset $k \geq W$ at which $G_k^{(n)}$ exceeds $S_n$ defines its execution horizon $h_n$, capped at the chunk length $H$; the kept candidate with the longest horizon is the one executed. An open-loop study with recorded reference actions shows that oracle selection among several candidates yields lower action error over an eight-step horizon than a single candidate at one step, and a roofline analysis of the action experts shows that batch sizes around 6 on Orin and 10 on Thor stay close to memory-bound operation, so the extra candidates cost little. The paper's empirical case is that this joint selection reduces policy calls by 25.4-60.3% and speeds up wall-clock policy inference by 1.2-2.3x while matching or exceeding baseline success rates.

The premise it rests on. The load-bearing premise is that a chunk's stepwise sensitivity to small perturbations of the initial noise tracks how accurate its actions are and when replanning is needed: low early sensitivity marks a trustworthy chunk, and the first step where the sensitivity profile $G_k^{(n)}$ rises above the early-window average $S_n$ marks the right point to stop executing; the paper itself notes in Appendix D that this interpretation gives no bound on action prediction error, leaving the open-loop and closed-loop results as the only support for the premise.

If the paper is right (Pith's inferences, not the authors')

Fixed-horizon execution is a cost the model itself can waive: the same frozen checkpoint, given a bounded candidate batch, can decide per call how far to run, and the measured result is fewer policy calls without losing success.

Cumulative inference time on edge hardware is governed by the number of policy calls, not just per-call latency: cutting calls by 25.4-60.3% yields 1.2-2.3x wall-clock speedups on Jetson Orin and Thor even though each PICES call is slower than a single-chunk call.

PICES composes with per-call accelerations: with pi-0.5 on LIBERO, PICES combined with visual token pruning (FastV) or grid sampling (GridS16) reaches cumulative speedups up to 1.8-1.9x and 2.5-2.8x respectively, all measured relative to the unpruned fixed-horizon baseline.

The sensitivity signal transfers across backbones and benchmarks: GR00T N1.7 on SimplerEnv-Fractal, pi-0.5 and GR00T N1.5 on LIBERO, and pi-0.5 on three real UR10e manipulation tasks all show the same pattern of reduced calls with maintained or improved success.

Candidate diversity and batching cost set a practical operating point: $N=3$ nominal candidates (six chunks per call) is where speedup peaks on Orin at 2.2x, since larger batches add compute-bound latency faster than they save calls.

My extension: the sensitivity-to-error link can be tested head-on. The paper already has an open-loop setup with recorded reference actions; computing the rank correlation between $S_n$ and prefix RMSE across those contexts would tell whether low-sensitivity chunks are genuinely the accurate ones, independent of any closed-loop result.

My extension: the threshold is each candidate's own early-window average, which is self-referential; a calibrated or task-phase-aware threshold could make the reactivity-versus-speed trade-off explicit and could be tuned against measured action error rather than only against rollout success.

My extension: because the probe touches only the action expert's noise input, the same machinery applies to any stochastic sequence generator with chunked execution, including diffusion and flow policies without a vision-language backbone and non-robot predictors where replanning cost matters.

My extension: since the policy-call reduction is the lever, PICES should compound with asynchronous or overlapped inference, where the batched candidate call is scheduled during execution of the previous chunk so the horizon savings appear as wall-clock time rather than only as GPU idle time.

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

Every value above, in the review's public record (JSON)

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.

Request a human review

How Pith checks papers · The full audit of this paper · Review history (2 versions)

The paper

Abstract

Action-chunking vision-language-action (VLA) models predict sequences of future robot actions. Under fixed-horizon execution, the robot executes a fixedlength prefix of each predicted chunk before invoking the policy again, leaving the remaining predictions unused. For a given number of executed actions, short execution horizons require more policy calls. Extending the execution horizon amortizes policy inference cost over more actions. However, uniformly applying long horizons across episodes can limit opportunities for precise corrections. To address this limitation, we propose PICES (Perturbation-Informed Chunk and Execution Horizon Selection), a training-free method that jointly selects an action chunk and the number of actions executed before the next policy call. Within a single policy call, the action expert generates a batch of action chunks from multiple initial noise samples and their locally perturbed counterparts, using the same conditioning features across all samples. PICES exploits differences between corresponding actions in each nominal chunk and its counterpart to determine candidate-specific execution horizons and select a nominal chunk for execution. Experiments on simulation benchmarks and real-world manipulation tasks demonstrate that PICES achieves speedup by up to 2.3x in wall-clock policy inference time on Jetson Orin and Thor relative to fixed horizon baselines while improving the success rate.

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-15

The authors' main claim, as the classifier picked it out 1.00

“Experiments on simulation benchmarks and real-world manipulation tasks demonstrate that PICES achieves speedup by up to 2.3x in wall-clock policy inference time on Jetson Orin and Thor relative to fixed horizon baselines while improving the success rate.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.20 · human participants 0.04 · controlled comparison 0.95 · randomized assignment 0.02 · states quantitative result 0.98 · compares with prior results 0.95 · 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.

SentenceRoleThe authors' own workStates the main conclusionStrength
Action-chunking vision-language-action (VLA) models predict sequences of future robot actions. background 1.00 0.06 0.02 asserted 1.00
Under fixed-horizon execution, the robot executes a fixedlength prefix of each predicted chunk before invoking the policy again, leaving the remaining predictions unused. background 0.98 0.11 0.03 asserted 1.00
For a given number of executed actions, short execution horizons require more policy calls. background 0.99 0.16 0.03 asserted 1.00
Extending the execution horizon amortizes policy inference cost over more actions. background 0.98 0.12 0.05 asserted 0.99
However, uniformly applying long horizons across episodes can limit opportunities for precise corrections. background 0.46 0.15 0.03 hedged possibility 0.77
To address this limitation, we propose PICES (Perturbation-Informed Chunk and Execution Horizon Selection), a training-free method that jointly selects an action chunk and the number of actions executed before the next policy call. contribution 0.97 0.86 0.18 asserted 0.99
Within a single policy call, the action expert generates a batch of action chunks from multiple initial noise samples and their locally perturbed counterparts, using the same conditioning features across all samples. method 0.99 0.87 0.03 asserted 1.00
PICES exploits differences between corresponding actions in each nominal chunk and its counterpart to determine candidate-specific execution horizons and select a nominal chunk for execution. method 1.00 0.87 0.08 asserted 1.00
Experiments on simulation benchmarks and real-world manipulation tasks demonstrate that PICES achieves speedup by up to 2.3x in wall-clock policy inference time on Jetson Orin and Thor relative to fixed horizon baselines while improving the success rate. result 1.00 0.96 0.82 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-15: 1 request, 6,889 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 (11)
Figure 1 of the paper
Figure 1. High-level idea of the PICES. (a) Fixed execution horizon generates a nominal action chunk from a single initial noise sample at each policy call and executes a fixed-length actions before replanning. (b) PICES uses multiple initial-noise samples and their perturbations to determine execution horizon of nominal action chunk. Our method reduces the number of policy calls required to complete the same episode, from four to two in the illustrated example. (c) Success rate versus speedup comparison across methods, showing that PICES achieves wall-clock inference time speedup while…
Figure 2 of the paper
Figure 2. Root-mean-square-error (RMSE) be￾tween reference and oracle-selected action chunk. The dashed horizontal line marks the baseline single￾candidate, one-step baselin (N = 1, h = 1)
Figure 4 of the paper
Figure 4. Overview of PICES. Step 1: Draw N initial noise samples and construct a perturbed variant of each sample. Step 2: The action expert processes the resulting N(1 + 1) inputs in a single batch under the shared condition C, producing N nominal action chunks and their corresponding perturbed chunks. Step 3: Stepwise action sensitivity G (n) k is computed by comparing each nominal chunk with its perturbed counterparts. Step 4: Compute a sensitivity score Si for each nominal chunk by averaging its sensitivity over the first W steps and use this score to determine its execution horizon hi.…
Figure 5 of the paper
Figure 5. Open-loop evaluation of selected action horizons. Action RMSE is computed between each selected nominal action and the corresponding reference action, following the evaluation protocol of the motivational study. Each fixed-step point is based on the single action chunk. For A 3 , AAC, PICES, and the lowest-Sn variant, the horizontal coordinate indicates the average of the horizons selected for individual method. PICES and the lowest-Sn variant use N = 3 nominal candidates; the latter selects the candidate with the smallest initial-window score (Sn). 6
Figure 6 of the paper
Figure 6. Sensitivity-guided chunk selection in LIBERO–Long. We compare Fixed (h = 5, top) and PICES (bottom) using GR00T N1.5. Colored arrows illustrate candidate motions, and the outlined bar identifies the selected execution horizon. PICES selects A(2) over A(3) for the longer execution hori￾zon (h2 = 10)
Figure 9 of the paper
Figure 9. Effect of the pertur￾bation scale on LIBERO success rate. We evaluate PICES at σ ∈ {0.05, 0.10, 0.25, 0.50}. A HORIZON DISTRIBUTIONS AND PERTURBATION SENSITIVITY Distribution of execution horizons. To examine how PICES selects action chunks and execution horizons, we analyze the policy call records collected during closed-loop evaluation of GR00T N1.7 on SimplerEnv–Fractal with three N = 3 nominal candidates. We group tasks by manipulation objective into three categories: Pick Coke/Object (Pick Coke Can and Pick Object), Open/Close (Open Drawer and Close Drawer), and Move/Place…
Figure 10 of the paper
Figure 10. Real-world experimental setup and task objects. Left: The UR10e robot with wrist-mounted and third-person cameras. Right: A tape and stand, a stapler, red and green cubes used for Tape Hanging, Stapler Pressing, and Cube Stacking, respectively. Robot platform and control. As shown in
Figure 11 of the paper
Figure 11. Task examples for real-world experiments

Showing 8 of the paper's 11 figures. Figures are the authors', reproduced from the paper.

Cited by 1 Pith paper

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.

No comments yet.

Sign in to comment