Leave-one-out testing for node-level differences in Gaussian graphical models
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Statistics. The day in statistics: methods, theory and the inference under them.
Tom: We're looking at the paper: "Leave-one-out testing for node-level differences in Gaussian graphical models".
Jane: Here's the gist of the paper. We study two-sample equality testing in Gaussian graphical models by proposing a node-level inference procedure via a leave-one-out Bartlettadjusted test on a fully connected graph <ref:2601.15896#pg2>.
Tom: This method yields increments with standard chi-square null limits, enabling calibrated significance for single nodes and fixed-size subsets <ref:2601.15896#pg5>.
Jane: The proposed procedure extends the two-sample LRT of Banzato et al.
Tom: (2023) to a leave-one-out framework on a fully connected graph <ref:2601.15896#pg3>.
Paper summary: Tom: So we're wrapping up this deep dive on "Leave-one-out testing for node-level differences in Gaussian graphical models" by Banzato et al., and what it means for us right now.
Jane: Basically, they took a standard likelihood ratio test and turned it into a leave-one-out procedure to check if two samples have the same structure, one node at a time.
Tom: Yeah, the big point is that this gives us calibrated significance for single nodes and even small groups of nodes instead of just getting one big score for the whole system.
Lu: They use a Bartlett adjustment to keep things accurate when the sample size is small, and they show simulations match what's expected under certain conditions.
Meng: So, if I'm deploying this to production, what's the biggest limitation they admit? What can you rely on?
Tom: They note that a major limitation is relying on a fully connected working graph when doing this analysis. They say this assumption is fine if the true structure is unknown or when you assume a maximal clique idealization.
Jane: It sounds like they're not just giving us a black box test, but actually proposing how to fit this into a larger workflow for finding where the difference actually lies in the data structure.
Lu: The authors suggest a two stage strategy: first find the actual structure of that clique with another method, and then use this leave-one-out analysis inside that specific group.
Tom: It’s about getting meaningful evidence for specific parts of the model structure without needing perfect knowledge of every single connection beforehand.
Jane: This opens up new ways to look at data where you want to know if a tiny piece is behaving differently than the rest.
Lu: We'll talk more about how this approach compares to other methods in our next segment when we look at the simulation results and see the power of this node-level inference.
Conclusion: Tom: So we're wrapping up this deep dive on "Leave-one-out testing for node-level differences in Gaussian graphical models" by Banzato and his team, and what it means for us right now.
Jane: Basically, they took a standard likelihood ratio test and turned it into a leave-one-out procedure to check if two samples have the same structure, one node at a time.
Tom: Yeah, the big point is that this gives us calibrated significance for single nodes and even small groups of nodes instead of just getting one big score for the whole system.
Lu: They use a Bartlett adjustment to keep things accurate when the sample size is small, and they show simulations match what's expected under certain conditions.
Meng: So, if I'm deploying this to production, what's the biggest limitation they admit? What can you rely on?
Tom: They note that a major limitation is relying on a fully connected working graph when doing this analysis. They say this assumption is fine if the true structure is unknown or when you assume a maximal clique idealization.
Jane: It sounds like they're not just giving us a black box test, but actually proposing how to fit this into a larger workflow for finding where the difference actually lies in the data structure.
Lu: The authors suggest a two stage strategy: first find the actual structure of that clique with another method, and then use this leave-one-out analysis inside that specific group.
Tom: It’s about getting meaningful evidence for specific parts of the model structure without needing perfect knowledge of every single connection beforehand.
Jane: This opens up new ways to look at data where you want to know if a tiny piece is behaving differently than the rest.
Lu: We'll talk more about how this approach compares to other methods in our next segment when we look at the simulation results.
Davide Benussi, Ester Alongi, Erika Banzato
Department of Statistical Sciences, University of Padova
stat.ME
Submitted: 2026-01-22
Updated: 2026-11-15
Journal ref: Journal of Statistical Planning and Inference, 248 (2027), 106486
DOI: 10.1016/j.jspi.2026.106486
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
Importance score: 86/100
The gist: We study two-sample equality testing in Gaussian graphical models by proposing a node-level inference procedure via a leave-one-out Bartlettadjusted test on a fully connected graph…
Key concepts
- Leave-one-out framework
- This procedure tests a hypothesis by comparing the test statistic calculated on the entire graph against the statistic calculated after removing one node at a time. This allows researchers to assess how much each specific node contributes to the overall difference being tested.
- Bartlett-adjusted test
- The original likelihood ratio test is corrected using Bartlett's correction. This adjustment improves the accuracy of finite-sample results, ensuring that the significance levels are more reliable when dealing with smaller datasets compared to standard tests.
- Null limiting distribution
- This describes the theoretical distribution of the test statistic when there is no true difference between groups (the null hypothesis). The paper shows this distribution converges to a chi-square value, which allows for precise calibration of the significance levels.
Terminology
Summary
We study two-sample equality testing in Gaussian graphical models by proposing a node-level inference procedure via a leave-one-out Bartlettadjusted test on a fully connected graph <ref:2601. p. 0 Classical likelihood ratio
tests on decomposable graphs admit clique-wise factorizations, offering limited localization and
unstable finite-sample behaviour. We propose node-level inference via a leave-one-out Bartlettadjusted test on a fully connected graph. We propose node-level inference via a leave-one-out Bartlettadjusted test on a fully connected graph. The resulting increments have standard chi-square
null limits, enabling calibrated significance for single nodes and fixed-size subsets.Where the paper says it
Where the paper says it
Methodology of Node Inference
The proposed procedure extends the two-sample LRT of Banzato et al. (2023) to a leave-one-out framework on a fully connected graph <ref:2601. p. 1 We propose a node-level inference procedure extending the two-sample LRT of Banzato et al. (2023) to a leave-one-out framework on a fully connected graph, either treated as a maximal clique or
as a simplifying assumption when the structure is unknown. (2023) to a leave-one-out framework on a fully connected graph, either treated as a maximal clique or
as a simplifying assumption when the structure is unknown. For any candidate node, the procedure
contrasts the Bartlett-adjusted LRT on the full graph with the statistic recomputed after removing
that node. For any candidate node, the procedure
contrasts the Bartlett-adjusted LRT on the full graph with the statistic recomputed after removing
that node. The resulting increment, under the null hypothesis of equality of distribution, has an
asymptotic chi-square distribution with degrees of freedom depending only on the number of nodes
removed and the total number of nodes.Where the paper says it
Where the paper says it
Where the paper says it
Null Limiting Distribution Results
Theorem 1 establishes that under H0, as n = n1 + n2 → ∞, the increment ∆M = T V n - T V M n d−→ χ2h(l,p), where h(l, p) = l(2p − l + 3)2 <ref:2601.15896#pg5>. Corollary 1 specifies that for a singleton removal (l = 1), the null limit is ∆j d−→ χ2p+1 <ref:2601. p. 3 Note that h(1, p) = p + 1, h(2, p) = 2p + 1, and
h(3, p) = 3p, corresponding to singletons, pairs, and triplets, which are our main focus, though
Theorem 1 holds for any 1 ≤ l ≤ p − 1. Corollary 1 (Singleton removal).Where the paper says it
Finite Sample Calibration and Error Control
The Bartlett-type correction improves finite-sample accuracy, and the adjusted test statistic T V n is defined as T V n = δ V n W V n, with δ V n = f V - 2µ V n <ref:2601.15896#pg4>. Numerical experiments in Section 3 indicate that Bartlett-adjusted increments provide better marginal type I error control than their Wnbased counterparts, particularly at small sample sizes <ref:2601. p. 5 05, for each
subset M. Bartlett-adjusted increments provide better marginal type I error control than their Wnbased counterparts, particularly at small sample sizes; see the leftmost columns for n1 = n2 = 10.Where the paper says it
Practical Application and Caveats
The methodology is computationally light and inherits improved finite sample calibration from the Bartlett adjustment <ref:2601.15896#pg5>. A limitation noted is the reliance on a fully connected working graph, which is defensible when the true structure is unknown or when a maximal clique idealization is common <ref:2601. p. 8 A limitation is the reliance on a fully connected working graph. This is defensible when the true structure is unknown and a maximal clique idealization is common. This is defensible when the true structure is unknown and a maximal clique idealization is common. This also
suggests a practical two-stage strategy: first localize the responsible clique with a valid clique-wise
method (Salviato et al.Where the paper says it
Where the paper says it
Simulation Validation
The simulation study confirms the validity of the null limiting distribution stated in Theorem 1 through empirical distributions matching the expected chi-square limits <ref:2601.15896#pg8>. The results demonstrate that Bartlett-adjusted increments track the nominal level more closely than Wn-based tests, and power results show improved complete recovery when shifts affect few nodes <ref:2601. p. 3 (ii) Using Wn in place of Tn preserves the form of
the results but degrades the finite-sample chi-square approximation. (iii) Numerical experiments in
Section 3 indicate Wn-based tests are anti-conservative, whereas Tn-based tests track the nominal
level more closely.Where the paper says it
Conclusions
We developed node and subset level two-sample inference for Gaussian graphical models by defining leave-one-out counterparts of a Bartlett-adjusted global LRT <ref:2601.15896#pg5>. The procedure is computationally light, inherits improved finite sample calibration from the Bartlett adjustment, and performs well in both simulations and data analyses <ref:2601. p. 7 When the number of altered nodes is unknown, classical multiple testing adjustments yield valid
selection of the set of altered nodes. The procedure is computationally light, inherits improved
finite sample calibration from the Bartlett adjustment, and performs well in both simulations and
8 4 Conclusions
We developed node and subset level two-sample inference for Gaussian graphical models by defining
leave-one-out counterparts of a Bartlett-adjusted global LRT. The associated increments have standard null limits, which provide calibrated significance for individual nodes and fixed-size subsets.Where the paper says it
Where the paper says it
Acknowledgements
The authors thank Prof. Davide Risso (Department of Statistical Sciences, University of Padova) for his valuable insights during the preparation of this manuscript <ref:2601. p. 8 Acknowledgements
The authors thank Prof. Davide Risso (Department of Statistical Sciences, University of Padova)
for his valuable insights during the preparation of this manuscript.Where the paper says it
References
Banzato, E., Chiogna, M. p. 1 Recent contributions exploit
decomposable structure to localize changes through clique-wise testing and set operations (Salviato
et al. , 2019; Djordjilovi´c and Chiogna, 2022), but do not directly address node-level inference and
rely on decomposability. Recent contributions exploit
decomposable structure to localize changes through clique-wise testing and set operations (Salviato
et al. , 2019; Djordjilovi´c and Chiogna, 2022), but do not directly address node-level inference and
rely on decomposability. Recent contributions exploit
decomposable structure to localize changes through clique-wise testing and set operations (Salviato
et al. , 2019; Djordjilovi´c and Chiogna, 2022), but do not directly address node-level inference and
rely on decomposability. Recent contributions exploit
decomposable structure to localize changes through clique-wise testing and set operations (Salviato
et al. , 2019; Djordjilovi´c and Chiogna, 2022), but do not directly address node-level inference and
rely on decomposability. Recent contributions exploit
decomposable structure to localize changes through clique-wise testing and set operations (Salviato
et al. , 2019; Djordjilovi´c and Chiogna, 2022), but do not directly address node-level inference and
rely on decomposability. Acknowledgements
The authors thank Prof. Davide Risso (Department of Statistical Sciences, University of Padova)
for his valuable insights during the preparation of this manuscript. , and Risso, D. A Bartlett-type correction for
likelihood ratio tests with application to testing equality of gaussian graphical models. A Bartlett-type correction for
likelihood ratio tests with application to testing equality of gaussian graphical models. , 193:109732.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Bartlett, M. p. 1 In decomposable graphs, the likelihood ratio statistic (LRT; Wilks, 1938) admits convenient
clique-separator factorizations and asymptotic chi-square limits, with finite-sample accuracy improved by Bartlett corrections (Bartlett, 1937; Banzato et al. Recent contributions exploit
decomposable structure to localize changes through clique-wise testing and set operations (Salviato
et al. Bartlett, M. Properties of sufficiency and statistical tests. Properties of sufficiency and statistical tests. A,
160:268–282.Where the paper says it
Where the paper says it
Where the paper says it
Benjamini, Y. p. 8 , 2019; Djordjilovi´c and Chiogna, 2022; Banzato et al. , 2023); then apply our
leave-one-out analysis within that clique, controlling the overall false discovery rate by an acrossstage adjustment (Benjamini and Heller, 2008; Van den Berge et al. , 2019; Djordjilovi´c and Chiogna, 2022; Banzato et al. , 2023); then apply our
leave-one-out analysis within that clique, controlling the overall false discovery rate by an acrossstage adjustment (Benjamini and Heller, 2008; Van den Berge et al. and Heller, R. Screening for partial conjunction hypotheses.Where the paper says it
Where the paper says it
Where the paper says it
Bonferroni, C. p. 4 Because |M(l)| grows combinatorially, testing all {∆M : M ∈ M(l)} without adjustment inflates
the probability of spurious findings, especially since the tests are dependent. We therefore use
multiplicity-adjusted p-values (Bonferroni, 1936; Holm, 1979) to control the family-wise error rate
(FWER) under arbitrary dependence.Where the paper says it
Chiaretti, S. p. 6 dataset (Chiaretti et al. , 2005; Li, 2025). Chiaretti, S. , Gentleman, R. , Gentleman, R. , Vitale, A. , Vitale, A. , Mandelli, F. , Mandelli, F. , and Ritz, J. , and Ritz, J. Gene expression profiles of b-lineage adult acute lymphocytic leukemia reveal genetic patterns
that identify lineage derivation and distinct mechanisms of transformation.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Djordjilovi´c, V. and Chiogna, M. p. 1 Recent contributions exploit
decomposable structure to localize changes through clique-wise testing and set operations (Salviato
et al. , 2019; Djordjilovi´c and Chiogna, 2022), but do not directly address node-level inference and
rely on decomposability. and Chiogna, M. Searching for a source of difference in graphical models.Where the paper says it
Where the paper says it
Holm, S. (1979). A simple sequentially rejective multiple test procedure <ref:2601. p. 9 , 190:104973. A simple sequentially rejective multiple test procedure.Where the paper says it
Lauritzen, S. p. 0 Simulations
confirm validity, and a case study shows practical utility. Keywords: Likelihood ratio test; Gaussian graphical models; Hypothesis testing; Node-level
inference
1 Introduction
Gaussian graphical models (GGMs) parametrize multivariate normal distributions by a mean vector
and a precision matrix constrained by an undirected graph, where zeros in the precision encode
conditional independences (Lauritzen, 1996; Whittaker, 2009). Leave-one-out testing for node-level differences
in Gaussian graphical models
Davide Benussi∗1
, Ester Alongi†2
, and Erika Banzato‡1
1Department of Statistical Sciences, University of Padova, 35121, Padova, Italy
January 23, 2026
Abstract
We study two-sample equality testing in Gaussian graphical models. Classical likelihood ratio
tests on decomposable graphs admit clique-wise factorizations, offering limited localization and
unstable finite-sample behaviour.Where the paper says it
Where the paper says it
Li, X. (2025). ALL: A data package <ref:2601. p. 9 Clarendon Press. ALL: A data package.Where the paper says it
Salviato, E. p. 1 In decomposable graphs, the likelihood ratio statistic (LRT; Wilks, 1938) admits convenient
clique-separator factorizations and asymptotic chi-square limits, with finite-sample accuracy improved by Bartlett corrections (Bartlett, 1937; Banzato et al. Recent contributions exploit
decomposable structure to localize changes through clique-wise testing and set operations (Salviato
et al. , Chiogna, M. , and Romualdi, C. , and Romualdi, C. SourceSet: A graphical model
approach to identify primary genes in perturbed biological pathways.Where the paper says it
Where the paper says it
Where the paper says it
Van den Berge, K. p. 8 , 2019; Djordjilovi´c and Chiogna, 2022; Banzato et al. , 2023); then apply our
leave-one-out analysis within that clique, controlling the overall false discovery rate by an acrossstage adjustment (Benjamini and Heller, 2008; Van den Berge et al. Van den Berge, K. , Soneson, C. , Soneson, C. , Robinson, M. , Robinson, M. , and Clement, L. , and Clement, L. stageR: a general
stage-wise method for controlling the gene-level false discovery rate in differential expression and
differential transcript usage.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Whittaker, J. p. 0 Simulations
confirm validity, and a case study shows practical utility. Keywords: Likelihood ratio test; Gaussian graphical models; Hypothesis testing; Node-level
inference
1 Introduction
Gaussian graphical models (GGMs) parametrize multivariate normal distributions by a mean vector
and a precision matrix constrained by an undirected graph, where zeros in the precision encode
conditional independences (Lauritzen, 1996; Whittaker, 2009). Whittaker, J. Graphical Models in Applied Multivariate Statistics.Where the paper says it
Where the paper says it
Wilks, S. S. (1938). The large-sample distribution of the likelihood ratio for testing composite hypotheses <ref:2601. p. 9 Graphical Models in Applied Multivariate Statistics. The large-sample distribution of the likelihood ratio for testing composite
hypotheses.Where the paper says it
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Leave-one-out inference for Gaussian graphical models allows for node-level inference by contrasting a Bartlett adjusted likelihood ratio test on a fully connected graph with one excluding a single node, resulting in
valid node-level p-values while retaining the finite-sample accuracy of the Bartlett correction.
-
The system can perform valid subset level testing by calculating increments like Delta M = T V n - T V M n, which is
stochastically large when M intersect S != empty and asymptotically negligible when M subset Sc.
-
When the true structure is unknown, the system can adopt a two-stage strategy: first localize the responsible clique with a valid clique-wise method, then apply leave-one-out analysis within that clique for node inference while controlling false discovery rate by an acrossstage adjustment.
Abstract
We study two-sample equality testing in Gaussian graphical models with the aim of localizing distributional differences at the node level. The proposed procedure targets departures in the joint distribution, which may arise from mean shifts, variance changes, or covariance differences. We extend Bartlett-adjusted likelihood ratio tests to a leave-one-out framework on a fully connected working graph. The resulting increments have standard chi-square null limits, enabling calibrated inference for single nodes and fixed-size subsets. We also discuss how decomposable graphical structure can be exploited to apply the approach locally on larger graphs. Simulation results indicate good calibration and competitive power, and a real data application highlights the practical applicability of the method.
Related papers
- Learning Robust Treatment Rules for Censored Data
- Neural Estimation of Summary Statistics for Simulation-Based Inference with Non-Asymptotic Guarantees
- Spectral divide-and-conquer MCMC for long stationary time series
- Improving the Efficiency of Subgroup Analysis in Randomized Controlled Trials with TMLE
- Personalized Federated Vector Autoregression with Personalization Diversity
- Doubly Robust and Efficient Calibration of Prediction Sets for Right-Censored Time-to-Event Outcomes