On testing marginal versus conditional independence

@article{Guo2020OnTM,
  title={On testing marginal versus conditional independence},
  author={F. Guo and T. Richardson},
  journal={Biometrika},
  year={2020}
}
We consider testing marginal independence versus conditional independence in a trivariate Gaussian setting. The two models are non-nested and their intersection is a union of two marginal independences. We consider two sequences of such models, one from each type of independence, that are closest to each other in the Kullback-Leibler sense as they approach the intersection. They become indistinguishable if the signal strength, as measured by the product of two correlation parameters, decreases… Expand
Universal inference
TLDR
A surprisingly simple method for producing statistical significance statements without any regularity conditions and it is shown that in settings when computing the MLE is hard, for the purpose of constructing valid tests and intervals, it is sufficient to upper bound the maximum likelihood. Expand
Constraints in Gaussian Graphical Models
In this paper, we consider the problem of finding the constraints in bow-free acyclic directed mixed graphs (ADMGs). ADMGs are a generalisation of directed acyclic graphs (DAGs) that allow forExpand
Universal Inference Using the Split Likelihood Ratio Test
We propose a general method for constructing hypothesis tests and confidence sets that have finite sample guarantees without regularity conditions. We refer to such procedures as ``universal.'' TheExpand

References

SHOWING 1-10 OF 48 REFERENCES
The hardness of conditional independence testing and the generalised covariance measure
It is a common saying that testing for conditional independence, i.e., testing whether whether two random vectors $X$ and $Y$ are independent, given $Z$, is a hard statistical problem if $Z$ is aExpand
Likelihood ratio tests and singularities
Many statistical hypotheses can be formulated in terms of polynomial equalities and inequalities in the unknown parameters and thus correspond to semi-algebraic subsets of the parameter space. WeExpand
Model selection and local geometry
We consider problems in model selection caused by the geometry of models close to their points of intersection. In some cases---including common classes of causal or graphical models, as well as timeExpand
Testing When a Parameter Is on the Boundary of the Maintained Hypothesis
This paper considers testing problems where several of the standard regularity conditions fail to hold. We consider the case where (i) parameter vectors in the null hypothesis may lie on the boundaryExpand
P Values Maximized Over a Confidence Set for the Nuisance Parameter
Abstract For testing problems of the form H 0: v = v 0 with unknown nuisance parameter θ, various methods are used to deal with θ. The simplest approach is exemplified by the t test where the unknownExpand
The Emperor’s new tests
In the past two decades, striking examples of allegedly infe- rior likelihood ratio tests (LRT) have appeared in the statistical litera- ture. These examples, which arise in multiparameter hypothesisExpand
Uniform consistency in causal inference
There is a long tradition of representing causal relationships by directed acyclic graphs (Wright, 1934). Spirtes (1994), Spirtes et al. (1993) and Pearl & Verma (1991) describe procedures forExpand
Model selection for Gaussian concentration graphs
A multivariate Gaussian graphical Markov model for an undirected graph G, also called a covariance selection model or concentration graph model, is defined in terms of the Markov properties, i.e.Expand
On the Asymptotics of Constrained $M$-Estimation
Limit theorems for an M-estimate constrained to lie in a closed subset of R d are given under two different sets of regularity conditions. A consistent sequence of global optimizers converges underExpand
Estimation of a covariance matrix with zeros
We consider estimation of the covariance matrix of a multivariate random vector under the constraint that certain covariances are zero. We first present an algorithm, which we call iterativeExpand
...
1
2
3
4
5
...