arXiv (All)
open access
Efficient computation of mixture confidence sequences in generalized linear models
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A simple and efficient method for sampling mixture models based on Dirichlet and Pitman-Yor processes#1158330
- Enabling Approximate Joint Sampling in Diffusion LMs#1076751
- On the robustness of mixture models in the presence of hidden Markov Regimes with covariate-dependent transition probabilities#1161148
- Mixture of Decoders for Diverse Dialog Response Generation#1155556
- FBST for Mixture Model Selection.#770692
Record · ID 1034312
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive