An Iterative Histogram-Based Optimization of Calibration Tables in a Powertrain Controller
Bibliographic record
Abstract
To comply with the stringent fuel consumption requirements, many automobile manufacturers have launched vehicle electrification programs which are representing a paradigm shift in vehicle design. Looking specifically at powertrain calibration, optimization approaches were developed to help the decision-making process in the powertrain control. Due to computational power limitations the most common approach is still the use of powertrain calibration tables in a rule-based controller. This is true despite the fact that the most common manual tuning can be quite long and exhausting, and with the optimal consumption behavior rarely being achieved. The present work proposes a simulation tool that has the objective to automate the process of tuning a calibration table in a powertrain model. To achieve that, it is first necessary to define the optimal reference performance. The calibration table then has its values optimized by the Genetic Algorithm to a single value that better matches the reference performance. A novel Iterative Histogram procedure is then used to identify which cells from the new table have the greatest contribution to the performance mismatch between the model and the reference. These values are optimized and the histogram is reassessed. This process is repeated until the mismatch target is achieved or the model results show saturation in its performance. The iterative nature of this process results in a powerful tool that gives its users the ability to easily conduct a simulation while simultaneously monitoring the results of each iteration until the target is met.
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".