Skip to content
Preprint

ReAL: Accelerating Flow Matching through Segment Advancement with Shared Lookahead

Sep 2026 · 0 citations · 72 references
Computer Science

TL;DR

This work introduces ReAL, a training-free sampler that selects how far to advance using one shared lookahead, and shows that the discrepancy between uncorrected and lookahead-corrected endpoint proposals can be computed directly from the observed velocity mismatch and the candidate span beyond the lookahead.

Abstract

Flow-matching models generate high-quality images and videos, but repeated neural network evaluations make sampling expensive. Skipping evaluations reduces this cost by extending an available velocity estimate over a longer span. However, local velocity agreement alone does not determine a suitable span, and checking each candidate endpoint adds costly model calls. We introduce ReAL, a training-free sampler that selects how far to advance using one shared lookahead. Our key insight is that the discrepancy between uncorrected and lookahead-corrected endpoint proposals can be computed directly from the observed velocity mismatch and the candidate span beyond the lookahead. This relation provides a span-dependent selection criterion without additional endpoint evaluations. The same lookahead selects the longest passing candidate span, corrects the accepted update, and supplies its velocity as the next starting estimate. After initialization, each regular iteration requires only one fresh evaluation. ReAL uses the pretrained velocity output and original noise schedule, with no additional training or access to internal features. Experiments cover four image-generation backbones, video generation, and image editing. ReAL achieves 4.91x measured speedup on FLUX.1-dev while retaining 97.0% of dense mean ImageReward. On HunyuanVideo, it achieves a 5.49x speedup while maintaining a VBench score close to that of dense sampling.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

Training-Free Hidden-State Refinement for Flow-Matching Image Generators

A training-free looping framework that repeatedly applies selected transformer layers inside each denoising call is introduced, which improves primary and auxiliary quality metrics with competitive quality--efficiency trade-offs across two Scale-RAE model scales.

Yuan-Yi Yan, Xin-Zhe Rao, Can-Yu Shen et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Contextual Flow Matching: Adaptive Step Selection in Flow Models for Efficient Visual Generation

Flow Matching enables high-quality visual generation via continuous-time dynamics, but inference remains costly due to multiple sequential function evaluations. Existing acceleration methods reduce the number of function evaluations but often introduce additional training overhead, degrade quality, or fail to account f...

D. J. Bajpai, Arun Verma, M. Hanawal · 0 citations
#machine learning Preprint Oct 2026

Sparse Planning in Visual World Models via Cost Gradients

Token-based world models enable fine-grained latent planning, but repeatedly processing large spatial token grids makes action search expensive. We introduce COSTGRAD, a training-free, goal-conditioned selector that ranks spatial tokens by the gradient norm of the planning cost with respect to each input token. By deri...

Ying-Chen Xu, Edward Grefenstette · 0 citations
#machine learning Preprint Sep 2026

SPeaR: Test-Time Adaptation with Steering Primitives for Realigning Representations

Test-time adaptation (TTA) addresses distribution shift using only unlabeled test data. Existing methods typically adapt pretrained models by updating their parameters, limiting both what is adapted and where adaptation can occur within the network. We instead keep the pretrained network frozen and steer its intermedia...

Muhammad Sudipto Siam Dip, Ali Etemad · 0 citations
#artificial intelligence Preprint Sep 2026

StackTok: Accelerating VLMs Inference with Budget-Adaptive Visual Token Selection

StackTok is introduced, a training-free selector that treats query relevance as the objective and visual coverage as budget-calibrated support in vision-language models and ranks first among training-free selectors in every tested model--budget setting.

Zhen-Bin Wang, Lei Zhang, Li-Tuan Wang et al. · 0 citations
Preprint Oct 2026

FASTER: Fast Adjoint Stochastic Transport for Endpoint Refinement in Reward-Guided Image Editing

Reward-guided image editing at test time seeks to improve a specified reward while preserving source content and visual plausibility. Many existing approaches optimize candidates through pretrained generation processes, making repeated adjustment depend on costly large-model execution and, in some cases, backbone backp...

Yi-Miao Zhou, Ze-Jia Zhong, Jing-Ya Wang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.