A Study on Extreme Learning Machine for Gasoline Engine Torque Prediction
Bibliographic record
Abstract
This research presents an extreme learning machine (ELM) based neural network modeling technique for gasoline engine torque prediction. The technique adopts a single-hidden layer feedforward neural network (SLFN) structure which has the potential to approximate any continuous function with high accuracy. To verify the robustness of this technique, over 3300 data points collected from a real-world gasoline engine are used to train, validate, and test the model. These data points cover a wide spectrum of normal engine operating conditions, with the engine speed from 1000 rpm to 4500 rpm, and the engine torque from idle to full load. The experiment results demonstrate that the model can predict the gasoline engine torque with high accuracy. Moreover, this research proposes a weight factor approach to further improve the prediction accuracy of the model in the desired data regions without modifying the input data set. The evaluation shows that the weight factor approach can reduce the overall prediction errors in the regions significantly. This feature is particularly useful in tuning the performance of the model when the significance of the individual data points varies, or when the distribution of the data points is imbalanced. In practice, the modeling approaches presented in this research will help reduce the engine test and verification time.
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.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| 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 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".