Table of Contents
Fetching ...

Confidence Estimation via Sequential Likelihood Mixing

Johannes Kirschner, Andreas Krause, Michele Meziu, Mojmir Mutny

TL;DR

This work tackles non-i.i.d. uncertainty quantification by introducing a universal framework for anytime confidence sequences based on sequential likelihood mixing. It builds a bridge between Bayesian inference and frequentist coverage, showing how mixing over parameter priors or online predictions yields valid confidence sets even under misspecification. The framework subsumes standard Bayesian and variational approaches, enabling practical, tractable confidence sets through ELBO bounds, posterior sampling, or online regret analyses, and yields tighter sequences in settings like sequential linear regression and sparse recovery. The results have broad implications for robust, interactive learning systems, kernelized and nonparametric regression, and online decision-making, with extensions to tempered likelihoods and misspecified model classes.

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.

Confidence Estimation via Sequential Likelihood Mixing

TL;DR

This work tackles non-i.i.d. uncertainty quantification by introducing a universal framework for anytime confidence sequences based on sequential likelihood mixing. It builds a bridge between Bayesian inference and frequentist coverage, showing how mixing over parameter priors or online predictions yields valid confidence sets even under misspecification. The framework subsumes standard Bayesian and variational approaches, enabling practical, tractable confidence sets through ELBO bounds, posterior sampling, or online regret analyses, and yields tighter sequences in settings like sequential linear regression and sparse recovery. The results have broad implications for robust, interactive learning systems, kernelized and nonparametric regression, and online decision-making, with extensions to tempered likelihoods and misspecified model classes.

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.

Paper Structure

This paper contains 38 sections, 14 theorems, 75 equations.

Key Result

Lemma 1

Let $(M_t)_{t \geq 1}$ be a non-negative supermartingale. For any $\alpha > 0$,

Theorems & Definitions (14)

  • Lemma 1: Ville's Inequality ville1939etude
  • Theorem 2: Sequential Likelihood-Ratio robbins1970statistical
  • Theorem 3: Prior Likelihood Mixing
  • Theorem 4: Sequential Likelihood Mixing
  • Theorem 5: Mixing Equivalence
  • Lemma 6: Prior-Posterior Ratio Confidence Set waudby2020confidence
  • Lemma 7: Variational Inequality
  • Theorem 8: Evidence Lower Bound Confidence Set
  • Theorem 9: Regret-To-Confidence
  • Theorem 10: Regret of Continuous Exponential Weights
  • ...and 4 more