Search arXiv⌕ Search

arXiv · 2610.35330

On the asymptotic behaviour of $α$-divergence generalized posteriors

Abstract

We study the asymptotic behaviour of the solutions to the unconstrained generalized variational inference problem regularized by an $α$-divergence. Under mild conditions, the minimizer is explicit up to a scalar normalizing constant, and we show that it admits a rescaling under which it converges in $L^1$ to a fixed non-Gaussian law, at a concentration scale around the empirical loss minimizer that departs from the typical $n^{-1/2}$ in the classical Bernstein--von Mises theorem. For $α\in(0,1)$ and $d<2/(1-α)$ the limit is a Student-$t$ distribution and the posterior width shrinks faster than the sampling error of the empirical minimizer. Conversely, for $α>1$ the limiting distribution is a compactly supported Pearson type-II distribution, and the posterior width shrinks more slowly than the sampling error. The KL divergence ($α=1$) is the unique member of the $α$-divergence family whose posterior width matches the sampling scale and whose limit is Gaussian. We discuss the implications of these qualitatively different regimes for the frequentist coverage of credible regions, and a toy example on intercept-only logistic regression illustrates the theoretical claims.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ioar Casado-Telletxea, Omar Rivasplata. 2026-10-26. On the asymptotic behaviour of $α$-divergence generalized posteriors. https://arxiv.org/abs/2610.35330

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Compatibility-based Bayesian inference: asymptotic limits, variational principles, and Wasserstein geometry

Approximate Bayesian Computation (ABC) replaces intractable likelihood evaluations with comparisons between observed and simulated data. We formulate discrepancy-based inference through nonnegative compatibility weights. Prior-integrated convergence of rescaled weights gives total variation convergence as the tolerance vanishes. For a fixed positive tolerance and increasing sample size, we give a general representation-based formulation of the conditional-prior limit known from ABC and coarsened Bayesian inference, and establish convergence in expected total variation under stabilization in probability and a prior-null boundary condition. We also derive acceptance-persistence bounds under partial stabilization. The Gibbs variational identity yields convergence of minimum values and stability of approximate minimizers; the fixed-tolerance limit is characterized separately by constrained relative-entropy minimization. For additional penalty-based functionals of the limiting Wasserstein discrepancy, we prove an exact reduction to distributions over model laws and, under a geodesic assumption, a representation by distances from a Wasserstein ball. These penalty-based updates are distinguished from the original fixed-tolerance ABC limit and illustrated through a Gaussian comparison.

math.ST↗

A theory of stratification learning

Given i.i.d. sample from a stratified mixture of immersed manifolds of different dimensions, we study the minimax estimation of the underlying stratified structure. We provide a constructive algorithm allowing to estimate each mixture component at its optimal dimension-specific rate adaptively. The method is based on an ascending hierarchical co-detection of points belonging to different layers, which also identifies the number of layers and their dimensions, assigns each data point to a layer accurately, and estimates tangent spaces optimally. These results hold regardless of any ambient assumption on the manifolds or on their intersection configurations. They open the way to a broad clustering framework, where each mixture component models a cluster emanating from a specific nonlinear correlation phenomenon.

math.ST↗

Wasserstein-Cramér-Rao Theory of Unbiased Estimation

The quantity of interest in the classical Cramér-Rao theory of unbiased estimation (e.g., the Cramér-Rao lower bound, its exact attainment for exponential families, and asymptotic efficiency of maximum likelihood estimation) is the variance, which represents the instability of an estimator when its value is compared to the value for an independently-sampled data set from the same distribution. In this paper we are interested in a quantity which represents the instability of an estimator when its value is compared to the value for an infinitesimal additive perturbation of the original data set; we refer to this as the "sensitivity" of an estimator. The resulting theory of sensitivity is based on the Wasserstein geometry in the same way that the classical theory of variance is based on the Fisher-Rao (equivalently, Hellinger) geometry, and this insight allows us to determine a collection of results which are analogous to the classical case: a Wasserstein-Cramér-Rao lower bound for the sensitivity of any unbiased estimator, a characterization of models in which there exist unbiased estimators achieving the lower bound exactly, and various results on the asymptotic achievement of the lower bound. More precisely, we show that Wasserstein projection estimators (and one-step approximations thereof) are asymptotically sensitivity-efficient under suitable assumptions, and that there exist Hodges-type estimators which exhibit super-sensitivity-efficiency. We use these results to treat many statistical examples, sometimes revealing new optimality properties for existing estimators and other times revealing entirely new estimators.

math.ST↗