Minimum Divergence Estimators, Maximum Likelihood and the Generalized Bootstrap

This paper states that most commonly used minimum divergence estimators are MLEs for suited generalized bootstrapped sampling schemes. Optimality in the sense of Bahadur for associated tests of fit under such sampling is considered.


Motivation and Context
Divergences between probability measures are widely used in statistics and data science in order to perform inference under models of various kinds; parametric or semiparametric, or even in non-parametric settings. The corresponding methods extend the likelihood paradigm and insert inference in some minimum "distance" framing, which provides a convenient description for the properties of the resulting estimators and tests, under the model or under misspecification. Furthermore, they pave the way to a large number of competitive methods, which allows to trade-off between efficiency and robustness, among other things. Many families of such divergences have been proposed, some of them stemming from classical statistics (such as the Chi-square divergence), while others have their origin in other fields, such as information theory. Some measures of discrepancy involve regularity of the corresponding probability measures while others seem to be restricted to measures on finite or countable spaces, at least when using them as inferential tools, henceforth in situations when the elements of a model have to be confronted with a dataset. The choice of a specific discrepancy measure in specific context is somehow arbitrary in many cases, although the resulting conclusion of the inference might differ accordingly, above all under misspecification.
The goal of this paper is explained shortly. The current literature on risks, seen from a statistical standpoint, has developed in two main directions, from basic definitions and principles, following the seminal papers [1,2].
A first stream of papers aims to describe classes of discrepancy indices (divergences) associated with invariance under classes of transformations and similar properties; see [3][4][5] for a review.
The second flow aims at making use of these indices for practical purposes under various models, from parametric models to semi-parametric ones, mostly. Also the literature in learning procedures makes extensive use of divergence-based risks, with a strong accent on the implementation issues. Following the standard approach, their properties are mainly considered under i.i.d. sampling, providing limit results, confidence areas, etc; see [6,7] and references therein for review and developments, and the monographs [8,9]. Also comparison among discrepancy indices are considered in terms of performances either under the model, or with respect to robustness (aiming at minimizing the role of outliers in the inference by providing estimators with redescending influence function), or with respect to misspecification, hence focusing on the loss in estimation or testing with respect to the distance from the assumed model to the true one.
This literature, however, rarely considers the rationale for specific choices of indices in relation with the concepts which define statistics, such as the Bayesian paradigm or the maximum likelihood (ML) one; for a contribution in this direction for inference in models defined by linear constraints, see [10]. In [11], we could prove that minimum divergence estimators (in the class of the ones considered in the present paper) coincide with MLEs under i.i.d. sampling in regular exponential models (but need not, even in common models such as mixtures). Here it is proved that minimum divergence estimators are indeed MLEs under weighted sampling, instead of standard i.i.d. one, commonly met in bootstrap procedures which aim at providing finite sample properties of estimators through simulation.
This paper considers a specific class of divergences, which contains most of the classical inferential tools, and which is indexed by a single scalar parameter. This class of divergences belongs to the Csiszar-Ali-Silvey-Arimoto family of divergences (see [4]), and is usually referred to as the power divergence class, which has been considered by Cressie and Read [12]; however this denomination is also shared by other discrepancy measures of some different nature [13]. We will use the acronym CR for the class of divergences under consideration in this paper.
Section 2 recalls that the MLE is obtained as a proxy of the minimizer of the Kullback-Leibler divergence between the generic law of the observed variable and the model, which is the large deviation limit for the empirical distribution. This limit statement is nothing but the continuation of the classical ML paradigm, namely to make the dataset more "probable" under the fitted distribution in the model, or, equivalently, to fit the most "likely" distribution in the model to the dataset. Section 3 states that given a divergence pseudo distance φ in CR the Minimum Divergence Estimator (MDE) is obtained as a proxy of the minimizer of the large deviation limit for some bootstrap version of the empirical distribution, which establishes that the MDE is MLE for bootstrapped samples defined in relation with the divergence. This fact is based on the strong relation which associates to any CR φ-divergence a specific RV W (see Section 1.1.2); this link is the cornerstone for the interpretation of the minimum φ-divergence estimators as MLEs for specific bootstrapped sampling schemes where W has a prominent rôle. Some specific remark explores the link between MDE and MLE in exponential families. As a by product, we also introduce a bootstrapped estimator of the divergence pseudo-distance φ between the distribution of the data and the model.
In Section 4, we specify the bootstrapped estimator of the divergence which can be used in order to perform an optimal test of fit. Due to the type of asymptotics handled in this paper, optimality is studied in terms of Bahadur efficiency. It is shown that tests of fit based on such estimators enjoy Bahadur optimality with respect to other bootstrap plans when the bootstrap is performed under the distribution associated with the divergence criterion itself.
The discussion held in this paper pertains to parametric estimation in a model P Θ whose elements P θ are probability measures defined on the same finite space Y := {d 1 , . . . , d K }, and θ ∈ Θ is an index space; we assume identifiability, namely different values of θ induce different probability laws P θ 's. Also all the entries of P θ will be positive for all θ in Θ.

Divergences
We consider regular divergence functions ϕ which are non negative convex functions with values in R + which belong to C 2 (R) and satisfy ϕ(1) = ϕ (1) = 0 and ϕ (1) = 1; see [3,4] for properties and extensions. An important class of such functions is defined through the power divergence functions defined for all real γ = 0, 1 with ϕ 0 (x) := − log x + x − 1 (the likelihood divergence function) and ϕ 1 (x) := x log x − x + 1 (the Kullback-Leibler divergence function). This class is usually referred to as the Cressie-Read family of divergence functions (see [12]). It is a very simple class of functions (with the limits in γ → 0, 1) which allows to represent nearly all commonly used statistical criterions. Parametric inference in commonly met situations including continuous models or some non-regular models can be performed with them; see [6]. The L 1 divergence function ϕ(x) := |x − 1| is not captured by the CR family of functions. When undefined the function ϕ is declared to assume value +∞. Associated with a divergence function ϕ, φ is the divergence between a probability measure and a finite signed measure; see [14].
For P := (p 1 , . . . , p K ) and Q := (q 1 , . . . , q K ) in S K , the simplex of all probability measures on Y, define, whenever Q and P have non-null entries Indexing this pseudo-distance by γ and using ϕ γ as divergence function yields the The is defined between signed measures; see [15] for definitions in more general setting, and [6] for the advantage to extend the definition to possibly signed measures in the context of parametric inference for non-regular models. Also the present discussion which is restricted to finite spaces Y can be extended to general spaces. The conjugate divergence function of ϕ is defined through and the corresponding divergence φ(P, Q) is whenever defined, and equals +∞ otherwise. When ϕ = ϕ γ then ϕ = ϕ 1−γ as follows by substitution. Pairs ϕ γ , ϕ 1−γ are therefore conjugate pairs. Inside the Cressie-Read family, the Hellinger divergence function is self-conjugate. For P = P θ and Q ∈ S K we denote φ(Q, P) by φ(Q, θ) (resp φ(θ, Q), or φ(θ , θ), etc. according to the context).

Weights
This paragraph introduces the special link which connects CR divergences with specific random variables, which we call weights. Those will be associated to the dataset and define what is usually referred to as a generalized bootstrap procedure. This is the setting which allows for an interpretation of the MDE's as generalized bootstrapped MLEs.
For a given real valued random variable (RV) W denote its cumulant generating function which we assume to be finite in a non-void open neighborhood of 0. The Fenchel Legendre transform of M (also called the Chernoff function) is defined through The function x → ϕ W (x) is non-negative, is C ∞ and convex. We also assume that It is of interest to note that the classical power divergences ϕ γ can be represented through (4) for γ ≤ 1 or γ ≥ 2. A first proof of this lays in the fact that when W has a distribution in a Natural Exponential Family (NEF) with power variance function with exponent α = 2 − γ, then the Legendre transform ϕ W of its cumulant generating function M is indeed of the form (1). See [16,17] for NEF's and power variance functions, and [18] for relation to the bootstrap. A general result of a different nature, including the former ones, can be seen in [19], Theorem 20. Correspondence between the various values of γ and the distribution of the respective weights can be found in [19], Example 39, and it can be summarized as presented now.
For γ < 0 the RV W is constructed as follows: Let Z be an auxiliary RV with density f Z and support [0, ∞) of a stable law with parameter triplet − γ 1−γ , 0, in terms of the "form B notation" on p 12 in [20]; then W has an absolutely continuous distribution with density For γ = 0 (which amounts to consider the limit as γ → 0 in (1)) then W has a standard exponential distribution E(1) on [0, ∞).
For γ ∈ (0, 1) then W has a compound Gamma-Poisson distribution For γ = 1, W has a Poisson distribution with parameter 1, POI(1). For γ = 2, the RV W has normal distribution with expectation and variance equal to 1.
For γ > 2, the RV W is constructed as follows: Let Z be an auxiliary RV with density f Z and support (−∞, ∞) of a stable law with parameter triplet γ γ−1 , 0, in terms of the "form B notation" on p 12 in [20]; then W has an absolutely continuous distribution with density

Standard Derivation
Let X 1 , . . . X n be a set of n independent random variables with common probability measure P θ T and consider the Maximum Likelihood estimator of θ T . A common way to define the ML paradigm is as follows: For any θ consider independent random variables (X 1,θ , . . . X n,θ ) with probability measure P θ , thus sampled in the same way as the X i 's, but under some alternative θ. Denote the empirical measures pertaining respectively to (X 1 , . . . X n ) and (X 1,θ , . . . X n,θ ). Define θ ML as the value of the parameter θ for which the probability that, up to a permutation of the order of the X i,θ 's, the probability that (X 1,θ , . . . X n,θ ) coincides with X 1 , . . . X n is maximal, conditionally on the observed sample X 1 , . . . X n . In formula θ ML := arg max θ P θ ( P n,θ = P n |P n ).
An explicit enumeration of the above expression P θ ( P n,θ = P n |P n ) involves the quantities n j := card i : X i = d j for j = 1, . . . , K and yields P θ ( P n,θ = P n,X |P n,X ) = n!P θ d j as follows from the classical multinomial distribution. Optimizing on θ in (6) yields It follows from direct evaluation that Introducing the Kullback-Leibler divergence KL(P n , P θ ) it thus holds We have recalled that minimizing the Kullback-Leibler divergence KL(P n , θ) amounts to minimizing the Likelihood divergence KL m (θ, P n ) and produces the ML estimate of θ T .

Asymptotic Derivation
We assume that lim n→∞ P n = P θ T a.s.
This holds for example when the X i 's are drawn as an i.i.d. sample with common law P θ T which we may assume in the present context. From an asymptotic standpoint, Kullback-Leibler divergence is related to the way P n keeps away from P θ when θ is not equal to the true value of the parameter θ T generating the observations X i 's and is closely related with the type of sampling of the X i 's. In the present case, when i.i.d. sampling of the X i,θ 's under P θ is performed, Sanov Large Deviation theorem leads to This result can easily be obtained from (6) using Stirling formula to handle the factorial terms and the law of large numbers which states that for all j's, n j /n tends to P θ T (d j ) as n tends to infinity. We note that the MLE θ ML is a proxy of the minimizer of the natural estimator θ T of KL(θ T , θ) in θ, substituting the unknown measure generating the X i 's by its empirical counterpart P n . Alternatively as will be used in the sequel, θ ML minimizes upon θ the Likelihood divergence KL m (θ, θ T ) between P θ and P θ T substituting the unknown measure P θ T generating the X i 's by its empirical counterpart P n . Summarizing we have obtained: The ML estimate can be obtained from a LDP statement as given in (7), optimizing in θ in the estimator of the LDP rate where the plug-in method of the empirical measure of the data is used instead of the unknown measure P θ T . Alternatively it holds with KL m (θ, θ T ) := KL m (θ, P n ).
This principle will be kept throughout this paper: the estimator is defined as maximizing the probability that the simulated empirical measure be close to the empirical measure as observed on the sample, conditionally on it, following the same sampling scheme. This yields a maximum likelihood estimator, and its properties are then obtained when randomness is introduced as resulting from the sampling scheme.

Bootstrap and Weighted Sampling
The sampling scheme which we consider is commonly used in connection with the bootstrap and is referred to as the weighted or generalized bootstrap, sometimes called wild bootstrap, first introduced by Newton and Mason [21].
Let X 1 , . . . , X n with common distribution P on Y := {d 1 , . . . , d K }. Consider a collection W 1 , . . . , W n of independent copies of W, whose distribution satisfies the conditions stated in Section 1. The weighted empirical measure P W n is defined through This empirical measure need not be a probability measure, since its mass may not equal 1. Also it might not be positive, since the weights may take negative values. Therefore P W n can be identified with a random point in R K . The measure P W n converges almost surely to P when the weights W i 's satisfy the hypotheses stated in Section 1.
We also consider the normalized weighted empirical measure where whenever ∑ n j=1 W j = 0, and

A Conditional Sanov Type Result for the Weighted Empirical Measure
We now state a conditional Sanov type result for the family of random measures P W n . It follows readily from a companion result pertaining to P W n and enjoys a simple form when the weights W i are associated to power divergences, as defined in Section 1.1.2. We quote the following results, referring to [19].
Consider a set Ω in R K such that which amounts to a regularity assumption (obviously met when Ω is an open set), and which allows for the replacement of the usual lim inf and lim sup by standard limits in usual LDP statements. We denote by P W the probability measure of the random family of i.i.d. weights W i . It then holds Proposition 1 (Theorem 9 in [19]). The weighted empirical measure P W n satisfies a conditional Large Deviation Principle in R K namely, denoting P the a.s. limit of P n , lim n→∞ 1 n log P W P W n ∈ Ω X n 1 = −φ W (Ω, P) where φ W (Ω, P) := inf Q∈Ω φ W (Q, P).
As a direct consequence of the former result, it holds, for any Ω ⊂ S K satisfying (11), where S K designates the simplex of all pm's on Y.
Theorem 1 (Theorem 12 in [19]). The normalized weighted empirical measure P W n satisfies a conditional Large Deviation Principle in S K A flavour of the simple proofs of Proposition 1 and Theorem 1 is presented in Appendix A; see [19] for a detailed treatment; see also Theorem 3.2 and Corollary 3.3 in [22] where Theorem 1 is proved in a more abstract setting.
We will be interested in the pm's in Ω which minimize the RHS in the above display. The case when φ W is a power divergence, namely φ W = φ γ for some γ enjoys a special property with respect to the pm's Q achieving the infimum (upon Q in Ω) in (12). It holds Proposition 2 (Lemma 14 in [19]). Assume that φ W is a power divergence. Then Q ∈ arg inf inf m =0 φ W (mQ, P), Q ∈ Ω and Q ∈ arg inf φ W (Q, P), Q ∈ Ω are equivalent statements.
Indeed Proposition 2 holds as a consequence of the following results, to be used later on. Lemma 1. For Q and P two pm's such that the involved expressions are finite, it holds (i) For γ = 0 and γ = 1 it holds that In the case where W is a RV with standard exponential distribution, then a link between the present approach and Bayesian inference can be drawn, since the normalized weighted empirical measure P W n is a realization of the a posteriori distribution for the Dirichlet prior on the non parametric distribution of X. See [23].
The weighted empirical measure P W n has been used in the weighted bootstrap (or wild bootstrap) context, although it is not a pm. However, conditionally upon the sample points, its produces statistical estimators T(P W n ) whose weak behavior (conditionally upon the sample) converges to the same limit as does T(P n ) when normalized on the classical CLT range; see eg Newton and Mason [21]. Large deviation theorem for the weighted empirical measure P W n has been obtained by [24]; for other contributions in line with those, see [22,25]. Normalizing the weights produces families of exchangeable weights Z i , and the normalized weighted empirical measure P W n is the cornerstone for the socalled non-parametric Bayesian bootstrap, initiated by [23], and further developed by [26] among others. Note however that in this context the RV's W i 's are chosen distributed as standard exponential variables. The link with spacings from a uniform distribution and the corresponding reproducibility of the Dirichlet distributions are the basic ingredients which justify the non parametric bootstrap approach; in the present context, the choice of the distribution of the W i 's is a natural extension of this paradigm, at least when those W i 's are positive RV's.

Maximum Likelihood for the Generalized Bootstrap
Let's turn back to the estimation of θ T , assuming P θ T the common distribution of the independent observations X 1 , . . . , X n . We will consider maximum likelihood in the same spirit as developed in Section 2.2, here in the context of the normalized weighted empirical measure; it amounts to justify minimum divergence estimators as appropriate MLEs under such bootstrap procedure.
We thus consider the same statistical model P Θ and keep in mind the ML principle as seen as resulting from a maximization of the conditional probability of getting simulated observations close to the initially observed data. Similarly as in Section 2 fix an arbitrary θ and simulate X 1,θ , . . . , X n,θ with distribution P θ . Define accordingly P W n,θ and P W n,θ making use of i.i.d. RV's W 1 , . . . , W n . Now the event P W n,θ (k) = n k /n has probability 0 in most cases (for example when W has a continuous distribution), and therefore we are led to consider events of the form P W n,θ ∈ V ε (P n ) , meaning max k P W n,θ (d k ) − P n (d k ) ≤ ε for some ε > 0; notice that V ε (P n ) defined through For such a configuration consider P W P w n,θ ∈ V ε (P n ) X 1,θ , . . . , X n,θ , P n (13) where the X i,θ are randomly drawn i.i.d. under P θ . Obviously for θ far away from θ T the sample (X 1,θ , . . . , X n,θ ) is realized "far away " from (X 1 , . . . , X n ), which has been generated under the truth, namely P θ T , and the probability in (13) is small, whatever the weights, for small ε.
We will now consider (13) for large n, since, in contrast with the first derivation of the standard MLE in Section 2.1, we cannot perform the same calculation for each n, which was based on multinomial counts. Note that we obtained a justification for the usual MLE through the asymptotic Sanov LDP, leading to the KL divergence and finally back to the MLE through an approximation step of this latest. From Theorem 12 together with the a.s. convergence of P n to P θ T in S K it follows that for some As ε → 0 , by continuity it holds that lim ε→0 lim n→∞ 1 n log P W P W n,θ ∈ V (P n )|X 1,θ , . . . , X n,θ , P n (15) The ML principle amounts to maximize P W P W n,θ ∈ V (P n )|X 1,θ , . . . , X n,θ , P n (16) over θ. Whenever Θ is a compact set we may insert this optimization in (14) which yields, following (15) lim ε→0 lim n→∞ 1 n log sup θ P W P W n,θ ∈ V (P n )|X 1,θ , . . . , X n,θ , P n We consider weights W's such that there exists a power divergence function ϕ γ satisfying (4), which amounts to φ W = φ γ ; by the results quoted in Section 1.1.2 this holds when γ ∈ (−∞, 1] ∪ [2, +∞).
By Proposition 2 the argument of the infimum upon θ in the RHS of the above display coincides with the corresponding argument of φ W (θ T , θ), which obviously gets θ T . This justifies to consider a proxy of this minimization problem as a "ML" estimator based on normalized weighted data.
A further interpretation of the MDE in the context of non-parametric Bayesian procedures may also be proposed; this is postponed to a next paper. Since the ML estimator is obtained as in the conventional case by plug in the LDP rate.
Obviously the "best" plug in consists in the substitution of P θ T by P n , the empirical measure of the sample, since P n achieves the best rate of convergence to P θ T when confronted to any bootstrapped version, which adds "noise" to the sampling. We may therefore call the MLE for the bootstrap sampling; here φ W (with divergence function ϕ) is the conjugate divergence of φ W (with divergence function ϕ). Since φ W = φ γ for some γ, it holds We can also plug in the normalized weighted empirical measure, which also is a proxy of P θ T for each run of the weights. This produces a bootstrap estimate of θ T through where P W n is defined in (9), assuming n large enough such that the sum of the W i 's is not zero. Whenever P(W = 0) > 0 , these estimators are defined for large n in order that P W n (d k ) be positive for all k. Since E(W) = 1, this occurs for large samples. For a given weighted bootstrapped sample with weights W 1 , . . . , W n leading to the weighted normalized empirical measure P W n , θ W B is the MLE in the sense of (16), hence defined as a proxy of the maximizer of P W P W n,θ ∈ V (P W n )|X 1,θ , . . . , X n,θ , P W n where the vector W 1 , . . . , W n is an independent copy of (W, . . . , W n ). This estimator usually differs from the bootstrapped version of the MLE based on P n (see (8)) which is defined for n large enough through When Y is not a finite space then an equivalent construction can be developed based on the variational form of the divergence; see [6].

Remark 1.
We may also consider cases when the MLE defined through θ W ML defined in (17) coincide with the standard MLE θ ML under i.i.d. sampling, and when its bootstrapped counterparts θ W B defined in (18) coincides with the bootstrapped standard MLE θ b ML defined through the likelihood estimating equation where the factor 1/n is substituted by the weight Z i . It is proved in Theorem 5 of [11] that whenever P Θ is an exponential family with natural parametrization θ ∈ R d and sufficient statistics T where the Hessian matrix of C(θ) is definite positive, then for all divergence pseudo distance φ satisfying regularity conditions (including therefore the present cases), θ W ML equals θ ML , the classical MLE in P Θ defined as the solution of the normal equation irrespectively upon φ. Therefore on regular exponential families, and under i.i.d. sampling, all minimum divergence estimators coincide with the MLE (which is indeed one of them). The proof of this result is based on the variational form of the estimated divergence Q → φ(Q, P), which coincides with the plug in version in (17) when the common support of all distributions in P Θ is finite. Following verbatim the proof of Theorem 5 in [11] substituting P n by P W n it results that θ W B equals the weighted MLE (standard generalized bootstrapped MLE θ b ML ) defined through the normal equation where the Z i 's are defined in (10). This fact holds for any choice of the weights, irrespectively on the choice of the divergence function ϕ with the only restriction that it satisfies the mild conditions (RC) in [11]. It results that for those models any generalized bootstrapped MDE coincides with the corresponding standard bootstrapped MLE.
which is defined for n large enough. Also in this case θ W ML coincides with the standard MLE. B-If W has an Inverse Gaussian distribution IG(1,1) then ϕ(x) = ϕ −1 (x) = 1 2 (x − 1) 2 /x for x > 0 and the ML estimator minimizes the Pearson Chi-square divergence with generator function ϕ 2 (x) = 1 2 (x − 1) 2 which is defined on R. C-If W follows a normal distribution with expectation and variance 1, then the resulting divergence is the Pearson Chi-square divergence ϕ 2 (x) and the resulting estimator minimizes the Neyman Chi-square divergence with ϕ(x) = ϕ −1 (x). D-When W has a Compound Poisson Gamma distribution C(POI(2), Γ(2, 1)) distribution then the corresponding divergence is ϕ 1/2 (x) = 2 √ x − 1 2 which is self conjugate, whence the ML estimator is the minimum Hellinger distance one.

Bahadur Efficiency of Minimum Divergence Tests under Generalized Bootstrap
In [27] Efron and Tibshirani suggest the bootstrap as a valuable approach for testing, based on bootstrapped samples. We show that bootstrap testing for parametric models based on appropriate divergence statistics enjoys maximal Bahadur efficiency with respect to any bootstrap test statistics.
The standard approach to Bahadur efficiency can be adapted for the present generalized Bootstrapped tests as follows.
Consider the test of some null hypothesis H0: θ T = θ versus a simple Hypothesis H1 θ T = θ .
We consider two competitive statistics for this problem. The first one is based on the bootstrap estimate of φ W (θ, θ T ) and which allows to reject H0 for large values since lim n→∞ T n,X = 0 whenever H0 holds. In the above display we have emphasized in P W n,X the fact that we have used the RV X i 's. Let L n (t) := P W ( T n,X > t|X 1 , . . . , X n ).
We use P W to emphasize that the hazard is due to the weights. Consider now a set of RVs Z 1 , . . . , Z n extracted from a sequence such that lim n→∞ P n,Z = P θ a.s; we have denoted P n,Z the empirical measure of (Z 1 , . . . , Z n ); accordingly define P W n,Z , the normalized weighted empirical measure of the Z i 's making use of weights W 1 , . . . , W n which are i.i.d. copies of (W 1 , . . . , W n ), drawn independently from (W 1 , . . . , W n ). Define accordingly T n,Z := Φ θ, P W n,Z = T P W n,Z .
Define L n (T n,Z ) := P W ( T n,W > T n,Z |X 1 , . . . , X n ) which is a RV (as a function of T n,Z ). It holds lim n→∞ T n,Z = Φ θ, θ a.s and therefore the Bahadur slope for the test with statistics T n is Φ(θ , θ) as follows from If θ T = θ. Under H0 the rate of decay of the p-value corresponding to a sampling under H1 is captured through the divergence Φ(θ , θ).
Consider now a competitive test statistics S P W n,X and evaluate its Bahadur slope. Similarly as above it holds, assuming continuity of the functional S on S K lim n→∞ 1 n log P W S P W n,X > S P W n,Z X 1 , . . . , X n as follows from the continuity of Q → Φ(Q, θ T ). Hence the Bahadur slope of the test based on S P W n,X is larger or equal Φ(θ , θ). We have proved that the chances under H0 for the statistics T n,X to exceed a value obtained under H1 are (asymptotically) less that the corresponding chances associated with any other statistics based on the same bootstrapped sample; as such it is most specific on this scale with respect to any competing ones. Namely the following result holds:

Informed Consent Statement: Not applicable.
Acknowledgments: The author thanks the Editor and two anonymous referees for many remarks which helped to improve this paper.

Conflicts of Interest:
The authors declare no conflict of interest.

Appendix A
A Heuristic Derivation of the Conditional LDP for the Normalized Weighted Empirical Measure The following sketch of proof gives the core argument which yields to Proposition 1; a proof adapted to a more abstract setting can be found in [22], following their Theorem 3.2 and Corollary 3.3, but we find it useful to present a proof which reduces to simple arguments. We look at the probability of the event for a given vector R in R K , where V(R) denotes a neighborhood of R, therefore defined through (Q ∈ V(R)) ⇐⇒ (Q(d l ) ≈ R(d l ); 1 ≤ l ≤ k) We denote by P the distribution of the RV X so that P n converges to P a.s. Evaluating loosely the probability of the event defined in (A1) yields, denoting P X n 1 the conditional distribution given (X 1 , . . . , X n ) P X n 1 P W n ∈ V(R) = P X n = P X n where we used repeatedly the fact that the r.v's W are i.i.d.. In the above display, from the second line on, the r.v's are independent copies of W 1 for all i and l. In the above displays n l is the number of X i 's which equal d l , and the W i,l are the weights corresponding to these X i 's. We used the convergence of n l /n to P(d l ) in the last display. Now for each l in {1, 2, . . . , K} by the Cramer LDP for the empirical mean, it holds 1 n l log P 1 n l i.e., as follows from the classical Cramer LDP, and therefore 1 n log P X n 1 P W n ∈ V(R) where the limit in the last line applies to the case where we let n → ∞ . A precise derivation of Proposition 1 involves two arguments: firstly for a set Ω ⊂ R K a covering procedure by small balls allowing to use the above derivation locally, and the regularity assumption (11) which allows to obtain proper limits in the standard LDP statement.
The argument leading from Proposition 1 to Theorem 1 can be summarized now.
For some subset Ω in S K with non-void interior it holds and P W n ∈ mΩ ⊂ (∑ n i=1 W i = m) for all m = 0. Therefore P X n 1 P W n ∈ Ω = P X n inf Q∈Ω φ W (mQ, P).
We have sketched the arguments leading to Theorem 1; see [19] for details.