Fermentation process quality prediction using teacher student stacked sparse recurrent autoencoder
Bibliographic record
Abstract
Abstract For predicting the value of the quality variable in fermentation processes, traditional data‐driven methods do not use information in large amounts of unlabelled data. To solve this data‐rich but information‐poor (DRIP) problem, a teacher student stacked sparse recurrent autoencoder (TS‐SSRAE) model is proposed. Compared with traditional data‐driven methods, the proposed method has three main advantages. First, an autoencoder is an unsupervised method which can effectively extract rich information in unlabelled data. The proposed stacked recurrent autoencoder (SRAE) with long short‐term memory (LSTM) recurrent neural unit is superior to traditional autoencoders when extracting the dynamic correlation information in the fermentation process. Second, sparse constraints can make it much easier for hidden neurons to obtain useful information in a single moment. Finally, the LSTM recurrent neural unit is complex and the inputs of a SRAE must be a sequence, which increases the complexity of the model to a certain extent. So, the knowledge distillation is employed to simplify the model and reduce the computing time. In order to demonstrate its effectiveness, the proposed method is applied to the penicillin fermentation process for a simulation experiment and Escherichia coli production of interleukin‐2. The results show that the proposed method based on TS‐SSRAE can have better performance than conventional methods.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".