arXiv AI

Bi-Anchor Interpolation Solver for Accelerating Generative Modeling

arXiv:2601. 21542v3 Announce Type: replace-cross Abstract: Flow Matching (FM) models have emerged as a leading paradigm for high-fidelity synthesis.

arXiv Machine Learning
Jun 10

Exploring the Design Space of Reward Backpropagation for Flow Matching

arXiv:2606. 11075v1 Announce Type: new Abstract: Aligning text-to-image flow matching models with human preferences via direct reward backpropagation is sample-efficient but hampered by two well-known pathologies: activations cannot be stored across the full sampling trajectory at modern model scale, and chained Jacobian products across steps inflate the reward gradient as it travels back to early indices.

By Ruoyu Wang, Boye Niu, Xiangxin Zhou, Yushi Huang, Tongliang Liu, Chi Zhang
arXiv Computer Vision
Sep 17

FlashAR: Efficient Post-Training Acceleration for Autoregressive Image Generation

FlashAR is a lightweight post‑training adaptation framework that converts a pre‑trained raster‑scan autoregressive image model into a highly parallel generator using two‑way next‑token prediction. It preserves the original training objective by keeping the horizontal head for row‑wise prediction and adding a lightweight vertical head for column‑wise prediction, with a learnable fusion gate to combine the two predictions. A two‑stage adaptation pipeline—first initializing the vertical head from the pre‑trained model and then jointly fine‑tuning—yields up to a 22.9× speedup for 512×512 image generation while using only 0.05% of the original training data.

By Junkang Zhou, Yefei He, Feng Chen, Weijie Wang, Bohan Zhuang
arXiv AI
Aug 25

ChebBooster: A Training-Free Approach for Efficient Diffusion Transformer Inference via Chebyshev-Inspired Extrapolation

ChebBooster is a training‑free extrapolation framework that accelerates Diffusion Transformers (DiTs) by using Chebyshev polynomial theory. It employs a Barycentric formulation for numerically stable evaluation and separates the process into an offline weight precomputation phase and a lightweight online application stage. Experiments on DiT‑XL/2, PixArt‑Σ, and FLUX.1‑dev show consistent visual quality gains and up to 3.68× latency speedup and 5.12× FLOPs reduction compared to existing training‑free baselines.

By Chengjie Lu, Tianchi Deng, Zhengqi He, Chengwen Luo, Xueliang Li
arXiv AI
Sep 2

Training-Free Refinement of Flow Matching with Divergence-based Sampling

The paper introduces Flow Divergence Sampler (FDS), a training‑free method that refines intermediate states in flow‑matching models by using the divergence of the marginal velocity field to detect and correct misguidance toward low‑density regions. FDS operates during inference, requires no additional training, and can be applied as a plug‑and‑play module with standard solvers and existing flow backbones. Experiments show that FDS consistently improves fidelity in tasks such as text‑to‑image synthesis and inverse problems.

By Yeonwoo Cha, Jaehoon Yoo, Semin Kim, Yunseo Park, Jinhyeon Kwon, Seunghoon Hong
Hugging Face Trending Papers
Aug 6

Energy-Guided Flow Matching

Pixel-space generative models bypass lossy latent compression, yet necessitate joint learning of global structure and fine-grained details in a high-dimensional space. Standard flow matching interpolates noise toward a fixed clean-image endpoint, leaving the spectral evolution to be learned implicitly.

arXiv Machine Learning
Sep 15

A Variational Optimal Transport Operator on Incompressible Flow

The paper introduces the Variational Incompressible Optimal Transport (VIOT) operator, a generative neural operator that predicts divergence‑free velocity fields for incompressible density transport. VIOT combines a stream‑function representation, a regularized transport objective, and a Fourier Neural Operator backbone to amortize the solve across new source‑target pairs and grid resolutions. Experiments on 2D and 3D benchmarks show that VIOT produces full transport trajectories in seconds, achieving roughly a $10^4 imes$ speedup over per‑instance baselines that require hours of optimization.

By Jinjin He, Shenyifan Lu, Sinan Wang, Zhiqi Li, Duowen Chen, Bo Zhu