mlsanityData to 14 Oct 2026

Conditioning Protein Generation via Hopfield Pattern Multiplicity

arXiv 2603.20115 ↗First posted 20 Mar 2026cs.LG q-bio.BM q-bio.QMcited by 1

Not on the map. Why?

Abstract (arXiv)

Small protein-family alignments often contain a subset of interest but not enough labeled data to train a conditional generator. We condition a training-free stochastic-attention sampler by adding one multiplicity ratio to its logits. Increasing this ratio shifts generation from the full family toward the designated subset. For unit-norm memories, the resulting Boltzmann distribution is exactly a Gaussian mixture whose component weights are set by the multiplicities. This result separates exact conditioning in latent space from losses caused by sampling, PCA reconstruction, and sequence decoding. Across five Pfam families, attention followed the analytic target, but recovery of single-residue markers depended on how well PCA separated the designated and background sequences. A matched weighted profile HMM reproduced these markers more directly, while stochastic attention gave lower ESM2 pseudo-perplexity in the Kunitz comparison. Using a curated set of 23 omega-conotoxin sequences as the target subset produced diverse sequences that preserved the cysteine scaffold and Tyr13 and shifted other residues toward the designated set. These sequences are candidates for experimental testing; they do not establish binding.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 27 references that are in the map. First posted on arXiv 20 Mar 2026.

Builds on

3 of 27 references.

References · 3

  1. 2020Hopfield Networks is All You Needcited by 475
  2. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 197
  3. 2026Training-Free Generation of Protein Sequences from Small Family Alignments via Stochastic Attentioncited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.