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

· Source: stat.ML updates on arXiv.org · Field: Technology & Digital — Artificial Intelligence & Machine Learning, AI for Scientific Discovery · Depth: Expert, extended

Summary

Branching Flows, introduced on November 12, 2025, is a novel generative modeling framework designed to overcome the limitations of existing diffusion and flow matching approaches in handling variable-length sequences. Unlike models that require a fixed number of elements, Branching Flows allows the number of elements in a sequence to evolve dynamically during generation. It achieves this by modeling element evolution over a forest of binary trees, where elements branch and die stochastically with learned rates. This framework is highly versatile, composing with any flow matching base process across discrete sets, continuous Euclidean spaces, smooth manifolds, and multimodal product spaces. Demonstrations include small molecule generation, antibody sequence generation, and protein backbone generation, showing it is a capable distribution learner with a stable objective and new capabilities. For instance, 10,000 samples were generated for QM9 and antibody analysis.

Key takeaway

For research scientists developing generative models for complex, variable-length data, Branching Flows provides a unified and robust solution. This framework eliminates the need for ad hoc length-handling mechanisms in diffusion and flow matching models, offering superior control over sequence length during generation. You should explore integrating Branching Flows to simplify model architectures and enhance performance in applications like protein design, small molecule synthesis, or advanced text generation where output length is inherently unknown.

Key insights

Branching Flows enables generative models to naturally handle variable-length sequences by stochastically evolving elements over binary trees.

Principles

Method

Augment a base Markov generator with branching and deletion processes, where elements evolve along a forest of binary trees, splitting and deleting based on learned rates, trained via conditional generator matching.

In practice

Topics

Best for: AI Scientist, Research Scientist

Related on AIssential

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by stat.ML updates on arXiv.org.