A Deep Retrieval-Enhanced Meta-Learning Framework for Enzyme Optimum pH Prediction
Bibliographic record
Abstract
The potential of hydrogen (pH) influences the function of the enzyme. Measuring or predicting the optimal pH (pH opt ) at which enzymes exhibit maximal catalytic activity is crucial for enzyme design and application. The rapid development of enzyme mining and de novo design has produced a large number of new enzymes, making it impractical to measure their pHopt in the wet laboratory. Consequently, in-silico computational approaches such as machine learning and deep learning models, which offer pH prediction at minimal cost, have attracted considerable interest. This work presents Venus-DREAM, an enzyme pH opt prediction model based on the k NN algorithm and few-shot learning, which achieves state-of-the-art accuracy in pHopt prediction. Venus-DREAM regards the pH opt prediction of an enzyme as a few-shot learning task: learning from the k -closest labeled enzymes to predict the pH opt of the target enzyme. The value of k is determined by the optimal k -value of the k NN regression algorithm. And the distance between two enzymes is defined as the cosine similarity of their mean-pooled embeddings obtained from protein language models (PLMs). The few-shot learner is based on the Reptile algorithm, which first adapts to the k -nearest labeled enzymes to create a specialized model for the target enzyme and then predicts its pH opt . This efficient method enables high-throughput virtual exploration of protein space, facilitating the identification of sequences with the desired pH opt ranges in a high-throughput manner. Moreover, our method can be easily adapted in other protein function prediction tasks.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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 source (direct Gemma or distilled Codex), 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".