- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 3(+1)
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes RCC, a generator-independent framework that enforces hard geometric constraints by compiling them directly into the representation space, rather than relying on penalty losses, modified generative dynamics, or post-hoc projection. By recursively decomposing global constraints into local compatibility conditions, RCC constructs exact, invertible, and differentiable coordinates for valid protein backbones, enabling constraint-preserving generation, probabilistic modeling, and inference-time guidance without retraining pretrained generators. Experiments demonstrate geometric feasibility and structural quality comparable to conventional projection methods. In CDR-H3 design, RCC-coordinate guidance improves structural success from 42.0% to 70.1%, substantially outperforming unconstrained Cartesian optimization followed by post-hoc repair (6.6–11.1%).
These results highlight the value of encoding hard constraints directly into the representation, allowing generation and optimization to remain within the feasible space throughout inference.
Critical strengths
I believe that a key strength of this paper lies in its conceptually interesting and mathematically grounded reformulation of constrained protein generation.
Rather than enforcing hard constraints through penalty losses, modified generative dynamics, or post-hoc corrections, RCC constructs a coordinate representation of the feasible space, effectively transforming a challenging constrained optimization problem into a more tractable optimization problem over coordinates that preserve feasibility by construction. I find this to be an elegant and insightful approach to handling hard constraints in probabilistic generative modeling.
Moreover, the method is supported by detailed mathematical derivations and theoretical results concerning coordinate invertibility and volume correction, along with empirical improvements over several relevant baselines.
Critical weaknesses
Although RCC demonstrates substantial improvements over unconstrained optimization followed by post-hoc repair, its performance is comparable to other feasibility-preserving baselines, particularly Riemannian guidance.
This makes it difficult to determine whether the observed improvements stem primarily from maintaining feasibility throughout optimization rather than from the specific advantages of the proposed coordinate representation. While this does not diminish the theoretical contribution of RCC, it somewhat limits the empirical evidence for its distinct practical advantages.
Questions for authors
Thank you to the authors for this interesting work. I have two questions that might help the authors improve:
- Could the authors further clarify the distinctive practical advantages of the proposed coordinate representation compared with existing feasibility-preserving methods, particularly given their comparable performance in Appendix E.5?
- Given that the theoretical construction requires recursively composable constraints with bounded-dimensional summaries, could the authors clarify what evidence supports the broader applicability of RCC beyond the two demonstrated constraint families?
3 comments
Q2. Broader applicability of recursively composable constraints
Given that the theoretical construction requires recursively composable constraints with bounded-dimensional summaries, could the authors clarify what evidence supports the broader applicability of RCC beyond the two demonstrated constraint families?
We developed two additional constructions beyond fixed-endpoint Cα bridges and bounded fixed-total allocations, while preserving the requirement for bounded-dimensional recursive summaries.
Richer peptide backbone. An N/Cα/C/O chart combines RCC's bridge coordinates with rotations of rigid planar peptide units. It enforces specified bond lengths, peptide-unit angles, trans planarity, and fixed-anchor attachment while retaining explicit encoding and decoding. The N–Cα–C angle remains softly restrained. Maximum numerical errors are 2.5 × 10⁻¹⁴ Å for specified bonds, 1.8 × 10⁻¹² degrees for peptide-unit angles and planarity, and 2.9 × 10⁻¹¹ Å for encode–decode reconstruction. Native H3 backbones have a median all-atom representation error of 0.08 Å.
On 202 generated Context-FrameChart development backbones, the new representation improved geometric quality.
| Measure | Before | After |
|---|---|---|
| Bond outliers per 100 checks | 20.3 | 0.0 |
| Angle outliers per 100 checks | 47.2 | 2.0 |
| Ramachandran-favored residues | 53.6% | 75.9% |
RCC extends its exact, invertible representation to chemically meaningful peptide geometry, eliminating specified bond outliers and improving backbone-angle and Ramachandran statistics. With identical peptide constraints, RCC and Newton reached metric-preconditioned objectives of 2.499 and 2.496, respectively.
Certified full-atom construction. A separate extension uses six-dimensional relative-pose summaries and admits a chart only when its validity checks pass. On 20 new CATH loops, 16 admitted valid charts and 14 met the prescribed 0.1 Å motion target. All 20 underwent independent CCTBX/Probe validation. We retain unsuccessful admissions in the denominator.
The peptide and rigid-pose constructions provide concrete evidence that RCC extends to richer protein constraints while retaining exact, invertible coordinates. The theory specifies the applicable class through bounded-dimensional recursive summaries and valid local charts. Side-chain packing and energetics can be modeled separately. The representation appears in Section 2.3, with validation and optimizer controls in Appendices H.4–H.5 and H.12–H.13.
We thank the reviewer again for the thoughtful assessment. We hope the expanded feasible comparisons, practical reconstruction result, and richer-constraint studies address the remaining questions. In light of this evidence, we would be grateful if the reviewer would consider increasing their score and continuing their support of our submission. Thank you!
Thank the authors for their thoughtful responses and the additional experiments. I believe my concerns have been well addressed.
We thank the reviewer for recognizing RCC's mathematically grounded formulation. To clarify the advantages of its coordinate representation, we compared stronger feasibility-preserving methods and evaluated a task that uses RCC's probabilistic structure directly.
W1 + Q1. What does RCC offer beyond feasibility preservation?
We added projected Adam + Newton and expanded the Riemannian + Newton comparison under matched conditions. On the original 288-condition panel (255 PDBs), methods used three checkpoints and three search seeds, shared starts and objectives, 15 updates, and 64 scored calls.
Combined success requires geometric success and PULCHRA steric cleanliness. Intervals use paired PDB-cluster bootstraps, and this expanded test-panel study is post hoc. The results show RCC performs effectively with strong feasibility-preserving guidance methods. Matched RCC, NAMM + Newton, and diffusion + Newton generators also achieved 87/96, 88/96, and 80/96 combined successes after guidance and screening on reused development PDBs.
RCC's distinctive practical benefit is more accurate reconstruction of missing protein loops from sparse, noisy structural measurements. The explicit inverse and tractable density enable local probabilistic inference within the feasible backbone space. We tested this on 229 held-out complexes, with eight simulated noisy distances and matched prior, context, starting states, Cα constraints, and 30-second CPU budgets.
RCC achieves the lowest mean error and highest observed recovery count. Its mean-error reductions are 7.3% versus Newton (adjusted 95% CI [4.3%, 9.1%]), 8.0% versus suffix inference [4.7%, 10.3%], and 9.0% versus direct sampling [5.0%, 11.2%]. All methods share the learned prior and geometric constraints, isolating the benefit of RCC's density-corrected inference procedure. The intrinsic-volume term is not independently isolated.
The reconstruction benchmark provides direct empirical evidence of the value of RCC's probabilistic coordinates beyond feasible guidance. Optimizer and generator controls appear in Section 3.4 and Appendices H.2–H.3 and H.16–H.17. The reconstruction benchmark will be incorporated into Section 3.6 and Appendix H.15.