- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The authors introduce Latent-Space Codon Optimization (LSCO), which performs synonymous codon design through gradient ascent in a pretrained variational masked autoencoder. They pretrain the backbone on over 15 million antibody transcripts and combine a ten-member expression-predictor ensemble with a ViennaRNA-trained minimum-free-energy predictor and a penalty for departing from a CodonBERT reference. The expression objective rewards predicted A280, absorbance at 280 nm, while penalizing ensemble uncertainty. Codon masks preserve the encoded protein, and temperature annealing converts relaxed codon distributions into discrete sequences. The authors evaluated 54 antibodies spanning nine antigens using the guiding predictor, two evaluators withheld from optimization, and sequence and folding metrics. LSCO achieved higher predicted expression than several codon-generation baselines, while MFE regularization improved folding energies at some cost to predicted expression. An ablation against direct codon-logit optimization showed an advantage under the guiding predictor but no statistically significant improvement under either held-out evaluator. However, the redesigned sequences were not experimentally tested.
Critical strengths
- I appreciate that the authors enforce synonymous codon choices during optimization, which preserves the protein sequence by construction and keeps the search focused on the intended design problem.
- The two held-out evaluators, including a structure-based GNN, provide useful checks on whether improvements transfer across predictors.
- The direct input-space optimization baseline is particularly useful for assessing the need for latent search. The authors also examine MFE regularization and removal of the naturalness prior, allowing readers to assess which components contribute to the reported results.
Critical weaknesses
- My main concern is the severely limited methodological novelty. Latent gradient optimization, ensemble uncertainty penalties, reference regularization, and constrained decoding are familiar components. I don't yet see the advance over methods such as LaMBO and NOS/LaMBO-2 beyond their adaptation to codon design. Table 2 also shows no significant advantage over direct input-space optimization on either held-out evaluator, weakening the central argument for the learned latent space.
- The test case is too limited to establish practical usefulness. The authors optimize 54 selected antibodies with moderate starting expression, and all reported improvements for the redesigned sequences come from predictors. Even a small prospective comparison against the original constructs and direct input-space optimization would make the application substantially more convincing.
- I also doubt whether the expression predictors have learned the effects needed for synonymous optimization. The reported test Spearman correlation of 0.65 does not establish that the model can rank synonymous variants of the same protein. Differences between antibody amino acid sequences could contribute substantially to predictive performance. Agreement between evaluator architectures and low ensemble disagreement do not resolve my concern.
Questions for authors
-
What specific algorithmic contribution distinguishes LSCO from existing latent optimization methods? Please add a comparison with an established latent optimizer and simple synonymous hill-climbing under shared scoring objectives, and report runtime and multiple seeds across antibodies alongside DISO.
-
How many expression measurements and unique proteins train each evaluator, and how are the splits constructed? Were all 54 starting antibodies excluded from every evaluator's training set? Please also specify which data were used to select optimization hyperparameters.
-
Can the expression predictors rank experimentally measured synonymous variants of the same protein? Perhaps the authors can use a public benchmark reporting within-protein rank correlation and recovery of high-expression variants -- that wou;d directly test this capability and provide a reproducible evaluation beyond the proprietary antibody dataset.
-
Do the authors have any wet-lab experimental data comparing LSCO, DISO, a strong codon-design baseline, and the original constructs on a small antibody panel? You could measure secreted antibody titer under matched expression conditions and report paired improvements across antibodies.
-
In , the utility subtracts uncertainty , weighted by , from mean predicted expression . Does represent disagreement between ensemble means or the total uncertainty in Eq. 8, which also includes measurement noise? Please clarify and test whether uncertainty predicts actual error on held-out measured variants.
-
How much predicted improvement survives conversion from soft codon probabilities to the final discrete sequence? Please report this gap across optimization trajectories and clarify whether the final decoding temperature is 0.01, as in Appendix A, or 0.03, as in Table 5.
-
Eq. 4 equates the optimized latent code with , the encoder representation of sequence . Why should these remain equal after latent optimization and decoding? Please clarify which representation the naturalness penalty uses and whether the distance is squared, as stated in Appendix C.
Response to Reviewer sahq
We thank the reviewer for their detailed assessment and for recognizing the value of synonymous constraints, held-out evaluation, and the direct input-space baseline. We appreciate the specific questions, which help us clarify the contribution, implementation, and limitations of the evidence.
1) Contribution and latent-space advantage
Our contribution is a framework combining pretrained mRNA representations, uncertainty-aware expression guidance, structural regularization, and protein-preserving decoding for codon optimization, rather than a new general-purpose latent optimizer. We will clarify this positioning relative to such optimizers better, i.e., LaMBO and NOS/LaMBO-2.
We acknowledge that LSCO’s statistically significant advantage over direct input-space optimization is confined to the guiding predictor; no statistically significant advantage was established under either held-out evaluator. We will temper the claims about the benefit of latent-space search accordingly. The current comparisons also do not isolate the respective contributions of the pretrained representation, optimization procedure, and learned expression predictor.
2) Training data and evaluation setup
All three evaluator ensembles were trained on the same supervised dataset, containing 2,298 expression measurements. The two external evaluators were withheld from optimization, but were not trained on independent expression datasets. We constructed six folds by first clustering mRNA sequences and then stratifying fold assignments over these clusters. Optimization hyperparameters were tuned on held-out fold. We will clarify these details and the resulting limitations in the manuscript.
3) Predictive validity and experimental validation
We acknowledge that the held-out evaluators only check whether predicted improvements extend beyond the guiding predictor. We observe evidence of transfer, although gains vary across evaluators and shared biases cannot be excluded. Importantly, the experimental measurements were used to train and evaluate the predictors; and LSCO-generated designs have not yet been wet-lab tested. We will clarify this distinction throughout the manuscript and stress that the results are improvements in predicted expression, rather than experimentally established expression gains.
4) Uncertainty penalty
We mainly follow Lakshminarayanan et al. (2017) uncertainty decomposition. Each probabilistic member of the deep ensemble outputs a mean and aleatoric variance. Epistemic uncertainty is estimated as the disagreement between the members’ mean (variance of the means), while aleatoric uncertainty is estimated as mean of the members’ variances. Our objective penalizes epistemic standard deviation, rather than total uncertainty. We will clarify this distinction and the different variance conventions used during optimization and evaluation.
5) Discretization and temperature
The temperature is linearly annealed from 1.0 toward 0.03 over 3,000 optimization steps. We will clarify this schedule and correct the conflicting values. The objective is evaluated on soft codon probabilities during optimization, whereas the reported results are obtained by rescoring the selected discrete, argmax-decoded sequences. Thus, the reported gains are evaluated on discrete designs, although the soft-to-discrete score gap has not been quantified.
6) Naturalness penalty
Thank you for pointing out the inconsistency in Equation 4. The implemented penalty uses squared Euclidean distance, averaged over positions, between the optimized latent variable and the fixed encoding of the BERT-natural reference sequence. This reference is computed once before optimization. The penalty does not involve re-encoding the decoded candidate or assume that its encoding equals the optimized latent variable. We will correct Equation 4, align the main text and Appendix C, and specify the coefficient for each variant, including when the penalty is disabled.
We thank the reviewer again for these constructive comments. They will help us describe the implementation more precisely, clarify the methodological contribution, and align the claims with the available evidence.
Kind regards,
The Authors