PreprintCited by 7Machine Learning in BioinformaticsProtein Structure and DynamicsRNA and protein synthesis mechanisms

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Efficient Inference, Training, and Fine-tuning of Protein Language Models

Open access

Preprint — published as 10.1016/j.isci.2025.113495 · Paper page

Abstract

Protein language models have shown great promise in predicting protein structure, function, and the effects of missense variants on protein fitness. However, their use has been limited by the substantial computational resources required. In this work, we focus on improving the computational efficiency of protein language models (PLMs), specifically the Evolutionary Scale Modeling (ESM) family, to increase the accessibility of PLMs. By implementing optimizations such as FlashAttention and Partition-Attention, a novel technique designed to handle proteins of variable length, we achieved a 16-fold speedup in inference time and reduced memory usage by 3 to 14 times for long proteins. Additionally, 4-bit quantization applied to billion-parameter models led to a 2 to 3 times reduction in memory consumption with minimal performance loss in the missense variant effect prediction task. Training efficiency was also improved, with a 6-fold reduction in runtime achieved through activation checkpointing and the DeepSpeed Zero-Offload strategy. For fine-tuning, we employed parameter-efficient methods, enabling state-of-the-art predictions of protein properties and functions by training only the model head or a small fraction of adapter weights. For instance, we achieved a Spearman’s correlation coefficient of 70% in melting point prediction and an 87% area under the precision-recall curve (AU-PRC) for transcription factor prediction. Our efficient ESM (ESME) implementation significantly lowers the barrier to using these powerful models, making them accessible to academic laboratories with limited computational resources. The ESME implementation is available on PyPI ( pypi.org/project/esm-efficient ) and GitHub ( github.com/uci-cbcl/esm-efficient ).

Overview

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/2024.10.22.619563

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

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

Self-check

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

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

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 62

  1. 10.1038/s41580-024-00718-y · DOI
  2. 10.1038/s41467-022-29268-7 · DOI
  3. 10.1038/s41586-019-1923-7 · DOI · Paper page
  4. 10.1038/s41586-024-07487-w · DOI · Paper page
  5. 10.1126/science.ade2574 · DOI · Paper page
  6. 10.48550/arXiv.2007.06225 · DOI
  7. 10.1101/2023.07.23.550085 · DOI · Paper page
  8. 10.1038/s42256-024-00795-w · DOI · Paper page
  9. 10.1126/science.adg7492 · DOI · Paper page
  10. 10.1038/s41588-023-01465-0 · DOI
  11. 10.1038/s41588-018-0167-z · DOI
  12. 10.48550/arXiv.1706.03762 · DOI · Paper page
  13. 10.7554/eLife.82819 · DOI
  14. 10.1101/2021.07.09.450648 · DOI · Paper page
  15. 10.1073/pnas.2016239118 · DOI · Paper page
  16. 10.1016/j.cels.2023.10.002 · DOI · Paper page
  17. 10.1101/2021.02.12.430858 · DOI · Paper page
  18. 10.1093/bioinformatics/btac020 · DOI · Paper page
  19. 10.48550/arXiv.1907.11692 · DOI · Paper page
  20. 10.1101/2022.12.31.522396 · DOI
  21. 10.1038/s41592-018-0138-4 · DOI · Paper page
  22. 10.1038/nbt.3769 · DOI · Paper page
  23. 10.1038/s41586-023-06328-6 · DOI · Paper page
  24. 10.1101/2022.12.25.521875 · DOI
  25. 10.1101/2021.11.09.467890 · DOI
  26. 10.1101/2024.10.11.617911 · DOI
  27. 10.1073/pnas.2320510121 · DOI
  28. 10.1126/sci-ence.adf2465 · DOI
  29. 10.1038/s41467-024-52533-w · DOI
  30. 10.1101/2024.04.17.589997 · DOI
  31. 10.1073/pnas.2316401121 · DOI
  32. 10.1038/s41467-023-43597-1 · DOI
  33. 10.1073/pnas.2220778120 · DOI
  34. 10.1101/2024.10.14.618129 · DOI
  35. 10.1038/s41587-023-01763-2 · DOI
  36. 10.1101/2024.07.01.600583 · DOI
  37. 10.1038/s41586-021-04043-8 · DOI · Paper page
  38. F. Zhu et al., “ScaleFold: Reducing AlphaFold Initial Training Time to 10 Hours,” arXiv.org. Accessed: Oct. 07, 2024. [Online]. Available: https://arxiv.org/abs/2404.11068v1 · DOI
  39. 10.48550/arXiv.2402.09748 · DOI
  40. 10.48550/arXiv.2403.14608 · DOI · Paper page
  41. 10.48550/arXiv.2312.03863 · DOI
  42. 10.48550/arXiv.2401.00625 · DOI
  43. 10.48550/arXiv.2307.08691 · DOI · Paper page
  44. 10.1093/nar/gkac1052 · DOI · Paper page
  45. 10.48550/arXiv.1905.12322 · DOI · Paper page
  46. 10.1073/pnas.2405840121 · DOI · Paper page
  47. 10.1038/s41467-024-46947-9 · DOI · Paper page
  48. T. Dettmers , M. Lewis , Y. Belkada , and L. Zettlemoyer , “LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale,” Nov. 10, 2022, arXiv: arXiv:2208.07339. Accessed: Jun. 07, 2024. [Online]. Available: http://arxiv.org/abs/2208.07339 · arXiv
  49. 10.48550/arXiv.2305.14314 · DOI · Paper page
  50. 10.1101/2023.12.07.570727 · DOI
  51. J. Gehring , M. Auli , D. Grangier , D. Yarats , and Y. N. Dauphin , “Convolutional Sequence to Sequence Learning,” Jul. 24, 2017, arXiv: arXiv:1705.03122. Accessed: Oct. 07, 2024. [Online]. Available: http://arxiv.org/abs/1705.03122 · arXiv
  52. D. P. Kingma and J. Ba , “Adam: A Method for Stochastic Optimization,” arXiv.org. Accessed: Oct. 08, 2024. [Online]. Available: https://arxiv.org/abs/1412.6980v9 · arXiv
  53. J. Ren et al., “ZeRO-Offload: Democratizing Billion-Scale Model Training,” arXiv.org. Accessed: May 25, 2024. [Online]. Available: https://arxiv.org/abs/2101.06840v1 · arXiv
  54. 10.48550/arXiv.2106.09685 · DOI · Paper page
  55. 10.1038/s41592-020-0801-4 · DOI
  56. 10.1073/pnas.2021171118 · DOI
  57. 10.48550/arXiv.2303.08302 · DOI
  58. 2022, “ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformers,”, Adv. Neural Inf. Process. Syst, 35, 27168
  59. 10.48550/arXiv.2010.04903 · DOI
  60. “[2104.09864] RoFormer: Enhanced Transformer with Rotary Position Embedding.” Accessed: Oct. 21, 2024. [Online]. Available: https://arxiv.org/abs/2104.09864 · arXiv
  61. 10.48550/arXiv.1606.08415 · DOI · Paper page
  62. 10.48550/arXiv.2205.14135 · DOI · Paper page

Metadata

Authors
Çelik, M. H., & Xie, X.
Affiliations
University of California, Irvine (US)
Corresponding author
Xie, Xiaohui
Venue
iScience
Publisher
openRxiv
Published
2024-10-25
Volume
28
Issue
10
Pages
113495-113495
ISSN
2589-0042 (ISSN-L)
OpenAlex
W4413950477
Cited by
7
References
1
Citations by year
2026: 5 · 2025: 2
FWCI
2.09
Type
journal article
Language
en
Open access
Locations
  • iScience (publishedVersion, cc-by)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by)
  • Europe PMC (PubMed Central) (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • PubMed Central (publishedVersion, cc-by)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA and protein synthesis mechanisms
Keywords
protein language models, FlashAttention, parameter-efficient fine-tuning, adapters, protein property prediction, protein function prediction, transcription factor identification, computational efficiency

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