Sensitivity analysis of the PC hyperprior for range and standard deviation components in Bayesian Spatiotemporal high-resolution prediction: An application to PM2.5 prediction in Jakarta, Indonesia
Bibliographic record
Abstract
The Gaussian Markov Random Field (GMRF) is widely acknowledged for its remarkable flexibility, especially in the realm of high-resolution prediction, when compared to conventional Kriging methods. Rooted in the fundamental principles of Bayesian estimation, this methodology underscores the importance of a meticulous examination of prior and hyperprior distributions, along with their corresponding parameter values. Sensitivity analyses are crucial for evaluating the potential impact of these distributions and parameter values on prediction results. To determine the most effective values for hyperprior parameters, an iterative trial-and-error approach is commonly employed. In our research, we systematically assessed a variety of parameter values through exhaustive cross-validation. Our study is focused on optimizing hyperprior parameter values, with a particular emphasis on Penalized Complexity (PC). We applied our method to conduct spatiotemporal high-resolution predictions of PM2.5 concentrations in Jakarta province, Indonesia. Achieving accurate predictive modeling of PM2.5 concentrations in Jakarta is contingent upon this optimization. We identified that the optimal values for PC hyperprior parameters, with a range of less than 2,000 and a hyperprior standard deviation greater than 1 with a 0.1 probability, yield the most accurate predictions. These parameter values result in the minimum mean absolute percentage error (MAPE) of 19.35393, along with a deviation information criterion (DIC) of -154.23. Our findings highlight that the standard deviation parameter significantly influences model fit compared to the relatively insignificant impact of the range parameter. When coupled with high-resolution mapping, these optimized parameters facilitate a comprehensive understanding of distribution patterns. This process aids in detecting areas particularly susceptible to risks, thereby enhancing decision-making efficacy regarding air quality management.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 teacher head, 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".