arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.12448stat.ME

具有条件覆盖的置信区间长度的一个(紧)上界

A (tight) upper bound for the length of confidence intervals with conditional coverage

Danijel Kivaranovic, Hannes Leeb

AI总结:

本文证明数据雕刻和带随机化响应的选择两种选择性推断方法与多面体方法结合后,置信区间长度有界,且在区间长度上总是优于样本分割方法。

摘要:

我们证明,两种流行的选择性推断方法,即数据雕刻(Fithian et al., 2017)和带随机化响应的选择(Tian et al., 2018b),在与多面体方法(Lee et al., 2016)结合时,所得置信区间的长度是有界的。这与仅基于多面体方法的置信区间结果形成对比,后者的期望长度通常是无限的(Kivaranovic and Leeb, 2020)。此外,我们证明这两种方法在区间长度上总是优于相应的样本分割方法。

英文摘要:

We show that two popular selective inference procedures, namely data carving (Fithian et al., 2017) and selection with a randomized response (Tian et al., 2018b), when combined with the polyhedral method (Lee et al., 2016), result in confidence intervals whose length is bounded. This contrasts results for confidence intervals based on the polyhedral method alone, whose expected length is typically infinite (Kivaranovic and Leeb, 2020). Moreover, we show that these two procedures always dominate corresponding sample-splitting methods in terms of interval length.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑