A Nested Ensemble Filtering Approach for Parameter Estimation and Uncertainty Quantification of Traffic Noise Models
Bibliographic record
Abstract
In this study, a nested ensemble filtering (NEF) approach is advanced for uncertainty parameter estimation and uncertainty quantification of a traffic noise model. As an extension of the ensemble Kalman filter (EnKF) and particle filter methods, the proposed NEF method improves upon the ensemble Kalman filter (EnKF) method by incorporating the sample importance resampling (SIR) procedures into the EnKF update process. The NEF method can avoid the overshooting problem (abnormal value (e.g., outside the predefined ranges, complex values) in parameter or state samples) existing in the EnKF update process. The proposed NEF method is applied to the traffic noise prediction on the Trans-Canada Highway in the City of Regina to demonstrate its applicability. The results indicate that: (a) when determining parameters in the traffic noise prediction model, the NEF method provides accurate estimation; (b) the model parameters can be recursively corrected with the NEF method whenever a new measurement becomes available; (c) the uncertainty in the traffic noise model (should be the noise itself) can be well reduced and quantified through the proposed NEF approach.
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.001 | 0.000 |
| 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.002 |
| Open science | 0.001 | 0.001 |
| 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".