- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The authors present mRNAWM, a latent world model for optimizing full-length mRNA while preserving the encoded protein. They formulate design as a sequence of synonymous CDS edits and constrained UTR substitutions, with a weighted utility over 18 sequence and structural properties. A learned transition model predicts how edits change the latent state, while preference-conditioned policy and value heads guide uncertainty-penalized beam search. The controller executes one edit and replans, allowing subsequent decisions to account for earlier changes. During search, the authors recompute 13 sequence properties exactly and predict five ViennaRNA-derived structural properties, then rescore final candidates with ViennaRNA. For me, the main computational contribution is combining learned edit dynamics with multi-step planning and adjustable objective weights. The authors compare against six methods on RefSeq-derived targets and evaluate 97 tumor-associated antigens across three UTR contexts, reporting improvements in codon adaptation and several structural and composition metrics. Planning-horizon and preference-weight studies provide additional computational support, but the study unfortunately doesn't include experimental measurements of expression or transcript stability.
Critical strengths
-
I appreciate that users can adjust the objective weights without retraining the model, which makes it straightforward to explore tradeoffs between codon usage, sequence composition, and predicted structure while preserving the encoded protein.
-
The authors recompute 13 inexpensive sequence properties exactly during search and rescore final candidates with ViennaRNA. These are sensible choices that reduce dependence on surrogate predictions and allow the final structural scores to be checked directly, so I appreciate that.
-
The improvement from one-step to two-step planning supports looking beyond the immediate edit, and the preference experiments show that changing the weights produces corresponding changes in the designs.
Critical weaknesses
-
My main concern is the missing comparison with mRNAutilus (Patel, et al. 2026), which already performs joint CDS/UTR optimization and includes experimental validation. The authors should compare both methods on shared protein targets and report the UTR constraints and search budgets. Even though the authors may have missed this, during rebuttals, I would need this comparison to judge the advance over existing approaches.
-
The biological usefulness remains unclear. All 18 properties come from sequence calculations or ViennaRNA, and I don't think improvements in these quantities alone establish that the resulting mRNAs would perform better experimentally. Even a small reporter panel measuring protein expression and transcript decay, with matched RNA chemistry and delivery conditions, would make the paper substantially stronger. I get that it may be difficult, but any published paper (conference or journal) for mRNA generation should have experimental results to validate.
-
I am having a hard time reconciling the CDS-only Kozak results with the stated definition. For transcript , the score awards half a point for A/G at position and half for G at relative to the start codon. Fixed UTRs preserve the first term, and synonymous CDS edits preserve whether is G. The increase from 0.625 for CodonTransformer to 0.770 for mRNAWM (CDS) therefore needs an explanation. Please check the scoring and confirm that the methods were evaluated on identical protein targets and UTRs.
Questions for authors
-
Could the authors compare with mRNAutilus on the same proteins, with compatible UTR lengths and shared evaluation metrics? Please report the sampling or search budget for each method.
-
The authors should test a small panel of designed reporter mRNAs for protein expression and transcript decay. Comparing against the starting constructs and strong baselines under matched RNA chemistry and delivery conditions would make the biological contribution much more convincing to me.
-
Since 13 of 18 properties are recomputed exactly, what improvement comes from the learned latent transitions? Please compare against beam search that directly encodes each candidate sequence, retaining the same structural predictor, initialization, and candidate budget, and report runtime.
-
The value target sums utility gains from step to trajectory end , with discount . These returns come from random/greedy training edits. How well do they predict returns under MPC? Please include an ablation removing the future-value contribution, .
-
In Appendix A.4.6, the uncertainty penalty includes ensemble standard deviations for property at rollout step . Are these set to zero for the 13 properties computed exactly? Please also report structural prediction error over one to five imagined edits and whether disagreement tracks that error.
-
How does the CDS-only Kozak score increase from 0.625 to 0.770? Under Table 4's definition, fixed UTRs preserve position , and synonymous substitutions preserve whether position is G. Please clarify the scoring and confirm that the comparisons use identical proteins and UTRs.
7 comments
Response to Reviewer GjC1 — Part 1/3: W1–W2 & Q1–Q2 — mRNAutilus Comparison and Biological Validation
[W1 & Q1] Comparison with mRNAutilus
We thank the reviewer for highlighting mRNAutilus (Patel et al., 2026), an important related work on joint CDS/UTR optimization. To address this concern, we conducted an additional comparison on 10,000 sampled targets from our held-out test set, evaluating both methods using the same eight sequence- and structure-based metrics.
Table R4. Comparison with mRNAutilus on 10,000 sampled test targets. Best results are highlighted in bold. Ensemble diversity is evaluated by proximity to the target of 0.10.
| Metric | mRNAWM (Full) | mRNAutilus |
|---|---|---|
| CAI ↑ | 0.9425 | 0.7627 |
| Kozak ↑ | 0.6657 | 0.7327 |
| Full-MFE/nt ↓ | −0.3960 | −0.3558 |
| Ens. diversity (target 0.10) | 0.0986 | 0.1458 |
| Homopolymer ↓ | 0.6450 | 0.6686 |
| Window GC deviation ↓ | 0.3040 | 0.2812 |
| uAUG density ↓ | 0.00450 | 0.00998 |
| UG-rich density ↓ | 0.01056 | 0.01190 |
mRNAWM outperforms mRNAutilus on six of the eight evaluated metrics, including substantially higher CAI (0.9425 vs. 0.7627), more favorable full-transcript MFE/nt (−0.3960 vs. −0.3558), and ensemble diversity closer to the target of 0.10. It also achieves lower homopolymer burden, uAUG density, and UG-rich density.
These differences are consistent with the methods' distinct optimization objectives. mRNAutilus employs masked discrete diffusion with Monte Carlo Tree Guidance to optimize predicted mRNA half-life, translation efficiency, and protein abundance, whereas mRNAWM evaluates 18 sequence- and structure-derived properties and optimizes their preference-weighted combination through model predictive control. In particular, mRNAWM explicitly rewards codon adaptation and RNA folding-related properties, helping explain its advantages in CAI, MFE/nt, and ensemble diversity. Its direct consideration of sequence-composition and manufacturability properties also provides optimization pressure on homopolymer and UG-rich burdens.
Conversely, mRNAutilus achieves a higher Kozak score (0.7327 vs. 0.6657) and slightly lower window GC deviation (0.2812 vs. 0.3040). The former is consistent with its translation-efficiency-oriented guidance, which may favor initiation-related sequence contexts. The latter may reflect sequence-composition preferences learned through its generative model and functional guidance, rather than direct optimization of the window GC metric.
Overall, these results demonstrate that mRNAWM achieves stronger computational performance on most of the evaluated sequence and structural objectives, while the two methods emphasize complementary aspects of mRNA design.
[W2 & Q2] Biological relevance and experimental validation
We thank the reviewer for emphasizing the importance of experimental validation. Our work focuses on establishing a generalizable computational framework for protein-preserving, multi-objective full-length mRNA design, with particular emphasis on learned edit dynamics, long-horizon planning, and controllable optimization.
To further demonstrate the practical relevance of our approach, we evaluate zero-shot transfer on 97 tumor-associated antigens across three UTR contexts (291 design tasks), without antigen-specific fine-tuning (Section 4.6, Table 3, and Appendix B.10). These CEDAR-derived antigen targets provide a therapeutically relevant evaluation setting. As shown in Table 3, mRNAWM achieves the highest CAI (0.9458), the lowest homopolymer burden (0.5457), and improved start-region unpaired fraction relative to CodonTransformer (0.4657 vs. 0.4446), while preserving the encoded antigen sequences.
These results highlight the generalizability and potential therapeutic applicability of mRNAWM, complementing our large-scale computational benchmarks. Experimental characterization of protein expression and transcript stability represents a valuable next step toward translating these computational designs into practical therapeutic applications.
Response to Reviewer GjC1 — Part 2/3: Q3–Q4 — Learned Latent Dynamics, Search Efficiency, and Future-Value Ablation
[Q3] Contribution of learned latent transitions versus direct re-encoding beam search
We thank the reviewer for this important question. Since 13 of the 18 properties can be computed directly from nucleotide sequences, we agree that the contribution of learned latent dynamics should be distinguished from conventional search.
To address this concern, we conducted additional comparisons against three conventional search strategies: Greedy Search, Randomized Greedy Search, and Direct Re-encoding Beam Search.
- Greedy Search selects the edit with the highest predicted immediate utility among policy-guided candidate proposals, without multi-step lookahead or learned future-value estimation.
- Randomized Greedy Search uniformly samples up to legal edit candidates at each step and selects the one with the highest predicted immediate utility, testing randomized exploration combined with local optimization.
- Direct Re-encoding Beam Search retains multi-step beam planning but explicitly constructs and re-encodes each edited candidate sequence, using the observation head to estimate structural properties instead of recursively propagating states through learned latent dynamics.
All methods operate under the same protein-preserving editing constraints and property definitions. The 13 inexpensive sequence-level properties are computed exactly, while structural properties are estimated using learned predictors during candidate search.
Table R2. Comparison with conventional search strategies. Best results are highlighted in bold. Ensemble diversity is evaluated by proximity to the target of 0.10.
| Metric | mRNAWM | Greedy | Random-Greedy | Re-encoding Beam |
|---|---|---|---|---|
| CAI ↑ | 0.945 | 0.9321 | 0.9253 | 0.9268 |
| Kozak ↑ | 0.677 | 0.590 | 0.590 | 0.560 |
| Full-MFE/nt ↓ | −0.401 | −0.3738 | −0.3804 | −0.3881 |
| Ens. diversity (target 0.10) | 0.098 | 0.1099 | 0.1059 | 0.1201 |
| Homopolymer ↓ | 0.650 | 0.738 | 0.712 | 0.790 |
| Window GC deviation ↓ | 0.314 | 0.3153 | 0.3207 | 0.3207 |
| uAUG density ↓ | 0.0054 | 0.0041 | 0.0033 | 0.005394 |
| UG-rich density ↓ | 0.0157 | 0.0216 | 0.0215 | 0.0214 |
mRNAWM achieves the best mean performance on seven of eight evaluated metrics, including CAI, full-transcript MFE, ensemble diversity, and several sequence-composition measures.
Importantly, mRNAWM also outperforms Direct Re-encoding Beam Search on seven of eight metrics, supporting the effectiveness of learned latent imagination for multi-step editing decisions.
Computational efficiency. We additionally conducted a paired runtime evaluation between mRNAWM and Direct Re-encoding Beam Search.
| Metric | mRNAWM | Re-encoding Beam | Ratio |
|---|---|---|---|
| Mean inference time (s) | 74.678 | 197.998 | 2.65× |
| Median inference time (s) | 39.001 | 129.734 | — |
Direct Re-encoding Beam Search requires approximately 2.65× the mean inference time of mRNAWM. This reflects the additional cost of repeatedly encoding edited candidate sequences, whereas mRNAWM propagates imagined successor states through learned latent transitions.
Together, these results support a favorable design quality–computational efficiency trade-off from learned latent dynamics, beyond simply increasing search depth or optimizing additional properties.
Dear Reviewer GjC1,
Thank you for your thoughtful and constructive feedback. We appreciate your recognition of the practical relevance of controllable multi-objective mRNA design, the use of exact sequence-property evaluation, and the benefits of multi-step planning.
To address your concerns, we have conducted additional comparisons with mRNAutilus (Patel et al., 2026) on 10,000 sampled test targets (Table R4), together with new evaluations against conventional search strategies, including direct re-encoding beam search (Table R2), a paired runtime comparison, and component ablations examining the contributions of future-value estimation, policy guidance, and uncertainty regularization (Table R3). We also provide an additional analysis of planning-horizon performance and decision consistency (Table R1) and further clarify the evaluation protocol and CDS-only Kozak scoring.
The additional results show that mRNAWM outperforms mRNAutilus on six of eight reported computational metrics, achieves the best mean performance on seven of eight metrics against conventional search strategies, and offers a substantial computational advantage, with direct re-encoding beam search requiring 2.65× the mean inference time of mRNAWM. Component ablations further demonstrate that learned latent dynamics and future-value estimation make substantial contributions to overall design quality.
We hope these new results and clarifications help address your concerns. Our detailed, point-by-point responses are organized into three parts in the accompanying comments.