- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper introduces a simple inference-time guidance mechanism for EditFlows applied to DNA generation. The key idea is to perform bounded tree search in the presence of a reward model that accepts intermediate states. The paper proposes model-specific and application-specific design choices, such as action type restrictions and local edits. The experiments show that the proposed approach outperforms simple guidance methods like CEM, Beam, TDS and SMC. The ablations also clarify the impact of the specific design choices proposed in the paper.
Critical strengths
Writing: The paper is well written and easy to follow.
Sound: The claims about the proposed method are measured and well supported by the experiments.
Critical weaknesses
Positioning and Significance: Currently, the paper comes across as a method for tree-search-based guidance for EditFlows applied to DNA generation. The claims are measured and supported by the experiments, but it is unclear whether the proposed method and observations generalize beyond the experiments presented. Moreover, the paper omits fixed-length generative models and the corresponding guidance methods (see my questions below), making it hard to situate the results relative to contemporary approaches that solve the same problem.
Questions for authors
- The choice of limiting the lookahead to H=2 seems a little arbitrary. What is the motivation behind picking H=2 and how does the performance change with H>2 under the same query budget?
- What is the motivation for the definition of ST-after type restriction rule? The ablations show that they have a meaningful impact, but there isn't sufficient explanation as to why.
- For Table 1 and Table 2, how is the computational budget for each method accounted?
- There have been other tree-based guidance methods proposed for fixed-length discrete diffusion models like [3] and [4]. Could you briefly discuss why those approaches cannot be applied/extended to the edit-based formulation? Such a discussion would better ground the specific design choices for LPDP.
Minor points and clarifications
- Could you incorporate newer variable-length generation models into the related work discussion alongside Insertion Transformers (Stern et. al.)
- Is the two-step procedure of equations 5 and 6 necessary? If is large enough, would it be equivalent to taking top-K directly?
[1] Expanding Flow Maps https://arxiv.org/pdf/2607.21585
[2] DILMs: https://arxiv.org/abs/2606.10199
[3] TreeG: https://arxiv.org/abs/2502.11420
[4] PepTune: https://arxiv.org/abs/2412.17780
5 comments
Depth saturates by H=3, and H=4 improves neither task (enhancer −0.0443 and splice −0.0019 relative to H=3, for 1,584 and 1,455 additional calls). We keep H=2 as the common default because it wins at matched cost on enhancer, is within 0.025 of the best setting on splice, and is the cheaper of the two. The remaining task-dependence is a one-step difference rather than a wide tuning surface.
Q2. Why ST-after, beyond simply pruning more candidates?
ST-after is deliberately the weakest form of type restriction. By Eq. (10) it is a subset of the Mixed shortlist, so it never leaves the candidate set the base model already ranked highest, and it falls back to Mixed when the subset is empty. ST-first (Eq. 11) instead re-ranks within the same-type subset of the entire neighborhood and can promote actions the base prior ranked low. That asymmetry is the design motivation, and it predicts the existing ablation.
Table Q2-A. Paired candidate-rule differences against Mixed, Max backup fixed (T10; N=500).
| Rule | Enhancer | Splice |
|---|---|---|
| ST-after − Mixed | +0.011 [0.005, 0.018] | +0.044 [0.027, 0.063] |
| ST-first − Mixed | −0.076 [−0.101, −0.050] | +0.049 [0.032, 0.069] |
The mild restriction is positive on both tasks; the aggressive one helps splice but reduces enhancer reward. ST-after is therefore the restriction we can apply without overriding the generator's own ranking, which is why it is our default rather than ST-first.
Why type consistency helps at all. Continuations are anchored on the most recent edit (Eq. 7). An insertion or deletion shifts downstream coordinates, so a same-type continuation at the moved anchor extends one coherent length change, whereas switching modality immediately after an indel spends the lookahead on a different edit type in a coordinate frame that has just moved. For substitutions the anchor is stable and same-type continuation refines the same local motif. This is consistent with the reward geometries reported in §4: splice reward is concentrated at two junctions, where same-type coherence is useful, whereas enhancer activity depends on distributed motif content, where mixed-type flexibility retains value.
The effect is not merely pruning. At matched local cardinality per state/root, candidate identity still matters.
Table Q2-B. Same-cardinality pruning controls (H=2, Max fixed, N=100).
| Continuation rule | Enhancer reward ↑ | Splice reward ↑ |
|---|---|---|
| Mixed Top-8 | 7.8924 | 0.7538 |
| Mixed Top-m | 7.8032 | 0.7526 |
| Random-m | 7.7966 | 0.7613 |
| ST-after | 7.9685 | 0.7998 |
Each state/root uses ST-after's final count m for Top-m and Random-m; trace mismatches were zero, including the 1,683 enhancer and 3,807 splice groups shared by multiple methods. Empty sets revert to full Mixed in all controls, with zero fallback-set mismatches. Counts are matched locally, not across divergent trajectories.
Q3. Computational budget and runtime accounting
Calls/output counts uncached reward-oracle evaluations, with sequence/context-aware caching (Appendices D.5/E.5). Repeated states reuse rewards. A query is not a tree node or generator forward; one enhancer query aggregates five windows. Original Tables 1–2 use approximately matched query costs, while the new tree comparison matches reported calls/output exactly and H3 exposes depth-dependent expenditure.
Runtime uses the same GPU, batch size, endpoint, and measurement scope. Enhancer LPDP is 51.67 s/output. Splice LPDP's single-output is 330 s/output.
Q4. TreeG/PepTune comparison and LPDP's measured advantage
Both approaches can be extended to Edit Flow; our adapters test that extension directly. TreeG branches and selects active paths; PepTune MCTG expands, completes rollouts, and backs up rewards. LPDP instead combines exhaustive roots, local continuations, and single-root replanning on the same backbone/reward.
Table H6. Tree-guidance comparison; N=100, matched calls/output.
| Task | Method | Reward ↑ | Calls/output | Runtime (s/output) |
|---|---|---|---|---|
| Enhancer | TreeG | 7.2114 | 32,384 | 352.00 |
| Enhancer | PepTune | 6.3437 | 32,384 | 616.00 |
| Enhancer | LPDP | 7.9685 | 32,384 | 51.67 |
| Splice | TreeG | 0.7437 | 17,613 | 453.00 |
| Splice | PepTune | 0.5855 | 17,613 | 1,095.00 |
| Splice | LPDP | 0.8069 | 17,613 | 330.00 |
At the same query counts, LPDP improves reward by +0.7571/+0.0632 over TreeG and +1.6248/+0.2214 over PepTune on enhancer/splice. The reported timing ratios favor LPDP by 6.81×/1.37× against TreeG and 11.92×/3.32× against PepTune; splice ratios use the single-output LPDP measurement. These results support LPDP's edit-structured allocation in the tested setting on both reward and execution time.
M1. Recent variable-length models
We will add Expanding Flow Maps and DILMs to §2, distinguishing variable-length generator design from inference-time reward control. LPDP targets the explicit-edit, reward-queryable interface rather than claiming superiority over every variable-length backbone.
M2. Why combine a δ-band with top-K?
With consistent ties, the reviewer is correct that the operations equal direct top-K when the band contains at least K roots. Otherwise, δ imposes score-based eligibility and K caps expansion count (Eqs. 5–6); direct top-K fills the quota even with less competitive roots.
Table H7. Root filtering versus direct top-K; N=100.
| Task / selection | Reward | Mean roots | Calls/output | Runtime (s/output) |
|---|---|---|---|---|
| Enhancer / δ-band + top-K | 7.9685 | 8.141 | 32,384 | 51.67 |
| Enhancer / direct top-K | 7.6921 | 16.000 | 33,656 | 125.00 |
| Splice / δ-band + top-K | 0.8069 | 14.941 | 17,613 | 330.00 |
| Splice / direct top-K | 0.7945 | 16.000 | 18,352 | 415.00 |
The band achieves higher reward point estimates with fewer roots and queries; its reported runtime is also lower. This supports an eligibility safeguard within LPDP, not a separate novelty claim or guaranteed preservation of all useful roots.
W1. Novelty, transfer, and positioning against fixed-length generation
LPDP scores current edits exhaustively but expands future edits selectively, executes one root, and replans (§3.1–3.2; Figure 1; Appendix B, Algorithm 1). Local anchors follow indels. This asymmetric allocation preserves immediate coverage without global multi-edit expansion.
Table 3 isolates these components: at eight continuations/root, locality raises splice reward from 0.787 to 0.819 (+0.032 [0.010, 0.060], Appendix F.2). Enhancer benefits more from exhaustive one-step selection. Q4 adds TreeG/PepTune comparisons.
Table H1. Guided-window edit-space ablation (N=100).
The gain is tied to the edit space rather than to substitution refinement. This isolates action availability, not cost-matched superiority; the sub-only control still uses a variable-length native sampler.
Table H2. Changed guidance objectives on the same frozen backbones (N=100).
Unlike the evaluation-only rescoring in Appendix D.6 and T11–13, these runs change the guidance objective, so the benefit is not tied to the original oracle. Controller ordering is also stable across the generator checkpoints in Appendix E.3, T6.
On fixed-length models we accept the positioning limitation. The mismatch is one of protocol, not of preference.
Table H3. Generation and scoring protocols (no performance values; protocol only).
Published cross-generator numbers therefore do not share an evaluation scale, and we do not present our results as outranking them. Our variable-length checkpoint also has no native exact-200-bp conditioning interface; enforcing that length requires changed sampling constraints and reward aggregation, which is a separate inference setting rather than the same model and protocol as a native fixed-length generator.
What we can compare on a common footing is the guidance half of your concern. TreeG and PepTun were designed for fixed-length discrete diffusion; ported to this backbone under the same reward and matched calls/output, they are directly comparable. (Q4)
Q1. Why H=2, and how does deeper lookahead trade off against queries?
H counts the root, so H=2 is the smallest horizon that adds any future information to one-step selection; H=1 is the no-lookahead controller in T3.
The matched-budget comparison you ask for is already in the manuscript. In Appendix G.4, T21 the H=2 and H=3 rows land within 1% of each other in measured oracle calls, so they constitute a near-matched-cost comparison.
Table H4-A. Horizon at matched oracle cost (T21; N=100, seed 12345, task-default windows).
At essentially equal oracle cost, H=2 is better on enhancer and H=3 is better on splice by +0.025. We state this directly rather than claiming H=2 is optimal on both tasks. The call counts above are measured, not enforced by a shared cap; we report them as a near-matched comparison rather than a budget-constrained experiment.
We also extend the sweep to H=4. This is a separate N=100 run with its own cost schedule, in which calls grow with depth.
Table H4-B. Extended depth sweep (separate N=100 cohort; not budget-matched).