Asymptotic confidence sequence (Appendix C, Eq. 55, Choe & Ramdas 2023)
Source:R/confidence_sequences.R
cs_asymptotic.RdAsymptotic, not finite-sample: coverage >= 1 - alpha holds only as
t -> infinity. Valid without requiring bounded score differences —
requires only that hat_delta_t has finite variance — so it's appropriate
for tick loss and other scoring rules where hard bounds depend on
unbounded realised values. Suitable for large evaluation windows.
Details
$$C_t^A = \hat\Delta_t \pm \sqrt{
\frac{2(t \sigma^2_t \rho^2 + 1)}{t^2 \rho^2}
\log\frac{\sqrt{t \sigma^2_t \rho^2 + 1}}{\alpha}}$$
where \(\sigma^2_t = \frac{1}{t}\sum_{i=1}^t (\hat\delta_i - \hat\Delta_{i-1})^2\)
and rho is tuned to be tightest at t_star:
$$\rho(t_{star}) = \sqrt{\frac{2\log(1/\alpha) + \log(1 + 2\log(1/\alpha))}{t_{star}}}$$
The running variance estimator uses the predictable mean hat_Delta_{t-1}
(not the current mean hat_Delta_t) to maintain predictability, with
hat_Delta_0 := 0.
Examples
scores1 <- c(-0.4, -0.2, -0.3, -0.1, -0.2)
scores2 <- c(-0.5, -0.3, -0.4, -0.2, -0.3)
cs_asymptotic(scores1, scores2, alpha = 0.05)
#> t estimate lower upper
#> 1 1 0.1 -1.8608122 2.0608122
#> 2 2 0.1 -0.8804061 1.0804061
#> 3 3 0.1 -0.5536041 0.7536041
#> 4 4 0.1 -0.3902030 0.5902030
#> 5 5 0.1 -0.2921624 0.4921624