Pith. sign in

REVIEW 2 cited by

Selective Inference in Graphical Models via Maximum Likelihood

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.24311 v1 pith:INO3DASB submitted 2025-03-31 stat.ME stat.APstat.CO

classification stat.MEstat.APstat.CO
keywords inferencegraphicalconditionalgraphlearnedlikelihoodrandomizationselective
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The graphical lasso is a widely used algorithm for fitting undirected Gaussian graphical models. However, for inference on functionals of edge values in the learned graph, standard tools lack formal statistical guarantees, such as control of the type I error rate. In this paper, we introduce a selective inference method for asymptotically valid inference after graphical lasso selection with added randomization. We obtain a selective likelihood, conditional on the event of selection, through a change of variable on the known density of the randomization variables. Our method enables interval estimation and hypothesis testing for a wide range of functionals of edge values in the learned graph using the conditional maximum likelihood estimate. Our numerical studies show that introducing a small amount of randomization: (i) greatly increases power and yields substantially shorter intervals compared to other conditional inference methods, including data splitting; (ii) ensures intervals of bounded length in high-dimensional settings where data splitting is infeasible due to insufficient samples for inference; (iii) enables inference for a wide range of inferential targets in the learned graph, including measures of node influence and connectivity between nodes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Flexible Selective Inference with Flow-based Transport Maps

    stat.ME 2025-06 conditional novelty 7.0 of 10

    A normalizing flow learns the post-selection conditional distribution through simulated selection events, then transforms inference back to the pre-selection distribution to correct selection bias.

  2. Reluctant Interaction Inference after Additive Modeling

    stat.ME 2025-06 conditional novelty 5.0 of 10

    A selective inference method produces valid p-values for interaction effects after a sparse additive model is fit to the same data, using external randomization and full-data statistics.

Pith tools