Sobolev Calibration of Imperfect Computer Models
Qingwen Zhang, Wenjia Wang
TL;DR
The paper develops Sobolev calibration for imperfect computer models by defining an identifiable calibration parameter through minimizing discrepancies in a Sobolev space $\mathcal{H}_m(\Omega)$. It establishes consistency, $\sqrt{n}$-consistency, asymptotic normality, and semiparametric efficiency, and shows how $L_2$ calibration and Kennedy–O'Hagan calibration are special cases when $m=0$ or for certain kernel choices. The method offers a tunable trade-off between function value accuracy and shape preservation via $m$, with practical computation via RKHS norms and kernel ridge surrogates, and it extends to Gaussian-process physical experiments. Numerical simulations and an ion-channel real-data example illustrate the flexibility and competitive performance of Sobolev calibration, validating its theoretical properties and showcasing its applicability to real-world calibration tasks. Overall, the framework unifies and extends key calibration approaches, enabling principled uncertainty quantification and downstream predictive fidelity control in imperfect computer models.
Abstract
Calibration refers to the statistical estimation of unknown model parameters in computer experiments, such that computer experiments can match underlying physical systems. This work develops a new calibration method for imperfect computer models, Sobolev calibration, which can rule out calibration parameters that generate overfitting calibrated functions. We prove that the Sobolev calibration enjoys desired theoretical properties including fast convergence rate, asymptotic normality and semiparametric efficiency. We also demonstrate an interesting property that the Sobolev calibration can bridge the gap between two influential methods: $L_2$ calibration and Kennedy and O'Hagan's calibration. In addition to exploring the deterministic physical experiments, we theoretically justify that our method can transfer to the case when the physical process is indeed a Gaussian process, which follows the original idea of Kennedy and O'Hagan's. Numerical simulations as well as a real-world example illustrate the competitive performance of the proposed method.
