Minimal-Data Peptide Design and Accessible Protein Language Models for Protein Engineering
Bibliographic record
Abstract
Protein engineering is increasingly driven by machine learning, yet two practical barriers still limit broad adoption: (i) the scarcity of experimentally labelled data for new protein targets and (ii) the steep hardware demands of modern protein-language models (pLMs). This dissertation tackles both challenges through two core contributions. First, I introduce Minimal-Data → Maximal-Insight (MDMI), a structure-aware peptide-discovery pipeline that needs only a single round (~100 variants) of experimental screening. MDMI couples AlphaFold-Multimer complex prediction with hybrid statistical/physics scoring (SPServer + PyRosetta) to train a predictor, which then steers a genetic algorithm through sequence space to find novel sequences. As a case study, I applied MDMI to the split-GFP system, where the interaction between a 16-residue GFP11 peptide and its target GFP1-10 fragment reconstitutes fluorescence. MDMI successfully designed GFP11 peptides with over 50% sequence divergence from the wild type while preserving function, demonstrating the MDMI’s capacity to uncover non-obvious, high-diversity variants in data-limited scenarios. By decoupling peptide engineering from large training sets, MDMI offers an accessible strategy for laboratories with limited throughput.Second, I present Quantized Low-Rank Adaptation (QLoRA) for protein language models (pLMs), combining 4-bit weight quantization with low-rank adapters to enable efficient fine-tuning on lower cost and accessible GPUs. Across several pLMs (8 million–3 billion parameters) QLoRA cuts required training memory by an average 46.7%, and up to 90 % for the largest models, while retaining ≥ 90 % of baseline performance on regression tasks (i.e. fluorescence and stability datasets), secondary-structure classification, and de novo protein generation. Together, these methods establish a resource-conscious paradigm: MDMI extracts maximal design power from minimal data, and QLoRA delivers advanced pLMs to laboratories without specialized hardware. By uniting minimal-data modelling with hardware-efficient learning, this work broadens access to next-generation protein engineering and paves the way for rapid, distributed innovation in therapeutics, diagnostics, and biomanufacturing.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".