{"paper":{"title":"Faster-WAM: Efficient Inference-Time Future Conditioning for Robust World Action Models","arxiv_id":"2608.04404","primary_cat":"cs.CV","submitted_at":"2026-08-05T03:18:58+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":"World Action Models (WAMs) improve robot manipulation by learning how the environment evolves beyond the current observation.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.06,"main_claim_p":0.03,"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.61,"id":"s1","own":false,"role":"background","text":"However, existing approaches face a fundamental dilemma: Joint-WAMs preserve future-aware representations during inference but incur prohibitive computation costs, while efficient alternatives remove future modeling at inference time and may lose the robustness benefits of temporal reasoning.","hedge":{"p":0.92,"label":"asserted"},"own_p":0.07,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.35,"role_probabilities":{"gap":0.39,"method":0.0,"result":0.0,"background":0.61,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":0.57,"id":"s2","own":true,"role":"result","text":"In this work, we revisit the role of future representations in WAMs and show that inference-time future conditioning is critical for generalization under distribution shifts.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.88,"main_claim_p":0.56,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.03,"method":0.0,"result":0.57,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.24,"interpretation":0.16}},{"i":3,"p":0.92,"id":"s3","own":true,"role":"contribution","text":"This observation motivates Faster-WAM, an efficient future-conditioning WAM that preserves future representations while avoiding expensive video-action interaction.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.77,"main_claim_p":0.2,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.08,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.92,"interpretation":0.0}},{"i":4,"p":0.85,"id":"s4","own":true,"role":"method","text":"Faster-WAM introduces a sparse future-conditioning framework that computes future representations once and selectively reuses them throughout action denoising.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.87,"main_claim_p":0.11,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":0.85,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.15,"interpretation":0.0}},{"i":5,"p":0.95,"id":"s5","own":true,"role":"method","text":"Specifically, we propose SparseMoT to replace ubiquitous layer-wise fusion with selective video-action interaction at a compact subset of network stages, and Interval KV-Fusion to aggregate multi-depth future representations without increasing attention complexity.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.91,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.0,"method":0.95,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.05,"interpretation":0.0}},{"i":6,"p":0.98,"id":"s6","own":true,"role":"result","text":"Experiments demonstrate that Faster-WAM achieves a substantially better performance-efficiency trade-off than existing WAMs.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.51,"quantitative":true,"quantitative_p":0.52,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.98,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.02}},{"i":7,"p":1.0,"id":"s7","own":true,"role":"result","text":"On the out-of-distribution LIBERO-Plus benchmark, Faster-WAM improves success rate from 49.14% to 73.57% compared with Fast-WAM, while running 2.21$\\times$ faster than Joint-WAM.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.22,"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}},{"i":8,"p":1.0,"id":"s8","own":true,"role":"result","text":"It further achieves state-of-the-art performance on LIBERO and RoboTwin 2.0, while demonstrating strong robustness in real-world manipulation.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.18,"quantitative":false,"quantitative_p":0.15,"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":0.87,"text":"Experiments demonstrate that Faster-WAM achieves a substantially better performance-efficiency trade-off than existing WAMs.","location":"abstract s6","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":7062,"cost_usd_reported":0.0},"compiled_at":"2026-09-23","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.07,"states_limitation":0.1,"human_participants":0.05,"controlled_comparison":0.93,"randomized_assignment":0.01,"states_quantitative_result":0.99,"compares_with_prior_results":0.98,"mentions_code_or_data_availability":0.03},"evidential_basis":{"p":0.99,"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.99,"simulation_or_computation":0.01}},"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":0.48,"text":"Specifically, we propose SparseMoT to replace ubiquitous layer-wise fusion with selective video-action interaction at a compact subset of network stages, and Interval KV-Fusion to aggregate multi-depth future representations without increasing attention complexity.","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"}}}