- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper addresses prospective forecasting of protein evolution from a single ancestral sequence x0, aiming to sample future evolutionary trees T_future ~ p(T_future | x0) that jointly specify descendant sequences, branching topology, and branch lengths. The authors propose Tree-Valued Schrödinger Bridge Matching (TreeSBM), which combines a reference evolutionary process (frozen ESM-2 mutation probabilities exponentially tilted by a fitness function F(x)) with a 4-layer sparse graph transformer over intermediate trees T_t and four per-node MLP heads predicting sitewise amino-acid substitution log-rate offsets, Poisson branching intensities, branch lengths, and lineage stopping probabilities. Training samples intermediate subtrees between the root-only tree T0 = {x0} and FastTree/Nextstrain-reconstructed phylogenies T1, supervising the heads on node/edge statistics of T1 plus a semigroup regularizer. Experiments evaluate TreeSBM on four NCBI viral datasets (SARS-CoV-2 Spike, Influenza A H3N2 HA, Influenza A H1N1 HA, and HIV-1 Env) under geographic, temporal, and epidemic-aware splits, alongside SARS-CoV-2 variant-of-concern (VOC) recovery and ablations.
Critical strengths
None
Critical weaknesses
1: Although the paper is aimed for predictive proposes, it only focuses on "predicting" very old SARS-Cov-2 VOCs appeared 5 years ago. SARS-CoV-2 is a virus continuously mutating at tremendous speed, and every year around 10 new nextclade major lineage and around 1,000 new pango lineages are designated. However, the paper does not discuss about any recent data at all. For example, in 2026 by 2026-10-20, we have 6 new major lineages 26A-26F that achieved very large spread XFG.1.1, XFG.3.4.1, PQ.16.1.1, RK.1, RF.5 and PJ.2.1. and we have 25A-25I major clades LP.8.1, NB.1.8.1, XFG, XFC, XFJ, MC.10.2.1, NW.1.2, BA.3.2 and PY.1.
The authors do not mention any of the 15 major lineages which are actually dominating the world in 2025 or 2026. Also the discussed "predicted" mutations match very few of the actual happening mutations in recent major variants.
2: Fundamental disconnect between the Tree-Valued Schrödinger Bridge theory and the implemented heuristics.
- Theory vs. implementation (Section 3.3, Algorithms 1–4): Eq. (6) parameterizes Doob-transformed rates via a tree-space potential difference g_theta(T', t) - g_theta(T, t), but the implementation trains independent node-level heads with direct supervised losses against static terminal-tree targets from T1 (Poisson NLL against T1 child count, which is deterministically 2 for internal nodes and 0 for leaves in bifurcating FastTree trees; MSE against mean T1 child branch length; BCE against leaf status; sitewise mutation losses against x1). SampleBridgeState (Algorithm 2) heuristically prunes branches and independently subsamples mutations M_t(v) subseteq M_1(v), which is not the conditional bridge P^0(T_t | T_0, T_1) of Algorithm 3 and mismatches inference (Algorithm 4, Table B.3). Line 218 also injects "per column Shannon entropy", which is undefined at inference given only a single sequence x0.
Questions for authors
1: What's the performance of treeSBM on recent major variants appeared in 2025 and 2026.
2: Please clarify the disconnections between the theory and implemented heuristics, show clearly why the implemented heuristics are perfect approximations of the proposed theory.
4 comments
W2 and Q2. Theory and implementation
Fundamental disconnect between the Tree-Valued Schrödinger Bridge theory and the implemented heuristics.
We appreciate the opportunity to explain how we implement the motivating bridge formulation. We learn sequence-space corrections and train additional heads for branching, branch length, and stopping. In the revision, we will connect each operation to its training objective and explain the approximation involved.
Motivating structure. The bridge is defined by Eq. (5), and its optimal rates take the Doob form of Eq. (4), . The theoretical tree-space parameterization multiplies the reference rates by (Eq. 6), and for mutations the offset is a log-correction on the ESM-2 rate at each site (Eq. 7).
Implemented components. We use node-level heads to predict sequence edits and tree-generation quantities. The sequence heads minimize the KL divergence between an endpoint-weighted ESM-2 target and the predicted categorical distribution, which is the bridge objective on sequence space. The topology heads are trained on node statistics of the observed tree. Most reconstructed phylogenies bifurcate, so child-count targets take the values 0 and 2, and the branching head learns which active lineages split along the bridge clock.
Algorithms 2, 3, and 4. Algorithm 2 samples training states and Algorithm 4 generates trees at inference, and we will describe their separate roles in the revision. Algorithm 2 builds an intermediate state by retaining a subset of the endpoint mutations, , on lineages alive at a sampled date. This construction matches generation, where the model extends lineages that are alive after an intermediate date, and it gives each head a training state of the type it meets at inference. We will state the design choices of Algorithm 2 explicitly.
Entropy feature. The per-column Shannon entropy is defined sitewise over the multiple sequence alignment in Eq. (14) and is used during training. The inference procedure starts from a single sequence and does not use it. The ablation without per-site entropy in Table 7 gives a mutation recall of 0.084, compared with 0.080 for the full model.
Empirical support for the approximation. The semigroup regularizer constrains the learned transitions to compose consistently across bridge times. The ablations in Table 7 show that bridge matching raises mutation recall from 0.008 to 0.080 and AA|hit from 0.087 to 0.375. On held-out geographic SARS-CoV-2 roots, TreeSBM reaches a mutation-site recall of 0.219 against 0.048 for the frozen pLM (Table 4), and the new 2026 experiment in our first comment tests the model on recent-lineage sequences.
Beyond the completed recent-lineage evaluation, we are currently running ProteinGym comparisons against the ESM-2 reference and computing generalized Robinson–Foulds distance alongside strict RF. These analyses will extend our assessment of variant-effect prediction and partial clade agreement. We will report the results during the discussion as they become available.
We thank the reviewer again for prompting a clearer explanation and the additional recent-lineage experiment. We have explained the sequence objective, tree supervision, and ancestral-sequence inference procedure, alongside the tenfold mutation-recall gain from bridge matching. We hope these additions are sufficient to merit a score increase and support for acceptance! Thank you!
Thanks for the rebuttal.
The rebuttal reveals that the author is not familiar with evolution at all, and are likely mostly AI slops.
I'll maintain my scoring of the lowest score.
While we respect the reviewer’s decision to maintain the lowest score, asserting that we are "not familiar with evolution at all" and describing our responses as “AI Slops” (without providing any justification or explanation) is quite disrespectful, and we will notify the AC of this unprofessionalism. We have been nothing but professional in our responses, and nothing we wrote warrants that level of disrespect. As a note, even if we wanted to use AI tools to help craft our response, the sensitive nature of this work (protein and viral evolution) flags and restricts usage anyway.
For the sake of improving our research, we would like to know what part of evolution are we not understanding: does the reviewer object to our treatment of mutation and selection, the branching process, the connection between the bridge formulation and evolutionary dynamics? Any clarifications here will help us better the research. Thank you.
We thank the reviewer for requesting an evaluation of recent lineages. We took this request seriously and completed an additional experiment. We also recognize the initial rejection recommendations and believe the paper merits a higher score after consideration of the expanded evaluation and the implementation details we explain here.
W1 and Q1. Recent major lineages
Table 3 already trains the H3N2 model on sequences collected through 2023 and tests it on 2024 sequences. To extend the evaluation to SARS-CoV-2 in 2026, we evaluated a panel of recent lineages. For the 2026 lineages, constructing moderately sized trees from nonidentical sequences was a low-data problem, because sequences showed almost 100 percent identity with minimal divergence. We therefore built one combined tree from the 2026 Omicron lineages that share ancestry (XFG.1.1, PY.1.1.1, PQ.17, and MC.10.1.7). We also evaluated JN.1 as an earlier comparison.
Table M1. TreeSBM forecasts on recent SARS-CoV-2 lineages. Coverage is the fraction of observed sequences within two substitutions of a generated leaf. Min. distance is the minimum distance to an observed leaf. RBD fraction is the proportion of mutations in the receptor-binding domain.
For the combined 2026 set, 50.5% of observed sequences lie within two substitutions of a generated leaf, and generated trees leave every conserved site unchanged. JN.1 reaches a union site recall of 0.585, so the model recovers most of the sites that changed. We additionally report nearest-leaf distances of 9.130 and 18.000 to characterize sequence agreement beyond the coverage threshold. The negative EVEscape Δ values indicate that the generated mutations score lower in predicted escape than the observed ones on these saltational lineages. We report AA|hit separately to distinguish recovery of mutation positions from recovery of the corresponding amino-acid identities.
These results address the request for recent data directly. The experiment extends the evaluation beyond the VOC analysis in Section 4.4 to lineages that emerged in 2026. The second comment addresses the relationship between the theory and the implementation.