mlsanityData to 14 Oct 2026

Knowledge-Design: Pushing the Limit of Protein Design via Knowledge Refinement

arXiv 2305.15151 ↗First posted 20 May 2023q-bio.BM cs.AI cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

Recent studies have shown competitive performance in protein design that aims to find the amino acid sequence folding into the desired structure. However, most of them disregard the importance of predictive confidence, fail to cover the vast protein space, and do not incorporate common protein knowledge. After witnessing the great success of pretrained models on diverse protein-related tasks and the fact that recovery is highly correlated with confidence, we wonder whether this knowledge can push the limits of protein design further. As a solution, we propose a knowledge-aware module that refines low-quality residues. We also introduce a memory-retrieval mechanism to save more than 50% of the training time. We extensively evaluate our proposed method on the CATH, TS50, and TS500 datasets and our results show that our Knowledge-Design method outperforms the previous PiFold method by approximately 9% on the CATH dataset. Specifically, Knowledge-Design is the first method that achieves 60+% recovery on CATH, TS50 and TS500 benchmarks. We also provide additional analysis to demonstrate the effectiveness of our proposed method. The code will be publicly available.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 28 of its 67 references that are in the map. First posted on arXiv 20 May 2023.

Builds on

28 of 67 references.

References · 28

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
  4. 2016Densely Connected Convolutional Networkscited by 6,720
  5. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
  6. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,576
  7. 2018Deep Learning on Graphs: A Surveycited by 393
  8. 20183D Steerable CNNs: Learning Rotationally Equivariant Features in Volumetric Datacited by 354
  9. 2020Learning from Protein Structure with Geometric Vector Perceptronscited by 313
  10. 2022SimVP: Simpler yet Better Video Predictioncited by 184
  11. 2022Protein Representation Learning by Geometric Structure Pretrainingcited by 162
  12. 2022EquiBind: Geometric Deep Learning for Drug Binding Structure Predictioncited by 144
16 more
  1. 2022PiFold: Toward effective and efficient protein inverse foldingcited by 83
  2. 2022OntoProtein: Protein Pretraining With Gene Ontology Embeddingcited by 70
  3. 2023Structure-informed Language Models Are Protein Designerscited by 68
  4. 2022AlphaDesign: A graph protein design method and benchmark on AlphaFoldDBcited by 40
  5. 2021Protein sequence design with deep generative modelscited by 35
  6. 2020Deep Learning in Protein Structural Modeling and Designcited by 25
  7. 2021Fold2Seq: A Joint Sequence(1D)-Fold(3D) Embedding-based Generative Model for Protein Designcited by 23
  8. 2022OpenMixup: Open Mixup Toolbox and Benchmark for Visual Representation Learningcited by 21
  9. 2022Target-aware Molecular Graph Generationcited by 18
  10. 2021Deep Generative Modeling for Protein Designcited by 17
  11. 2022SemiRetro: Semi-template framework boosts deep retrosynthesis predictioncited by 13
  12. 2022CoSP: Co-supervised pretraining of pocket and ligandcited by 12
  13. 2022HelixFold: An Efficient Implementation of AlphaFold2 using PaddlePaddlecited by 12
  14. 2023DiffSDS: A language diffusion model for protein backbone inpainting under geometric conditions and constraintscited by 10
  15. 2023PrefixMol: Target- and Chemistry-aware Molecule Design via Prefix Embeddingcited by 7
  16. 2022TERMinator: A Neural Framework for Structure-Based Protein Design using Tertiary Repeating Motifscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 5; 2024: 4; 2025: 1; 2026: 2.

12 papers.