Updating simulation model parameters using stochastic gradient descent
Bibliographic record
Abstract
This paper presents a method to automatically improve simulation model accuracy by using a stochastic gradient descent algorithm. The proposed algorithm updates models' parameters based on data collected from the actual domain under investigation. Collected data and feedback are fed into the simulation model to get predictions. In a linear prediction model, this data, along with the predictions, would form a typical regression problem; however, the stochastic gradient descent algorithm was modified to update the simulation model parameters. A tunneling case study is presented here, and the results show that the proposed algorithm can decrease simulation error by more than 50%, even in the case of incomplete simulation models or a missing inter-relationship between elements. Besides improving initial models, this paper provides a new approach for achieving data-driven simulation models that are updated in real time based on feedback from the actual domain. • Proposing a data-driven approach to enhance simulation performance. • Using stochastic gradient descent algorithm to update simulation parameters. • Deriving mathematical model to calculate error rate from a simulation model. • Applying the proposed method in a real case study of a tunneling project. • Suggesting a new approach for fitting data to model a simulation.
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.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".