Fast leave-one-cluster-out cross-validation using clustered Network Information Criterion (NICc)
Jiaxing Qiu, Douglas E. Lake, Pavel Chernyavskiy, Teague R. Henry

TL;DR
This paper introduces a fast clustered estimator of NICc for model validation on clustered data, improving accuracy over AIC and BIC in model selection, especially with strong clustering.
Contribution
The paper develops NICc, a new cluster-adjusted criterion that approximates leave-one-cluster-out deviance efficiently, enhancing model validation for clustered datasets.
Findings
NICc provides a more accurate approximation than AIC and BIC.
NICc improves variable selection accuracy in clustered data.
Simulation and empirical results show NICc's effectiveness with strong clustering.
Abstract
For prediction models developed on clustered data that do not account for cluster heterogeneity in model parameterization, it is crucial to use cluster-based validation to assess model generalizability on unseen clusters. This paper introduces a clustered estimator of the Network Information Criterion (NICc) to approximate leave-one-cluster-out deviance for standard prediction models with twice differentiable log-likelihood functions. The NICc serves as a fast alternative to cluster-based cross-validation. Stone (1977) proved that the Akaike Information Criterion (AIC) is asymptotically equivalent to leave-one-observation-out cross-validation for true parametric models with independent and identically distributed observations. Ripley (1996) noted that the Network Information Criterion (NIC), derived from Stone's proof, is a better approximation when the model is misspecified. For…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsLogistic Regression
