- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper introduces NimblDrift, a nonparametric method for discrete biological sequence generation that uses frozen pretrained encoders and reference populations to guide generation without needing to to train generative model. The method iteratively applies discrete candidate edits to minimize the distance between generated and reference distributions in the embedding space, and further extends this framework through GreedyDrift to incorporate reward optimization with reference-based regularization. The paper evaluates the approach across a few tasks including sentence sentiment transformation, small-molecule binding, therapeutic peptide optimization and allele-specific MHC peptide generation.
Critical strengths
- This paper provides broad empirical evaluation across diverse domains with evaluation that also considers multiple pretrained encoders, reference distributions, and search neighborhood constructions. This demonstrates good flexibility of the method. Additionally the result in biological design and property preservation are encouraging.
2.The method is straightforward and simple. The adaptability for different biological design tasks and objectives without requiring model training is appealing.
Critical weaknesses
-
A very significant limitation of this work is the limited comparison against natural alternatives, such as nearest reference optimization or pure local search guided by the embedding or other evolutionary search approaches. Without these baselines, the evaluation is incomplete.
-
The figures are difficult to see and interpret, quite blurry and very dense. Not suitable for the intended purpose (Figure 2 and 3 For Example).
-
The work is quite incremental with respect to "Generative Modeling via Drifting" [1]. There are some useful extension and interesting applications, but this work is too incremental.
[1] Deng, M., Li, H., Li, T., Du, Y., & He, K. (2026). Generative Modeling via Drifting. arXiv preprint arXiv:2602.04770. https://arxiv.org/abs/2602.04770
Questions for authors
-
It would be helpful for the authors to include comparisons against simpler search-based baselines, such as nearest-reference embedding search and reference attraction only optimization. These comparisons would help isolate the benefits of population level distribution matching over simpler embedding-guided local search approaches.
-
Could the authors further clarify the methodological novelty of NimblDrift relative to the original continuous Drifting framework (Deng et al., 2026) and existing greedy search methods? In particular, beyond adapting feature-space distribution matching to discrete spaces through local search and incorporating reward-based regularization, what are the key novel methodological contributions of the proposed approach?
5 comments
Q2. Contribution relative to continuous drifting and greedy search
“Could the authors further clarify the methodological novelty of NimblDrift relative to the original continuous Drifting framework (Deng et al., 2026) and existing greedy search methods?”
We appreciate the opportunity to clarify this relationship. Deng et al. [1] use a drifting field to train a neural generator with one-step inference. NimblDrift uses frozen biological encoders to directly update populations of discrete molecules or sequences during generation. Each update selects a feasible edit by evaluating its effect on the population discrepancy. This enables immediate use of a new reference population and makes the permitted molecular or sequence edits part of the generation procedure.
1. Direct discrete updates and projected continuous drift. We explicitly compare population-discrepancy minimization with projecting a continuous drift displacement onto feasible edits. Projection selects edits close to the displaced embedding. Direct discrepancy minimization can select a long-range edit when its endpoint improves the population objective. In the synthetic small-world experiment, the mean convergence times are 10.67 steps for NimblDrift and 14.17 for projected drift. The corresponding peptide comparison appears in Appendix A2.2.
2. Molecular connectivity and crossover proposals. We adapt Graph GA crossover operations [2] to propose candidates for population-discrepancy minimization. The analysis using Kleinberg networks [3] motivates the role of long-range connections, and the molecular experiment directly measures the effect of adding those proposals.
Table R18. Molecular reference matching under three neighborhoods, from submission Table 1. MMD² is squared maximum mean discrepancy. The reference self-MMD² level is 0.0065, and each crossover configuration uses 10 partners.
| Neighborhood | Minimum MMD² ↓ | Steps to self-MMD² level ↓ |
|---|---|---|
| Graph edits | 0.0128 | >100 |
| Graph edits + BindingDB crossovers | 0.0062 | 92 |
| Graph edits + within-population crossovers | 0.0049 | 45 |
Within-population crossovers reach the reference self-MMD² level in 45 steps, compared with 92 for BindingDB crossovers. Graph edits reach a minimum MMD² of 0.0128 after the reported search. This establishes a concrete connection between feasible edit connectivity and the effectiveness of population matching.
3. Reference-based regularization for biological objectives. GreedyDrift combines predicted affinity with a penalty for departure from the reference population. At regularization weight 0.2, mean predicted affinity increases from 6.281 to 7.969 while solubility EMD is 0.280, compared with 0.670 for greedy search. The new attraction-only and nearest-reference controls further isolate the contribution of the population objective.
Together, these contributions connect frozen biological representations, discrete feasible edits, population coupling, and property regularization in a single generation procedure. The new experiments strengthen this account by identifying how simpler search, fine-tuning, and encoder geometry affect the resulting designs.
Improving figure clarity and exposition
“The figures are difficult to see and interpret, quite blurry and very dense.”
We appreciate this feedback. We will enlarge labels, separate the dense panels in Figures 2 and 3, and use high-resolution exports with consistent legends and readable axes. We will also streamline the mathematical exposition around the reference distribution, population discrepancy, and candidate-update rule, and place the new quantitative comparisons alongside the corresponding figures.
References
[1] Deng et al. (2026). Generative Modeling via Drifting. https://arxiv.org/abs/2602.04770
[2] Jensen (2019). A graph-based genetic algorithm and generative model/Monte Carlo tree search for the exploration of chemical space. https://doi.org/10.1039/C8SC05372C
[3] Kleinberg (2000). The Small-World Phenomenon: An Algorithmic Perspective. https://www.cs.cornell.edu/home/kleinber/swn.pdf
We thank the reviewer again for the helpful review! We hope the additional experiments and clearer methodological explanation support a more favorable assessment, and we would be grateful if the reviewer would consider increasing the score and reassessing confidence in the submission to support acceptance of the work.
I thank the authors for their additional experiments, which address my concerns regarding missing baselines. However, my main concern regarding limited methodological novelty relative to prior work remains unresolved. I appreciate the clarifications and additional results, I will maintain my original score.
We thank the reviewer for the constructive feedback and for recognizing the flexibility and simplicity of NimblDrift. To address the baseline and methodological questions, we undertook new experiments with nearest-reference search, mean-shift attraction, evolutionary search, fine-tuned generative models, and additional encoders. We describe the new comparisons first, then clarify the algorithmic contribution and planned presentation improvements.
Q1. Simpler embedding-guided search
We implemented both suggested controls. Fixed nearest-reference search moves each candidate toward the reference closest to its initial embedding. Mean-shift attraction instead moves the candidate toward a kernel-weighted average of the reference embeddings. These baselines update candidates individually. NimblDrift selects replacements by evaluating the full candidate-population discrepancy against the reference distribution.
Table R15. Predicted MHC class I binder percentages.
NimblDrift exceeds fixed nearest-reference search on all three alleles and mean-shift attraction on A*01:01 and A*03:01. For A*02:01, mean shift reaches 12.3% and NimblDrift reaches 11.2%, both substantially above the 2.7% initialization. The comparisons therefore identify the settings in which population coupling contributes most clearly.
Table R16. Mean Boltz-2 binding likelihood in the molecular search ablation.
For 2VT4, population matching raises the score to 0.466, compared with 0.216 for nearest-reference search and 0.259 for mean-shift attraction. This gives a 79.9% increase over mean-shift attraction, directly addressing the reviewer's question about the value of coupling the candidate updates.
New evolutionary and generative comparisons
To extend the evaluation further, we compared against a genetic algorithm and fine-tuned peptide generators across nine allele-seed pairs.
Table R17. Aggregate MHC class I results from the generation and encoder comparisons. Lower NetMHCpan percentile ranks indicate stronger predicted presentation.
These results provide a direct comparison with evolutionary search and generative fine-tuning. ESM C 600M drifting achieves a median percentile rank of 8.0 and 31% predicted binders, compared with 8.1 and 33% for the genetic algorithm. Fine-tuned PepDFM reaches 78%, close to the 79% observed for held-out ligands. This expanded comparison quantifies the improvement from direct population updates and motivates the additional experiments on encoder geometry.
For molecular generation, we also fine-tuned ChemGPT, REINVENT4, and GenMol on the same reference datasets used for drifting. NimblDrift achieves a mean Boltz-2 score of 0.816 on 6CM4, compared with 0.532, 0.463, and 0.543, respectively. These new baselines substantially broaden the evidence supporting the approach.