- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes ProEdit, a one-step protein sequence optimization method based on a diffusion-pretrained protein language model. Instead of using the original multi-step diffusion process, ProEdit takes a complete parent sequence as input and directly generates an edited sequence in one step. The model is trained with GRPO using black-box structural rewards, with a reference KL to control policy updates. They evaluate ProEdit on two protein binder optimization tasks, PD-L1 and IFNA2. The results show improvements in structural rewards and iPTM compared with pretrained editing, diffusion-based GRPO, and reward-weighted supervised training. ProEdit also reduces training cost significantly. Additional experiments with independent structure predictors, sequence diversity, and parent conditioning further support the effectiveness of the method.
Critical strengths
-
Strong experimental results and high efficiency. ProEdit achieves clear improvements in structural rewards and iPTM on two protein binder optimization tasks. It also greatly reduces training cost compared with the native diffusion rollout baseline. These results show the potential practical value of the proposed approach.
-
Comprehensive experimental analysis. The authors provide several additional experiments, including raw proposal quality, parent conditioning, sequence diversity, and evaluation with independent structure predictors. These analyses provide evidence for the effectiveness of the learned editing policy.
Critical weaknesses
-
Limited methodological novelty compared with existing work. Several key ideas of this paper have already been explored in related studies. RIDER [1] uses reinforcement learning with external structural rewards to optimize diffusion-based RNA sequence generation. This already covers the idea of using black-box structural feedback to directly optimize diffusion-based sequence models. SOLD [2] goes further by proposing single-step RL optimization, where a complete RNA sequence is predicted and evaluated using external structural rewards without sampling the full diffusion trajectory during training. It also uses policy optimization and KL regularization, which are similar to the main optimization ideas in ProEdit. I understand that RIDER and SOLD focus on RNA inverse folding, while ProEdit studies protein optimization. However, they all belong to biological sequence design and optimization, and share similar ideas of using diffusion models and external structural rewards. ProEdit differs from these works by taking a complete parent sequence as input and directly generating an edited sequence without diffusion trajectories during training or inference. However, this remaining difference mainly comes from a simple parallel categorical policy combined with existing GRPO optimization. I find the methodological novelty relatively limited, as the paper does not clearly explain what new insights or advantages this design provides beyond existing approaches.
-
Unclear necessity of diffusion in the proposed framework. The paper is titled "One-Step Protein Optimization with Diffusion Protein Language Models", but I do not see why diffusion is necessary for the proposed method. ProEdit does not optimize or use the diffusion trajectory during downstream training or inference. Instead, it mainly uses the diffusion-pretrained model as a sequence prediction network to directly generate edited sequences from a given parent. In this case, why is a diffusion model needed? For example, could autoregressive or masked protein language models also be used for sequence optimization with similar reward-based training? The proposed parallel prediction and GRPO optimization do not seem to rely on any diffusion-specific mechanism. The paper does not provide sufficient explanation or experimental evidence showing what unique advantage diffusion pretraining brings to this framework. This makes the motivation and methodological contribution less appealing.
References
[1] Hu et al., "RIDER: 3D RNA Inverse Design with Reinforcement Learning-Guided Diffusion." ICLR 2026.
[2] Si et al., "Structure-based RNA Design by Step-wise Optimization of Latent Diffusion Model." AAAI 2026.
Questions for authors
-
What is the main novelty compared with existing studies? Please see weakness1. Could the authors clarify what the main new contribution of ProEdit is beyond these existing ideas?
-
Why is diffusion pretraining necessary for ProEdit? The proposed method does not use diffusion trajectories during downstream optimization or inference. Could other pretrained protein language models, such as autoregressive or masked models, achieve similar results with the same editing policy and GRPO training? What specific advantage does diffusion pretraining provide?
-
Does the current comparison really demonstrate the advantage of one-step editing? According to Table 8 in Appendix D.1, ProEdit takes a complete parent sequence as input, while FullRollout-GRPO starts from an all-mask sequence with only the sequence length matched. This means the comparison changes both the input information and the generation process at the same time. The large performance improvement may therefore come from parent conditioning rather than the one-step editing policy itself. Could the authors explain how these two factors are separated in the current experiments? Would ProEdit still show similar advantages when compared with a parent-conditioned multi-step diffusion editor under the same training budget?
6 comments
2. Why use diffusion pretraining, and can other PLMs be used? (W2, Q2)
We chose DPLM-2 because masked diffusion pretraining equips it with strong capabilities in protein sequence modeling, structure-aware representation learning, and conditional generation. DPLM-2 can leverages bidirectional context to predict residue distributions in parallel, providing a strong pretrained foundation for a full-context editing policy. We investigate whether these pretrained capabilities can be transformed through downstream reward training into the ability to directly optimize existing protein candidates without retaining the native multistep denoising process.
To this end, we retain DPLM-2's pretrained parameters and residue prediction capability, use the complete parent sequence as the policy input, and define the complete edited sequence as the action to be optimized. Pretraining provides a prior for protein modeling, while RL learns effective modifications for the target. This changes not only the sampling strategy, but also the way the pretrained model is trained and optimized for downstream tasks.
Experiments validate this design. Frozen DPLM-2 achieves one-step editing rewards of 0.2597 and 0.2532 (PD-L1 and IFNA2, respectively), which increase to 0.9787 and 0.9434 after GRPO training. This shows that high-quality one-step optimization is not an inherent capability of the pretrained model, but can be learned directly through reward feedback on complete edited sequences. The comparison with FullRollout-GRPO further indicates that retaining the native multistep denoising process is not necessary for this downstream optimization task.
As suggested, we also applied the same full-context editing interface and GRPO training to ESM-2 and ESM-3. Each model used 6,400 optimizer updates and 409,600 training candidates. We followed the sampling and evaluation protocols in Table 1, except that we disabled parent fallback.
| Pretrained backbone | PD-L1 Reward | IFNA2 Reward |
|---|---|---|
| DPLM-2(650M) | 0.9787 | 0.9434 |
| ESM-2(650M) | 0.83957 | 0.57184 |
| ESM-3(1.4B) | 0.85403 | 0.67404 |
These results suggest that the editing formulation is applicable across different pretrained PLMs. Under the evaluated training setup and budget, DPLM-2 achieves higher Reward, supporting its use as the initialization in this study. More broadly, DPLM-2 provides a strong pretrained foundation for downstream protein optimization without requiring its native iterative denoising process to be retained as the downstream policy.
3. Parent-conditioned iterative baseline (Q3)
We trained three parent-conditioned GRPO baselines. M64 starts from a partially masked parent and iteratively completes the masked positions while keeping observed residues fixed. P64 and P500 use the complete parent as a fixed prefix and recover a fully masked part through 64 and 500 native denoising steps, respectively, which providing direct parent-conditioned rollout comparisons with ProEdit.
All methods used the same training budget of 3.2K optimizer updates and 204.8K training reward evaluations. Sampling and evaluation followed the protocol in Table 1, except that parent fallback is disabled.
| Method | PD-L1 Reward | IFNA2 Reward | PD-L1 | IFNA2 | Training GPU-hours (PD-L1 / IFNA2) |
|---|---|---|---|---|---|
| ProEdit | 0.9332 | 0.8719 | 200.00 | 200.00 | 21.6 / 33.1 |
| M64 | 0.2529 | 0.2376 | 200.00 | 200.00 | 110.0 / 120.6 |
| P64 | 0.2590 | 0.3503 | 1.04 | 3.58 | 165.3 / 175.1 |
| P500 | 0.2438 | 0.3244 | 2.91 | 5.06 | 1,303 / 1,321 |
All three parent-conditioned iterative baselines still trail ProEdit in reward. M64 retains high sequence-family diversity but achieves low reward, whereas P64 and P500 exhibit substantial family concentration. Increasing the number of denoising steps from 64 to 500 does not improve reward, despite substantially higher training cost. Under the same training budget, ProEdit achieves higher reward while maintaining () on both targets, with considerably fewer GPU-hours.
We also trained a GRPO baseline with masked infilling (Masked GRPO). During training, we randomly masked positions in the parent sequence, kept visible residues fixed, and predicted the masked positions in a single forward pass. This followed the masked-corruption and recovery formulation of diffusion pretraining, with predictions restricted to the masked positions.
The table reports inference results using the native 500-step diffusion decoder starting from an all-mask input.
| Target | Inference sampling | Optimizer updates | Reward |
|---|---|---|---|
| PD-L1 | All-mask native500 | 3.2K | 0.3325 |
| PD-L1 | All-mask native500 | 6.4K | 0.6701 |
| IFNA2 | All-mask native500 | 3.2K | 0.4711 |
| IFNA2 | All-mask native500 | 6.4K | 0.7145 |
These experiments test whether reward training based on masked infilling can achieve performance comparable to direct full-context editing. Although Masked GRPO improves native diffusion generation, it remains substantially below ProEdit at 6.4K updates on both PD-L1 (0.6701 vs. 0.9787) and IFNA2 (0.7145 vs. 0.9434). This supports directly training the parent-conditioned editing policy rather than relying on masked-infilling training followed by iterative denoising.
Thank you for your thoughtful review and for recognizing the strong experimental results, computational efficiency, and comprehensive evaluation of ProEdit. We appreciate your questions regarding methodological novelty, the role of diffusion pretraining, and the comparison with parent-conditioned iterative methods. Below, we clarify our contributions in relation to SOLD and RIDER and present additional experimental evidence addressing these concerns.
1. Differences from SOLD and RIDER and our main contributions (W1, Q1)
We would first like to clarify the methodological distinctions between ProEdit, SOLD, and RIDER. Simply grouping these methods as applications of RL to diffusion models does not capture the distinct problems they address or their methodological contributions.
Diffusion models and probabilistic formulations
RIDER and SOLD share a continuous Gaussian diffusion formulation, although they operate in different representation spaces. ProEdit differs fundamentally in its underlying generative formulation. DPLM-2 is a pretrained discrete masked-diffusion protein language model. Its pretraining operates on discrete protein tokens, uses masking for corruption, and learns to predict masked tokens, rather than predicting Gaussian noise in continuous representations. For downstream editing, ProEdit directly adapts this pretrained model to define a categorical policy over complete amino-acid sequences conditioned on the parent.
In particular, SOLD uses pretrained RNA-FM representations to construct a separate latent diffusion generator, whereas ProEdit directly reuses the pretrained diffusion protein language model itself for reward-driven protein optimization.
RL policies and actions
RIDER and SOLD both apply RL to the native denoising policies of pretrained diffusion models for structure-conditioned RNA inverse folding. RIDER samples complete denoising trajectories and uses terminal structural rewards to update the policy. SOLD avoids full-trajectory sampling during training by sampling noise levels and evaluating denoising predictions: a short-term reward for a single transition (t→t−1), and a long-term reward for a direct prediction (t→0). Both provide reward feedback to the same noise-conditioned denoising policy, and inference retains the native multistep denoising process.
ProEdit takes a different approach. Rather than optimizing DPLM-2's native denoising policy, we repurpose the pretrained model to define a parent-conditioned policy over complete edited sequences. The complete edited sequence is the RL action, evaluated using its target-specific structural reward. This same action is optimized during training and executed in a single forward pass at inference. It is neither a single transition nor a shortened version of the native diffusion process.
Downstream optimization tasks
RIDER and SOLD address RNA inverse folding, whereas ProEdit optimizes existing protein candidates. Given a parent binder and a target-specific structural reward, ProEdit learns to directly improve the candidate's binding quality.
This task difference motivates a different policy design. RIDER and SOLD condition sequence generation on the target structure, whereas ProEdit conditions editing on the complete parent sequence and evaluates the resulting candidate using its target-specific reward. We therefore decouple input visibility from output editability: the complete parent remains available as context, while every output position can be modified. This defines a direct sequence-editing policy for downstream protein optimization, rather than retaining the native multistep denoising process.
Main contributions
A direct, full-context policy for downstream protein optimization. We turn a diffusion-pretrained protein language model originally used for multistep generation into a one-step sequence optimizer conditioned on the complete parent sequence, decoupling input visibility from output editability.
Direct reward learning with tractable policy quantities. We use parent-wise GRPO to learn complete sequence edits directly. The policy provides explicit action likelihoods and an exact conditional sequence KL to a frozen reference policy. The accompanying theoretical analysis connects reward training to the action used at inference.
Effective and compute-efficient learned protein optimization. Across two binder-design benchmarks, ProEdit achieves the highest reward and iPTM among the methods compared. Its raw policy proposals already show high reward. ProEdit also substantially reduces training cost relative to rollouts with the native 500-step diffusion decoder. The additional parent-conditioned iterative baselines further support the effectiveness of direct reward training for editing.
Diffusion pretraining provides a foundation for protein modeling without prescribing the decision process used for downstream reward optimization.