- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
De novo antibody design by inverting a co-folding model: optimise CDR sequence logits so the model’s own structural and confidence outputs report a favourable complex, as BindCraft does with AlphaFold-Multimer. Modern all-atom models like Boltz-2) predict antibody–antigen complexes better but decode with a diffusion sampler, and unrolled backpropagation through T denoising steps costs O(T) activation memory. Existing work avoids the sampler leaving objectives defined on emitted coordinates unavailable. The authors propose a solution ABPilot . It differentiates the sampler with a discrete adjoint recursion and trajectory replay. The forward pass runs graph-free while caching coordinates and per-step noise, and the backward pass reconstructs one transition at a time. Each step at t is rebuilt from its cached coordinates and noise, differentiated locally, then discarded. The authors claim that this yields the first end-to-end gradient through a diffusion co-folding model at activation memory constant in depth, that the resulting coordinate gradients enable geometric objectives unavailable to trunk-level methods, and that periodic re-ranking by an independent predictor limits model-specific reward hacking.
Critical strengths
- The paper is well written and well motivated
- The ablation against a distogram surrogate changes exactly one thing, whether the geometric gradient starts in sampled coordinates or in a predicted distance distribution, and finds that the surrogate reaches lower confidence loss but worse downstream acceptance (Appendix H Table 5), which helps generalise past antibodies to ither predictor-inversion methods 3.The authors provide a practical insight into what is feasible. Unrolling fails at T = 2 on a real job while the adjoint holds constant to T = 200 (appendix B), and the benchmark gap over four baselines on 11–12 of 12 targets is too large to be run-to-run noise (Appendix I).
Critical weaknesses
AlignProp (Prabhudesai et al., 2024) is not cited, and the claim to end-to-end differentiation rests on its absence. AlignProp backpropagates the reward gradient through the denoising chain of a diffusion model and makes it fit in memory with gradient checkpointing, reporting a reduction from 512 GB to 15 GB on a single GPU, which is a similar problem, and solution as section3.2 and Fig. 4.
Questions for authors
Please position the work against AlignProp (Prabhudesai et al., 2024), which backpropagates through the full denoising chain with gradient checkpointing. This has direct implication on appendix A Specifically: how does the adjoint recursion of section 3.2 differ from checkpointing at timestep granularity, beyond the replay of ε_t required by AF3’s rigid-body augmentation, and does any part of the memory result not follow from checkpointing alone? If the difference is one of application rather than procedure, please say so and identify which contributions you would have the reader weigh instead.
6 comments
Dear Reviewer,
We would appreciate it if you could take a look at our rebuttal and let us know whether your concerns have been adequately addressed. As the discussion period is approaching its end, we would particularly appreciate any further feedback you may have.
We would be happy to clarify any remaining questions.
Best regards,
The Authors
Dear Reviewer,
As today is the final day of the discussion period, we kindly ask if you could review our rebuttal and let us know whether your concerns have been addressed.
We have invested significant time and effort into carefully addressing your questions, including conducting additional experiments and providing detailed clarifications. We would sincerely appreciate your feedback.
Thank you for your time and consideration.
Best regards, The Authors
We thank the reviewer for bringing AlignProp [1] to our attention.
Methodological differences. As AlignProp was originally developed for text-to-image diffusion models, we adapt its official implementation (https://github.com/mihirp1998/AlignProp/) to antibody design for a fair comparison, using the same frozen co-folding predictor, sequence optimization variables, and molecular objectives as AbPilot.
Both methods support gradient propagation through diffusion trajectories using recomputation. However, our discrete adjoint formulation explicitly separates forward sampling from backward differentiation , computing local vector–Jacobian products (VJPs) at each denoising step and accumulating gradients with respect to the shared conditioning before propagating them to sequence logits.
Importantly, unlike Gaussian truncation in AlignProp, which stops gradients through network predictions at selected denoising steps, our method preserves all diffusion-step gradient pathways . By explicitly replaying the stochastic variables from the forward trajectory, we recover the full discrete gradient, subject to the predictor's existing stop-gradient operations, without introducing additional temporal truncation.
Gradient fidelity evaluation. To quantify this distinction, we evaluated a 438-residue DerF7–scFv complex using 25 diffusion steps, three paired random seeds, and five Gaussian cutoff samples per initial input.
We compared each computed gradient g^ against the untruncated reference gradient g under identical inputs and stochastic trajectories, using three metrics:
Relative gradient error:
∥g∥2∥g^−g∥2
Cosine similarity:
∥g^∥2∥g∥2g^⋅g
Angular deviation:
\frac{\hat{\mathbf{g}}\cdot\mathbf{g}}{\|\hat{\mathbf{g}}\|_2\|\mathbf{g}\|_2} \right)$$ | Metric | AbPilot (local VJP) | Gaussian-truncated AlignProp | | ------------------------------ | ------------------------ | ---------------------------- | | Median relative gradient error | **6.98 × 10⁻⁷** | 98.89% | | Relative error range | 6.43–7.04 × 10⁻⁷ | 77.80–99.74% | | Median cosine similarity | **≈ 1.0** | 0.1576 | | Median angular deviation | **≈ 0.000040°** | 80.93° | **Our formulation reproduces the untruncated reference gradient with near-machine-precision agreement** , preserving both its magnitude and direction. In contrast, Gaussian truncation introduces substantial gradient discrepancies, with angular deviations ranging from 50.22° to 85.45°, indicating changes in gradient direction rather than merely magnitude. **Memory efficiency.** Our approach manages memory by constructing and releasing local computation graphs during the backward sweep, without discarding diffusion-step gradient pathways. Across three seeds and 25 consecutive optimization updates per seed, our encoder-recomputation variant achieves **approximately 7.1% lower mean peak allocated memory** than the AlignProp implementation. **Overall, these results demonstrate that AbPilot preserves full-gradient fidelity while achieving modest additional memory savings in the evaluated setting.** We emphasize that our contribution is not a fundamentally different mathematical gradient from exact checkpointed backpropagation, but an explicit trajectory-level differentiation formulation integrated into antibody co-folding optimization. This enables direct sequence optimization against structure-dependent geometric objectives while maintaining precise control over gradient propagation. [1] Prabhudesai, Mihir, et al. "Aligning text-to-image diffusion models with reward backpropagation." (2023).