PulseAugur
EN
LIVE 22:23:29

New research advances Rectified Flow and Flow Matching generative models · 10 sources tracked

Researchers are exploring new methods within the framework of Rectified Flow (RF) and Flow Matching (FM) generative models. One approach, Self-Consistent Flow (SC-Flow), unifies velocity and endpoint prediction to stabilize training and improve generation quality. Another area of investigation focuses on understanding and mitigating memorization in RF models, with new metrics developed to detect privacy risks. Additionally, techniques like Velocity Scheduled Flow Matching (VSFM) are being introduced to enhance sampling efficiency and generation fidelity by adjusting the speed profile during inference and training. Finally, Reward Transport offers a novel way to control generated properties by aligning noise and data based on target attributes. AI

IMPACT These advancements in Flow Matching and Rectified Flow models could lead to more efficient, higher-fidelity generative models with better control over data properties and reduced memorization risks.

RANK_REASON Multiple arXiv papers introducing novel methods and analyses within the Flow Matching and Rectified Flow generative modeling frameworks.

Read on Hugging Face Daily Papers →

AI-generated summary · Google Gemini · from 15 sources. How we write summaries →

New research advances Rectified Flow and Flow Matching generative models · 10 sources tracked

COVERAGE [15]

  1. arXiv cs.AI TIER_1 English(EN) · Xu Han, Jiajing Hu, Li-Ping Liu ·

    Self-Consistent Flow: Unifying Velocity and Endpoint Prediction for Rectified Flow Models

    arXiv:2607.12171v1 Announce Type: cross Abstract: In rectified-flow-based generative models, the neural network can be trained to predict two different targets, such as the instantaneous velocity or the data endpoint, to perform denoising. Although prior work shows that these par…

  2. arXiv cs.LG TIER_1 English(EN) · Mingxing Rao, Daniel Moyer ·

    Generalization and Memorization in Rectified Flow

    arXiv:2603.13421v2 Announce Type: replace Abstract: Generative models based on the Flow Matching objective, particularly Rectified Flow, have emerged as a dominant paradigm for efficient, high-fidelity image synthesis. However, while existing research heavily prioritizes generati…

  3. arXiv cs.LG TIER_1 English(EN) · Gianluca Galletti, Gerald Gutenbrunner, William Hornsby, Lorenzo Zanisi, Naomi Carey, Stanislas Pamela, Johannes Brandstetter, Fabian Paischer ·

    A Shortcut to Statistically Steady-State Turbulence with Flow Matching

    arXiv:2607.13022v1 Announce Type: cross Abstract: Many nonlinear physical systems exhibit an initial transient phase in which perturbations grow before nonlinear interactions lead to a statistically steady state. While this saturated regime is of primary interest, direct numerica…

  4. arXiv cs.LG TIER_1 English(EN) · Shuchan Wang ·

    The Geometry of Memorization: Finite-Time Spectral Sensitivity as a Diagnostic for Flow Matching Models

    arXiv:2607.12616v1 Announce Type: new Abstract: Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields. While theoretical targets favor straight trajectories, empirical networks develop comple…

  5. Hugging Face Daily Papers TIER_1 English(EN) ·

    A Shortcut to Statistically Steady-State Turbulence with Flow Matching

    Many nonlinear physical systems exhibit an initial transient phase in which perturbations grow before nonlinear interactions lead to a statistically steady state. While this saturated regime is of primary interest, direct numerical simulations must resolve the full transient dyna…

  6. arXiv cs.LG TIER_1 English(EN) · Fabian Paischer ·

    A Shortcut to Statistically Steady-State Turbulence with Flow Matching

    Many nonlinear physical systems exhibit an initial transient phase in which perturbations grow before nonlinear interactions lead to a statistically steady state. While this saturated regime is of primary interest, direct numerical simulations must resolve the full transient dyna…

  7. arXiv cs.LG TIER_1 English(EN) · Shuchan Wang ·

    The Geometry of Memorization: Finite-Time Spectral Sensitivity as a Diagnostic for Flow Matching Models

    Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields. While theoretical targets favor straight trajectories, empirical networks develop complex path deformations. This paper presents the Fin…

  8. Hugging Face Daily Papers TIER_1 English(EN) ·

    The Geometry of Memorization: Finite-Time Spectral Sensitivity as a Diagnostic for Flow Matching Models

    Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields. While theoretical targets favor straight trajectories, empirical networks develop complex path deformations. This paper presents the Fin…

  9. arXiv cs.LG TIER_1 English(EN) · Vitalii Bondar ·

    Velocity Scheduled Flow Matching

    arXiv:2607.11442v1 Announce Type: new Abstract: Flow matching trains a neural network to regress the conditional velocity along a linear interpolant between noise and data, and the number of network evaluations~(NFE) sets the cost of sampling. The straight-line interpolant carrie…

  10. Hugging Face Daily Papers TIER_1 English(EN) ·

    Velocity Scheduled Flow Matching

    Flow matching trains a neural network to regress the conditional velocity along a linear interpolant between noise and data, and the number of network evaluations~(NFE) sets the cost of sampling. The straight-line interpolant carries an implicit choice: the sample moves at consta…

  11. arXiv cs.LG TIER_1 English(EN) · Vitalii Bondar ·

    Velocity Scheduled Flow Matching

    Flow matching trains a neural network to regress the conditional velocity along a linear interpolant between noise and data, and the number of network evaluations~(NFE) sets the cost of sampling. The straight-line interpolant carries an implicit choice: the sample moves at consta…

  12. arXiv cs.AI TIER_1 English(EN) · Kehan Guo, Yili Shen, Yujun Zhou, Yue Huang, Chujie Gao, Shiyi Du, Xiangliang Zhang ·

    Reward Transport: Property Control in Flow Matching via Noise-Space Alignment

    arXiv:2607.08781v1 Announce Type: cross Abstract: The coupling in flow matching -- the rule pairing noise vectors with data points -- is typically treated as a computational choice. We show that this coupling can instead serve as an alignment interface: by matching noise and data…

  13. Hugging Face Daily Papers TIER_1 English(EN) ·

    Constrained Flow Matching via Lagrangian Dual Flows

    Flow matching is a powerful tool for generative modeling, but emerging applications in robotics, planning, and physics require inference-time constraints on generated outputs. Such constraints are often complex and highly nonlinear. As a result, methods designed for linear constr…

  14. arXiv stat.ML TIER_1 English(EN) · Zhouhao Yang, Yezhen Wang, Kenji Kawaguchi, Vladimir Braverman, Haoyang Cao ·

    Heavy-Tailed Flow Matching via Random Clocks

    arXiv:2607.13841v1 Announce Type: cross Abstract: Heavy-tailed data arise in many domains where rare events carry disproportionate importance, such as imbalanced image datasets, financial returns, and weather extremes. Standard diffusion and flow-matching models typically begin f…

  15. arXiv stat.ML TIER_1 English(EN) · Haoyang Cao ·

    Heavy-Tailed Flow Matching via Random Clocks

    Heavy-tailed data arise in many domains where rare events carry disproportionate importance, such as imbalanced image datasets, financial returns, and weather extremes. Standard diffusion and flow-matching models typically begin from Gaussian noise or Gaussian source distribution…