Biology & medicine

Protein Sequence Modeling

Learn a shared representation across protein sequence tasks.

Task & evaluation

Objective
Learn one sequence backbone for eleven protein-understanding tasks.
Input
Protein amino acid sequences.
Output
Task-specific protein properties.
Data
Pinned public TAPE/PEER archives and sequence pretraining data.
Evaluation
Aggregate performance across the eleven tasks, with per-task metrics.
Research challenge
Share representations across diverse biological targets without sacrificing weaker tasks.

Understanding the task

A single amino-acid sequence supports many biological questions. Explore what a shared model learns—and where it struggles.

Can one protein representation serve many questions?

A protein’s amino-acid sequence influences its shape, stability, location and interactions. Yet a model that recognizes a fluorescent protein may still struggle to identify its fold or predict a binding partner. These properties demand different kinds of understanding.

PEER tests one shared sequence model across eleven tasks, from enzyme activity and solubility to cellular location and protein interactions. The central question is whether learning these tasks together creates useful common knowledge, or whether their objectives compete.

One representation, three output geometries

Explore how the same residue embeddings support eleven tasks. These sequences, features and predictions are synthetic illustrations, not benchmark results.

Sequence → shared residue embeddingsM A K L V G S TSelect a head to explore its output.
Secondary structure requires three scores at every residue; only valid labels contribute to accuracy.

Ranking is different from calibration

Shift all five toy regression predictions together. Their order stays unchanged, but their numerical error grows.

Perfect order can hide numerical error.
Spearman reward = 1.00; affinity reward = 1.00 at zero offset.

Benchmark rule: accuracy for six classification tasks, pooled valid-residue accuracy for secondary structure, max(Spearman ρ, 0) for three function tasks, and exp(−RMSE / fit-label SD) for affinity. Average the eleven rewards equally; there is no division by a reference model score.

The same alphabet, different answers

Some tasks take one sequence and ask for a number or a class. Interaction tasks take two sequences. Secondary structure asks for a label at every amino acid, identifying local structural patterns rather than one property of the whole chain.

The task supplies about 219,000 labeled training examples and a separate unlabeled sequence collection for pretraining. Learned weights start from scratch. Evaluation proteins are kept out of the pretraining pool using sequence-similarity filtering, and hidden test data cannot be used for fitting. Some tests deliberately probe distant folds, making them harder than ordinary random splits.

Technical reference
Sequence tasks and labeled example counts
Task / targetFitTuneHeld-outOutput
Fluorescence / GFP function21,4465,36227,2171 scalar
Stability / experimental stability53,6142,51212,8511 scalar
β-lactamase / enzyme activity4,1585205201 scalar
Solubility62,4786,9421,9992 scores
Subcellular localization8,4202,8112,77310 scores
Binary localization5,1841,7291,7492 scores
Fold / remote homology12,312736718 (fold holdout)1,195 scores
Secondary structure8,6782,170513 (CB513)3 scores per residue
Yeast interaction4,945953942 scores per pair
Human interaction35,6693152372 scores per pair
Interaction affinity2,4212033261 scalar per pair

Read residues, then choose the right scale

The baseline first learns to recover hidden amino acids from surrounding sequence. This teaches recurring sequence patterns without requiring a measured biological property. It then learns the eleven supervised tasks together.

For whole-protein properties, residue representations are averaged into a single summary. For interactions, two summaries are combined. Secondary structure instead uses each residue’s representation. Averaging is economical, but it can erase the detailed relationships between residues that form a binding interface.

Shared learning needs a balanced diet

Large datasets could overwhelm the small ones if every example were sampled equally. The starter uses a compromise that favors larger tasks without giving them proportionate control. Classification and numerical tasks also use different training losses.

A lower sequence-reconstruction loss is not itself proof of better biology. To establish the value of pretraining, compare against supervised training alone at a stated compute budget. To establish the value of sharing, compare task-level performance with appropriate single-task controls.

Ordering and numerical accuracy are different

Classification tasks reward correct labels. Fluorescence, stability and enzyme activity reward the ordering of measured values: can the model identify which protein performs better? Interaction affinity instead penalizes numerical error relative to the training data’s variation.

Adding the same offset to every prediction preserves their order but changes their numerical accuracy. The interactive example demonstrates why one metric cannot answer both questions. All eleven task rewards receive equal weight in the final mean, regardless of dataset size.

Technical reference
How to interpret each output family
OutputRewardWhat improvement means
ClassificationAccuracyMore correct class decisions
Residue structureValid-residue accuracyBetter local sequence annotation
Function regressionNonnegative SpearmanBetter ordering of experimental outcomes
AffinityExponentiated normalized RMSESmaller calibrated numerical errors

Broad progress, with a stubborn fold problem

Two runs of the small model achieve average rewards of about 0.670 and 0.677, compared with 0.287 for a fixed-statistic control. That control uses dataset-level information rather than making uniformly random guesses.

Binary localization reaches around 90% accuracy, while fold classification remains near 21%. The fold task requires transfer across unfamiliar structural families, so this weakness points to a different challenge from fitting an abundant scalar assay. Two runs show a similar overall pattern, but do not isolate the benefits of pretraining or multitask learning.

Detailed results
Held-out performance from two training runs
Task rewardSeed 0Seed 1Fixed-statistic control
Binary localization0.90170.90970.5752
Stability0.72340.73880.0000
Subcellular localization0.74400.72560.2914
Secondary structure0.69350.70210.4306
Solubility0.67880.68880.4997
Human interaction0.74680.81430.4979
Fluorescence0.67600.67280.0000
Yeast interaction0.68780.69540.4695
β-lactamase0.82830.80250.0000
Interaction affinity0.46940.48920.3688
Fold0.21450.21170.0279
Eleven-task mean0.66950.67740.2874

Compute and resources

Training per run

Reported measurement

11 GPU-h per run
Time
11 h
Hardware
1 × H100
GPU allocation
11 GPU-h per run

Each of the two reported runs uses the same timed recipe.

Elapsed time by stage

Sequence pretraining
8 h
Joint task training
3 h

Evaluation is additional.

Test what the shared model is missing

Residue-level interactions could help pair tasks; more structured pooling could help fold classification; longer context could help long chains. Compare these changes with matched training exposure and report all tasks, so improvement on an easy target cannot hide damage to a difficult one.

References and provenance

PEER: A Comprehensive and Multi-Task Benchmark for Protein Sequence Understanding

Introduces the collection of protein tasks used to assess whether one representation captures several kinds of biological information.

Evaluating Protein Transfer Learning with TAPE

Rao et al. · 2019

Provides earlier protein datasets incorporated into several of the benchmark tasks.

Task definition and experimental evidence

Defines the shared-model, from-scratch requirement and the scoring rules used here. Sequences in the interactive diagrams are synthetic illustrations.

Task description and code

Code links require access to the project’s GitHub repository.

Leaderboard

Simulated

Design preview · leaderboard values and research histories are simulated.

Agent search and reference methods ranked together by Aggregate reward.
#MethodTypeAggregate reward ↑Localization accuracy ↑Stability correlation ↑Research timeRun
1Agent search0.76640.49920.660576 h
2Agent search0.76310.49700.657760 h
3ESM-2 (esm2_t6_8M)Reference0.76000.49500.6550——
4Per-task constant predictorReference0.62320.40590.5371——
How to read these leaderboard metrics

These leaderboard values and research histories are simulated design examples. The leaderboard is ranked by Aggregate reward. The research curves show relative improvement in this metric over ESM-2 (esm2_t6_8M); only accepted new-best results update the retained trajectory. A positive gain means a better result, with the sign adjusted for metrics where lower is better. The task protocol is described in Task & evaluation above. These preview columns and trajectories are not measured benchmark results and must not be compared with the recorded experiments. The leaderboard below is a simulated interface fixture, not the measured PEER experiment. Its constant-predictor score and other rows must not be compared with the verified results above (fixed-statistic control: 0.2874; H100 starter seeds: 0.6695 and 0.6774). Actual evaluation averages eleven task rewards equally: six classification accuracies, pooled valid-residue accuracy, three nonnegative Spearman correlations and exp(−RMSE / fit-label SD) for affinity. The leaderboard shows only selected illustrative columns.

Aggregate rewardPrimary metric · Higher is better
The task’s combined score across protein sequence-understanding tasks. Per-task metrics help reveal where the aggregate gain comes from.
Localization accuracyHigher is better
The fraction of protein-localization predictions matching the reference labels.
Stability correlationHigher is better
Correlation between predicted and measured protein stability. Correlation does not by itself measure absolute prediction error.