Efficient computation of mixture confidence sequences in generalized linear models
Claudia Di Caterina, Luigi Pace, Alessandra Salvan, Nicola Sartori
Abstract
Classical confidence intervals, when repeatedly obtained on accumulating data at different sample sizes, produce contradictory inferences with high probability. We propose a simple and efficient strategy for computing, instead, mixture confidence sequences for regression coefficients in generalized linear models under this sequential framework. Simulations demonstrate the computational convenience of our approach and the importance of drawing inferential conclusions based on these anytime-valid tools when observations become available in batches over time. The usefulness of the proposed procedure is also shown in the analysis of streaming data from the American National Automotive Sampling System.
Create a lesson
Related papers
Conditional Independence Testing in Time Series
Jieru Shi, Rajen D. Shah
Sampling-Based Batch Sequential Design by Stein Variational Gradient Descent
Penghui Fu, Xiaoxian Ding, Chunlin Ji et al.
Gaussian Boundary Inference in a Hypergeometric Heavy-Tailed Family
Steve Lawford
Exponential Smoothing for Time Series of Random Objects
Takuo Matsubara, Peiwen Jiang, Wilson Ye Chen et al.
Identification and Estimation of Causal Estimands with Missing Not at Random Data
Faria Rauf Ria, Tarikul Islam, Mahbub A. H. M. Latif
Noise-adjusted turnover in estimated networks
Sultan Amed, Sayantan Banerjee