{"paper":{"title":"Accelerating VLA Inference with Perturbation Informed Execution","arxiv_id":"2610.19656","primary_cat":"cs.RO","submitted_at":"2026-10-14T06:31:06+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"Action-chunking vision-language-action (VLA) models predict sequences of future robot actions.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.06,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":0.98,"id":"s1","own":false,"role":"background","text":"Under fixed-horizon execution, the robot executes a fixedlength prefix of each predicted chunk before invoking the policy again, leaving the remaining predictions unused.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.11,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.1,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.98,"limitation":0.02,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":0.99,"id":"s2","own":false,"role":"background","text":"For a given number of executed actions, short execution horizons require more policy calls.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.16,"main_claim_p":0.03,"quantitative":true,"quantitative_p":0.51,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.99,"limitation":0.01,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":3,"p":0.98,"id":"s3","own":false,"role":"background","text":"Extending the execution horizon amortizes policy inference cost over more actions.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.12,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.11,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.98,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.02}},{"i":4,"p":0.46,"id":"s4","own":false,"role":"background","text":"However, uniformly applying long horizons across episodes can limit opportunities for precise corrections.","hedge":{"p":0.77,"label":"hedged_possibility"},"own_p":0.15,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.09,"role_probabilities":{"gap":0.35,"method":0.0,"result":0.0,"background":0.46,"limitation":0.19,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":5,"p":0.97,"id":"s5","own":true,"role":"contribution","text":"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.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.86,"main_claim_p":0.18,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.0,"method":0.03,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.97,"interpretation":0.0}},{"i":6,"p":0.99,"id":"s6","own":true,"role":"method","text":"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.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.87,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.14,"role_probabilities":{"gap":0.0,"method":0.99,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":7,"p":1.0,"id":"s7","own":true,"role":"method","text":"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.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.87,"main_claim_p":0.08,"quantitative":false,"quantitative_p":0.12,"role_probabilities":{"gap":0.0,"method":1.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":8,"p":1.0,"id":"s8","own":true,"role":"result","text":"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.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.82,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":1.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":1.0,"text":"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.","location":"abstract s8","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":6889,"cost_usd_reported":0.0},"compiled_at":"2026-10-15","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.05,"states_limitation":0.2,"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},"evidential_basis":{"p":0.96,"value":"observation or experiment","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.96,"simulation_or_computation":0.04}},"contribution_type":{"p":1.0,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":1.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":1.0,"text":"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.","location":"abstract s5"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":9,"sentences_in_abstract":9},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}