arXiv Machine Learning

Branching Flows: Discrete, Continuous, and Manifold Flow Matching with Splits and Deletions

arXiv:2511. 09465v4 Announce Type: replace-cross Abstract: Diffusion and flow matching approaches to generative modeling have shown promise in domains where the state space is continuous, such as image generation or protein folding & design, and discrete, exemplified by diffusion large language models.

arXiv AI
Sep 15

Branched Optimal Transport Amortization

arXiv:2609.15072v1 Announce Type: cross Abstract: Methods of Branched Optimal Transport (BOT) mimic the economy and efficiency of natural tree-like structures, such as those found in rivers and biolo...

By Semyon Semenov, Viktor Kovalchuk, Meir Roketlishvili, Albert Baichorov, Fakhri Karray, Martin Takac, Arip Asadulaev
arXiv Machine Learning
Sep 11

Particle GFlowNets: Rethinking Generative Marginalization Models

The paper introduces Particle GFlowNets, showing that Generative Marginalization Models (MaMs) are equivalent to Generative Flow Networks. It extends MaMs to non‑autoregressive sampling and proposes an automatic full‑state rejuvenation criterion based on the Gelman‑Rubin statistic to accelerate learning. Experiments demonstrate significant training speedups in large combinatorial spaces.

By Tiago da Silva, Diego Mesquita, Salem Lahlou
arXiv Machine Learning
1d ago

dFlowGRPO: Rate-Aware Policy Optimization for Discrete Flow Models

The paper introduces dFlowGRPO, a reinforcement learning framework tailored for discrete flow models (DFMs). It generalizes previous work on diffusion large language models by supporting various probability paths and non-masked source distributions, and formulates denoising as a Markov decision process that leverages transition rates and posterior models. Experiments on the multimodal DFM FUDOKI show that dFlowGRPO outperforms existing GRPO methods on text‑to‑image generation and matches continuous flow models on multimodal understanding tasks.

By Zhengyan Wan, Yidong Ouyang, Panwen Hu, Qiang Sun
arXiv Machine Learning
2d ago

RW-Flow: One-Step Generation on Compact Manifolds via Wasserstein Gradient Flows

RW-Flow presents a new one‑step generative framework for data on compact manifolds, leveraging Wasserstein gradient flows. The authors derive a necessary and sufficient identifiability condition for velocity fields on compact, connected Riemannian manifolds, showing that a symmetric, Lipschitz‑continuous cost function yields identifiability iff its Gibbs kernel is nondegenerate. Experiments on geospatial events, protein and RNA torsion angles, and discretized manifolds demonstrate that RW‑Flow surpasses existing one‑step methods across most benchmark settings.

By Ualibyek Nurgulan, Seungwoo Yoo, Prin Phunyaphibarn, Minhyuk Sung