mlsanityData to 7 Oct 2026

Contrastive losses as generalized models of global epistasis

arXiv 2305.03136 ↗First posted 4 May 2023q-bio.PE cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Fitness functions map large combinatorial spaces of biological sequences to properties of interest. Inferring these multimodal functions from experimental data is a central task in modern protein engineering. Global epistasis models are an effective and physically-grounded class of models for estimating fitness functions from observed data. These models assume that a sparse latent function is transformed by a monotonic nonlinearity to emit measurable fitness. Here we demonstrate that minimizing supervised contrastive loss functions, such as the Bradley-Terry loss, is a simple and flexible technique for extracting the sparse latent function implied by global epistasis. We argue by way of a fitness-epistasis uncertainty principle that the nonlinearities in global epistasis models can produce observed fitness functions that do not admit sparse representations, and thus may be inefficient to learn from observations when using a Mean Squared Error (MSE) loss (a common practice). We show that contrastive losses are able to accurately estimate a ranking function from limited data even in regimes where MSE is ineffective and validate the practical utility of this insight by demonstrating that contrastive loss functions result in consistently improved performance on benchmark tasks.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 51 references that are in the map. First posted on arXiv 4 May 2023.

Builds on

5 of 51 references.

References · 5

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019Conditioning by adaptive sampling for robust designcited by 110
  3. 2022Tranception: protein fitness prediction with autoregressive transformers and inference-time retrievalcited by 78
  4. 2021Deep Extrapolation for Attribute-Enhanced Generationcited by 18
  5. 2022Spectral Regularization Allows Data-frugal Learning over Combinatorial Spacescited by 1

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.