bioRxivBioinformaticsPreprint
CAPO: Compute-Aware Automated Protein-Model Optimization
Theo Schifferli, J. García PardiñasiD, Edward B. IrvineiD, Mary‐Anne HartleyiD, Thomas BikiasiD
Abstract
Protein models such as Evolutionary Scale Modeling (ESM), AlphaFold and Boltz have transformed computational protein science, yet a pretrained model rarely transfers to a particular laboratory's assay without adaptation to its data and experimental setting, and that adaptation is technically demanding and spends real compute budget. Existing agentic systems can automate model training, yet typically treat fine-tuning as a reliable tool call: feasibility and cost are estimated rather than measured, and infeasibility is discovered only after compute has been spent. We formulate protein-model adaptation as a gated decision problem: given a task, raw data and a compute budget c_max, a system should decide whether and how to adapt a model before committing expensive computation. We introduce CAPO (Compute-Aware Automated Protein-Model Optimization), a multi-agent system built around one rule: gate before you train. CAPO measures feasibility on the target accelerator, projects cost against the available budget, runs a canary inside the actual training loop and maintains an auditable artifact trail; critically, it can decline an unaffordable adaptation and select a cheaper alternative. We evaluate CAPO, without system changes, on three protein-modeling tasks: (i) SARS-CoV-2 host-range prediction, (ii) hit-to-lead affinity ranking and (iii) temporal variant-effect reclassification. On host range, CAPO partially fine-tuned an 8-million-parameter ESM-2 model to a species-averaged MCC of 0.826, compared with 0.743 for a hand-designed expert transformer; it matched a general coding agent while using 57.4% less GPU time and reduced failed training trials from four to zero. For hit-to-lead affinity ranking, CAPO rejected Boltz-2 fine-tuning and instead trained an assay-calibrated lightweight head over frozen representations, improving ranking on 11 of 15 held-out targets in 1.68 GPU-hours. On temporally held-out ClinVar variants, rank-4 low-rank adaptation of ESM-2 reached an MCC of 0.478, compared with 0.252 for a one-hot baseline and 0.000 for the frozen zero-shot score. These results come from single runs, without a gate ablation and with one generalist-agent comparison. Within those limits, they show that measured admission control can make protein-model adaptation not only automated but selective: deciding what to compute, what not to compute and why.
- Citations
- 0
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Training Compute-Optimal Protein Language Models
Xingyi Cheng, Bo Chen, … Le Song·bioRxiv·Jun 6, 2024
- Democratizing Protein Language Model Training, Sharing and Collaboration
Jin Su, Zhikai Li, … Sergey Ovchinnikov·Nature BiotechnologyPeer-reviewed·Oct 24, 2025
- Cramming Protein Language Model Training in 24 GPU Hours
Nathan C. Frey, Taylor Joren, … Vladimir Gligorijević·bioRxiv·May 14, 2024
- Democratizing Protein Language Models with Parameter-Efficient Fine-Tuning
Samuel Sledzieski, Meghana Kshirsagar, … Bonnie Berger·Proceedings of the National Academy of SciencesPeer-reviewed·Jun 20, 2024
- Protein Language Models: Is Scaling Necessary?
Quentin Fournier, Robert McCoy Vernon, … CHRISTOPHER JAMES LANGMEAD·bioRxiv·Sep 23, 2024
- Efficient Inference, Training, and Fine-tuning of Protein Language Models
Muhammed Hasan Çelik, Xiaohui S. Xie·iSciencePeer-reviewed·Sep 3, 2025