Publications · Journal

Revisiting concentration results for approximate Bayesian computation

Hien Duy Nguyen, TrungTin Nguyen, Julyan Arbel, Florence Forbes

† Corresponding author.

Bayesian Analysis · Journal Bayesian Analysis. Journal article (advance publication, 2025).

Abstract

We study the large sample behavior of approximate Bayesian computation (ABC) posterior measures in situations when the data generating process is dependent on unidentifiable parameters. In particular, we establish the concentration of posterior measures on sets of arbitrarily small measure that contain the equivalence set of the data generative parameter, when the sample size tends to infinity. Our theory also makes weak assumptions regarding the measurement of discrepancy between the data set and simulations. In particular, it does not require the use of summary statistics and is applicable to a broad class of kernelized ABC algorithms. We provide useful illustrations and demonstrations of our theory in practice, and offer a comprehensive assessment of how our findings complement other results in the literature.

Keywords: Approximate Bayesian computation; Posterior consistency; Pseudo-posterior measure; Unidentifiability; Large sample theory

1 Introduction

Approximate Bayesian computation (ABC) has become a leading paradigm for drawing inference when data generating processes do not possess known or tractable likelihood functions. Recent expositions regarding the history, varieties, and example applications of ABC can be found in the comprehensive volume of Sisson et al. (2018). Other reviews of the ABC literature can be found in Marin et al. (2012) and Beaumont (2019). In this work, we study the asymptotic behaviors of two classes of ABC posterior measures, the so-called pseudo-posterior and coarsened posterior measures, in the context where the data generating process is unidentifiable. We now turn to describing those two classes of densities, the unidentifiable setting, as well as the possible asymptotic regimes in ABC.

Pseudo-posterior density.

The density obtained by a usual ABC algorithm is referred to here as the pseudo-posterior density. A typical ABC sampling scheme consists of three steps:

  1. 1.

    sample some parameter value θ from the prior distribution;

  2. 2.

    sample some synthetic data from the data generative process, given θ;

  3. 3.

    compute some distance between the synthetic data and the actual data in order to treat θ.

Multiple ABC variants exist depending on the treatment of the parameter in step 3. The usual accept/reject ABC algorithm (e.g. Marin et al. 2012, Algorithm 2) discards parameter samples that are at a distance beyond some threshold ϵ, while keeping all the parameters below the threshold. In contrast, variants known as importance sampling ABC (Karabatsos and Leisen, 2018; Nguyen et al., 2020) or kernel ABC (Park et al., 2016; Li and Fearnhead, 2018b, a) yield weighted ABC posterior samples, where sample weights are computed by taking kernel function transformations of sample discrepancy values. Refer to Equation (1) in Section 3 for a detailed description of the pseudo-posterior density, and more specifically to the description of weights at the end of Section 3.

Coarsened posterior density.

The approach followed by Miller and Dunson (2019) is different in nature from ABC, however we will see in Section 3 that it can be described in similar statistical terms. The motivation of these authors stems from realizing that the distribution of the observed data rarely belongs to the chosen model class of idealized data. In order to ensure robustness to model misspecification, the basic idea proposed by Miller and Dunson (2019) in a Bayesian context is to condition on the event that the observed data and idealized data are sufficiently close, resulting in the so-called coarsened posterior density. The degree of closeness is defined according to the distance between the empirical measures of the observed data and idealized data, assumed to be below some threshold denoted by r in Miller and Dunson (2019), and which will be denoted by ϵ here. Refer to Equation (2) in Section 3 for a detailed description of the coarsened posterior density.

Unidentifiability.

We are interested in models which are not necessarily identifiable, meaning that multiple parameter values may result in the same likelihood. Let us denote by θ0 the true data generating parameter. The meaning of such a true parameter in a Bayesian context may seem counterintuitive, but such a value is often postulated in works that endeavour to validate posterior distributions based on frequentist principles in the asymptotic regime of large sample size. Let Θ0 be the set of parameters which identify the same likelihood as the true data generating parameter θ0. Then the model is identifiable if Θ0 reduces to the singleton {θ0}, and unidentifiable otherwise. Illustrations of identifiable, as well as finitely unidentifiable, and infinitely unidentifiable normal models are presented in Sections 6.1, 6.2, and 6.3, respectively.

Asymptotic settings for ABC posterior measures.

The asymptotic behavior of the ABC posterior can be investigated in three scenarios depending on the regime of the tolerance parameter ϵ and the sample size n.

  • ϵ fixed and n: when the tolerance parameter is held fixed while the sample size increases to infinity, the ABC posterior measures are expected to converge to some pseudo-posterior distribution. This scenario is particularly relevant when computational resources allow for larger sample sizes and large data sets are available.

  • ϵ0 and n: when the tolerance parameter and the sample size tend to zero and infinity, respectively, the goal is to have a more stringent acceptance criterion with a large sample, potentially leading to more accurate estimates of the posterior distribution, with high probability or in expectation. One typically requires shape restrictions on the tail probabilities of both the measure on the sequence of data and the prior measure. These restrictions can be controlled as a function of ϵ and are often quite restrictive and intricate. The results that have been obtained in this setting yield convergence in probability theorems which differ from our conclusions, which establish convergence of measures in the almost sure sense. An archetypal example of such a result is found in Bernton et al. (2019), Proposition 3 and Corollary 1.

  • ϵ0 and n fixed: when the tolerance parameter decreases toward zero while the sample size is kept constant, the acceptance criterion becomes strict, requiring that whatever distance is used to measure similarities can identify discretely supported measures. It has been resolved for most practical scenarios through Bernton et al. (2019), Proposition 2, and Rubio and Johansen (2013), Proposition 1.

A collection of recent works from the literature concerning these asymptotic settings for ABC posterior measures appears in Table 1.

Table 1: Recent works on the asymptotics of ABC posterior measures, organized by the behavior of ϵ and n. The top and bottom rows correspond to pseudo-posteriors and coarsened posteriors, respectively.
ϵ fixed and n ϵ0 and n ϵ0 and n fixed
Jiang (2018) Bernton et al. (2019) Bernton et al. (2019)
Nguyen et al. (2020) Frazier et al. (2018) Rubio and Johansen (2013)
Legramanti et al. (2025) Li and Fearnhead (2018a, b) Nguyen et al. (2020)
Frazier et al. (2020)
Legramanti et al. (2025)
Miller and Dunson (2019) Miller and Dunson (2019)

The current work extends upon the best-known results for the setting when ϵ>0 and n, and seeks to complement the technical contributions by other authors regarding alternative settings for establishing convergence. Namely, in Section 3, we prove the almost sure convergence of the pseudo-posterior density and its convergence in expectation, resulting in a special case of the convergence for the coarsened posterior of Miller and Dunson (2019). Our convergence result makes more explicit assumptions than the previous works of Jiang (2018), Miller and Dunson (2019), and Nguyen et al. (2020), with proofs that more carefully handle the measure theoretic elements of the analysis. Furthermore, we make the important observation that these posterior density results imply the convergence in total variation of the corresponding measures. In Section 4, we then expand upon the convergence of the ABC posterior measures (both the pseudo-posterior and coarsened posterior measures) to obtain broadly applicable concentration of mass results as n, in practical cases when the density pθ0(𝐱n) is not identifiable with respect to the generative parameter θ0.

Outline.

In the rest of the paper, we first discuss the related literature in Section 2, and then define the notations as well as the pseudo-posterior density and the coarsened posterior density in Section 3. Our main results on convergence of ABC posterior measures and concentration of mass without identifiability are stated in Section 4 and Section 5, respectively. The next three sections are devoted to illustrations: posterior concentration is illustrated in Section 6, numerical estimation of the posterior is covered in Section 7, while in Section 8 covers an application motivated by a sound source localization problem. Section 9 summarizes our contributions and discuss future research directions, while the Appendix contains the proofs of the technical results.

2 Related work

Our work follows the progress of Jiang (2018), Miller and Dunson (2019), and Nguyen et al. (2020), who focus on the use of limit theorems to derive asymptotics regarding the ABC posteriors Πcn,ϵ and Πpn,ϵ. This differs from the approaches of Frazier et al. (2018), Bernton et al. (2019), Frazier et al. (2020), and Legramanti et al. (2025), who rely on concentration of probability inequalities in order to provide rates at which the posterior measure converges in probability. However, although we do not provide in-probability rates, our results establish the stronger modes of L1 and almost sure convergence of posterior objects instead.

As discussed in Section 5, it is also notable that Theorem 1 only provides posterior quasi-consistency results, rather than true posterior consistency, which would require a result that guarantees that Πcn,ϵ or Πpn,ϵ converges to a point mass, in some mode of convergence, when ϵ is taken to be a decreasing function of n, as n. Such a result is in fact guaranteed by Frazier et al. (2018, Thm. 1), Bernton et al. (2019, Cor. 1), and Legramanti et al. (2025, Cor. 1), in probability. We note that Frazier et al. (2018, Thm. 1), Bernton et al. (2019, Cor. 1), and Legramanti et al. (2025, Cor. 1) make Hölder continuity assumptions that are stronger than our uniform continuity assumption when interpreting our assumption B2 in the identifiable case, and obviously much stronger than our assumptions in unidentifiable cases. In particular, in comparison to Frazier et al. (2018, Thm. 1), we do not require D to be a distance between summary statistics. This is also true when comparing with the results of Li and Fearnhead (2018b, a).

Next, unlike Frazier et al. (2018), Bernton et al. (2019), Frazier et al. (2020), and Legramanti et al. (2025), we provide asymptotic results for weights w other than the accept/reject kernel. This is a feature that is shared with Li and Fearnhead (2018b, a). However, our structural assumptions A3 and B4 are fairly mild in comparison to the location-scale form requirements and the existence of higher order moments of Li and Fearnhead (2018b, a). On the other hand, the additional restrictions together with stronger assumptions regarding the concentration of measure and weak convergence of summaries of 𝐗n and 𝐘n, particularly the concentration of the prior measure Π, permit Frazier et al. (2018); Li and Fearnhead (2018b, a), and Frazier et al. (2020) to establish weak and strong convergence of Πpn,ϵ to measures with explicit forms.

3 Pseudo-posterior and coarsened posterior densities

Let (Ω,,P) be a probability space with typical element ω and expectation operator EP. We let 𝐗=(Xi)i be a sequence of random variables (Xi:Ω𝕏d), and we denote the tuple containing the first n elements of 𝐗 by 𝐗n, which is defined on the measurable space (𝕏n,(𝕏)n). We define a measure on 𝐗n via the density function pθ0(𝐱n), dominated by the measure 𝔪n (where 𝔪 is typically the counting measure or Lebesgue measure), for some θ0𝕋, which we call the generative parameter.

Next, we let θ denote a random parameter from the measure space (𝕋,(𝕋),Π), where Π is characterized by its density π, dominated by the measure 𝔫. Let 𝐘=(Yi)i (Yi:Ω𝕏) be a sequence of random variables with partial sequence 𝐘n on (𝕏n,(𝕏)n), and define the joint measure of 𝐘n and θ via the density p(𝐲n|θ)π(θ), where p(𝐲n|θ) is the likelihood of 𝐘n, and corresponds to a measure on (𝕏n,(𝕏)n), for each θ𝕋. Throughout the text, we will take 𝐗 and 𝐘 to be independent, and take 𝕏 and 𝕋 to be Polish spaces. Furthermore, for fixed θ𝕋, we will write Pθ to denote the conditional measure of ω given θ that is compatible, in the sense of the Ionescu–Tulcea extension Theorem (Spataru, 2013, Thm. 16.8), with the measure on 𝐗n and density p(𝐲n|θ), for all n.

Define w:0×>00, (δ,ϵ)w(δ,ϵ) to be a weighting or kernel function, where we typically think of ϵ as a threshold parameter. For 𝐱n,𝐲n𝕏n, we then let (𝐱n,𝐲n)D(𝐱n,𝐲n)0 denote some notion of a distance or a discrepancy between 𝐱n and 𝐲n. We are now ready to describe our primary objects of interest, the pseudo-posterior density πpϵ,n

πpϵ,n(θ)=πpϵ(θ|𝐗n)=π(θ)ϵ(𝐗n|θ)𝒞pϵ(𝐗n)ϵ>0, (1)

where

ϵ(𝐗n|θ)=𝕏nw(D(𝐗n,𝐲n),ϵ)p(𝐲n|θ)d𝔪(𝐲n),
𝒞pϵ(𝐗n)=𝕋π(θ)ϵ(𝐗n|θ)d𝔫(θ);

and the coarsened posterior density πcϵ,n

πcϵ,n(θ)=π(θ)EP{ϵ(𝐗n|θ)}𝒞cϵ,nϵ>0, (2)

where

𝒞cϵ,n=𝕋π(θ)EP{ϵ(𝐗n|θ)}d𝔫(θ).

The pseudo-posterior density of form (1) is often studied in the context of importance sampling ABC (Karabatsos and Leisen, 2018; Nguyen et al., 2020) or kernel ABC (Park et al., 2016; Li and Fearnhead, 2018b, a). Of course, the accept/reject ABC algorithms (e.g. Marin et al. 2012, Algorithm 2) can be studied in this setting by taking w(δ,ϵ)=𝟏[0,ϵ)(δ), where we use the indicator function notation: 𝟏𝔸(x)=1 if x𝔸, and 𝟏𝔸(x)=0 otherwise. Other popular choices of weights including the exponential kernel w(δ,ϵ)=exp(|δ|α/ϵ) (with α>0) (Park et al., 2016), with Gaussian kernel special case, where α=2, and the Epanechnikov kernel w(δ,ϵ)=(3/4){1(δ/ϵ)2}𝟏[0,ϵ)(δ) (Beaumont et al., 2002). In Section 5, we also consider the tri-weight kernel w(δ,ϵ)={1(δ/ϵ)2}3𝟏[0,ϵ)(δ) and note that one may also validly choose any of the traditionally studied kernels from the theory of kernel density estimation, as per Scott (2015, Ch. 6). The purpose of the weight function is to generate a surrogate for the likelihood function that endows higher density on synthetic data that are closer to the observed data and lower density to those synthetic data that are further away. Here, the choice of weight function may be made on technical grounds, when properties such as continuity, differentiability, or support boundedness are often required, or to emulate other objects of interest, as per the measurement error interpretation of Wilkinson (2013).

Lastly, our study of the coarsened posterior density can be seen as a special case of that studied in Miller and Dunson (2019), under the assumption of correct specification of the simulation model, in the sense that there exists a θ0𝕋 such that 𝐗n has density p(𝐱n|θ0). We shall refer to both (1) and (2) as ABC posterior densities, when it is immaterial to distinguish between them.

4 Convergence of ABC posterior measures

Since we are operating on both the probability spaces (Ω,,P) and (𝕋,(𝕋),Π), it is important to maintain a clear nomenclature. Throughout the article, we will use the convention of denoting an event being true for almost every ωΩ by P-a.s. (P-almost sure/surely). Similarly, for an event that is true for almost all θ𝕋, we write Π-a.a. (Π-almost all/always).

Let the pseudo-posterior and coarsened posterior measures Πpϵ,n and Πcϵ,n be defined, respectively, as

Πpϵ,n(𝔸)=𝔸πpϵ(θ|𝐗n)d𝔫(θ),Πcϵ,n(𝔸)=𝔸πcϵ,n(θ)d𝔫(θ),

for each 𝔸(𝕋) and n. We show in this section that Πpϵ,n and Πcϵ,n converge in total variation, almost surely and deterministically, respectively. To this end, we first establish the pointwise convergence of their densities in Proposition 1 below.

Let D(,):𝕋×𝕋0 and make the following assumptions:

A1

For Π-a.a θ, D(𝐗n,𝐘n)n[]Pθ-a.s.D(θ0,θ).

A2

For each ϵ>0, supδ0w(δ,ϵ)<.

A3

For each ϵ>0, w(D(θ0,),ϵ):𝕋0 is continuous Π-a.a.

Proposition 1.

Under A1–A3, if

𝕋π(θ)w(D(θ0,θ),ϵ)d𝔫(θ)>0,

then (i) for Π-a.a θ,

πpϵ(θ|𝐗n)n[]P-a.s.πϵ(θ)=π(θ)w(D(θ0,θ),ϵ)𝕋π(τ)w(D(θ0,τ),ϵ)d𝔫(τ),

and (ii) for Π-a.a θ,

πcϵ,n(θ)n[]πϵ(θ).

Proof sketch.  For each fixed θ𝕋 for which A3 holds, we observe that

w(D(𝐗n,𝐘n),ϵ)n[]Pθ-a.s.w(D(θ0,θ),ϵ)

which then allows the use of Hunt’s Lemma (Lemma 2 in Appendix A) to conclude that

ϵ(𝐗n|θ)n[]Pθ-a.s.π(θ)w(D(θ0,θ),ϵ) (3)

and

Ωϵ(𝐗n|θ)dPθn[]π(θ)w(D(θ0,θ),ϵ)

for Π-a.a θ𝕋, which yield the respective convergence of the numerators of (1) and (2). To obtain convergence of the denominator of (2), we apply Tonelli’s Theorem to write 𝒞ϵ,nc as a double integral over the space Ω×𝕋:

𝒞ϵ,nc=Ω×𝕋ϵ(𝐗n|θ)dQ(ω,θ),

where Q is the joint measure on (Ω×𝕋,(𝕋)) that is consistent with P, Π, and Pθ (for each θ𝕋), which exists by the Ionescu–Tulcea extension Theorem. This then permits an application of the dominated convergence theorem with respect to the joint measure Q to show that 𝒞ϵ,nc converges to the integral of the right-hand side of (3).

Finally, we obtain the Q-a.s. convergence of the denominator of (1), by noticing that (3) implies that

𝒞ϵ,np(𝐗n)n[]Q-a.s.𝕋π(θ)w(D(θ0,θ),ϵ)d𝔫(θ)

by a second application of Hunt’s Lemma.  

Complete proofs of all results can be found in Appendix B.

Let us now discuss the assumptions. A1 holds in a variety of settings and is generally obtained by combining a strong law of large numbers and continuous mapping theorem. As applied in Section 5, a common situation that often appears (see, e.g., Marin et al., 2012) is when D(𝐗n,𝐘n)=𝒟(ςn(𝐗n),ςn(𝐘n)), where, for each n, ςn:𝕏n𝕊 is a summary statistic that maps to the space 𝕊, and 𝒟:𝕊×𝕊0 is continuous in both its arguments. Then, if the summary statistics are consistent in the sense that ςn(𝐗n)n[]P-a.s.ςθ0 and ςn(𝐘n)n[]Pθ-a.s.ςθ, for Π-a.a θ, then A1 holds with D(θ0,θ)=𝒟(ςθ0,ςθ). In Section 6 we also consider the case when D(𝐗n,𝐘n)=|F¯n(x;𝐗n)F¯n(x;𝐘n)|dx, where F¯n(;𝐗n):[0,1] is the empirical distribution function corresponding to the sample 𝐗n of observations supported on 𝕏=. Then, by the Glivenko–Cantelli Theorem, it holds that F¯n(;𝐗n) converges uniformly P-a.s to the distribution Fθ0 and similarly, F¯n(;𝐘n) converges uniformly Pθ-a.s to Fθ. This then implies that D(𝐗n,𝐘n)n[]Pθ-a.s.D(θ0,θ), where D(θ0,θ)=|Fθ0(x)Fθ(x)|dx, by Makarov and Podkorytov (2013, Thm. 4.8.1). Beyond these examples, we have that A1 holds, under appropriate conditions, when D(𝐗n,𝐘n) is taken to be the energy distance (Nguyen et al., 2020), the sample Kullback–Leibler divergence (Jiang, 2018), the classification accuracy discriminant, or distances between posterior surrogates (Forbes et al., 2022).

Notice that no assumption is made regarding the independence between elements of the sequences 𝐗 and 𝐘. Further, no direct conditions are imposed on the limiting function D, as it always appears composed with the weight function w, as in A3. The latter assumption requires continuity on a set of probability one with respect to the prior distribution, which is verified for the accept/reject kernel, for instance. Lastly, A2 is a simple requirement that the weight function w is bounded.

Remark 1.

Proposition 1(i) makes the same conclusion as Jiang (2018, Thm. 1) and Nguyen et al. (2020, Thm. 2), although the proofs in the aforementioned works require some clarification, which we take the opportunity to make. Proposition 1(ii) can be viewed as a version of the large-sample results regarding the well-specified case of the coarsened posterior, proved in Miller and Dunson (2019, Sec. S3.1).

Remark 2.

The pointwise convergence established by Proposition 1, together with Scheffé’s Theorem, implies that

sup𝔸(𝕋)|Πpϵ,n(𝔸)Πϵ(𝔸)|n[]P-a.s.0, and sup𝔸(𝕋)|Πcϵ,n(𝔸)Πϵ(𝔸)|n[]0,

where

Πϵ(𝔸)=𝔸πϵ(θ)d𝔫(θ) (4)

defines the limiting ABC posterior measure. That is, Πpϵ,n and Πcϵ,n converge in total variation to Πϵ, almost surely and deterministically, respectively.

Remark 3.

The conclusions of Proposition 1 hold irrespective of the identifiability of the model. Theorem 1 in the next section provides more precise results in terms of concentration of mass under specific treatments of the potential model unidentifiability.

5 Concentration of mass without identifiability

We let 𝔹θ={τq:θτ2<1} be the (open) unit ball in q with respect to the Euclidean norm 2, centered at θq, and we note that we can scale 𝔹0 by a factor λ>0 to obtain balls λ𝔹0={λb:b𝔹0} with any radius λ. Let 𝕋0𝕋q be some set of interest. We say that Θλ𝕋 is a set of λ-covering centres for 𝕋0 if 𝕋0Θλλ𝔹0, where 𝔸𝔹={a+b:a𝔸,b𝔹} is the Minkowski sum. We will denote the cardinality of Θλ by |Θλ| and the Lebesgue measure on q by Leb.

Let θ0𝕋. In the context of potential unidentifiability, consider the function D(θ0,):𝕋0 and denote its set of zeros by Θ0={θ𝕋:D(θ0,θ)=0}. Then unidentifiability amounts to having a set of zeros Θ0 of cardinality larger than 1. The illustrations of Section 6 will cover the identifiable case |Θ0|=1, and then the unidentifiable cases 1<|Θ0|< and |Θ0|=.

We make the following assumptions:

B1

The set of zeros of D(θ0,):𝕋0, denoted by Θ0, is non-empty.

B2

For each λ>0, there exists an ϵ>0, such that D(θ0,θ)<ϵ implies that infτΘ0θτ2<λ.

B3

For each λ>0, there exists a covering of Θ0 with λ-covering centres Θλ𝕋, such that λq|Θλ|λ00.

B4

The weight function w(,) can be decomposed as w(δ,ϵ)=W(δ,ϵ)𝟏[0,ϵ)(φ(δ)) where W:0×00 and φ:00 is strictly increasing and bijective, with φ(0)=0.

Lemma 1.

Assume B1–B3. Then, as λ0, Leb(Θ0λ𝔹0)0.

Proof sketch.  We make the observation that Θ0λ𝔹0Θλ2λ𝔹0, and combine this with the fact that the Lebesgue measure of λ𝔹0cλq in q, for some constant c>0. The result follows by bounding Leb(Θλ2λ𝔹0) from above by |Θλ|Leb(2λ𝔹0).  

Theorem 1.

Assume A1–A3 and B1–B4. Let 𝕋π(θ)w(D(θ0,θ),ϵ)d𝔫(θ)>0, for each ϵ>0. Then

(i) for every λ>0, there exists an ϵ>0, such that Πpϵ,n(Θ0λ𝔹0)nP-a.s.1;

(ii) for every λ>0, there exists an ϵ>0, such that Πcϵ,n(Θ0λ𝔹0)n1.

Proof sketch.  Let 𝕊0ϵ𝕋 be the support of the ABC posterior kernel in the sense that w(Dθ(θ0,θ),ϵ)=0 for all θ𝕊0ϵ. By B4, this set has a finite radius in the sense that for every ϵ>0, D(θ0,θ)<φ1(ϵ) if θ𝕊0ϵ. From this, B1 and B2 then imply that 𝕊0ϵΘ0λ𝔹0, which implies that the mass of the limiting posterior measure (4) is concentrated on Θ0λ𝔹0, since B4 implies that Πϵ(Θ0λ𝔹0)Πϵ(𝕊0ϵ)=Πϵ(𝕋)=1. Then, A1–A3 permit the conclusions of Remark 2, implying the convergence in total variation of Πϵ,np and Πϵ,nc to Πϵ, P-a.s. and deterministically, respectively. We conclude by noting that convergence in total variation implies set-wise convergence.  

Let us now unpack the assumptions and conclusions of Theorem 1. Firstly, B1 simply assumes that the zeroes of D(θ0,θ)=0 exists. If D:𝕋×𝕋0 is a pseudometric on 𝕋 (as per Richmond 2020, Sec. 11.1), then we may consider Θ0 to be the equivalence class defined by the generative parameter: Θ0=[θ0], corresponding to the equivalence relationship: D(θ0,θ)=0.

B2 is a primitive boundedness and an identification assumption. A sufficient condition for B2 to hold is if the Hölder condition infτΘ0θτ2LD(θ,θ0)K is satisfied for each θ𝕋, for some L,K>0. This is further simplified when taking Θ0={θ0} to be a singleton. Then, B2 is implied by condition that θθ02LD(θ,θ0)K, for every θ𝕋.

Next, B3 states that there exists a set of covering centres Θλ of Θ0 that does not grow too quickly, since we need the Lebesgue measure of the Euclidean balls covering Θ0 to be small when λ is small, in order to establish Part (i) of the theorem. Here, the assumption is automatically fulfilled when Θ0 is a finite set, which particularly holds true when Θ0 is a singleton. Note, however, that countability of Θ0 is not a sufficient condition for B3 as in the case of dense countable subsets of q. Taken together, B1–B3 require that there is a non-empty set of parameters that Θ0𝕋 corresponding to the generative model of 𝐗n, that the sets of parameters in 𝕋 that produce small discrepancies to the generative model are good approximations of the set Θ0, and that the set Θ0 can be covered by sets of arbitrarily small volume, respectively.

Lastly, B4 implies, when taken together with A2, that w(D(θ0,),ϵ) and its support are bounded. This holds for the classical accept/reject kernel w(δ,ϵ)=𝟏[0,ϵ)(δ), but not for kernels with unbounded support, such as the Gaussian kernel w(δ,ϵ)=exp(δ2/ϵ), that is considered in Park et al. (2016) and Nguyen et al. (2020). Note, however, that the conclusions of Proposition 1 remain true for kernels with unbounded supports.

We can interpret the results as follows. Lemma 1 states that under B1–B3, we can always cover the zero set Θ0, of elements of 𝕋 that are indistinguishable from θ0, using D, by Euclidean balls with radius λ, such that the total volume of the covering vanishes with respect to the Lebesgue measure, as λ0. Then, Theorem 1 states that if we further assume A1–A3 and B4, given any choice of λ>0, we can pick an ϵ>0 such that the pseudo-posterior and coarsened posterior measures, Πcϵ,n or Πpϵ,n, of the covering of Θ0 converge to full mass as n, almost surely and deterministically, respectively. That is, regardless of how small the Lebesgue measure of our covering of Θ0 is, we can always choose an ϵ>0 such that the ABC posterior always eventually concentrates its mass entirely within the covering.

The conclusions can be viewed as a kind of posterior consistency, as defined in Ghosal and van der Vaart (2017, Ch. 6), where posterior consistency requires that the posterior measure concentrates on a point mass (with zero Lebesgue measure, in the continuous case), as n, in some sense, in the case where Θ0 is a singleton. Here, we can call our conclusion a posterior quasi-consistency result, since we obtain that the ABC posterior measures concentrate on a set of negligible mass, instead, for potentially uncountable Θ0.

Remark 4.

Like Bernton et al. (2019), Frazier et al. (2020), and Legramanti et al. (2025), we can also permit misspecification between the density of the data generating process of 𝐗n: p0(𝐱n), and that of the simulated data p(𝐲n|θ), in the sense that there does not exist a θ0𝕋 such that pθ0(𝐱n)=p(𝐱n|θ0), by allowing for the possibility that D(θ0,θ)>0, for all θ𝕋. This can be achieved by replacing Θ0 in B1 by Θ={θ𝕋:D(θ0,θ)=ϵ}, where ϵ=minθ𝕋D(θ0,θ) (assuming that ϵ exists), and replacing B2 by the condition: for each λ>0, there exists an ϵ>0, such that if D(θ0,θ)<ϵ+ϵ, then infτΘθτ2<λ. This then provides a result in situations when the underlying data generating process is both unidentifiable and misspecified.

6 Illustrative examples of posterior concentration

In this section we illustrate examples covering different sets of zeros Θ0. Firstly, in Section 6.1, Θ0 is equal to the singleton {θ0}, and then in Section 6.2, Θ0 is made of two points {θ0,θ0}. Lastly, an example where |Θ0|= is studied in Section 6.3.

6.1 Identifiable normal model

Let us suppose that 𝐗 is an independent and identically distributed (IID) sequence defined by XiN(θ0,1) for each i, and that 𝐘 is independent of 𝐗, with elements YiN(θ,1), where θ0,θ𝕋=. We will take π(θ)=ϕ(θ;0,1), where ϕ(;μ,σ2) is the normal density function with mean μ and variance σ2>0. We shall use the distance

D(𝐗n,𝐘n)=|n1i=1nXin1i=1nYi|. (5)

The law of large numbers and continuous mapping implies that D(𝐗n,𝐘n)n[]P-a.s.D(θ0,θ)=|θ0θ|, which entails that Θ0 is equal to the singleton {θ0}. Provided that w satisfies A2 and A3, then Theorem 1 implies that the pseudo-posterior and coarsened posterior densities

πpϵ,n(θ)=ϕ(θ;0,1)nw(D(𝐗n,𝐲n),ϵ)i=1nϕ(yi;θ,1)d𝐲nϕ(τ;0,1)nw(D(𝐗n,𝐲n),ϵ)i=1nϕ(yi;τ,1)d𝐲ndτ (6)

and

πcϵ,n(θ)=ϕ(θ;0,1)E{nw(D(𝐗n,𝐲n),ϵ)i=1nϕ(yi;θ,1)d𝐲n}ϕ(τ;0,1)E{nw(D(𝐗n,𝐲n),ϵ)i=1nϕ(yi;τ,1)d𝐲n}dτ (7)

converge to

πϵ(θ)=ϕ(θ;0,1)w(|θ0θ|,ϵ)ϕ(τ;0,1)w(|θ0τ|,ϵ)dτ, (8)

where we write from now on d𝔪 and d𝔫 as d for the Lebesgue measure. To make the conclusions of Theorem 2, we require a choice of w that satisfies B4. Two possibilities are the venerable accept/reject kernel and the triweight kernel w(δ,ϵ)={1(δ/ϵ)2}3𝟏[0,ϵ)(δ) which corresponds to a choice of W(δ,ϵ)={1(δ/ϵ)2}3 and φ(δ)=δ. In either case, since Θ0={θ0}, it is then procedural to verify the remaining assumptions B1–B3 of Theorem 2, which then implies that the pseudo-posterior and coarsened posterior can be made to concentrate on sets of arbitrarily small Lebesgue measure by making ϵ sufficiently small. We visualize the concentration of the limiting measure Πϵ in Figure 1, for both the cases of the accept/reject and triweight kernels. Observe that the masses of both limiting measures concentrate on smaller intervals around θ0 as ϵ decreases, as expected from our theory. The choice of weight functions influences the smoothness and shape of the posterior densities but does not affect the size of the support.

Remark 5.

Besides our choices for w, one can use any common kernel with compact support from the theory of density estimation, such as the triangular or Epanechnikov kernels (cf. Scott 2015, Ch. 6).

Refer to caption
Refer to caption
Figure 1: Identifiable normal model. Limiting posterior densities of form (8) using the accept/reject kernel (left) and triweight kernel (right), with θ0=1, are graphed for a range of values of 11 threshold values ϵ, between 0.1 and 0.6. The prior densities are drawn with dotted lines.

6.2 Finitely unidentifiable normal model

We now instead suppose that 𝐗 is an IID sequence defined by XiN(θ02,1) for each i, and that 𝐘 is independent of 𝐗, with elements YiN(θ2,1), where θ0,θ𝕋=. We again use the distance (5), which P-a.s. converges to D(θ0,θ)=|θ02θ2|.

For non-zero generative parameter θ0, B1 holds with Θ0={θ0,θ0}. B2 holds since |θ02θ2|<ϵ implies that minτ{θ0,θ0}{|τθ|}<ϵ=λ. The verification of the remaining assumptions A1–A3 and B3–B4 for the case of w set to the accept/reject and triweight kernels follows from analogous arguments to those made in Section 6.1. As such, we have the fact that the pseudo-posterior and coarsened posterior measures concentrate mass on sets with arbitrarily small Lebesgue measure, for sufficiently small ϵ>0, and have limiting densities

πϵ(θ)=ϕ(θ;0,1)𝟏[0,ϵ)(|θ02θ2|)ϕ(τ;0,1)𝟏[0,ϵ)(|θ02τ2|)dτ, (9)

and

πϵ(θ)=ϕ(θ;0,1){1(θ02θ2)2ϵ2}3𝟏[0,ϵ)(|θ02θ2|)ϕ(τ;0,1){1(θ02θ2)2ϵ2}3𝟏[0,ϵ)(|θ02τ2|)dτ, (10)

when w is taken as either the accept/reject or triweight kernels, respectively. We plot the concentration of mass of the corresponding measures for various values of ϵ>0 in Figure 2. Unlike Figure 1, we observe that the limiting posterior distributions not only concentrate mass around θ0 but also around θ0, since N(θ02,1) is the same in both cases. As predicted by our theory, as ϵ decreases, the limiting distributions are supported on smaller sets containing θ0 and θ0, which are independent of the choice of weights.

Refer to caption
Refer to caption
Figure 2: Finitely unidentifiable normal model. Limiting posterior densities (9) with accept/reject kernel (left) and (10) with triweight kernel (right), with θ0=2, are graphed for a range of 11 threshold values ϵ, between 0.5 and 3. The prior densities are drawn with dotted lines.

6.3 Infinitely unidentifiable normal model

We further complicate the situation by supposing that 𝐗 is an IID sequence defined by XiN(θ01,1) for each i, and that 𝐘 is independent of 𝐗, with IID elements YiN(θ1,1). In this example, θ0=(θ01,θ02) and θ=(θ1,θ2) are elements in 𝕋=2 with θ01=|θ01|+|θ02| and θ1=|θ1|+|θ2| denoting their L1-norms. We use the prior π(θ)=ϕ(θ1;0,1)ϕ(θ2;0,1) and consider the distance (5), which P-a.s. converges to D(θ0,θ)=|θ01θ1|. B1 holds with Θ0={τ=(τ1,τ2):τ1=θ01} and B2 holds with ϵ=λ since |θ01θ1|<ϵ implies that infτΘ0{τθ1}<ϵ=λ and τθ2τθ1 for each τΘ0. We also have to verify B3, which can be achieved by noting that Θ0 is the contour of the 1-ball of radius θ01 and thus consists of four line segments, each of length a2, where a=θ01. We can cover each of line segments with Euclidean balls of radius λ>0 by placing a ball on each of the a2/(2λ) equidistant points along the line, of distance 2λ apart. Then, we can check B3 by evaluating λq|Θλ|=4×λ2(a2/(2λ))=2aλ2, which approaches zero as λ0, as required. The verification of A1–A3 and B4 for concluding Theorem 1 Part (i) and Theorem 2 Part (ii) using w set to the accept/reject and triweight kernels is then procedural. We illustrate the concentration of mass by plotting the support of the limit (8) of both of the ABC posterior densities, defined by (6) and (7), in Figure 3. For both kernels, the support satisfies |θ1θ01|ϵ or equivalently θ01ϵθ1θ01+ϵ, which corresponds to the region between the L1-balls of radii θ01+ϵ and θ01ϵ.

Refer to caption
Figure 3: Infinitely unidentifiable normal model. Contour plot representation of limiting posterior measures for four threshold values ϵ where the data-gener- ating process only depends on θ0 through θ01. The black square represents θ0=(1,1). Black dotted lines represent the set Θ0, where θ01=2.
Remark 6.

We have used the example of normal distributions for the measures of Xi,Yi (i), and θ, in all of the examples above out of convenience. Of course, the same illustrations can be made if we replace all uses of the normal law N(μ,σ2), with density ϕ(;μ,σ2), by any generic location-scale law defined by density ψ(;μ,σ) with location and scale parameters μ and σ>0, provided that the necessary integrals with respect to ψ exist.

7 Numerical estimation of posterior measures

We have opted for examples with summary-based discrepancy functions D and for IID sequences 𝐗 and 𝐘, for ease of understanding and simplicity of exposition. However, the main conclusions of Proposition 1 and Theorem 1 apply in much broader settings, as we will demonstrate below.

7.1 Non-IID sequences from a first-order autoregressive model

In this example, we consider 𝐗=(Xi)i, where Xi can be characterized as

Xi=|θ0|Xi1+Ei,

where θ0(1,1)=𝕋, X0N(0,1/{1|θ0|2}), and (Ei)i is IID with EiN(0,1). Similarly, we write 𝐘=(Yi)i, characterized by Yi=|θ|Yi1+Ei, with θ𝕋, where Y0N(0,1/{1|θ|2}) and (Ei)i is IID with EiN(0,1). We shall use a uniform prior density π(θ)=𝟏[0,1)(|θ|)/2. Via Hall and Heyde (1980, Thm. 6.6), we have the following strongly consistent estimators of |θ0| and |θ| from 𝐗n and 𝐘n: r0,n=i=2nXiXi1/i=2nXi2 and rn=i=2nYiYi1/i=2nYi2, respectively. Thus, the distance D(𝐗n,𝐘n)=|r0,nrn| converges, P-a.s., to D(θ0,θ)=||θ0||θ||.

To estimate the ABC posterior measures, we sample (θk)k[m] and compute (Dk)k[m] as described in Algorithm 1. For any given ϵ>0, we can then characterize the ABC posterior measures via their cumulative distribution functions (CDFs), estimated by the respective empirical CDFs. The larger the value of m, the more accurate the empirical distribution is to its target. When we take w to be the accept/reject kernel, the empirical CDF is given by:

FARm,ϵ(θ)={k=1m𝟏[0,ϵ)(Dk)}1k=1m𝟏[0,ϵ)(Dk)𝟏[0,θ)(θk). (11)

In the same way, when taking w to be the triweight kernel, we can estimate CDFs that characterize the ABC posterior measures, for any given ϵ, via the empirical weighted CDF:

Ftrim,ϵ(θ)={k=1m{1(Dkϵ)2}3𝟏[0,ϵ)(Dk)}1k=1m{1(Dkϵ)2}3𝟏[0,ϵ)(Dk)𝟏[0,θ)(θk). (12)

Figure 4 displays sample functions (11) and (12) from an experiment with θ0=1/2, n{100,1000}, and m=10000. We observe that the empirical cumulative distribution functions both concentrate around the estimates {r0,n,r0,n}, which converge towards the zeroes of D(θ0,θ): Θ0={θ0,θ0}={1/2,1/2}. The support of the sample measures are supersets of the estimates {r0,n,r0,n} that decrease in size as ϵ decreases towards zero, as expected. We also observe that, for fixed ϵ, the empirical cumulative distribution functions both converge to their limiting forms, as n increases, as predicted by Remark 2.

Algorithm 1 Sampling from the prior and computing discrepancies.

Input: Data 𝐗n, discrepancy function D, number of Monte Carlo replications m1.

For k[m]:

Sample θk from a measure with density π(θ);

Generate 𝐘n,k from a measure with density f(𝐲n|θk);

Compute discrepancy Dk=D(𝐗n,𝐘n,k).

Output: Discrepancies (Dk)k[m]; Parameters (θk)k[m].

(a) n=100
Refer to caption Refer to caption
(b) n=1000
Refer to caption Refer to caption
(c) n=
Refer to caption Refer to caption
Figure 4: Autoregressive model. Pseudo-posterior CDF FARm,ϵ (11) (left) and pseudo-posterior weighted CDF Ftrim,ϵ (12) (right) for the experiment described in Section 7.1, with θ0=1/2, m=10000, and sample sizes equal to (a) n=100 (top row), (b) n=1000 (middle row), and (c) n= (bottom row; limiting measures). Dotted diagonal lines represent the CDF of the prior measure (uniform).

7.2 Wasserstein distance in Gaussian model

For this example, we take 𝐗 to be an IID sequence of random variables, where XiN(θ022,1), for each i. We let θ0=(θ01,θ02)𝕋=[2,2]2 and endow 𝕋 with the prior measure defined by the uniform density π(θ)=𝟏[2,2]2(θ1,θ2)/16. We then take 𝐘 to be an IID sequence, independent of 𝐗, such that YiN(θ22,1), for each i.

To measure the distance between partial sequences 𝐗n and 𝐘n, we use the sample 1-Wasserstein distance

D(𝐗n,𝐘n)=n1i=1n|X(i)Y(i)|,

where X(1)X(2)X(n) and Y(1)Y(2)Y(n) are the order statistics of 𝐗n and 𝐘n, respectively (cf. Peyré and Cuturi 2019, Rem. 2.28). In this case, the 1-Wasserstein distance between measures on is just the L1 distance between the distribution functions of X1 and Y1, Fθ0 and Fθ (Peyré and Cuturi, 2019, Rem. 2.30). The Glivenko–Cantelli theorem implies that D(𝐗n,𝐘n) converges P-a.s. to D(θ0,θ)=|Fθ0(x)Fθ(x)|dx. To verify B2, we use the fact that the 1-Wasserstein distance between normal distributions N(μ1,σ2) and N(μ2,σ2) is |μ1μ2|, for μ1,μ2 (cf. Chafai and Malrieu, 2010, Example. 2.5).

We use Algorithm 1 to obtain samples and discrepancies to estimate the ABC posteriors using the accept/reject kernel and the triweight kernel in place of w. Simulations are carried out with θ01=θ02=1/2, n{100,1000}, and m=10000. Interpreting the expression θk<θ as meaning θk1<θ1 and θk2<θ2 (for θk,θ2), we provide representations of the obtained estimated empirical distribution functions of form (11) and (12) via their weighted point masses in Figure 5, along with an illustration of the supports of the limiting ABC posterior measures for various values of ϵ. We observe, as predicted, that the estimated ABC posterior measures concentrate on supersets of the zeroes of D, which can be characterized by the contour of the L2-ball of radius θ02=1: Θ0={θ=(θ1,θ2)2:θ2=θ02=1}, where the sets get smaller in volume as ϵ decreases, and where smaller weights w(Dk,ϵ) are assigned for larger deviations from Θ0. As expected from Remark 2, we observe that the supports of the empirical representations converge to those of the limiting measures, as n increases, for fixed values of ϵ.

Note that, when 𝐗 and 𝐘 arise from general location-scale distributions instead of normal distributions, we can use the formula of Gelbrich (1990, Cor. 2.4) with the Wasserstein norm equivalence result of Garling (2018, Cor. 21.2.4) to verify B2.

(a1) n=100, ϵ varies (a2) n=100, weights representation
Refer to caption Refer to caption
(b1) n=1000, ϵ varies (b2) n=1000, weights representation
Refer to caption Refer to caption
(c) n=, ϵ varies
Refer to caption
Figure 5: Student model. Point mass representations (a1, b1) and contour plot (c) of pseudo-posterior distribution function for the accept-reject kernel, and pseudo-posterior weighted distribution function for the triweight kernel (a2, b2) for the experiment described in Section 7.2, with m=10000 and where the black square represents θ0=(1/2,1/2). Black dotted lines represent the set Θ0. Left: point masses contributing to the empirical distribution under different threshold values ϵ>0 are indicated by color. Right: point masses for ϵ=1, with the sizes of points indicating the weights w(Dk,ϵ) (as a fraction of the maximum observed weight).

8 Application to binaural sound source localization

The following example is a simplified version of a synthetic example of Forbes et al. (2022) related to sound source localization. Here, we take 𝐗 to be an IID sequence of random variables, with XiN(ITD(θ0),1/4), for each i, and θ02 is interpreted as the 2D position of a sound source, assumed to be captured only through the noisy measurements of so-called interaural time differences (ITDs). In a binaural setting with two microphones, the ITD is defined as the difference between the time of arrival to the first and second microphone and given by ITD(θ0)=|θ0μ12θ0μ22| for a source in θ0 and microphones at positions μ1,μ22. ITD measurements only allow us to determine a pair of hyperbolas on which the source may be. We let θ0=(θ01,θ02)𝕋=[2,2]2 and endow 𝕋 with the prior measure defined by the uniform density π(θ)=𝟏[2,2]2(θ1,θ2)/16. We then take 𝐘 to be an IID sequence, independent of 𝐗, such that YiN(ITD(θ),1/4), for each i.

We proceed in the same manner as in Section 7.2. That is, to measure the distance between partial sequences 𝐗n and 𝐘n, we use the 1-Wasserstein distance D(𝐗n,𝐘n)=n1i=1n|X(i)Y(i)|, where X(1)X(2)X(n) and Y(1)Y(2)Y(n) are the order statistics of 𝐗n and 𝐘n, respectively. Again, the 1-Wasserstein distance between measures on is just the L1 distance between the distribution functions of X1 and Y1, Fθ0 and Fθ, and we have the convergence of D(𝐗n,𝐘n), P-a.s., to D(θ0,θ)=|Fθ0(x)Fθ(x)|dx, with B2 verified via the form of the 1-Wasserstein distance: |ITD(θ0)ITD(θ)| (cf. Chafai and Malrieu, 2010, Example. 2.5).

We again use Algorithm 1 to obtain prior and discrepancy samples to estimate the ABC posteriors using the accept/reject kernel and the triweight kernel in place of w. Simulations are carried out with θ01=θ02=1, n{100,1000,10000}, and m=10000. We provide representations of the obtained estimated empirical distribution functions via their weighted point masses in Figure 6. We observe, as predicted, that the estimated ABC posterior measures concentrate on supersets of the zeroes of D which consists of two hyperbolas as shown in Figure 6. Observe that smaller values of ϵ correspond to sets with elements that sit closer to the zeroes of D. We also observe that smaller weights w(Dk,ϵ) are assigned for larger deviations from the zeroes of D.

(a1) n=100, ϵ varies (a2) n=100, weights representation
Refer to caption Refer to caption
(b1) n=1000, ϵ varies (b2) n=1000, weights representation
Refer to caption Refer to caption
(c1) n=10000, ϵ varies (c2) n=10000, weights representation
Refer to caption Refer to caption
Figure 6: Sound source localization. Point mass representations of pseudo-posterior distribution functions for the accept-reject kernel (left) and pseudo-posterior weighted distribution functions for the triweight kernel (right) for the binaural sound source localization experiment, with θ0=(1,1), m=10000. Black dots represent the locations of the two microphones. The black square represents the source θ0 on the thick-dotted hyperbola that visualizes the set Θ0. Left: point masses contributing to the empirical distribution under different threshold values ϵ>0, from 0.15 to 0.3, are indicated by color. Right: point masses for ϵ=0.3, with the sizes of points indicating the weights w(Dk,ϵ) (as a fraction of the maximum observed weight).

9 Conclusion and future directions

In summary, we have provided a set of results that permit the establishment of posterior quasi-consistency of ABC posterior measures in the L1 and almost sure sense, in scenarios that lack identifiability, when discrepancies are possibly not Hölder continuous, and when the sequences 𝐗 and 𝐘 are potentially non-IID. Our results complement the existing literature and deliver theoretical guarantees to situations that are not covered by previous works.

Our contributions suggest several potential directions for further research. Open questions include whether our approach can be extended to prove the concentration of ABC posterior measures when the weight function is supported on an unbounded domain, whether this approach can prove concentration results in the ϵ0 n setting, and whether our proof techniques can be extended to provide approximation and estimation rates that either improve upon those proposed by others, such as Frazier et al. (2018), Bernton et al. (2019), and Legramanti et al. (2025), or relax the assumptions that are previously made. We aim to address these questions in our future work.

Acknowledgments

All authors acknowledge funding from the Australian Research Council grant number DP230100905, and from Inria Project WOMBAT.

Appendix A Technical results

Lemma 2 (Hunt’s Lemma).

Let (Ω,𝒢,Q) be a probability space and (𝒢n)n be a filtration on 𝒢. Further, define 𝒢=σ(n𝒢n). Let (Un)n, U, and V be random variables mapping from Ω, such that Unn[]Q-a.s.U, where |Un|V, Q-a.s., for each n, such that EQ(V)<. Then, limnEQ(Un|𝒢n)=EQ(U|𝒢), Q-a.s., and in L1(Q).

Remark 7.

Lemma 2 is often called Hunt’s Lemma and can be found in Dellacherie and Meyer (1980) and Spataru (2013, Thm. 29.32).

Appendix B Proofs of main results

B.1 Proof of Proposition 1

We use the canonical representation of Ω that supports the definitions of 𝐗 and 𝐘. That is, we write Ω=(𝕏×𝕏) with typical elements ω=(x1,y1,x2,y2,), and equip it with its Borel σ-algebra =((𝕏)(𝕏)). We then, define Ω=Ω×𝕋, with typical element (ω,θ), and equip it with the σ-algebra (𝕋). For each i, write Xi(ω)=xi and Yi(ω)=yi. For each n, we characterize the measure on (𝐗n,𝐘n,θ) via the density function

pn(𝐱n,𝐲n,θ)=pθ0(𝐱n)p(𝐲n|θ)π(θ), (13)

with respect to the dominating measure 𝔫2n𝔪, and we assume that (pn)n is a consistent sequence in the sense of the Ionescu–Tulcea extension theorem. We shall write Q to denote the unique measure on (𝕋) that is compatible with the measures defined by (13).

Further, for each n and Π-a.a. θ, we define the conditional distribution of (𝐗n,𝐘n) given by θ as the measure defined by

pn(𝐱n,𝐲n|θ)=pθ0(𝐱n)p(𝐲n|θ)

and denote the compatible conditional measure on by Qθ. Let (𝒢n)n be a filtration, where 𝒢n=σ(𝐗n), and write 𝒢=n𝒢n to be its limit.

Next, we set

Un=w(D(𝐗n,𝐘n),ϵ).

By A2, we can set V=supδw(δ,ϵ), so that |Un|V<. By A1, we have

D(𝐗n,𝐘n)n[]Qθ-a.s.D(θ0,θ) (14)

for Π-a.a. θ. Then, by A3, we can apply the continuous mapping:

limnUn =limnw(D(𝐗n,𝐘n),ϵ)
=w(limnD(𝐗n,𝐘n),ϵ)
=w(D(θ0,θ),ϵ)Qθ-a.s.

Using the filtration (𝒢n)n, we then apply Lemma 2, which implies that

EQθ{w(D(𝐗n,𝐘n),ϵ)|𝒢n}n[]Qθ-a.s.EQθ{w(D(θ0,θ),ϵ)|𝒢}

and

ΩEQθ{w(D(𝐗n,𝐘n),ϵ)|𝒢n}dQθn[]ΩEQθ{w(D(θ0,θ),ϵ)|𝒢}dQθ,

for Π-a.a. θ. By definition of Qθ, we have

EQθ{w(D(𝐗n,𝐘n),ϵ)|𝒢n} =𝕏nw(D(𝐗n,𝐲n),ϵ)p(𝐲n|θ)d𝔪(𝐲n)
=ϵ(𝐗n|θ),

and since

EQθ{w(D(θ0,θ),ϵ)|𝒢}=w(D(θ0,θ),ϵ),

for Π-a.a. θ, we conclude that, for Π-a.a. θ,

ϵ(𝐗n|θ)n[]Qθ-a.s.w(D(θ0,θ),ϵ) (15)

and

𝕏nϵ(𝐱n|θ)pθ0(𝐱n)d𝔪(𝐱n)n[]w(D(θ0,θ),ϵ). (16)

To prove (ii), we write

𝒞cϵ,n =𝕋π(θ)Ωϵ(𝐗n(ω)|θ)dQθ(ω)d𝔫(θ)
=Ω×𝕋ϵ(𝐗n(ω)|θ)dQ(ω,θ)

by Tonelli’s theorem. From (15) we have

ϵ(𝐗n|θ)n[]Q-a.sw(D(θ0,θ),ϵ). (17)

We thus obtain the desired result that

𝒞cϵ,nn𝕋w(D(θ0,θ),ϵ)π(θ)d𝔫(θ) (18)

by application of the dominated convergence theorem. The proof is complete by combining (16) and (18).

To prove (i), we note that (17) also implies

𝒞pϵ(𝐗n)=EQ{ϵ(𝐗n|θ)|𝒢n}n[]Q-a.sEQ{w(D(θ0,θ),ϵ)|𝒢} (19)

by Lemma 2, where

EQ{w(D(θ0,θ),ϵ)|𝒢}=𝕋w(D(θ0,θ),ϵ)π(θ)d𝔫(θ).

The proof is complete by combining the result above with (17).

B.2 Proof of Lemma 1

Let us define the Minkowski sum of sets 𝔸,𝔹𝕋 as 𝔸𝔹={a+b:a𝔸,b𝔹}. By B3, we have λ-covering centres Θλ𝕋 of Θ0 (as defined by B1 and B2). This then implies that Θ0Θλλ𝔹0. By the monotonicity of Minkoswki addition, Θ0λ𝔹0Θλλ𝔹0λ𝔹0=Θλ2λ𝔹0, where we use the fact that if 𝔸 is convex, then α𝔸+β𝔸=(α+β)𝔸 (cf. Schneider 2013, Ch. 3). Now, using the fact that the Lebesgue measure of λ𝔹0 is πq/2λq/Γ(q/2+1) and by monotonicity, we obtain the fact that

Leb(Θ0λ𝔹0)Leb(Θλ2λ𝔹0)|Θλ|πq/2(2λ)qΓ(q/2+1)λ00,

since |Θλ|λqλ00.

B.3 Proof of Theorem 1

Notice first that for each ϵ>0, w(D(θ0,θ),ϵ) has support {θ:D(θ0,θ)<φ1(ϵ)}, by B4. But by B1 and B2, for each λ>0, there exists a ϵ>0, such that if D(θ0,θ)<φ1(ϵ), then minτΘ0θτ<λ, and thus

{θ:D(θ0,θ)<φ1(ϵ)}Θ0λ𝔹0,

and

(Θ0λ𝔹0)π(θ)w(D(θ0,θ),ϵ)d𝔫(θ) {φ(D(θ0,θ))<ϵ}π(θ)w(D(θ0,θ),ϵ)d𝔫(θ)
=𝕋π(θ)w(D(θ0,θ),ϵ)d𝔫(θ),

where the equality holds by the fact that w(D(θ0,θ),ϵ) is zero when φ(D(θ0,θ))ϵ. Thus,

(Θ0λ𝔹0)π(θ)w(D(θ0,θ),ϵ)d𝔫(θ)𝕋π(θ)w(D(θ0,θ),ϵ)d𝔫(θ)=1

since (Θ0λ𝔹0)𝕋. Here, by appropriately choosing ϵ, we can make Leb(Θλ2λ𝔹0) as small as we like via Lemma 1. Under A1–A3, we obtain the conclusion from Remark 2, implying that Πϵ,np converges in total variation to Πϵ, P-a.s., and Πϵ,nc converges in total variation to Πϵ. But by definition of convergence in total variation, we must also have the set-wise convergence statements Πϵ,np(𝔸)n[]P-a.s.Πϵ(𝔸) and Πϵ,nc(𝔸)n[]Πϵ(𝔸), for any 𝔸(𝕋) (cf. Hernández-Lerma and Lasserre, 2003, Sec. 1.4.2). Thus,

Πϵ,np(Θ0λ𝔹0)n[]P-a.s.Πϵ(Θ0λ𝔹0)

and

Πϵ,nc(Θ0λ𝔹0)n[]Πϵ(Θ0λ𝔹0),

as required.

References

  • M. A. Beaumont, W. Zhang, and D. J. Balding (2002) Approximate bayesian computation in population genetics. Genetics 162 (4), pp. 2025–2035. Cited by: §3. a
  • M. A. Beaumont (2019) Approximate Bayesian computation. Annual Review of Statistics and its Application 6, pp. 379–403. Cited by: §1. a
  • E. Bernton, P. E. Jacob, M. Gerber, and C. P. Robert (2019) Approximate Bayesian computation with the Wasserstein distance. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 81 (2), pp. 235–269. Cited by: item, item, Table 1, §2, §2, §2, §9, Remark 4. a b c d e f g h i j
  • D. Chafai and F. Malrieu (2010) On fine properties of mixtures with respect to concentration of measure and Sobolev type inequalities. Annales de l’IHP Probabilités et Statistiques 46, pp. 72–96. Cited by: §7.2, §8. a b
  • C. Dellacherie and P. Meyer (1980) Probabilities and potential, b: theory of martingales. Elsevier. Cited by: Remark 7. a
  • F. Forbes, H. D. Nguyen, T. Nguyen, and J. Arbel (2022) Summary statistics and discrepancy measures for approximate Bayesian computation via surrogate posteriors. Statistics and Computing 32. Cited by: §4, §8. a b
  • D. T. Frazier, G. M. Martin, C. P. Robert, and J. Rousseau (2018) Asymptotic properties of approximate Bayesian computation. Biometrika 105 (3), pp. 593–607. Cited by: Table 1, §2, §2, §2, §9. a b c d e f g h
  • D. T. Frazier, C. P. Robert, and J. Rousseau (2020) Model misspecification in approximate Bayesian computation: consequences and diagnostics. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 82 (2), pp. 421–444. Cited by: Table 1, §2, §2, Remark 4. a b c d e
  • D. J. Garling (2018) Analysis on polish spaces and an introduction to optimal transportation. Cambridge University Press. Cited by: §7.2. a
  • M. Gelbrich (1990) On a formula for the L2 Wasserstein metric between measures on Euclidean and Hilbert spaces. Mathematische Nachrichten 147 (1), pp. 185–203. Cited by: §7.2. a
  • S. Ghosal and A. van der Vaart (2017) Fundamentals of nonparametric bayesian inference. Vol. 44, Cambridge University Press. Cited by: §5. a
  • P. Hall and C. C. Heyde (1980) Martingale limit theory and its application. Academic Press. Cited by: §7.1. a
  • O. Hernández-Lerma and J. B. Lasserre (2003) Markov chains and invariant probabilities. Birkhauser. Cited by: §B.3. a
  • B. Jiang (2018) Approximate Bayesian computation with Kullback-Leibler divergence as data discrepancy. In International Conference on Artificial Intelligence and Statistics, pp. 1711–1721. Cited by: §1, Table 1, §2, §4, Remark 1. a b c d e
  • G. Karabatsos and F. Leisen (2018) An approximate likelihood perspective on ABC methods. Statistics Surveys 12, pp. 66–104. Cited by: §1, §3. a b
  • S. Legramanti, D. Durante, and P. Alquier (2025) Concentration of discrepancy-based approximate Bayesian computation via Rademacher complexity. Annals of Statistics 53 (1), pp. 37 – 60. External Links: Document Cited by: Table 1, §2, §2, §2, §9, Remark 4. a b c d e f g h
  • W. Li and P. Fearnhead (2018a) Convergence of regression-adjusted approximate Bayesian computation. Biometrika 105 (2), pp. 301–318. Cited by: §1, Table 1, §2, §2, §3. a b c d e f g
  • W. Li and P. Fearnhead (2018b) On the asymptotic efficiency of approximate Bayesian computation estimators. Biometrika 105 (2), pp. 285–299. Cited by: §1, Table 1, §2, §2, §3. a b c d e f g
  • B. Makarov and A. Podkorytov (2013) Real Analysis: Measures, Integrals and Applications. Springer, New York. Cited by: §4. a
  • J. Marin, P. Pudlo, C. P. Robert, and R. J. Ryder (2012) Approximate Bayesian computational methods. Statistics and Computing 22 (6), pp. 1167–1180. Cited by: §1, §1, §3, §4. a b c d
  • J. W. Miller and D. B. Dunson (2019) Robust Bayesian inference via coarsening. Journal of the American Statistical Association 114 (527), pp. 1113–1125. Cited by: §1, §1, Table 1, §2, §3, Remark 1. a b c d e f g h i j
  • H. D. Nguyen, J. Arbel, H. Lü, and F. Forbes (2020) Approximate Bayesian computation via the energy statistic. IEEE Access 8, pp. 131683–131698. Cited by: §1, §1, Table 1, §2, §3, §4, §5, Remark 1. a b c d e f g h i
  • M. Park, W. Jitkrittum, and D. Sejdinovic (2016) K2-ABC: Approximate Bayesian computation with kernel embeddings. In Artificial Intelligence and Statistics, pp. 398–407. Cited by: §1, §3, §5. a b c d
  • G. Peyré and M. Cuturi (2019) Computational optimal transport: with applications to data science. Foundations and Trends in Machine Learning 11 (5-6), pp. 355–607. Cited by: §7.2. a b
  • T. Richmond (2020) General Topology. An Introduction, De Gruyter. External Links: ISBN 978-3-11-068657-9, Document Cited by: §5. a
  • F. Rubio and A. M. Johansen (2013) A simple approach to maximum intractable likelihood estimation. Electronic Journal of Statistics 7, pp. 1632–1654. Cited by: item, Table 1. a b
  • R. Schneider (2013) Convex Bodies: The Brunn–Minkowski Theory. 2 edition, Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge. External Links: ISBN 978-1-107-60101-7, Document Cited by: §B.2. a
  • D. W. Scott (2015) Multivariate density estimation: theory, practice, and visualization. John Wiley & Sons. Cited by: §3, Remark 5. a b
  • S. A. Sisson, Y. Fan, and M. Beaumont (2018) Handbook of approximate bayesian computation. CRC Press. Cited by: §1. a
  • A. Spataru (2013) Analysis and probability. Elsevier, Oxford. Cited by: §3, Remark 7. a b
  • R. D. Wilkinson (2013) Approximate bayesian computation (ABC) gives exact results under the assumption of model error. Statistical Applications in Genetics and Molecular Biology 12, pp. 129–141. Cited by: §3. a

Cite this paper

Please cite the published version. Venue: Bayesian Analysis, Journal article (advance publication, 2025). DOI: 10.1214/25-BA1520. Official record: Project Euclid.

BibTeX
@article{nguyen2025revisiting,
  title     = {Revisiting concentration results for approximate Bayesian computation},
  author    = {Nguyen, Hien Duy and Nguyen, TrungTin and Arbel, Julyan and Forbes, Florence},
  journal   = {Bayesian Analysis},
  year      = {2025}, publisher = {International Society for Bayesian Analysis},
  doi       = {10.1214/25-BA1520},
}