Antibody-SGM, a Score-Based Generative Model for Antibody Heavy-Chain Design
Bibliographic record
Abstract
Traditional computational methods for antibody design involved random mutagenesis followed by energy function assessment for candidate selection. Recently, diffusion models have garnered considerable attention as cutting-edge generative models, lauded for their remarkable performance. However, these methods often focus solely on the backbone or sequence, resulting in the incomplete depiction of the overall structure and necessitating additional techniques to predict the missing component. This study presents Antibody-SGM, an innovative joint structure-sequence diffusion model that addresses the limitations of existing protein backbone generation models. Unlike previous models, Antibody-SGM successfully integrates sequence-specific attributes and functional properties into the generation process. Our methodology generates full-atom native-like antibody heavy chains by refining the generation to create valid pairs of sequences and structures, starting with random sequences and structural properties. The versatility of our method is demonstrated through various applications, including the design of full-atom antibodies, antigen-specific CDR design, antibody heavy chains optimization, validation with Alphafold3, and the identification of crucial antibody sequences and structural features. Antibody-SGM also optimizes protein function through active inpainting learning, allowing simultaneous sequence and structure optimization. These improvements demonstrate the promise of our strategy for protein engineering and significantly increase the power of protein design models.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".