SearcharxivSearch

arXiv · 2608.14895

On WAIC for Dependent Data: A Covariance-Corrected Framework with Linear-Time Complexity

Abstract

The Widely Applicable Information Criterion (WAIC) is a cornerstone of Bayesian model selection, but its conditional independence assumption renders it inappropriate for sequential and spatially correlated data - a limitation that leads to systematically underestimated model complexity and over-optimistic predictive assessments. We introduce CC-WAIC, a principled generalization of WAIC that explicitly incorporates the full posterior covariance structure of log-likelihood contributions. CC-WAIC reduces exactly to WAIC when independence holds, making it a natural extension rather than an ad-hoc modification. To overcome the prohibitive computational cost of the full covariance matrix, we develop a linear-time implementation using a banded covariance approximation that reduces complexity, with theoretical guarantees on the approximation error. We further introduce an effective sample size correction to mitigate finite-sample bias in MCMC estimation. Through extensive simulations on Hidden Markov Models and real-world applications to Old Faithful geyser data and S&P 500 volatility modelling, we demonstrate that CC-WAIC substantially outperforms WAIC, LOO-CV, iWAIC, and WAICNF, particularly under strong temporal dependence and limited sample sizes. The proposed criterion offers a computationally scalable and theoretically grounded tool for Bayesian model selection in the dependent data settings that are ubiquitous across modern science. Limitations include reliance on exponential mixing and exact conditional likelihoods; extensions to long-memory processes and approximate inference are discussed.

Explore related subjects

Keep this discovery

BibTeXRIS

Safaa K. Kadhem. 2026-08-14. On WAIC for Dependent Data: A Covariance-Corrected Framework with Linear-Time Complexity. https://arxiv.org/abs/2608.14895

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Surprise Reduction and Nullification in Bayesian and Inverse Bayesian Inference under Ambiguous Prediction-Error Attribution

In non-stationary environments, prediction errors may signal environmental change or transient outliers, and adaptive systems must track such changes without overreacting to outliers. We distinguish surprise reduction, which updates beliefs to fit observations, from surprise nullification, which weakens constraints imposed by the predictive structure, and formalize both within Bayesian and inverse Bayesian (BIB) inference. Belief and likelihood updates are derived from variational objectives sharing a nullification strength, determined endogenously by minimizing surprise under the candidate post-update predictive distribution. In the Gaussian case, nullification expands belief and likelihood variances by a common factor relative to standard Bayesian updating, leaving the ratio unchanged. BIB thus defers attribution of the prediction error, committing to neither latent-state change nor observation-process uncertainty. The nullification strength is carried over as a candidate and is maintained or released according to the predictive surprise of the next observation. In a mean estimation task with outliers and changepoints, no scanned parameter setting of a Sage-Husa-type adaptive Kalman filter, fixed-strength BIB variant, or belief-forgetting-only variant outperforms BIB in both changepoint tracking and post-outlier stability. An oracle-informed reduced Bayesian model tracks changepoints better but is less stable after outliers. Although BIB maintains no explicit hypotheses about changepoints or outliers, it generates event-dependent dynamics. The learning rate increases after changepoints, whereas after outliers, nullification is released, and this increase is suppressed. Deferring attribution and letting subsequent observations differentiate the responses may constitute a principle of adaptive inference in non-stationary environments.

stat.ME

Generalized Ridge Refitting for the Lasso and Prediction Improvement Bounds

We study a class of Lasso based estimators obtained by applying a quadratic correction on the Lasso equicorrelation set. The penalty matrix determines both the magnitude and geometry of the correction and contains, among other cases, the isotropic Lasso--Ridge correction, least squares refitting, Gram proportional interpolation between the Lasso and least squares, and coordinate specific penalties. We first derive a closed form representation and isolate the positive gain component of the resulting prediction improvement. We then control the remaining stochastic linear term in expectation by localizing the random signed equicorrelation model around a deterministic reference support. This yields a finite sample expectation bound that explicitly accounts for the randomness induced by Lasso model selection. The resulting decomposition provides a unified framework for understanding when Lasso based quadratic corrections can improve prediction.

stat.ME

Discretization in covariate-adaptive randomization: gains and losses

Covariate-adaptive randomization(CAR) is widely implemented in clinical trials to balance prognostic covariates across treatment arms. Continuous covariates are often discretized into strata in practice, yet their consequences are not clearly understood. This paper provides a comprehensive study of the impact of discretization on both the CAR design process and the inferential results thereafter. We establish the asymptotic properties of both imbalance measures and treatment effect estimators under discretized and non-discretized settings. Practical recommendations are given on when and how discretization should be employed. We show that discretization in design is generally recommended, as it enhances robustness against model misspecification. However, if the true model is known, the most efficient strategy is to balance covariates according to that model in the design. The theoretical results are corroborated by extensive simulation studies and an empirical application to a diabetes trial dataset. Together, the results clarify the gains and losses of discretization in CAR and pave the way for learning impact of discretization to other designs and beyond.

stat.ME