- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3(+1)
- Soundness
- 2
Read review
Paper summary
This paper proposes Fixed-Cardinality Joint Diffusion (FC-JD), a discrete diffusion framework for combinatorial protein design under exact mutation-cardinality constraint. The method models mutation positions through a diffusion process on the Johnson graph, where each transition preserves exactly K mutated positions, and uses a separate residue diffusion stream to model amino-acid identities when needed. The authors further introduce a simulation-free training objective based on analytically computed reverse-transition posteriors.
The proposed method is evaluated on several protein fitness landscapes, with models trained on low-order mutations and tested on higher-order designs. The experiments compare FC-JD against simulated annealing and Bayesian optimization in terms of fitness, diversity, validity, and computational cost. Results show that FC-JD guarantees exact-K generation, produces diverse candidate batches with low sampling latency, and achieves competitive extreme-tail fitness compared with Bayesian optimization in the reported settings.
Critical strengths
-
Well-motivated problem formulation. This paper addresses the problem that a practically relevant setting where generated protein sequences must contain exactly K mutations relative to a reference. Enforcing this constraint directly during generation is a meaningful alternative to post-hoc filtering or rejection sampling.
-
Interesting methodological design. Modeling mutation-position sets through diffusion on the Johnson graph provides a natural way to preserve the exact-K constraint throughout the generation process. The use of an analytically computed reverse-transition posterior is also an interesting aspect of the framework.
-
Comprehensive evaluation and transparent reporting. The paper evaluates the proposed method across multiple protein fitness landscapes and considers several relevant metrics, including fitness, diversity, validity, and computational efficiency.
Critical weaknesses
1. Missing comparisons with constrained generative baselines.
The current baselines do not establish the advantages of Johnson-graph diffusion over simpler exact-K methods, such as stochastic Top-K sampling or other fixed-cardinality generators. Unconstrained diffusion only demonstrates the need for cardinality enforcement. Comparisons with diversity-oriented methods such as GFlowNets (Jain et al., ICML 2022) would further strengthen the evaluation.
2. Limited evidence of a superior quality–diversity trade-off.
SA achieves higher mean fitness across all four oracle-evaluable landscapes, while BO offers comparable diversity in several settings. The extreme-tail comparison selects the better result between FC-JD and P+R, and only 2 of 7 pre-registered criteria are met. A systematic quality–diversity comparison under matched budgets is needed to clarify FC-JD's practical advantages.
3. Limited evaluation on realistic protein design tasks.
Most experiments use small combinatorial landscapes, with antibody tasks restricted to predefined substitutions and DHFR using a small alphabet. GFP lacks reliable exact-K fitness evaluation. Thus, scalability to longer protein sequences, larger amino-acid alphabets, and complex mutational interactions remains unclear.
Questions for authors
-
Could the authors clarify what advantages Johnson-graph diffusion offers over simpler exact-K generation methods, such as stochastic Top-K sampling? Would comparisons with constrained generative baselines or GFlowNets change the conclusions?
-
Given that SA achieves higher mean fitness and only 2 of 7 pre-registered criteria are met, under what conditions does FC-JD provide a clear advantage in the quality–diversity trade-off? Could the authors provide comparisons under matched computational and candidate budgets?
-
How well is FC-JD expected to scale to realistic protein design tasks involving longer sequences and larger amino-acid alphabets? Is there additional evidence beyond the current small combinatorial landscapes?
I would be willing to reconsider my rating if the authors can adequately address these questions.