in silico
Phase 1 : In Silico Validation
- Objectif
- To falsify the core hypothesis via simulation before any field work. Determine if the Bayesian adaptive OED algorithm consistently outperforms uniform grid and stratified random designs under controlled, reproducible conditions.
- Coût estimé
- €1,500-2,000 (cloud compute time if local GPU insufficient; otherwise €0)
- Durée estimée
- 6-8 weeks
- Critères de réussite
- Posterior variance of spatial length-scale parameter (θ_spatial) after 100 readings · Mean reduction ≥ 30% compared to uniform grid (i.e., OED mean < 0.7 × uniform mean) · (Compute mean posterior variance from 30 runs per strategy; apply one-tailed Welch’s t-test on log-transformed values; p < 0.05 required)
- Cumulative distance traveled for 200 readings · Mean reduction ≥ 20% compared to stratified random · (Compute mean cumulative distance from 30 runs per strategy; one-tailed Welch’s t-test; p < 0.05 required)
- RMSE at 50 held-out test locations after 150 readings · Mean reduction ≥ 15% compared to uniform grid · (Compute mean RMSE from 30 runs per strategy; one-tailed paired t-test; p < 0.05 required)
- On continue si
- All three success criteria are met (p < 0.05 for each test). This confirms the mechanism works in silico.
- On arrête si
- Any one of the three criteria fails (p ≥ 0.05). The hypothesis is falsified under ideal conditions; stop or pivot.
- On réoriente si
- Two criteria pass but one fails (e.g., RMSE reduction not significant). Consider adjusting the OED algorithm (e.g., change batch size, kernel, or utility function) and re-running Phase 1 before proceeding.
- Risques
- HMC sampling fails to converge for some runs (e.g., due to multimodal posteriors)Probabilité : mediumParade : Use NUTS sampler with 4 chains, 1000 warmup, 2000 samples; monitor R-hat < 1.05; if persistent, switch to variational inference (ADVI) as fallback
- OED algorithm is computationally too expensive for 100 sequential steps (each step requires optimization over candidate locations)Probabilité : mediumParade : Use BoTorch’s quasi-Monte Carlo approximation for expected information gain; limit candidate set to 500 random locations per step; parallelize over 4 CPU cores
- Synthetic data is too simple (stationary GP) and results do not generalize to real fieldsProbabilité : lowParade : Add a second synthetic scenario with non-stationary mean (e.g., linear trend) and heteroscedastic noise to test robustness; document as limitation