OpenAlex ·
Efficient computation of mixture confidence sequences in generalized linear models
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.20496
- Original
- Read it at the publisher
- Topics
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.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Probability
Get the few papers worth your time in Probability every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.