mlsanityData to 14 Oct 2026

Training-Free Generation of Protein Sequences from Small Family Alignments via Stochastic Attention

arXiv 2603.14717 ↗First posted 16 Mar 2026cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Generating novel protein sequences that respect a family's statistical constraints typically requires training deep generative models on thousands to millions of examples. Yet most protein families are small: the median Pfam seed alignment contains only 22 sequences, a regime where learned models overfit or collapse. We propose stochastic attention (SA), a training-free sampler that treats the modern Hopfield energy over stored sequences as a Boltzmann distribution and draws samples via Langevin dynamics. The score function is the residual of a single softmax attention operation, eliminating the need for a trained score network, pretraining data, or graphics processing units (GPUs). Across eight Pfam families spanning 37 to 420 sequences and 23 to 262 residues, SA generates sequences with low composition divergence, novelty, and structural plausibility supported by ESMFold and AlphaFold2. Compared with profile hidden Markov models (HMMs), EvoDiff, and the multiple sequence alignment (MSA) Transformer, SA is the only tested method to simultaneously achieve low composition divergence, genuine novelty, and sequence identity within each family's nearest-neighbor identity range; the others drift outside this range or produce near-copies. The critical inverse temperature is predicted from principal component analysis (PCA) dimensionality alone, enabling fully automatic operation from a seed alignment. In two domains with deep mutational scanning data, SA-generated substitutions are enriched for experimentally tolerated mutations beyond a position-matched null, and an independent language model (ESM2-650M) scores them within the natural range. Stochastic attention thus opens training-free sequence generation to the long tail of protein families too small for deep learning.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 12 of its 45 references that are in the map. First posted on arXiv 16 Mar 2026.

Builds on

12 of 45 references.

References · 12

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Denoising Diffusion Probabilistic Modelscited by 21,076
  3. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
  4. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,101
  5. 2020Hopfield Networks is All You Needcited by 475
  6. 2016Dense Associative Memory for Pattern Recognitioncited by 236
  7. 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 208
  8. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 197
  9. 2022Tranception: protein fitness prediction with autoregressive transformers and inference-time retrievalcited by 79
  10. 2023Energy Transformercited by 71
  11. 2017Variational auto-encoding of protein sequencescited by 9
  12. 2026Stochastic Attention via Langevin Dynamics on the Modern Hopfield Energycited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2023PoET: A generative model of protein families as sequences-of-sequences
  2. 2022Generative power of a protein language model trained on multiple sequence alignments
  3. 2024Diffusion on language model encodings for protein sequence generation
  4. 2024MSAGPT: Neural Prompting Protein Structure Prediction via MSA Generative Pre-Training
  5. 2022Protein language models trained on multiple sequence alignments learn phylogenetic relationships
  6. 2023Enhancing the Protein Tertiary Structure Prediction by Multiple Sequence Alignment Generation
  7. 2025Understanding protein function with a multimodal retrieval-augmented foundation model
  8. 2025Gene42: Long-Range Genomic Foundation Model With Dense Attention