PreprintCited by 342Protein Structure and DynamicsMachine Learning in BioinformaticsRNA and protein synthesis mechanisms

Transformer protein language models are unsupervised structure learners

Open access
Rao, Roshan, Meier, Joshua, Sercu, Tom, Ovchinnikov, Sergey, Rives, Alexander·2020·bioRxiv (Cold Spring Harbor Laboratory)

Abstract

A bstract: Unsupervised contact prediction is central to uncovering physical, structural, and functional constraints for protein structure determination and design. For decades, the predominant approach has been to infer evolutionary constraints from a set of related sequences. In the past year, protein language models have emerged as a potential alternative, but performance has fallen short of state-of-the-art approaches in bioinformatics. In this paper we demonstrate that Transformer attention maps learn contacts from the unsupervised language modeling objective. We find the highest capacity models that have been trained to date already outperform a state-of-the-art unsupervised contact prediction pipeline, suggesting these pipelines can be replaced with a single forward pass of an end-to-end model. 1

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1101/2020.12.15.422761

Cites

66 of 66 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Attention-based networks are extremely powerful for modeling complicated interactions between entities, making them suitable for modeling proteins whose functions are largely determined by interactions between amino acids.

    “Among many successful neural network architectures, attention-based networks are extremely powerful for modeling complicated interactions between entities, making them suitable for modeling proteins whose functions are largely determined by interactions between amino acids (34–37).”
  • Various language model-based protein embedding methods have been applied to protein prediction problems through transfer learning, including protein phenotype prediction, residue-residue contact prediction, fold recognition, protein-protein and protein-drug interaction prediction.

    “Since then, various language model-based protein embedding methods have been applied to these and other protein prediction problems through transfer learning, including protein phenotype prediction 28,32-34, residue-residue contact prediction 32,70, fold recognition 33, protein-protein 71,72 and protein-drug interaction prediction 35,73.”
  • Increasing language model scale leads to continued improvements in downstream applications, such as residue-residue contact prediction.

    “Recent works have shown that increasing language model scale leads to continued improvements in downstream applications, such as residue-residue contact prediction 70.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. Robert D. Finn, Alex Bateman, Jody Clements, Penelope Coggill, Ruth Y. Eberhardt, Sean R. Eddy, Andreas Heger, Kirstie Hetherington, Liisa Holm, Jaina Mistry, Erik L.L. Sonnhammer, John Tate, and Marco Punta. Pfam: The protein families database, 1 2014. ISSN 03051048. URL https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3965110/.
  2. pubmedcentral.nih.gov/articlerender.fcgi?artid=PMC4201158https: //academic.oup.com/bioinformatics/article-lookup/doi/10.1093/ bioinformatics/btu500. · DOI

Cited by

Sorted by citations

Authors
Rao, R., Meier, J., Sercu, T., Ovchinnikov, S., & Rives, A.
Affiliations
  • University of California, Berkeley (US)
  • Meta (United States) (US)
  • Harvard University (US)
Corresponding author
  • Rao, Roshan
  • Meier, Joshua
  • Sercu, Tom
  • Ovchinnikov, Sergey
  • Rives, Alexander
Venue
bioRxiv (Cold Spring Harbor Laboratory)
Publisher
openRxiv
Published
2020-12-15
OpenAlex
W3111174583
Cited by
341
References
63
Citations by year
2026: 51 · 2025: 67 · 2024: 79 · 2023: 56 · 2022: 49 · 2021: 37 · 2020: 2
Type
posted content
Language
en
Open access
Locations
bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by-nc-nd)
Funders
National Institutes of Health (DP5OD026389)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA and protein synthesis mechanisms
Keywords
protein language models, protein structure prediction, protein structure design, evolutionary constraints

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review