arXiv Machine Learning

Multi-Marginal Flow Matching with Adversarially Learnt Interpolants

arXiv Machine Learning
Aug 5

Trajectory inference via Acceleration Matching

arXiv:2608. 03916v1 Announce Type: new Abstract: Trajectory inference is a fundamental problem in many scientific domains: given a collection of unpaired snapshots of observations at discrete time points, the goal is to generate smooth trajectories that best resemble and interpolate the data.

By Bartolo Dazzini, Giovanni Conforti, Alain Durmus, Aram-Alexandre Pooladian
arXiv Machine Learning
Aug 5

Information-Geometric Forward Policy Training in GFlowNets

arXiv:2608. 03967v1 Announce Type: cross Abstract: Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward.

By Yordan Raykov, Rodrigo Veiga
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
1d ago

Walking the Score Manifold: Continuous-time Generative Dynamics on Learned Data Manifolds

The paper proposes a continuous‑time generative framework that models time‑dependent data as evolution on a learned data manifold. By using pretrained score‑based models as geometric priors, it learns a vector field that drives data along score‑induced interpolation paths, enabling generation at arbitrary timestamps and temporal super‑resolution. The method includes a regression‑based training objective, a stability‑promoting term interpreted as denoising score matching, and a probabilistic extension for future trajectory distributions, demonstrated on natural video, PDE‑based fields, and molecular dynamics.

By Jan Tauberschmidt, Brian B. Moser, Stanislav Frolov, Andreas Dengel, Andrew B. Duncan, Sebastian J. Vollmer
arXiv Machine Learning
Aug 28

COFM: Consistent Optimal Transport Flow Matching via Partially Input Convex Neural Networks

The paper introduces COFM, a framework for consistent optimal transport flow matching that uses partially input convex neural networks (PICNN) to parameterize the transport potential. By adding a Hamilton‑Jacobi residual to the training objective, COFM enforces dynamical consistency and supports both one‑step transport and multi‑step ODE sampling without costly inner optimization. Experiments on benchmark datasets show that COFM achieves competitive performance while reducing L^2‑UVP by over 2× and cutting computational time by about 9× compared to state‑of‑the‑art models.

By Fanghui Song, Zhongjian Wang, Jiebao Sun
arXiv AI
Aug 24

ReCurveflow: A Flow Matching Framework that Learns Curved Reaction Trajectories to Predict Transition State Geometries

ReCurveflow is a flow‑matching framework that learns to predict transition state geometries by training on continuously curved reference paths derived from full NEB bands, rather than straight linear paths. It introduces an off‑path correction mechanism that generates corrective velocity fields when the model encounters geometries off the training path, improving resistance to exposure bias and TS prediction accuracy. Across multiple data splits and evaluation metrics, ReCurveflow outperforms seven baselines and produces reaction trajectories whose energy profiles closely follow the reference NEB path, aiding NEB optimization and demonstrating effective corrective behavior.

By Seungheun Baek, Mogan Gim, Jaewoo Kang