Papers
Topics
Authors
Recent
Search
2000 character limit reached

On nearly assumption-free tests of nominal confidence interval coverage for causal parameters estimated by machine learning

Published 8 Apr 2019 in stat.ML, cs.LG, math.ST, stat.ME, and stat.TH | (1904.04276v2)

Abstract: For many causal effect parameters of interest, doubly robust machine learning (DRML) estimators $\hat{\psi}{1}$ are the state-of-the-art, incorporating the good prediction performance of machine learning; the decreased bias of doubly robust estimators; and the analytic tractability and bias reduction of sample splitting with cross fitting. Nonetheless, even in the absence of confounding by unmeasured factors, the nominal $(1 - \alpha)$ Wald confidence interval $\hat{\psi}{1} \pm z_{\alpha / 2} \widehat{\mathsf{se}} [\hat{\psi}{1}]$ may still undercover even in large samples, because the bias of $\hat{\psi}{1}$ may be of the same or even larger order than its standard error of order $n{-1/2}$. In this paper, we introduce essentially assumption-free tests that (i) can falsify the null hypothesis that the bias of $\hat{\psi}{1}$ is of smaller order than its standard error, (ii) can provide an upper confidence bound on the true coverage of the Wald interval, and (iii) are valid under the null under no smoothness/sparsity assumptions on the nuisance parameters. The tests, which we refer to as \underline{A}ssumption \underline{F}ree \underline{E}mpirical \underline{C}overage \underline{T}ests (AFECTs), are based on a U-statistic that estimates part of the bias of $\hat{\psi}{1}$.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.