Linear Fitness Subspace in Protein Language Models Enables Sample-Efficient Directed Evolution
q-bio.QM, cs.AI, cs.LG
Submitted: 2026-10-06
Updated: 2026-10-06
Comments: Accepted to Findings of the Association for Computational Linguistics: EMNLP 2026
License: http://creativecommons.org/licenses/by/4.0/
The gist: Model-guided directed evolution seeks to identify high-fitness protein variants under limited oracle budgets.
Abstract
Model-guided directed evolution seeks to identify high-fitness protein variants under limited oracle budgets. Protein language models (PLMs) provide rich representations for this task, but task-agnostic zero-shot scores can be misaligned with a target assay, while supervised search in high-dimensional embedding spaces can make surrogate modeling and uncertainty estimation sample-inefficient. We propose the Linear Fitness Subspace (LFS) hypothesis: within mutation-induced residue-level representation changes, a compact, assay-specific set of directions makes fitness variation linearly accessible from few labeled variants. This is a local, supervision-recoverable statement rather than a claim that protein fitness landscapes or global PLM geometry are universally linear. Building on this observation, we introduce Subspace-Guided Evolutionary Search (SGES), which estimates an LFS from a small initial sample and performs surrogate modeling, uncertainty estimation, and acquisition in the learned subspace. Across 10 core ProteinGym assays, 87 extended static-validation assays, and an 18-assay budgeted-search evaluation, SGES improves fitness prediction and search efficiency over zero-shot PLMs and recent ML-guided protein optimization baselines. Controlled comparisons with PCA, random projections, label-shuffled PLS, classical mutation features, and acquisition ablations further isolate the benefit of a fitness-aligned site-delta coordinate.
Sources
- Towards Understanding the Shape of Representations in Protein Language Models
- EvoFlows: Evolutionary Edit-Based Flow-Matching for Protein Engineering
- Dropout as a Bayesian Approximation: Appendix
- ODAR: Principled Adaptive Routing for LLM Reasoning via Active Inference
- CoT2-Meta: Budgeted Metacognitive Control for Test-Time Reasoning
- Why Linear Interpretability Works: Invariant Subspaces as a Result of Architectural Constraints
- AdaLead: A simple and robust adaptive greedy search algorithm for sequence design
- Towards A Generative Protein Evolution Machine with DPLM-Evo
- Boosting In-Silicon Directed Evolution with Fine-Tuned Protein Language Model and Tree Search
Related papers
- A likelihood-based framework for simultaneously learning both noise and growth dynamics using biologically-informed neural networks
- Automated Lesion Segmentation of Stroke MRI Using nnU-Net: A Comprehensive External Validation Across Acute and Chronic Lesions
- Imaging-anchored multiomics in cardiovascular disease: integrating cardiac imaging, bulk, single-cell, and spatial transcriptomics
- Resolving satellite-in situ mismatches in Net Primary Production using high-frequency in situ bio-optical observations in the subpolar Northwest Atlantic
- easyplater: The easy way to generate microplate designs deconvolved from multivariate clinical data
- Essential Workers at Risk: An Agent-Based Model (SAFE-ABM) with Bayesian Uncertainty Quantification