Pith. sign in

REVIEW 3 cited by

Confidence Estimation via Sequential Likelihood Mixing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.14689 v1 pith:ECJUGOMZ submitted 2025-02-20 stat.ML cs.LG

classification stat.MLcs.LG
keywords sequentialframeworkconfidenceestimationinferencelikelihoodmixingclassical
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present a universal framework for constructing confidence sets based on sequential likelihood mixing. Building upon classical results from sequential analysis, we provide a unifying perspective on several recent lines of work, and establish fundamental connections between sequential mixing, Bayesian inference and regret inequalities from online estimation. The framework applies to any realizable family of likelihood functions and allows for non-i.i.d. data and anytime validity. Moreover, the framework seamlessly integrates standard approximate inference techniques, such as variational inference and sampling-based methods, and extends to misspecified model classes, while preserving provable coverage guarantees. We illustrate the power of the framework by deriving tighter confidence sequences for classical settings, including sequential linear regression and sparse estimation, with simplified proofs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Beyond Modern Asymptotics for Log-Likelihood Ratios in Logistic Regression

    math.ST 2026-08 conditional novelty 8.0 of 10

    The worst-case (1−δ) quantile of the logistic log-likelihood ratio is d log(en/d)+log(1/δ) for n≥d≥3, with d=2 at log log log n and d=1 at log(1/δ).

  2. A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions

    cs.LG 2026-02 conditional novelty 7.0 of 10

    A per-round O(1) algorithm for generalized linear bandits achieves near-optimal regret with time-varying dispersion and adversarial corruptions, up to a κ factor.

  3. Confidence Sequences for Generalized Linear Models via Regret Analysis

    math.ST 2025-04 conditional novelty 6.0 of 10

    A low-regret online predictor for any GLM yields a valid confidence sequence for the true parameter, giving a unified framework and new sample-size-independent and sparse-model bounds.

Pith tools