- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The authors incorporates the meta flow map (MFM) to biological application tasks. MFM is the inference steering method toward the posterior distribution p(x)e^r(x) without training. In this paper, the authors extend MFM to two biological task, discrete DNA design task and joint 3D small molecule design task. They propose discrete MFM (dMFM) and multi-modal MFM (multiMFM), which joints the continuous MFM and discrete MFM. Finally, they validate the proposed method on cyclizability-guided DNA design and conditional small-molecule generation tasks and compare it to various steering methods.
Critical strengths
The authors extend the meta flow map to discrete representation. This paper provides the empirical demonstration of dMFM and multiMFM on DNA and small-molecule design. Not only the biological sequence and 3D small molecule design, this framework can be introduced on multiple biological tasks.
Critical weaknesses
- The objective of MFM is shifting the sampling distribution to the posterior distribution p(x)e^r(x) via inference steering. However, the proposed dMFM is not validated that this can yield the same posterior distribution in discrete space. It would be beneficial to show the discrete toy example.
Questions for authors
- Recently, Riemannian mean flow (RMF; [1]) is proposed and demonstrated on DNA design task. Please compare against it on the same DNA task under comparable computational budgets, reporting the rewards or target errors. This comparison would help establish whether stochastic posterior look-ahead provides sufficient benefits to justify its additional sampling cost.
- Is the reward call count matched to other baselines?
- What are the limitations of the proposed method, and for what types of applications is it most suitable?
- Please report uncertainty estimates (std) for the proposed methods in Table 2.
Reference
- Woo, Dongyeop, et al. "Riemannian MeanFlow." ICML 2026
2 comments
Thank you for response and additional experiments and analysis. I'll maintain my score (3).
benchmark RMF (FMAP), clarifying reward counts and limitations and uncertainties
Thank you for the questions. We added an exact discrete toy test of the tilted distribution, a comparison with RMF-style endpoint guidance, explicit reward-call counts, and standard deviations for Table 2.
W1. Toy Example
Yes. We tested it on all 256 sequences in {A,C,G,T}4. The base law p1 is known there, so the tilted target p(x)p1(x)er(x) can be normalized exactly. Over 500,000 guided samples, the empirical distribution q is within total variation distance 0.0058 of p, compared with 0.394 for the unguided p1. In other words, the guided samples get the probability of any set of sequences right to within 0.6 percentage points. The match improves with finer integration, and the best guidance coefficient in our sweep is the one the theory predicts. We will add the toy example into the revised manuscript.
Q1. Comparison with RMF
RMF guides with the reward gradient of a single deterministic endpoint, xtr(t1(xt)) (RMF, Sec. 3.4). We implemented this rule (FMAP) on our own base generator and reward, so the only difference from dMFM is the guidance signal: one deterministic continuation versus reward-weighted posterior samples. At a slightly lower billed budget, dMFM gives 10% lower error than FMAP, and it also beats DPS, FK, and best-of-N at similar budgets (Table Asio-1). We billed FMAP's entire teacher solve as one call, which favors FMAP.
Table Asio-1. Posterior guidance versus endpoint guidance and search on DNA.
Cyclizability target y=0.30, held-out oracle; mean ± SEM for the guided methods.
Q2. clarifying whether reward calls are matched
Not exactly. We match the billed budget and report reward calls, backward work, and GPU time separately (Table Asio-2). On DNA, Eq. (4) makes the same forward and reward calls as Eq. (3) but needs no backward passes, which cuts GPU time by 49%; it is also 35% faster than direct GLASS. On QM9, multiMFM makes about as many reward calls as FK, but its backward passes make it slower per output than DPS or FK. To compare accuracy at matched sampling budget and PB-validity floor, Please refer to Table 4Jmz-3 replying to reviewer 4Jmz-3 where multiMFM outperforms baselines with PB-validity floor held at 75%.
Table Asio-2. Generator work, reward work, and measured sampling time.
DNA: one H200, length 50. QM9: one A100; the timed settings is the same as the accuracy runs.
Q3. Best use and limitations
Our method is most useful for hard design problems at limited inference budgets: rare target values, or several requirements that must hold at once. On GEOM-Drugs, best-of-4 wins on the two easiest radius-of-gyration targets, but multiMFM wins on the six harder ones, with 19% lower error at the hardest. On DNA, dMFM keeps its advantage up to length 400 with four motifs required at once. Because the sampler does not depend on the reward, it can be reused when objectives change. The main limitations are that guidance strength must be tuned against validity (too much guidance worsens both error and validity), that search does better under very tight limits on sequence-statistic drift, and that results depend on the quality of the distilled sampler and the reward model.
Q4. Standard deviations in Table 2
We now report mean ± SD over three seeds, with 1,000 outputs per property each, for multiMFM and steer-search (SS). These are new evaluation runs and replace the numbers in the submission.
Table Asio-3. Table 2 results with standard deviations.