paper-with-me

홈 › Papers

A new and flexible class of sharp asymptotic time-uniform confidence sequences

2025-02-14 · Felix Gnettner, Claudia Kirch

Confidence sequences are anytime-valid analogues of classical confidence intervals that do not suffer from multiplicity issues under optional continuation of the data collection. As in classical statistics, asymptotic confidence sequences are a nonparametric tool showing under which high-level assumptions asymptotic coverage is achieved so that they also give a certain robustness guarantee against distributional deviations. In this paper, we propose a new flexible class of confidence sequences yielding sharp asymptotic time-uniform confidence sequences under mild assumptions. Furthermore, we highlight the connection to corresponding sequential testing problems and detail the underlying limit theorem.

📄 PDF Abstract BibTeX arXiv:2502.10380

Code (0)

등록된 구현이 없습니다.

Tasks

valid

Similar Papers 제목 키워드 기반

Spherical Cap Packing Asymptotics and Rank-Extreme Detection

2015-11-19 · Kai Zhang

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vecto…

Sharp concentration of uniform generalization errors in binary linear classification

2025-05-22 · Shogo Nakakita

We examine the concentration of uniform generalization errors around their expectation in binary linear classification problems via an isoperimetric argument. In particular, we establish Poincar\'{e} and log-Sobolev ineq…

Linear programming approach to partially identified econometric models

2025-03-19 · Andrei Voronin

Sharp bounds on partially identified parameters are often given by the values of linear programs (LPs). This paper introduces a novel estimator of the LP value. Unlike existing procedures, our estimator is root-n-consist…

Sharp detection boundaries on testing dense subhypergraph

2021-01-12 · Mingao Yuan, Zuofeng Shang

We study the problem of testing the existence of a dense subhypergraph. The null hypothesis is an Erdos-Renyi uniform random hypergraph and the alternative hypothesis is a uniform random hypergraph that contains a dense …

Time-uniform central limit theory and asymptotic confidence sequences

2021-03-11 · Ian Waudby-Smith, David Arbour, Ritwik Sinha, Edward H. Kennedy 외

Confidence intervals based on the central limit theorem (CLT) are a cornerstone of classical statistics. Despite being only asymptotically valid, they are ubiquitous because they permit statistical inference under weak a…

Causal Inferencevalid