- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper proposes Branching Flow Maps (BFMs), a few-step generative method for variable-length data. Time is divided into fixed stages, with continuous fixed-dimensional flow dynamics within each stage. Each element is additionally augmented with a continuous action variable that determines, at stage boundaries, whether the element is kept, deleted, or split, thereby allowing the dimensionality of the process to change. The method is trained using branching-forest conditional paths and finite flow-map distillation. Experiments on synthetic data, QM9 molecules, and antibody generation demonstrate effective variable-length generation with few neural function evaluations.
Critical strengths
The forest-based branching construction is intuitive and well motivated, providing a natural mechanism for variable-length generation through coordinated splitting and deletion events. The experiments also demonstrate the efficiency of BFM, achieving competitive generation quality with substantially fewer neural function evaluations, along with additional runtime improvements in antibody generation.
Critical weaknesses
-
The efficiency evaluation relies largely on NFE, which does not account for the computational cost of each evaluation. In BFM, the population size changes across stages, and the flow model evolves continuous action variables together with the state, so the cost per NFE may vary across methods and stages. Although wall-clock runtime is reported for the antibody experiment, similar wall-clock or FLOPs-based comparisons should be provided for all experiments to more convincingly support the claimed efficiency gains and their generalizability across architectures and applications.
-
The number and locations of stage boundaries are pre-specified rather than learned. Since the paper shows that the number of stages can affect few-step performance, it would be helpful to provide more intuition or empirical analysis on how to choose these stages for a new data distribution and how sensitive the method is to this hyperparameter.
Questions for authors
-
Can you provide intuition/analysis on how to choose the number and locations of stage boundaries, which is transferable to other data?
-
Can you provide wall-clock or FLOPs-based comparisons for all experiments?
Response to Reviewer Upw1
We thank the reviewer for the review. While it has taken us some time to do so, we believe we have addressed all of the reviewer's concerns, and we hope that the reviewer can consider raising their score in the reviewer/AC discussion period. We address the specific points below:
W1 / Q2: "Computational cost"
An excellent point that was a common concern among reviewers. We now have architecture and compute matched comparisons (see response to reviewer qFy3, W2 / Q2, for more detail), and show NFE and wall clock results (Figures 7–8 and 23; Tables 1, 9, 13 and 16). In summary, with matched architectures there is no substantial overhead for Branching Flow Maps relative to many step approaches (e.g. Branching Flows) and the NFE results closely track the wall-clock results (except when many-step methods collapse into degenerate very short samples at low NFE). We do not provide wallclock sampling timing for the "toy" sinusoid model (just as one would not typically provide these for the classical "spiral" example used in flow matching), but we do include training times.
W2 / Q1: “Intuition / analysis on how to choose the number and locations of stage boundaries”
This is an excellent point and we thank the reviewer for bringing it up. We now have experiments that, for QM9 and Sinusoid tasks, directly compare 2, 3 and 4 stages (Figures 9–10), and then for the standard 4 stage setup we compare linear interval boundaries vs boundaries that are shifted earlier and vs boundaries that are shifted later (Figures 11–12). Note that 2 is the minimum stage count for a Branching Flow Map model. For stage count, the behavior is mostly similar, where the main difference is that stage count puts a lower bound on the NFE you can attempt, and lower stage counts slightly improve the performance at lower NFE. For stage boundary location, we see a mild consistent benefit of "sqrt" spacing (0, 0.5, 0.707, 0.866, 1) for both QM9 and sinusoid (Section 4.2; Appendix D.2; Tables 4 and 10; Appendix E.6).
Our intuition here is that this choice is much like the choice of "schedule" in standard diffusion or flow matching, and we expect there to not be a universal "best" answer here for all tasks, and it will depend, for example, on the length distribution of what you're trying to learn, as well as interacting with other design choices, such as the starting length distribution. For example, for tasks where you have an unknown but relatively tight length distribution, it might suffice to initialize the number of elements close to the mean of that distribution, and then have only a single interval boundary where the length can change, for example, but in other tasks allowing multiple branching stages might be beneficial.
We now discuss this, and describe these experiments, in the manuscript (Sections 4.2 and 5; Appendices D.2 and E.6).