Revisiting Penalized Likelihood Estimation for Deterministic Computer Experiments

Gaussian processes (GPs) are popular as nonlinear regression models for expensive computer simulations, yet GP performance relies heavily on estimation of unknown covariance parameters.

Maximum likelihood estimation (MLE) is common, but it can be plagued by numerical issues in small data settings.

The addition of a nugget may help but is not a cure-all.

Penalized likelihood methods may improve upon traditional MLE, but their success depends on tuning parameter selection.

We introduce a new cross-validation (CV) metric called ``decorrelated prediction error'' (DPE), within the penalized likelihood framework for GPs.

Inspired by the Mahalanobis distance, DPE provides more consistent and reliable tuning parameter selection than traditional metrics like prediction error, particularly for $K$-fold CV.

Our proposed metric performs comparably to standard MLE when penalization is unnecessary and outperforms traditional tuning parameter selection metrics in scenarios where regularization is beneficial, especially under the one-standard error rule.