arXiv Machine Learning

Learning Domain Trajectories with Flow Matching for Gradual Domain Adaptation

The paper introduces FlowGDA, a flow‑matching framework for gradual domain adaptation that models adaptation as continuous transport on a statistical manifold. FlowGDA learns time‑dependent velocity fields to generate smooth domain trajectories, avoiding adversarial Min–Max optimization by using a simulation‑free regression objective. The method incorporates source‑anchored transport, semantic consistency loss, and a two‑stage optimization scheme to prevent semantic drift, achieving superior performance over state‑of‑the‑art techniques.

arXiv Machine Learning
Oct 2

A Flow Matching Algorithm for Many-Shot Adaptation to Unseen Distributions

The paper introduces Function Projection for Flow Matching (FP‑FM), an algorithm that conditions generative models directly on samples from a target distribution. FP‑FM learns basis functions spanning velocity fields for training distributions and adapts to new distributions via a simple least‑squares projection, enabling efficient sample generation without additional training at inference time. Variants of the method trade expressivity for computational cost by enriching coefficient calculations, and the approach shows markedly better precision and recall than baselines, especially on unseen distributions.

By Tyler Ingebrand, Ruihan Zhao, Kushagra Gupta, David Fridovich-Keil, Sandeep P. Chinchali, Ufuk Topcu
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
arXiv AI
Oct 12

ReSFlow: Rectifying Categorical Flows on Statistical Manifolds for One-Step Generation

ReSFlow is a generative model that learns geodesic trajectories on statistical manifolds to enable one‑step categorical generation. By rectifying continuous‑time flows to follow intrinsic Riemannian geometry, it reduces transport cost and eliminates the need for multi‑step numerical integration. Experiments across image, text, and biological datasets show that ReSFlow achieves superior one‑step generation quality compared to prior methods.

By Xiaohuan Jia, Renzhe Xu, Xiao Wang, Jiayun Wu, Shaohua Fan
arXiv Machine Learning
Aug 11

CPDA: Class-Conditional Path Distribution Alignment for Unsupervised Time-Series Domain Adaptation

arXiv:2608. 09193v1 Announce Type: cross Abstract: Unsupervised time-series domain adaptation (DA) addresses the challenge of transferring a classifier from a labeled source domain to an unlabeled target domain under distribution shifts induced by different users, sensors, devices, acquisition conditions, or temporal dynamics.

By Felix Ott, Christopher Mutschler
arXiv AI
Oct 2

Unsupervised Domain Adaptation for Enhanced Radiometer Image Precipitation Estimation using Conditional Flow Matching

The paper proposes an unsupervised domain adaptation technique for satellite radiometer images using conditional flow matching models. By leveraging deterministic ODE components of flow matching, the method aligns domains bijectively, preserving essential information across different satellite instruments. Experiments on the GPM-Core constellation demonstrate improved rain precipitation estimation from radiometer imagery.

By Victor Enescu, Assaad Zeghina, Matthieu Meignin, Nicolas Viltard, C\'ecile Mallet