Retrieve in Time, Correct in Frequency

• URL: http://arxiv.org/abs/2608.04527v2
• Date: Fri, 07 Aug 2026 01:42:57 GMT
• Title: Retrieve in Time, Correct in Frequency
• Abstract summary: We introduce Retrieve in Time, Correct in Frequency (RTCF), a training-free test-time correction framework.<n>RTCF separates which experience to retrieve from which part of its action to transfer.<n>It raises aggregate success from 86.4% to 88.4% and improves LIBERO-Long from 61.6% to 68.6%.
• Score: 14.108343620177314
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Frozen vision-language-action (VLA) policies generate temporally extended action chunks, but long-horizon manipulation remains vulnerable to accumulated execution error and visual aliasing across task stages. Successful rollouts provide useful corrective evidence, yet current frame retrieval can return progress-misaligned actions,while direct replay or time-domain fusion can overwrite the reactive structure of the policy proposal. We introduce Retrieve in Time, Correct in Frequency (RTCF), a training-free test-time correction framework that improves frozen VLA performance with low model-side overhead.RTCF separates which experience to retrieve from which part of its action to transfer. Progressive Memory Alignment (PMA) causally aligns the growing visual execution history with complete successful trajectories through incrementally updated monotonic frontiers, jointly identifying a relevant memory and the current aligned memory position without stage labels. From the aligned action chunk,RTCF transfers a coefficient-wise-clipped low-frequency residual on motion channels. Higher-frequency components and gripper decisions remain inherited from the frozen policy. Across four LIBERO suites and 2,000 episodes per condition, RTCF raises aggregate success from 86.4% to 88.4% and improves LIBERO-Long from 61.6% to 68.6%.These gains require no parameter updates, repeated VLA inference, or additional GPU resources: correction can be performed on the client CPU after a single policy invocation, and the median latencies sum to only 10.99 ms per action chunk

Related papers

• EmbodiedSkills: A Unified Framework for Orchestrating, Training, and Deploying VLA Agents [56.25120535601186]
  Vision-language-action (VLA) models map visual observations and language instructions directly to robot actions.<n>We propose EmbodiedSkills, a framework that treats each skill decision as an execution proposal.<n>A shared executable-skill interface connects high-level skill selection, bounded low-level VLA execution, and post-action verification.
  arXiv  Detail & Related papers  (2026-09-01T14:14:47Z)
• Hindsight Memory-PRM: Supervising Memory Management with Auditable Hindsight Credit [48.811961095386]
  Hindsight Memory-PRM exploits this audit trail twice.<n> offline to train an operation-conditioned memory-utility critic.<n>Online, where retrievals, citations, and one controlled deletion-and-reanswer per probe settle an intervention-calibrated entry-level presence credit.
  arXiv  Detail & Related papers  (2026-08-30T06:53:13Z)
• AGM: Achievement-Grounded Memory for Closed-Loop Agents with Frozen VLA Policies [17.09836507714724]
  We propose Achievement-Grounded Memory (AGM) for frozen vision-language-action (VLA) policies.<n>AGM represents a task as a subgoal sequence with a progress pointer and advances this memory only after the current subgoal is verified by physical evidence.<n>On the RoboMME Counting benchmark, AGM reaches on PickXTimes and on BinFill, surpassing the strongest memory-augmented baseline by points on average.
  arXiv  Detail & Related papers  (2026-08-30T03:50:49Z)
• CheckVLA: Execution-Time Verification with Action-Conditioned World Model for Long-Horizon Mobile Manipulation [15.532709298240215]
  Vision-language-action (VLA) policies execute long-horizon mobile manipulation through open-loop action chunks.<n>We propose CheckVLA, which verifies execution with a separately trained, frozen action-conditioned world model.<n>On RoboCasa365, under a common training recipe and a matched invocation budget, CheckVLA attains a 36.1% average success rate against 27.6% for periodic replanning.
  arXiv  Detail & Related papers  (2026-07-29T11:31:33Z)
• TFP: Temporally Conditioned Memory-Fusion Policies for Visuomotor Learning [11.149498165285491]
  Vision--Language--Action (VLA) policies such as $_0.5$ and OpenVLA perform well on many tasks, but they are often reactive.<n>We argue that such tasks require not only memory, but dynamics-aware belief updates.
  arXiv  Detail & Related papers  (2026-07-09T09:24:30Z)
• SEAM: Smooth Execution of Action-Chunked Motion for Vision-Language-Action Policies [26.372187124257362]
  Vision-Language-Action (VLA) policies that execute fixed-length action chunks can exhibit multimodal bifurcation.<n>We propose SEAM (Smooth Execution of Action-Chunked Motion), a training-free inference-time method for flow matching VLAs.<n>On LIBERO-10 with pi_0.5, SEAM reduces boundary jerk by 28%, reduces chunk transition discontinuity by 27%, preserves baseline-level task success, and keeps denoising-loop cost near the unguided baseline.
  arXiv  Detail & Related papers  (2026-07-06T02:32:10Z)
• TempAct: Advancing Temporal Plausibility in Autoregressive Video Generation via Planner-Executor RL [72.7712729541565]
  Autoregressive (AR) video diffusion models enable low-latency streaming generation by synthesizing videos chunk by chunk with cached visual context.<n>A single global prompt does not specify which sub-event should be realized in each chunk, while naively switching to step-wise prompts often leads to delayed reactions, blended step semantics, and error propagation across prompt transitions.<n>We address these challenges with TempAct, a planner--executor reinforcement learning framework that jointly optimize temporal decomposition and step-conditioned execution for temporally plausible AR video generation.
  arXiv  Detail & Related papers  (2026-06-26T12:19:28Z)
• VLA-Pro: Cross-Task Procedural Memory Transfer for Vision-Language-Action Models [73.99344788183949]
  VLA-Pro is a plug-and-play framework designed to enhance cross-task generalization.<n>It stores task-relevant procedural memories at training time and transferring these memories during inference.<n>Experiments on RoboTwin, RLBench, and real-world manipulation tasks show that VLA-Pro consistently improves cross-task generalization.
  arXiv  Detail & Related papers  (2026-05-28T08:14:08Z)
• DiscreteRTC: Discrete Diffusion Policies are Natural Asynchronous Executors [57.944744187489185]
  We propose DiscreteRTC, which replaces external corrections with native unmasking.<n>DiscreteRTC is simpler to implement with 0 lines of code for async inpainting, faster at inference with only 0.7x computation compared with generating actions from scratch, and better at execution with 50% higher success rate in real-world dynamic pick task compared with flow-based RTC.
  arXiv  Detail & Related papers  (2026-04-27T23:04:03Z)
• FASTER: Rethinking Real-Time Flow VLAs [82.58822112377923]
  Real-time execution is crucial for deploying Vision-Language-Action (VLA) models in the physical world.<n>We show that reaction time follows a uniform distribution determined jointly by the Time to First Action (TTFA) and the execution horizon.<n>We propose Fast Action Sampling for ImmediaTE Reaction (FASTER) to overcome this issue.
  arXiv  Detail & Related papers  (2026-03-19T17:51:37Z)
• TempoFit: Plug-and-Play Layer-Wise Temporal KV Memory for Long-Horizon Vision-Language-Action Manipulation [16.28432866472846]
  We present TempoFit, a training-free temporal retrofit that upgrades frozen Vision-Language-Action policies through state-level memory.<n>Our key insight is that prefix attention K/V already form a model-native, content-addressable runtime state.<n>On LIBERO-LONG, TempoFit improves strong pretrained backbones by up to +4.0% average success rate while maintaining near-real-time latency.
  arXiv  Detail & Related papers  (2026-03-08T14:17:25Z)
• Real-Time Execution of Action Chunking Flow Policies [49.1574468325115]
  This paper presents a novel inference-time algorithm that enables asynchronous execution of action interacting systems.<n>It is applicable to any diffusion- or VLA-based systems executing out of the box with no re-training.<n>Results show that RTC is fast, performant, and uniquely robust to inference manipulation.
  arXiv  Detail & Related papers  (2025-06-09T01:01:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.