arXiv Computer Vision By Kian Hosseinkhani (Simon Fraser University), Qinhe Peng (University of Pennsylvania), George Shramko (Simon Fraser University), Mehran Aghabozorgi (Simon Fraser University), Jianing Qian (University of Pennsylvania), Tristan Engst (Simon Fraser University), Alireza Moazeni (Simon Fraser University), Dinesh Jayaraman (University of Pennsylvania), Ke Li (Simon Fraser University, Canada CIFAR AI Chair)

IMLE-VLA: Fast Single-Step Action Generation for Vision-Language-Action Policies

Read the original on arXiv Computer Vision →

IMLE‑VLA replaces the iterative action head in vision‑language‑action policies with a single‑step conditional generator trained via conditional Implicit Maximum Likelihood Estimation (cIMLE). This eliminates multi‑step sampling, boosting inference frequency by 3.67× (55 Hz vs. 15 Hz) and achieving the highest average success rate (98.0 %) on the 40‑task LIBERO benchmark while maintaining robustness under perturbations. Real‑world tests on a Franka Emika Panda show smoother, faster motions and a 3.9×–6.6× reduction in inference time per episode.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computer Vision.

arXiv Computer Vision
Oct 19

MambaAct: Efficient Mamba Action Experts for Flow-Matching Vision-Language-Action Models

MambaAct introduces a compact Mamba-based action expert to replace the transformer-based expert in flow‑matching vision‑language‑action models, preserving the pretrained visual‑language prefix encoder while reducing the action expert size by tenfold. The new design employs a lightweight Context Compressor to embed vision‑language conditioning into each Mamba block, eliminating repeated token‑level cross‑attention. Experiments show a 64.8 % reduction in denoising latency on LIBERO and 58.8 % in real‑world deployment, with a modest 1.08 % increase in mean success rate across multiple fine‑tuning seeds.

By Khuyen Pham, Tran Nguyen Le, Edoardo Fazzari, Cesare Stefanini
arXiv Machine Learning
Sep 25

Decoupled Early Exits for Task-Dependent Compute Allocation in Flow-Matching VLAs

The paper introduces a framework for Flow‑Matching Vision‑Language‑Action (VLA) models that allows independent adjustment of backbone depth, action expert depth, and denoising steps. Lightweight Exit Transformers are added at intermediate layers to enable early exits, and a KV Cache synthesis mechanism manages skipped layers so the action expert can exit deeper than the backbone. Experiments on SmolVLA and π0.5 across LIBERO and Meta‑World show that joint tuning of these compute axes reduces latency by 79.2 % and FLOPs by 31.8 %, while improving mean success rate by 5.6 %.

By Riccardo Andrea Izzo, Rimvydas Rubavicius, Gianluca Bardaro, Subramanian Ramamoorthy, Matteo Matteucci, Alessandro Suglia
arXiv AI
Sep 1

CF-VLA: Efficient Coarse-to-Fine Action Generation for Vision-Language-Action Policies

CF‑VLA introduces a two‑stage coarse‑to‑fine approach for vision‑language‑action policies, replacing multi‑step sampling with a coarse initialization that constructs an action‑aware starting point and a single‑step refinement that corrects residual errors. The coarse stage learns a conditional posterior over endpoint velocity to transform Gaussian noise into a structured initialization, while the fine stage performs a fixed‑time refinement. Experiments on CALVIN and LIBERO demonstrate that CF‑VLA achieves a strong efficiency‑performance trade‑off, reducing action sampling latency by 75.4 % and achieving an 83.0 % real‑robot success rate, outperforming existing NFE=2 methods and matching or surpassing NFE=10 baselines.

By Fan Du, Feng Yan, Jianxiong Wu, Xinrun Xu, Weiye Zhang, Weinong Wang, Yu Guo, Bin Qian, Zhihai He, Fei Wang, Heng Yang
arXiv AI
4d ago

TOPS: Reshaping Flow Source and Transport for Multi-Task Robot Manipulation

TOPS (Task‑Oriented Priors and Schedules) adapts flow‑based policies for language‑conditioned multi‑task robot manipulation by customizing the flow source prior and interpolation schedule per task without changing the network architecture. It constructs multimodal task sources from reverse‑mapped expert action sequences, allowing language instructions to select the generation start point, and adjusts the denoising schedule based on source‑target covariance mismatch to reduce velocity‑prediction risk. Experiments on LIBERO, LIBERO‑Plus, CALVIN, and real‑world tasks show significant performance gains, including a jump from 53.44 % to 69.67 % success on LIBERO‑10 with a single integration step and a five‑fold reduction in inference time.

By Tuo An, Chuhao Zhou, Jiahua Dong, Jingliang Li, Jiaqi Bai, Jindou Jia, Jianfei Yang