Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 7 min ago
PreprintarXiv licencearXiv

Efficient computation of mixture confidence sequences in generalized linear models

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.

Related

  1. Not All Mislabels Are Equal: Efficient Task-Aware Auditing with Confidence Sequences
    Fangyuan Lin, Noah Krever, Jakub Černý +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Design-Based Confidence Sequences: A General Approach to Risk Mitigation in Panel Experiments
    Dae Woong Ham, Michael Lindon, Martin P. Tingley +1
    Management SciencePeer-reviewedLicence not stated19 citedStatisticsOpenAlex
  3. Regret Lower Bound for Online Learning of Quantum States with Logarithmic Loss, with Applications to Quantum State Tomography and Confidence Sequences for Matrix Means
    Yen-Huan Li, Wei-Fu Tseng
    arXivPreprintarXiv licenceFull textStatisticsQuantum physics & quantum informationarXiv
  4. Certified computation of Buehler confidence limits for system reliability
    Zhaohui Li
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. On the Tightness and Computational Tractability of Higher-Dimensional Confidence Sequences
    Fabian Denoodt, Sibylle Hess, Joaquin Vanschoren +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{caterina2026efficient,
  title = {{Efficient computation of mixture confidence sequences in generalized linear models}},
  author = {Claudia Di Caterina and Luigi Pace and Alessandra Salvan and Nicola Sartori},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.20496},
  eprint = {2609.20496},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.20496},
}
RIS
TY  - UNPB
TI  - Efficient computation of mixture confidence sequences in generalized linear models
AU  - Claudia Di Caterina
AU  - Luigi Pace
AU  - Alessandra Salvan
AU  - Nicola Sartori
PY  - 2026
DA  - 2026/09/17
PB  - arXiv
DO  - 10.48550/arxiv.2609.20496
UR  - https://arxiv.org/abs/2609.20496
AB  - 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.
ER  -