Pith. sign in

REVIEW 1 cited by

Upper and lower bounds for local Lipschitz stability of Bayesian posteriors

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 2505.23541 v2 pith:YLHJEPYH submitted 2025-05-29 math.ST stat.TH

classification math.STstat.TH
keywords boundsupperevidencelowerconcentratedincreaselipschitzlocal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The work of Sprungk (Inverse Problems, 2020) established the local Lipschitz continuity of the misfit-to-posterior and prior-to-posterior maps with respect to the Kullback--Leibler divergence and the total variation, Hellinger, and 1-Wasserstein metrics, by proving certain upper bounds. The upper bounds were also used to show that if a posterior measure is more concentrated, then it can be more sensitive to perturbations in the misfit or prior. We prove upper bounds and lower bounds that emphasise the importance of the evidence. The lower bounds show that the sensitivity of posteriors to perturbations in the misfit or the prior not only can increase, but in general will increase as the posterior measure becomes more concentrated, i.e. as the evidence decreases to zero. Using the explicit dependence of our bounds on the evidence, we identify sufficient conditions for the misfit-to-posterior and prior-to-posterior maps to be locally bi-Lipschitz continuous.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. A Convex Approximation Framework for Neural Likelihood-Based Bayesian Inverse Problems

    stat.ML 2026-07 conditional novelty 7.0 of 10

    By folding normalization into a KL-based objective over un-normalized potentials, neural likelihood approximation becomes a strictly convex problem with provable consistency.

Pith tools