Bahadur asymptotic efficiency in the zone of moderate deviation probabilities


Abstract

We establish an analogue of the lower bound for Bahadur asymptotic efficiency in the zone of moderate deviation probabilities. The assumptions coincide with the assumptions under which the Hajek-Le Cam locally asymptotically minimax lower bound holds. The lower bound for local Bahadur asymptotic efficiency is a special case of this lower bound.

Institute of Problems of Mechanical Engineering RAS, Bolshoy pr., 61, VO, 199178 St. Petersburg and
St. Petersburg State University, Universitetsky pr., 28, Petrodvoretz, 198504 St. Petersburg, RUSSIA

AMS subject classification: 62F03, 62G10, 62G20
Key words: Bahadur asymptotic efficiency, large deviations, moderate deviations

1 Introduction↩︎

Let \(X_1,\ldots,X_n\) be independent identically distributed random variables having probability measure \(\mathbf{P}_{\boldsymbol{\theta}}\), \(\boldsymbol{\theta}\in \boldsymbol{\Theta}\), defined on probability space \((S,\mathcal{B})\). The set \(\boldsymbol{\Theta}\) is an open subset of \(\mathbb{R}^d\). The value of parameter \(\boldsymbol{\theta}\) is unknown. We are interested in the lower bounds of asymptotic efficiency for estimators of parameter \(\boldsymbol{\theta}\).

There are two approaches for the study of lower bounds for asymptotic efficiency. One of them is a locally asymptotically minimax lower bound. In this setting we get the lower bound of the supremum of risks of statistical estimators for any small neighborhood of the true value of parameter. Such a lower bound of asymptotic efficiency does not provide precise information about the behavior of the risk of statistical estimator for a specific value of the parameter. The Hajek-Le Cam [1][4] locally asymptotically minimax lower bound specifies a lower bound on the asymptotic efficiency for estimators \(\hat{\theta}_n= \hat{\theta}_n(X_1,\ldots,X_n)\) that deviate from the true value of the parameter \(\theta\) by an order of \(n^{-1/2}\). Locally asymptotically minimax lower bounds for the risks in the zone of large deviation probabilities have been established by Pukhalskii and Spokoiny [5].

The lower bound for the Bahadur asymptotic efficiency [3], [6][8] provides the lower bounds for the risks of statistical estimators at each specific point of possible parameter values. In this case, only consistency of estimates is assumed. However this lower bound works only for probabilities of large deviations of statistical estimators. In confidence estimation the significance level is small. This causes the interest to the study of large and moderate deviation probabilities of estimators.

In the zone of moderate deviation probabilities, one can prove lower bounds for asymptotic efficiency both in the locally asymptotically minimax setting and in the Bahadur setting. Lower bounds for locally asymptotically minimax risks of statistical estimators have been established in [9][11]. For logarithmic asymptotics, locally asymptotically minimax lower bounds for the moderate deviation probabilities were obtained under the same assumptions [9], [11] as the lower bound for the local asymptotic efficiency of Hajek-Le Cam [1][4]. For the strong asymptotics of moderate deviation probabilities of statistical estimators, the lower bound of the local asymptotically minimax risks has been proved under not very strong additional assumptions [9], [10].

The goal of present paper is to obtain an analogue of the Bahadur lower bound for asymptotic efficiency of estimators in the zone of moderate deviation probabilities assuming the same conditions as in the lower bound for the Hajek-Le Cam local asymptotic efficiency. Note that the straightforward application of Bahadur method of the proof leads to significant additional conditions [3], [12] even for establishing the lower bound for the local Bahadur asymptotic efficiency. The lower bound for the local Bahadur asymptotic efficiency is a special case of the lower bound for the Bahadur asymptotic efficiency in the zone of moderate deviations. For \(\Theta \subset \mathbb{R}^1\), we also note that Bahadur lower bound holds separately on each side of the exterior of the confidence interval. A multidimensional analogue of these one-sided lower bounds was also obtained.

The paper is organized as follows. All lower bounds for parametric estimation are collected in Section 2. In Subsection 2.1 we introduce the condition under which these results are proved. This condition is the same one under which the locally asymptotically minimax Hajek-Le Cam lower bound is established. In Subsection 2.2, for the sake of completeness of presentation and better understanding of further results, a locally asymptotically minimax lower bound for moderate deviation probabilities of statistical estimates is presented. In Subsection 2.3, the analogue of the lower bound for Bahadur asymptotic efficiency of statistical estimators is provided in the zone of moderate deviation probabilities. The lower bounds for Bahadur local asymptotic efficiency are particular cases of these ones. These results are provided for the case of independent identically distributed observations. In Subsection 2.4 we extend these results to the inhomogeneous case. In Subsection 2.5 we show that the same results hold for the problem of parameter estimation of signal in Gaussian white noise. In Subsection 2.6 we give a generalization of Bahadur lower bounds to the multivariate case, covering “one-sided” lower bounds, and show that its proof is no different from the proof of traditional Bahadur lower bounds on the asymptotic efficiency [3], [8]. In Section 3 we extend these results to the case of estimation of differentiable statistical functional value. In Section 4 we provide the proof that the local Bahadur efficiency is a particular case of the efficiency for moderate deviation probabilities.

We use letters \(c\) and \(C\) as a generic notation for positive constants. For the case of multidimensional parameter \(\boldsymbol{\Theta}\subset \mathbb{R}^d\), \(d > 1\), we shall denote by bold letters \(\boldsymbol{\theta}, \boldsymbol{\tau}, \boldsymbol{\phi}, \ldots\) vectors or vector functions. For \(\Theta \subset \mathbb{R}^1\), for similar notation we shall implement letters \(\theta, \tau, \phi, \ldots\). For any vector \(\boldsymbol{\tau}\in \mathbb{R}^d\) we denote by \(\boldsymbol{\tau}^T\) the transposed vector. We denote \(\mathbf{1}(A)\) the indicator of an event \(A\). For any two sequences of positive real numbers \(a_n\) and \(b_n\), \(a_n = o(b_n)\) implies \(a_n/b_n \to 0\) as \(n \to \infty\).

2 Lower bounds for parametric estimation↩︎

2.1 Main Assumption↩︎

Suppose probability measures \(\mathbf{P}_{\boldsymbol{\theta}}\), \(\boldsymbol{\theta}\in \boldsymbol{\Theta}\), are absolutely continuous with respect to probability measure \(\mu\), defined on the same \(\sigma\)-algebra \(\mathcal{B}\) of set \(S\), and have the densities \[f(x,\boldsymbol{\theta}) = \frac{d \mathbf{P}_{\boldsymbol{\theta}}}{d\mu} (x), \quad x \in S.\] For any \(\boldsymbol{\theta},\boldsymbol{\theta}_0\in \boldsymbol{\Theta}\), denote \(\mathbf{P}^a_{\boldsymbol{\theta}, \boldsymbol{\theta}_0}\) and \(\mathbf{P}^s_{\boldsymbol{\theta}, \boldsymbol{\theta}_0}\) absolutely continuous and singular components of probability measure \(\mathbf{P}_{\boldsymbol{\theta}}\) with respect to probability measure \(\mathbf{P}_{\boldsymbol{\theta}_0}\). For all \(\boldsymbol{\theta}_0,\boldsymbol{\theta}_0 + \boldsymbol{\tau}\in \boldsymbol{\Theta}\) define the function \[g(x,\boldsymbol{\tau})= g(x,\boldsymbol{\theta}_0,\boldsymbol{\theta}_0 +\boldsymbol{\tau})= \left(\frac{f(x,\boldsymbol{\theta}_0+\boldsymbol{\tau})}{f(x,\boldsymbol{\theta}_0)}\right)^{1/2} -1\] for all \(x\) belonging to the support of measure \(\mathbf{P}^a_{\boldsymbol{\theta}_0+\boldsymbol{\tau}, \boldsymbol{\theta}_0}\) and equals to zero otherwise.

We say that statistical experiment \(\mathcal{E}= \{(S,\mathcal{B}), \mathbf{P}_{\boldsymbol{\theta}}, \boldsymbol{\theta}\in \boldsymbol{\Theta}\}\) has the finite Fisher information at the point \(\boldsymbol{\theta}_0 \in \boldsymbol{\Theta}\), if there exists vector function \(\boldsymbol{\phi}\, :\, S \to \mathbb{R}^d\) such that we have \[\label{s21} \int_S(g(x,\boldsymbol{\tau}) - \boldsymbol{\tau}^T\,\boldsymbol{\phi}(x))^2\,d\mathbf{P}_{\boldsymbol{\theta}_0} = o(|\boldsymbol{\tau}|^2), \quad \mathbf{P}^s_{\boldsymbol{\theta}_0,\boldsymbol{\theta}_0 + \boldsymbol{\tau}}(S) = o(|\boldsymbol{\tau}|^2)\tag{1}\] as \(\boldsymbol{\tau}\to 0\) and the matrix \[I(\boldsymbol{\theta}_0) = 4 \int_S \boldsymbol{\phi}\,\boldsymbol{\phi}^T \, d\mathbf{P}_{\boldsymbol{\theta}_0}\] is positive definite. Matrix \(I(\boldsymbol{\theta}_0)\) is called Fisher information matrix. We explore moderate deviation probabilities for the zone of moderate deviations defined by a sequence \(u_n > 0\), \(u_n \to 0\), \(n u_n^2 \to \infty\) as \(n \to \infty\). We establish lower bounds for Bahadur efficiency for some fixed point \(\boldsymbol{\theta}_0 \in \boldsymbol{\Theta}\). We shall omit index \(\boldsymbol{\theta}_0\) in symbols of \(\mathbf{E}_{\boldsymbol{\theta}_0}\) and \(\mathbf{P}_{\boldsymbol{\theta}_0}\).

2.2 Locally asymptotically minimax lower bound↩︎

Locally asymptotically minimax lower bound for risks in the zone of moderate deviation probabilities does not require any conditions of consistency.

Theorem 1. Let \(d=1\) and let the statistical experiment \(\mathcal{E}= \{(S,\mathcal{B}), \mathbf{P}_\theta, \theta \in \Theta\}\) have the finite Fisher information at the point \(\theta_0 \in \Theta\). Then, for any estimator \(\hat{\theta}_n\), for the points \(\theta_0,\theta_n=\theta_0 +2u_n \in \Theta\), we have \[\label{s2201} \liminf_{n\to \infty}\sup_{\theta=\theta_0,\theta_n}(nu_n^2I(\theta)/2)^{-1} \log \mathbf{P}_\theta (\,|\hat{\theta}_n - \theta| > u_n) \ge - 1.\qquad{(1)}\]

The proof is based on the following lower bound for efficiency in hypothesis testing. Let us consider the problem of hypothesis testing \(H_0: \theta = \theta_0\) versus alternative \(H_n: \theta = \theta_0+v_n\), \(v_n = 2 u_n\). For any test \(K_n\), denote \(\alpha(K_n)\) and \(\beta(K_n)\) respectively type I and type II error probabilities of test \(K_n\). By Theorem 2.2 in [9], for any test \(K_n\), if \(\alpha(K_n) < c < 1\) and \(\beta(K_n) < c < 1\), then we have \[\label{s270} \limsup_{n\to \infty}(nv_n^2I(\theta_0))^{-1/2}(|2 \log \alpha(K_n)|^{1/2} + |2 \log \beta(K_n)|^{1/2}) \le 1.\tag{2}\]

Proof of Theorem 1. Proof of 2 is based on the fact that 2 is valid for testing a similar hypothesis for the normal distribution by virtue of the Neyman-Pearson Lemma and the extension of a certain version of the statement about local asymptotic normality to the zone of moderate deviations. The lower bound 2 has been proved simultaneously with the author in [13] with rather severe assumptions.

Define the test \(K_n = K_n(X_1,\ldots,X_n) = \mathbf{1}(\hat{\theta}_n -\theta_0 > u_n)\). We have \[\label{s271} \alpha(K_n) \le \mathbf{P}_{\theta_0}(|\theta_n - \theta_0| > u_n)\tag{3}\] and \[\label{s272} \beta(K_n) = \mathbf{P}_{\theta_n}(\hat{\theta}_n - \theta_0 < u_n) = \mathbf{P}_{\theta_n}(\hat{\theta}_n - \theta_0 - 2 u_n< - u_n)\le \mathbf{P}_{\theta_n}(|\hat{\theta}_n - \theta_n|> u_n).\tag{4}\] By 24 , we get ?? . ◻

2.3 Bahadur efficiency for moderate deviations. Independent identically distributed random observations↩︎

We say that estimator \(\hat{\boldsymbol{\theta}}_n=\hat{\boldsymbol{\theta}}_n(X_1,\ldots,X_n)\) of parameter \(\boldsymbol{\theta}\in \boldsymbol{\Theta}\) is \(u_n\)-consistent, if, for any \(\boldsymbol{\theta}_0\in \boldsymbol{\Theta}\), there is a vicinity \(U\) of \(\boldsymbol{\theta}_0\), such that, for any \(\delta > 0\), we have \[\lim_{n\to \infty} \sup_{\theta \in U} \mathbf{P}_\theta(\,|\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}| > \delta u_n) = 0.\] Let us present an analogue of lower bound for Bahadur efficiency in the zone of moderate deviation probabilities for \(d=1\).

Theorem 2. Let statistical experiment \(\mathcal{E}= \{(S,\mathcal{B}), \mathbf{P}_\theta, \theta \in \Theta\}\) have the finite Fisher information at the point \(\theta_0 \in \Theta\subset \mathbb{R}^1\). Let estimator \(\hat{\theta}_n\) be \(u_n\)-consistent. Then, for any point \(\theta_0 \in \Theta\), we have \[\label{s23} \liminf_{n\to \infty}(nu_n^2I(\theta)/2)^{-1} \log \mathbf{P} (\,|\hat{\theta}_n - \theta_0| > u_n) \ge - 1.\qquad{(2)}\] Moreover, we have \[\label{s24} \liminf_{n\to \infty}(nu_n^2I(\theta)/2)^{-1} \log \mathbf{P} (\,\hat{\theta}_n - \theta_0 > u_n) \ge - 1.\qquad{(3)}\]

The multidimensional version of Theorem 2 is provided below. In the following Theorems 3 and 4 the asymptotic efficiency varies in different directions. This is the main distinguishing feature of theorems.

Theorem 3. Let the statistical experiment \(\mathcal{E}= \{(S,\mathcal{B}), \mathbf{P}_{\boldsymbol{\theta}}, \boldsymbol{\theta}\in \boldsymbol{\Theta}\}\) have the finite Fisher information at the point \(\boldsymbol{\theta}_0 \in \boldsymbol{\Theta}\subset \mathbb{R}^d\). Let estimator \(\hat{\boldsymbol{\theta}}_n\) be \(u_n\)-consistent. Then, for any point \(\boldsymbol{\theta}_0 \in \boldsymbol{\Theta}\), for any open set \(\boldsymbol{V}\subset \mathbb{R}^d\), we have \[\label{s25} \liminf_{n\to \infty}(nu_n^2)^{-1} \log \mathbf{P} (\,\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}_0 \in u_n \boldsymbol{V}) \ge - \frac{1}{2}\inf_{\boldsymbol{\tau}\in \boldsymbol{V}} \boldsymbol{\tau}^T I(\boldsymbol{\theta}_0)\boldsymbol{\tau}\qquad{(4)}\]

Note that the requirement 1 of differentiability of the function \(g\) in \(\mathbb{L}_2\) can be replaced by the weaker conditions (2.5)-(2.7) in [9] on the behavior of the function \(g\) itself.

The following lower bound for local asymptotic Bahadur efficiency is deduced from Theorem 3. Estimator \(\hat{\boldsymbol{\theta}}_n\) is called consistent, if for any \(\boldsymbol{\theta}_0\in\Theta\), for any \(\varepsilon > 0\), there is \[\lim_{n\to \infty} \mathbf{P} (\,|\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}_0| > \varepsilon) = 0.\]

Theorem 4. Let the statistical experiment \(\mathcal{E}= \{(S,\mathcal{B}), \mathbf{P}_{\boldsymbol{\theta}}, \boldsymbol{\theta}\in \boldsymbol{\Theta}\}\) have the finite Fisher information at the point \(\boldsymbol{\theta}_0 \in \boldsymbol{\Theta}\subset \mathbb{R}^d\). Let estimator \(\hat{\boldsymbol{\theta}}_n\) be consistent. Then, for any bounded open set \(\boldsymbol{V}\subset \mathbb{R}^d\), we have \[\label{d27} \liminf_{u\to 0}\lim_{n\to \infty}(nu^2)^{-1} \log \mathbf{P} (\,\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}_0 \in u \boldsymbol{V}) \ge - \frac{1}{2}\inf_{\boldsymbol{\tau}\in \boldsymbol{V}} \boldsymbol{\tau}^T I(\boldsymbol{\theta}_0)\boldsymbol{\tau}.\qquad{(5)}\]

Proving a lower bound for Bahadur’s local asymptotic efficiency by Bahadur’s method requires introducing additional regularity conditions for the family of probability measures \(\mathbf{P}_{\boldsymbol{\theta}}\), \(\boldsymbol{\theta}\in \boldsymbol{\Theta}\) (see Theorem 9.3, Chapter 1 in [3], as well as the remark on Bahadur’s lower bound (1.6) in [1] and the paper [12] devoted to this issue).

Proof of Theorem 2. We consider problem of hypothesis testing \(H_0: \theta = \theta_0\) versus alternatives \(H_n: \theta = \theta_0+v_n\), \(v_n = r u_n\), \(r >1\). Define the tests \(K_n = K_n(X_1,\ldots,X_n) = \mathbf{1}(|\hat{\theta} -\theta_0| > u_n)\). Since the estimator \(\hat{\theta}_n\) is \(u_n\)-consistent, we can implement 2 and we get \[\label{s28} \begin{align} & \limsup_{n\to \infty}(nv_n^2I(\theta))^{-1/2}(|2 \log \mathbf{P}_{\theta_0}(|\hat{\theta}_n -\theta_0| >u_n) |^{1/2} \\ & + |2 \log \mathbf{P}_{\theta_0+v_n}(|\hat{\theta}_n -\theta_0| <u_n) |^{1/2}) \le 1. \end{align}\tag{5}\] By 5 , we get \[\label{s29} \liminf\sup_{n\to \infty}(nr^2u_n^2I(\theta))^{-1/2}(|2 \log \mathbf{P}_{\theta_0}(|\hat{\theta}_n -\theta_0| >u_n )|^{1/2} \le 1.\tag{6}\] Since the choice of \(r>1\) is arbitrary, we get ?? . Inequality ?? is proved similarly. It suffices to implement 2 to the test \(K_n = \mathbf{1}(\hat{\theta}_n -\theta_0 > u_n)\). Since the estimator \(\hat{\theta}_n\) is \(u_n\)-consistent, then there is \(n_0\), such that, for \(n> n_0\), \[\alpha(K_n) \le \mathbf{P}(|\hat{\theta}_n - \theta_0| > u_n) < c< 1.\] and \[\label{x28} \begin{align} \beta(K_n) &= \mathbf{P}_{\theta_0+v_n}(\hat{\theta}_n -\theta_0 < u_n)\\ &= \mathbf{P}_{\theta_0+v_n}(\hat{\theta}_n -\theta_0- v_n < u_n-v_n)\\ &\le \mathbf{P}_{\theta_0+v_n}(|\hat{\theta}_n -\theta_0- v_n| > (r-1) u_n) < c <1. \end{align}\tag{7}\] Therefore, arguing similarly to 5 and 6 , we get ?? . ◻

Proof of Theorem 3. Proof in the case of \(\boldsymbol{\theta}\in\boldsymbol{\Theta}\subset\mathbb{R}^d\) is akin to \(\theta\in\Theta\subset\mathbb{R}^1\) and also is reduced to the problem of estimating a parameter at two points. Denote \(cl(\boldsymbol{V})\) the closure of set \(\boldsymbol{V}\). The reasoning will be given if \(0 \notin cl(\boldsymbol{V})\). Let \(\boldsymbol{\tau}_0 \in cl(\boldsymbol{V})\) and let \[\label{s25u} e \doteq \boldsymbol{\tau}_0^T I(\boldsymbol{\theta}_0) \boldsymbol{\tau}_0 = \inf_{\boldsymbol{\tau}\in \boldsymbol{V}} \boldsymbol{\tau}^T I(\boldsymbol{\theta})\boldsymbol{\tau}.\tag{8}\] For clarity the further reasoning will be provided with unite matrix \(I(\boldsymbol{\theta}_0)\) and \(e=1\). Then, for any \(\delta > 0\), there is such \(\boldsymbol{\tau}_1 \in \boldsymbol{V}\) that \(|\boldsymbol{\tau}_1 - \boldsymbol{\tau}_0| < \delta\). There are \(\lambda > 0\) such that \(B(\boldsymbol{\tau}_1, \lambda) \subset \boldsymbol{V}\) where \(B(\boldsymbol{\tau}_1, \lambda)\) is the ball having the center \(\boldsymbol{\tau}_1\) and radius \(\lambda\). There is \(r_0 >1\) such that, for \(1 < r < r_0\), \(B(r\boldsymbol{\tau}_1,(r-1)/2) \subset B(\boldsymbol{\tau}_1, \lambda)\). Consider problem of testing hypothesis \(H_0: \boldsymbol{\theta}= \boldsymbol{\theta}_0\) versus alternative \(H_n: \boldsymbol{\theta}= \boldsymbol{\theta}_n = \boldsymbol{\theta}_0 + \boldsymbol{v}_n\), where \(\boldsymbol{v}_n = r u_n \boldsymbol{\tau}_1\). Define the test \(K_n = \mathbf{1}\{\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}_0 \in u_n \boldsymbol{V}\}\). Then we have \[\alpha(K_n) \le \mathbf{P} (|\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}_0| > u_n) < c < 1\] and \[\begin{align} \beta(K_n) &= \mathbf{P}_{\theta_n}(\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}_0 \notin u_n \boldsymbol{V}) \le \mathbf{P}_{\theta_n}(\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}_n \notin u_n \boldsymbol{V}- \boldsymbol{v}_n) \\ &\le \mathbf{P}_{\theta_n}(\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}_n \notin u_n\,B(r\boldsymbol{\tau}_1,(r-1)/2)) < c < 1, \end{align}\] since the set \(u_n \boldsymbol{V}- \boldsymbol{v}_n\) contains the ball \(B(0,\lambda u_n)\). Therefore we can implement 2 . Further reasoning essentially coincides with the reasoning for proving Theorem 3 and is omitted. ◻

Proof of Theorem 4. We carry out the reasoning for \(\theta_0 \in \Theta \subset \mathbb{R}^1\). Let’s take the points \(\theta_0\) and \(\theta_u=\theta_0 + r\,u \in \Theta\), \(r >1\), \(u >0\). Using the consistency of the estimate \(\hat{\theta}_n\), we obtain \[\lim_{u \to 0}\lim_{n\to \infty} \mathbf{P} (\,\hat{\theta}_n - \theta_0 > u ) = 0\] and \[\lim_{u \to 0}\lim_{n\to \infty} \mathbf{P}_{\theta_u} (\,\hat{\theta}_n - \theta_u < (r-1) u) = 0.\] Therefore, for any sequence \(u_k > 0\), \(u_k \to 0\) as \(k \to \infty\), there exists a sequence \(n_{0k}\), \(n_{0k} u_k^2 \to \infty\) as \(k \to \infty\), such that for any sequence \(n_k > n_{0k}\), we have \[\lim_{k\to \infty} \mathbf{P} (\,\hat{\theta}_{n_k} - \theta_0 > u_k) = 0\] and \[\lim_{k\to \infty} \mathbf{P}_{\theta_{u_k}} (\,\hat{\theta}_{n_k} - \theta_{u_k} < (r-1) u_k) = 0,\] and these are precisely the key inequalities used in the proof of Theorem 4 (see the proof of Theorems 2, 3, and 11). We omit further reasoning. ◻

2.4 Bahadur efficiency in moderate deviation zone. Independent inhomogeneous random observations↩︎

Let \(X_{n1},\ldots,X_{nn}\) be independent random variables defined on probability space \((\mathcal{X},S, \mathbf{P}_{\boldsymbol{\theta}ni})\), \(1 \le i \le n\), \(\boldsymbol{\theta}\in \boldsymbol{\Theta}\). The set \(\boldsymbol{\Theta}\) is open set in \(\mathbb{R}^d\). Suppose probability measures \(\mathbf{P}_{\theta ni}\), \(1 \le i \le n\), are absolutely continuous with respect to some measure \(\mu\) and have densities \[f_{ni}(x,\boldsymbol{\theta})= \frac{d\,\mathbf{P}_{\boldsymbol{\theta}ni}}{d\mu}.\] For any \(\boldsymbol{\theta}, \boldsymbol{\theta}+ \boldsymbol{\tau}\in \boldsymbol{\Theta}\) define functions \(g_{ni}(x,\boldsymbol{\theta},\boldsymbol{\theta}+\boldsymbol{\tau}) =f_{ni}^{1/2}(x,\boldsymbol{\theta}+ \boldsymbol{\tau})f_{ni}^{-1/2}(x,\boldsymbol{\theta}) - 1\) for all \(x\) belonging the support \(\mathbf{P}^a_{\boldsymbol{\theta}+ \boldsymbol{\tau}, \boldsymbol{\theta},ni}\) and equal to zero otherwise. We say that statistical experiments \(\Xi_{ni}= \{(S,\mathcal{B}), \mathbf{P}_{\boldsymbol{\theta}ni}, \boldsymbol{\theta}\in \boldsymbol{\Theta}\}\), \(1 \le i \le n\), have finite Fisher information at a point \(\boldsymbol{\theta}_0 \in \boldsymbol{\Theta}\), if there are functions \(\boldsymbol{\phi}_{ni}\, :\, S \to \mathbb{R}^d\) such that we have \[\label{a9} \int_{S} (g_{ni}(x,\boldsymbol{\theta},\boldsymbol{\theta}+\boldsymbol{\tau}) - \boldsymbol{\tau}^T \boldsymbol{\phi}_{ni}(x,\boldsymbol{\theta}))^2\, d\mathbf{P}_{\boldsymbol{\theta}ni} = o(|\boldsymbol{\tau}|^2), \quad \mathbf{P}^s_{\boldsymbol{\theta}+ \boldsymbol{\tau}, \boldsymbol{\theta},ni}(S) = o(|\boldsymbol{\tau}|^2)\tag{9}\] as \(\boldsymbol{\tau}\to 0\) and Fisher information matrix \[I_{ni}(\theta) = 4 \int_{S} \boldsymbol{\phi}_{ni}(x,\theta) \boldsymbol{\phi}_{ni}^T(x,\boldsymbol{\theta})\, d\mathbf{P}_{\boldsymbol{\theta}ni}\] is positively defined. Denote \[\Upsilon_n(\theta)= \sum_{i=1}^n I_{ni}(\boldsymbol{\theta}).\] Let \(\theta_0 \in \Theta \subset \mathbb{R}^1\). We consider the problem of testing hypothesis \(H_0: \theta = \theta_0\) versus alternatives \(H_n : \theta = \theta_0 + u_n\).

Theorem 5. Let statistical experiments \(\Xi_{ni}\), \(1 \le i \le n\), have finite Fisher information. Let \(u_n \to 0\) and \(u_n^2 \,\Upsilon_n(\theta_0) \to \infty\) as \(n \to \infty\). Assume \[\label{a10} \sup_{|u| \le u_n}\sum_{i=1}^n \mathbf{E}\,[ (\phi_{ni}(x,\theta_0+u) - \phi_{ni}(x,\theta_0))^2\,] = o(\Upsilon_n(\theta_0))\qquad{(6)}\] as \(n \to \infty\). Assume that, for all \(\varepsilon > 0\), condition of Lindeberg type is satisfied \[\lim_{n\to\infty} \Upsilon_n(\boldsymbol{\theta}_0)^{-1} \sum_{i=1}^n \mathbf{E}\,\Bigl[ \phi_{ni}^2(x,\theta_0) \mathbf{1}\Bigl(|\phi_{ni}(x,\theta_0)| > \varepsilon u_n^{-1}\Bigr)\Bigr] = 0.\] Then, for any test \(K_n\) such that \(\alpha(K_n) < c < 1\) and \(\beta(K_n) < c < 1\), we have \[\label{a12} \limsup_{n\to \infty}(u_n^2\Upsilon_n(\theta_0))^{-1/2}(|2 \log \alpha(K_n)|^{1/2} + |2 \log \beta(K_n)|^{1/2}) \le 1.\qquad{(7)}\]

The lower bounds for local Bahadur, local Hodges-Lehman and local Chernoff asymptotic efficiencies [9] follow from the following Corollary 1 of Theorem 5. Let \(\theta_0 \in \Theta \subset \mathbb{R}^1\). We consider the problem of testing hypothesis \(H_0: \theta = \theta_0\) versus alternatives \(H_n : \theta = \theta_0 + u\).

Corollary 1. Let statistical experiments \(\Xi_{ni}\), \(1 \le i \le n\), have finite Fisher information. Let \(\Upsilon_n(\theta_0) \to \infty\) as \(n \to \infty\). Assume \[\label{cau10} \lim_{u \to 0}\,\limsup_{n\to\infty}\,\Upsilon_n^{-1}(\theta_0)\,\sup_{|v| \le u}\,\sum_{i=1}^n \mathbf{E}\,[ (\phi_{ni}(x,\theta_0+v) - \phi_{ni}(x,\theta_0))^2\,] = 0.\qquad{(8)}\] Assume that, for all \(\varepsilon > 0\), condition of Lindeberg type is satisfied \[\lim_{u \to 0}\,\limsup_{n\to\infty}\, \Upsilon_n(\boldsymbol{\theta}_0)^{-1}\, \sum_{i=1}^n\, \mathbf{E}\,\Bigl[ \phi_{ni}^2(x,\theta_0) \mathbf{1}\Bigl(|\phi_{ni}(x,\theta_0)| > \varepsilon u^{-1}\Bigr)\Bigr] = 0.\] Then, for any test \(K_n\) such that \(\alpha(K_n) < c < 1\) and \(\beta(K_n) < c < 1\), we have \[\label{cau12} \limsup_{u\to 0}\limsup_{n\to \infty}\,(u^2\Upsilon_n(\theta_0))^{-1/2}\,(|2 \log \alpha(K_n)|^{1/2} + |2 \log \beta(K_n)|^{1/2}) \le 1.\qquad{(9)}\]

Introduce the following assumption.

D. There are such constants \(c, C\) and natural number \(n_0\), that, for each \(\boldsymbol{\theta}\in \boldsymbol{\Theta}\subset \mathbb{R}^d\) and \(n > n_0\), we have \[0 < c < \frac{\boldsymbol{e}_1^T \Upsilon_n(\boldsymbol{\theta}) \boldsymbol{e}_1}{\boldsymbol{e}_2^T \Upsilon_n(\boldsymbol{\theta}) \boldsymbol{e}_2} < C\] for all unit vectors \(\boldsymbol{e}_1, \boldsymbol{e}_2 \in \mathbb{R}^d\).

Theorem 6. Let \(\boldsymbol{\Theta}\subset \mathbb{R}^d\) and let D hold. Let statistical experiments \(\Xi_{ni}\), \(1 \le i \le n\), have finite Fisher information. Let \(\boldsymbol{e}\) be unit vector in \(\mathbb{R}^d\). Let \(u_n > 0\), \(u_n \to 0\), \(u_n^2\, \boldsymbol{e}^T \Upsilon_n(\boldsymbol{\theta}_0) \boldsymbol{e}\to \infty\) as \(n \to \infty\). Assume, there is \(c>2\) such that we have \[\label{q21u} \sup_{|u| < c\,u_n}\sum_{i=1}^n \mathbf{E}\,[ (\boldsymbol{\phi}_{ni}^T(X_{ni},\boldsymbol{\theta}_0+u) \boldsymbol{e}- \boldsymbol{\phi}_{ni}^T(X_{ni},\boldsymbol{\theta}_0) \boldsymbol{e})^2\, ] = o( \boldsymbol{e}^T\Upsilon_n(\theta_0) \boldsymbol{e})\qquad{(10)}\] as \(n \to \infty\). Assume, for all \(\varepsilon > 0\), Lindeberg type condition holds \[\label{qq21u} \begin{align} \lim_{n\to\infty} & (\boldsymbol{e}^T\Upsilon_n(\theta_0) \boldsymbol{e})^{-1} \sum_{i=1}^n \mathbf{E}\,\Bigl[ (\boldsymbol{\phi}_{ni}^T(X_{ni},\boldsymbol{\theta}_0) \boldsymbol{e})^2\\ & \times \mathbf{1}\Bigl(|\boldsymbol{\phi}_{ni}^T(X_{ni},\boldsymbol{\theta}_0) \boldsymbol{e}| > \varepsilon u_n^{-1}\Bigr)\Bigr] = 0. \end{align}\qquad{(11)}\] Then for any estimator \(\hat{\boldsymbol{\theta}}_n\), for points \(\boldsymbol{\theta}_0,\boldsymbol{\theta}_n = \theta_0 +2 u_n\boldsymbol{e}\in \Theta\), we have \[\label{bu1} \liminf_{n\to \infty}\sup_{\boldsymbol{\theta}=\boldsymbol{\theta}_0,\boldsymbol{\theta}_n}(u_n^2\boldsymbol{e}^T\Upsilon_n(\theta_0) \boldsymbol{e}/2)^{-1} \log \mathbf{P}_{\boldsymbol{\theta}} (\,|\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}| > u_n) \ge - 1.\qquad{(12)}\] Assume additionally that \(\hat{\boldsymbol{\theta}}\) is \(u_n\)-consistent and ?? , ?? hold for all unit vectors \(\boldsymbol{e}\in \mathbb{R}^d\). Then, for any open set \(\boldsymbol{V}\subset \mathbb{R}^d\), we have \[\label{qq25} \liminf_{n\to \infty}(u_n^2\,\boldsymbol{\tau}_n^T\Upsilon_n(\boldsymbol{\theta}) \boldsymbol{\tau}_n/2)^{-1} \log \mathbf{P}_{\boldsymbol{\theta}} (\,\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}\in u_n \boldsymbol{V}) \ge - 1,\qquad{(13)}\] where vector \(\boldsymbol{\tau}_n \in cl(\boldsymbol{V})\) satisfies the equation \[\boldsymbol{\tau}_n^T \Upsilon_n(\boldsymbol{\theta})\boldsymbol{\tau}_n = \inf_{\boldsymbol{\tau}\in \boldsymbol{V}} \boldsymbol{\tau}^T \Upsilon_n(\boldsymbol{\theta})\boldsymbol{\tau}.\]

Remark 1. Note that ?? and ?? can be replaced respectively with \[\sup_{|u| < c u_n} \,\sum_{i=1}^n\, \mathbf{E}\,( g_{ni}(X_{ni},u) - u \phi_{ni}(X_{ni},\theta_0))^2 = o(|u_n|^2\, \Upsilon_n(\theta_0))\] and \[\sup_{|u| < c u_n} \,\sum_{i=1}^n\, \mathbf{E}\,( g_{ni}(X_{ni},\boldsymbol{\theta}_0,\boldsymbol{\theta}_0+u \boldsymbol{e}) - u \,\boldsymbol{e}^T \boldsymbol{\phi}_{ni}(X_{ni},\boldsymbol{\theta}_0))^2 = o(|u_n|^2\, \boldsymbol{e}^T\Upsilon_n(\boldsymbol{\theta}_0)\,\boldsymbol{e})\] as \(n \to \infty\).

From Theorem 6 we get the following Corollary for local Bahadur asymptotic efficiency.

Corollary 2. Let \(\boldsymbol{\Theta}\subset \mathbb{R}^d\) and let D hold. Let statistical experiments \(\Xi_{ni}\), \(1 \le i \le n\), have finite Fisher information. Let \(\boldsymbol{e}\) be unit vector in \(\mathbb{R}^d\). Let \(u_n > 0\), \(u_n \to 0\), \(u_n^2\, \boldsymbol{e}^T \Upsilon_n(\boldsymbol{\theta}_0) \boldsymbol{e}\to \infty\) as \(n \to \infty\). Assume, there is \(c>2\) such that we have \[\label{cq21u} \limsup_{u\to 0}\limsup_{n\to\infty}\sup_{|v| < c\,u}( \boldsymbol{e}^T\Upsilon_n(\theta_0) \boldsymbol{e})^{-1}\sum_{i=1}^n \mathbf{E}\,[ (\boldsymbol{\phi}_{ni}^T(X_{ni},\boldsymbol{\theta}_0+v) \boldsymbol{e}- \boldsymbol{\phi}_{ni}^T(X_{ni},\boldsymbol{\theta}_0) \boldsymbol{e})^2\, ] = 0\qquad{(14)}\] as \(n \to \infty\). Assume, for all \(\varepsilon > 0\), Lindeberg type condition holds \[\label{cqq21u} \begin{align} \limsup_{u\to 0}\limsup_{n\to\infty} & (\boldsymbol{e}^T\Upsilon_n(\theta_0) \boldsymbol{e})^{-1} \sum_{i=1}^n \mathbf{E}\,\Bigl[ (\boldsymbol{\phi}_{ni}^T(X_{ni},\boldsymbol{\theta}_0) \boldsymbol{e})^2\\ & \times \mathbf{1}\Bigl(|\boldsymbol{\phi}_{ni}^T(X_{ni},\boldsymbol{\theta}_0) \boldsymbol{e}| > \varepsilon u^{-1}\Bigr)\Bigr] = 0. \end{align}\qquad{(15)}\] Then for any estimator \(\hat{\boldsymbol{\theta}}_n\), for points \(\boldsymbol{\theta}_0,\boldsymbol{\theta}_u = \theta_0 +2 u\boldsymbol{e}\in \Theta\), we have \[\label{cbu1} \liminf_{u\to 0}\liminf_{n\to \infty}\sup_{\boldsymbol{\theta}=\boldsymbol{\theta}_0,\boldsymbol{\theta}_u}(u^2\boldsymbol{e}^T\Upsilon_n(\theta_0) \boldsymbol{e}/2)^{-1} \log \mathbf{P}_{\boldsymbol{\theta}} (\,|\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}| > u) \ge - 1.\qquad{(16)}\] Assume additionally that \(\hat{\boldsymbol{\theta}}\) is consistent and ?? , ?? hold for all unit vectors \(\boldsymbol{e}\in \mathbb{R}^d\). Then, for any open set \(\boldsymbol{V}\subset \mathbb{R}^d\), we have \[\label{qq25b} \liminf_{u\to 0}\liminf_{n\to \infty}(u^2\,\boldsymbol{\tau}_n^T\Upsilon_n(\boldsymbol{\theta}) \boldsymbol{\tau}_n/2)^{-1} \log \mathbf{P}_{\boldsymbol{\theta}} (\,\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}\in u \boldsymbol{V}) \ge - 1,\qquad{(17)}\] where vector \(\boldsymbol{\tau}_n \in cl(\boldsymbol{V})\) satisfies the equation \[\boldsymbol{\tau}_n^T \Upsilon_n(\boldsymbol{\theta})\boldsymbol{\tau}_n = \inf_{\boldsymbol{\tau}\in \boldsymbol{V}} \boldsymbol{\tau}^T \Upsilon_n(\boldsymbol{\theta})\boldsymbol{\tau}.\]

Proof of Theorem 6 is based on Theorem 5 and is akin to the proofs of Theorems 13. We omit the reasoning.

Proof of Theorem 5. Reasoning basically repeats the proof of similar statements of Theorems 2.1 in [14] and Theorems 2.2 in [15]. For \(1 \le i \le n\) and \(\varepsilon > 0\), define the events \[\label{qq26} A_{ni} = A_{ni}(\varepsilon) = \{X_i: |u_n\phi_{ni}(X_{ni})| > \varepsilon\}, \quad D_{ni} = D_{ni}(\varepsilon) = \{X_i: |g_{ni}(X_{ni})| > \varepsilon\}.\tag{10}\] Applying Chebyshev inequality and ?? , we get \[\label{qq27} \sum_{i=1}^n \mathbf{P}(A_{ni}) \le \varepsilon^2 u^2 \sum_{i=1}^n \int_S \phi_{ni}^2(x,\theta_0) \mathbf{1}\Bigl(|\phi_{ni}(x,\theta_0) | > \varepsilon u_n^{-1}\Bigr)\,d\mu = o(u_n^2 \Upsilon_n).\tag{11}\] Applying 11 , we get \[\label{qq28} \begin{align} \sum_{i=1}^n \mathbf{P}(D_{ni}) &\le \sum_{i=1}^n \mathbf{P}(A_{ni}(\varepsilon/2)) \\ &+ \sum_{i=1}^n \mathbf{P}(|g_{ni}(X_{ni},u_n) - u_n\phi_{ni}(X_{ni})| > \varepsilon/2)= o(u_n^2 \Upsilon_n(\theta_0)), \end{align}\tag{12}\] since, by virtue of Chebyshev inequality and the last estimate of the proof of Lemma 3.1, Ch.1 in [3], we have \[\label{qq29} \begin{align} \sum_{i=1}^n & \mathbf{P}(|g_{ni}(X_{ni},u_n) - u_n\phi_{ni}(X_{ni})| > \varepsilon/2)\\ &\le 4\varepsilon^{-2}\sum_{i=1}^n \mathbf{E}(g_{ni}(X_{ni},u_n) - u_n^T\boldsymbol{\phi}_{ni}(X_{ni}))^2 = o(u_n^2 \Upsilon_n(\theta_0)). \end{align}\tag{13}\] For any event \(A\), let \(\bar A\) denote its complement. Define event \(U_n = (\cap_{i=1}^n \bar A_{ni}) \cap (\cap_{i=1}^n \bar D_{ni})\). We have \[\label{qq30} \begin{align} \mathbf{P}(U_n) &= \prod_{i=1}^n (1 - \mathbf{P}(A_{ni}))\prod_{i=1}^n (1 - \mathbf{P}(D_{ni}))\\ &\ge \exp\Bigl\{-\sum_{i=1}^n (\mathbf{P}(A_{ni}) + \mathbf{P}(D_{ni}))\Bigr\} = \exp\{-o(nu_n^2)\}. \end{align}\tag{14}\] For any events \(A\) and \(B\) denote \(\mathbf{P}(A|B)\) the conditional probability of event \(A\) given event \(B\). Denote \[\log L_n = \sum_{i=1}^n \log \Bigl(\frac{f_{ni}(X_{ni},\theta_0 +u_n)}{f_{ni}(X_{ni},\theta_0)}\Bigr).\] Theorem 5 follows from 14 and Lemma 1 given below.

Lemma 1. Let assumptions of Theorem 5 be satisfied. Then for any sequence \(\delta_n\), \(0< \delta_n <1\), \(\delta_n u_n \Upsilon_n^{1/2}(\theta_0) \to \infty\) as \(n \to \infty\) and any sequence \(C_n\) such that \(-(1-\delta_n) u_n \Upsilon_n^{1/2}(\theta_0)/2 < C_n\), we have \[\label{g12} \log\mathbf{P} (u_n^{-1} \Upsilon_n^{-1/2}(\theta_0)\log L_n > C_n \,|\, U_n) = - \frac{( C_n+ u_n\Upsilon_n^{1/2}(\theta_0)/2)^2}{2}(1 + o(1))\qquad{(18)}\] For any sequence \(\delta_n\), \(0< \delta_n <1\), \(\delta_n u_n \Upsilon_n^{1/2}(\theta_0) \to \infty\) as \(n \to \infty\) and any sequence \(C_n\) such that \(C_n < (1-\delta_n)u_n \Upsilon_n^{1/2}(\theta_0)/2\), we have \[\label{g13} \log\mathbf{P}_{\theta_0 +u_n} (u_n^{-1} \Upsilon_n^{-1/2}(\theta_0)\log L_n < C_n\,|\,U_n) = - \frac{( u_n \Upsilon_n^{1/2}(\theta_0)/2- C_n)^2}{2}(1 + o(1))\qquad{(19)}\] as \(n \to \infty\).

If event \(U_n\) occurs, the proof of ?? and ?? is practically identical to the proof of Theorem 2.2 in [15]. We omit the reasoning. ◻

2.5 Lower bound for estimating parameter of signal in Gaussian white noise↩︎

In moderate deviation zone the problems of efficiency of statistical inference on the parameter of signal in Gaussian white noise have been explored in [16]. We obtained the lower bounds on the asymptotic efficiency similar to ?? for estimation and similar to 2 for hypothesis testing. Thus, in [16] the lower bound for the asymptotically minimax setting of the signal parameter estimation has been established. At the same time, the analog of the lower bound 2 for the hypothesis testing allows us to implement the technique of the proof of Theorems 24 and to establish the lower bound of Bahadur’s efficiency for signal estimation in the zone of moderate deviation probabilities.

Let we observe a realization of a random process \(Y_\varepsilon(t)\), \(t\in [0,1)\), \(\varepsilon > 0\), defined by a stochastic differential equation \[d Y_\varepsilon(t) = S(t,\boldsymbol{\theta}) \,dt + \varepsilon\, dw(t).\] Here \(S(t,\boldsymbol{\theta}) \in \mathbb{L}_2(0,1)\) is a signal with unknown value of parameter \(\boldsymbol{\theta}\in \boldsymbol{\Theta}\subset \mathbb{R}^d\) and \(dw(t)\), \(t \in [0,1)\) is Gaussian white noise. The set \(\boldsymbol{\Theta}\) is open. Suppose that, for any \(\boldsymbol{\theta}_0 \in \boldsymbol{\Theta}\), the signal \(S(t,\boldsymbol{\theta})\) has the derivative in \(\mathbb{L}_2(0,1)\) on \(\boldsymbol{\theta}\) at the point \(\boldsymbol{\theta}_0\), that is, there is such a vector function \(\boldsymbol{S}_{\boldsymbol{\theta}}(t,\boldsymbol{\theta}_0) : [0,1) \to \mathbb{R}^d\), that we have \[\label{e231} \int_0^1 (S(t,\boldsymbol{\theta}) - S(t,\boldsymbol{\theta}_0) - \boldsymbol{S}_\theta^T(t,\boldsymbol{\theta}_0)(\boldsymbol{\theta}- \boldsymbol{\theta}_0))^2 dt = o(|\boldsymbol{\theta}- \boldsymbol{\theta}_0|^2)\tag{15}\] as \(\boldsymbol{\theta}\to \boldsymbol{\theta}_0\). Fisher information matrix equals \[I(\boldsymbol{\theta}_0) = \int_0^1 \boldsymbol{S}(t,\boldsymbol{\theta}_0) \boldsymbol{S}^T(t,\boldsymbol{\theta}_0) \,dt\] We say that a statistical experiment has finite Fisher information if Fisher information is positive definite and 15 holds.

For signal parameter estimation all proofs of lower bounds on Bahadur asymptotic efficiency in the moderate deviation probability zone are based on the following analog of inequality 2 for hypothesis testing established in [16]. We present it in the one-dimensional case. Suppose we have a family \(u_\varepsilon > 0\), \(\varepsilon > 0\), such that \(u_\varepsilon \to 0\), \(\varepsilon^{-1}\,u_\varepsilon \to \infty\) as \(\varepsilon \to 0\). Let us consider the problem of testing hypothesis \(H_0: \theta = \theta_0\) versus simple alternative \(H_\varepsilon: \theta = \theta_0+u_\varepsilon\). For any test \(K_\varepsilon\), \(\varepsilon > 0\), denote \(\alpha(K_\varepsilon)\) and \(\beta(K_\varepsilon)\) respectively their type I and type II error probabilities. For any family of tests \(K_\varepsilon\), \(\varepsilon > 0\), by Theorem 2.1 in [16], we have \[\label{su270} \limsup_{\varepsilon \to 0}\, \varepsilon u_\varepsilon^{-1}I^{-1/2}(\theta_0)(|2 \log \alpha(K_\varepsilon)|^{1/2} + |2 \log \beta(K_\varepsilon)|^{1/2}) \le 1,\tag{16}\] if \(\alpha(K_\varepsilon) < c < 1\) and \(\beta(K_\varepsilon) < c < 1\). Inequalities 2 and 16 coincide if we set \(\varepsilon = n^{-1/2}\). This allows us to formulate Theorems 24 almost identically. Let us demonstrate this on the base of Theorem 3.

We say that estimator \(\hat{\boldsymbol{\theta}}_\varepsilon\) is \(u_\varepsilon\)-consistent, if for any \(\boldsymbol{\theta}_0\in \boldsymbol{\Theta}\) there is a vicinity \(U\) of \(\boldsymbol{\theta}_0\), such that, for any \(\delta > 0\), we have \[\lim_{\varepsilon \to 0} \sup_{\boldsymbol{\theta}\in U} \mathbf{P}_{\boldsymbol{\theta}}(\,|\hat{\boldsymbol{\theta}}_\varepsilon- \boldsymbol{\theta}| > \delta u_\varepsilon) = 0.\]

Theorem 7. Let statistical experiment have finite Fisher information for all \(\boldsymbol{\theta}\in \Theta\subset\mathbb{R}^d\). Let estimator \(\hat{\boldsymbol{\theta}}_\varepsilon\) be \(u_\varepsilon\)-consistent. Then, for any open set \(\boldsymbol{V}\subset \mathbb{R}^d\), we have \[\label{sv25} \liminf_{\varepsilon \to 0}\,\varepsilon^2 u_\varepsilon^{-2} \,\log \mathbf{P}_{\boldsymbol{\theta}} (\,\hat{\boldsymbol{\theta}}_\varepsilon - \boldsymbol{\theta}\in u_\varepsilon \boldsymbol{V}) \ge - \frac{1}{2}\inf_{\boldsymbol{\tau}\in \boldsymbol{V}} \boldsymbol{\tau}^T I(\boldsymbol{\theta})\boldsymbol{\tau}.\qquad{(20)}\]

Corollary 3. Let statistical experiment have finite Fisher information for all \(\boldsymbol{\theta}\in \Theta\subset\mathbb{R}^d\). Let estimator \(\hat{\boldsymbol{\theta}}_\varepsilon\) be consistent. Then, for any open set \(\boldsymbol{V}\subset \mathbb{R}^d\), we have \[\label{csv25} \liminf_{u\to 0}\liminf_{\varepsilon \to 0}\,\varepsilon^2 u^{-2} \,\log \mathbf{P}_{\boldsymbol{\theta}} (\,\hat{\boldsymbol{\theta}}_\varepsilon - \boldsymbol{\theta}\in u \boldsymbol{V}) \ge - \frac{1}{2}\inf_{\boldsymbol{\tau}\in \boldsymbol{V}} \boldsymbol{\tau}^T I(\boldsymbol{\theta})\boldsymbol{\tau}.\qquad{(21)}\]

2.6 Multidimensional lower bound of Bahadur asymptotic efficiency↩︎

Below we provide the lower bound for Bahadur asymptotic efficiency, which is different in different directions. Estimator \(\hat{\boldsymbol{\theta}}_n\) is called the consistent estimator of parameter \(\boldsymbol{\theta}\in \boldsymbol{\Theta}\subset\mathbb{R}^d\), if for any \(\boldsymbol{\theta}\in \boldsymbol{\Theta}\), for any \(\varepsilon > 0\), we have \[\lim_{n\to \infty} \mathbf{P}_{\boldsymbol{\theta}} (\,|\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}| > \varepsilon) =0.\]

Theorem 8. Let \(\hat{\boldsymbol{\theta}}_n\) be a consistent estimator of parameter \(\boldsymbol{\theta}\in \boldsymbol{\Theta}\). Let \(\boldsymbol{\theta}_0 \in \boldsymbol{\Theta}\). Let \(\Omega \subset \mathbb{R}^d\) be open set such that \(0 \notin \Omega\) and \(\boldsymbol{\theta}_0 + \Omega \subset \boldsymbol{\Theta}\). Then, for any \(\tilde{\boldsymbol{\theta}}\in \boldsymbol{\theta}_0 + \Omega\), we have \[\label{b1} \lim_{n\to \infty}\frac{1}{n} \log \mathbf{P}_{\boldsymbol{\theta}_0} (\,\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}_0 \in \Omega) \ge - \int_S \log\frac{f(x,\tilde{\boldsymbol{\theta}})}{f(x,\boldsymbol{\theta}_0)} \, f(x,\tilde{\boldsymbol{\theta}}) \, \mu(dx).\qquad{(22)}\]

Proof. Proof is akin to [3], [8]. Denote \(- K\) the righthand side of ?? . By Jensen inequality, the righthand side of ?? is not positive. We define the indicator function \(\lambda_n= \lambda_n(\hat{\boldsymbol{\theta}}_n -\boldsymbol{\theta}_0) = 1\), if \(\hat{\boldsymbol{\theta}}_n -\boldsymbol{\theta}_0\in \Omega\) and \(\lambda_n= \lambda_n(\hat{\boldsymbol{\theta}}_n -\boldsymbol{\theta}_0) = 0\), if \(\hat{\boldsymbol{\theta}}_n -\boldsymbol{\theta}_0 \notin \Omega\). We put \(r = n(K + \delta)\) with \(\delta >0\). Denote \[G_n= G_n(X_1,\ldots,X_n,\boldsymbol{\theta}_0,\tilde{\boldsymbol{\theta}}) = \prod_{j=1}^n \frac{f(X_j,\tilde{\boldsymbol{\theta}})}{f(X_j,\boldsymbol{\theta}_0)}.\] We have \[\label{b2} \begin{align} \mathbf{P}_{\boldsymbol{\theta}_0}(\hat{\boldsymbol{\theta}}_n -\boldsymbol{\theta}_0\in \Omega) &= \mathbf{E}_{\boldsymbol{\theta}_0} \lambda_n\\ &\ge \mathbf{E}_{\boldsymbol{\theta}_0}(\lambda_n\mathbf{1}(G_n < \exp\{r\})) \ge \exp\{-r\} \mathbf{E}_{\tilde{\boldsymbol{\theta}}}\Bigl\{\lambda_n \mathbf{1}(G_n < \exp\{r\})\Bigr\}\\ &\ge \exp\{-r\} (\mathbf{P}_{\tilde{\boldsymbol{\theta}}}(\hat{\boldsymbol{\theta}}_n -\boldsymbol{\theta}_0\in \Omega) - \mathbf{P}_{\tilde{\boldsymbol{\theta}}}(G_n > \exp\{r\})). \end{align}\tag{17}\] Since \(\hat{\boldsymbol{\theta}}_n\) is consistent estimator, we have \[\label{b3} \lim_{n \to \infty}\,\mathbf{P}_{\tilde{\boldsymbol{\theta}}}(\hat{\boldsymbol{\theta}}_n -\boldsymbol{\theta}_0\in \Omega) =1.\tag{18}\] By the Law of Large Numbers, we have \[\label{b4} \lim_{n \to \infty}\mathbf{P}_{\tilde{\boldsymbol{\theta}}}\Bigl(\frac{1}{n}|G_n - n K| > \delta/2\Bigr) = 0.\tag{19}\] By 1719 , we get ?? . ◻

Theorems 26 and 8 show that the super efficiency of estimators [2][4] in the zones of large and moderate deviation probabilities is possible only if the estimator is in some sense inconsistent. Thus we can say that the emergence of super effective estimators satisfying consistency conditions is inherent only to the \(n^{-1/2}\)–deviation zone.

3 Lower bound for moderate deviation probabilities of differentiable statistical functionals↩︎

We implement the standard reasoning [4], [17][20] for the transition from the lower bounds for asymptotic efficiency in parametric setting to the semiparametric setting. The transition is based on the choice of the least favourable direction in the functional space of parameters and the definition of parametric families of distributions having score function coinciding with this direction. The lower bound of asymptotic efficiency of estimation for this parametric family of distributions coincides with the lower bound for asymptotic efficiency in semiparametric estimation.

Here we consider a rather simple model of semiparametric estimation. Since we prove the lower bound of asymptotic efficiency for moderate deviations almost for the same setting as the setting in Hajek-Le Cam lower bound [1][4] of asymptotic efficiency, then the unique problem is the definition of \(u_n\)-consistency. It is clear that this condition should be satisfied uniformly for the parameters of the least favourable family of distributions. Let \((S,\mathcal{B})\) be a measurable space, let \(\Lambda\) be the set of all probability measures on \((S,\mathcal{B})\). Let \(X_{1},\ldots,X_{n}\) be i.i.d.r.v.’s with probability measure \(\mathbf{P} \in \Lambda\). Suppose a priori information is given that \(\mathbf{P} \in \Gamma \subseteq \Lambda\). Let the functional \(T: \Lambda\to \mathbb{R}^{1}\) be defined. We want to estimate the value of the functional \(T(\mathbf{P})\) when it is known that \(\mathbf{P} \in \Gamma\). We implement the standard terminology (see [4], [17], [19]). For fixed \(\mathbf{P} \in \Gamma\) denote \(\Pi (\Gamma ,\mathbf{P})\) the set of all maps \(\lambda :u\to \mathbf{P}_{u}\) from interval \((0,\delta )\) in \(\Gamma\) satisfying 1 for some function \(\phi(x)= \phi_\lambda(x)\), \(\phi\in \mathbb{L}_{2}(\mathbf{P})\). Let \(\Delta (\Gamma ,P)\) be the set of all functions \(\phi_\lambda\), \(\lambda \in \Pi (\Gamma ,\mathbf{P})\), satisfying 1 and let \(cl(\Delta(\Gamma ,\mathbf{P}))\) be the closure in \(\mathbb{L}_{2}(\mathbf{P})\) of the set \(\Delta (\Gamma ,\mathbf{P})\). Define the linear space \(\mathbb{L}(\Gamma ,\mathbf{P})\) as the closure in \(\mathbb{L}_{2}(\mathbf{P})\) of the linear space induced by the functions \(\varphi \in \Delta (\Gamma ,\mathbf{P})\). The linear space \(\mathbb{L}(\Gamma ,\mathbf{P})\) can be interpreted as a tangent space of \(\Gamma\) at a point \(\mathbf{P}\) for the Hellinger metric. We say that the function \(\psi _{P}\in \mathbb{L}(\Gamma ,\mathbf{P})\), \(\mathbf{E}_{\mathbf{P}} \psi_\mathbf{P}(X_1) = 0\), is the influence function of the functional \(T\) in \(\Gamma\) at a point \(\mathbf{P} \in \Gamma\), if, for all \(\lambda \in \Pi (\Gamma ,\mathbf{P})\), there holds \[T(\mathbf{P}_{u}) - T(\mathbf{P}) = u \mathbf{E} [\psi_{\mathbf{P}}(X_1) \phi_\lambda(X_1)] + o(u), \quad u\downarrow 0,\] and \(\mathbf{E}[\psi_{\mathbf{P}}(X_1)\, \phi(X_1)] =0\) for any function \(\phi \in \mathbb{L}_2(\mathbf{P})\) orthogonal to all functions \(\phi_\lambda \in \Delta(\Gamma ,\mathbf{P})\). Make the following assumption.

E. For all \(\mathbf{P} \in \Gamma\) there exists influence function \(\psi_{\mathbf{P}}\) of functional \(T\) in \(\Gamma\) and \(\psi_{\mathbf{P}}\in cl(\Delta(\Gamma ,\mathbf{P}))\).

Denote \(I(\Gamma,\mathbf{P}) = (\mathbf{E}_{\mathbf{P}} \psi_{\mathbf{P}}^2(X_1))^{-1}\). We say that estimator \(\hat{\theta}_n=\hat{\theta}_n(X_1,\ldots,X_n)\) of a value of functional \(T(\mathbf{P})\) is \(u_n\)-consistent, if, for any \(\mathbf{P}_0\in \Gamma\), for any \(\delta > 0\), we have \[\label{ququ10} \lim_{n\to \infty} \sup_{\mathbf{P} \in U_\varepsilon} \mathbf{P}(\,|\hat{\theta}_n - T(\mathbf{P})| > \delta u_n) = 0,\tag{20}\] for any vicinity \(U=U(T,\mathbf{P}_0) = \{\mathbf{P}: |T(\mathbf{P}) - T(\mathbf{P}_0)| < Cu_n, \mathbf{P} \in \Gamma\}\), \(C> 3\delta\), of the point \(\mathbf{P}_0\in \Gamma\). If \(\psi_{\mathbf{P}_0}\in\Delta (\Gamma ,\mathbf{P}_0)\), then we can replace \(U\) in 20 with image \(\lambda_{\psi_{\mathbf{P}_0}} ((0,Cu_n))\).

Theorem 9. Assume E. Let \(u_{n}\to 0\), \(nu^{2}_{n}\to\infty\) as \(n\to\infty\). Then, for any \(u_n\)-consistent sequence of estimators \(\hat{\theta}_{n}\), we have \[\liminf_{n\to\infty } (nu^{2}_{n}\,I(\Gamma,\mathbf{P})/2)^{-1}\log \mathbf{P}(|\hat{\theta}_{n}- T(\mathbf{P})|> u_{n}) \ge -1.\] Moreover, we have \[\liminf_{n\to\infty } (nu^{2}_{n}\,I(\Gamma,\mathbf{P})/2)^{-1}\log \mathbf{P}(\hat{\theta}_{n}- T(\mathbf{P}) > u_{n}) \ge -1.\]

We call estimator \(\hat{\theta}_n\) consistent, if, for any \(\mathbf{P}_0\in \Gamma\), for any \(\delta > 0\), we have \[\label{ququ15} \lim_{n\to \infty} \mathbf{P}_0(\,|\hat{\theta}_n - T(\mathbf{P}_0)| > \delta) = 0.\tag{21}\]

Theorem 10. Assume E. Then, for any consistent estimator \(\hat{\theta}_n\), we have \[\liminf_{u\to 0}\lim_{n\to \infty}(n\,u^2\,I(\Gamma,\mathbf{P}_0)/2)^{-1} \log \mathbf{P}_0 (\,|\hat{\theta}_n - T(\mathbf{P}_0)| > u ) \ge - 1.\] Moreover, we have \[\liminf_{u\to 0}\lim_{n\to \infty}(n\,u^2\,I(\Gamma,\mathbf{P}_0)/2)^{-1} \log \mathbf{P}_0 (\,\hat{\theta}_n - T(\mathbf{P}_0) > u ) \ge - 1.\]

4 Asymptotic efficiency for moderate deviations and local Bahadur asymptotic efficiency↩︎

Bahadur asymptotic efficiency [6][8] is well-known measure of quality of test and estimators. Exploration of Bahadur efficiency is a rather hard technical problem [21] and, often, is replaced with the study of local Bahadur asymptotic efficiency (see [3], [9], [22] and many other papers). In [9] we pay attention that the statements on local Bahadur asymptotic efficiency follows from similar Theorems on moderate deviation probabilities. Below we present this statement in explicit form.

In [14], [23], we show that technique of Fréchet differentiability of statistical functionals can be implemented to the study of moderate deviations probabilities to the same extent as in the case of proving asymptotic normality [24]. In [25] this result has been extended to the case of Hadamard differentiability. Thus the results [14], [23], [25] are valid for the setting of local Bahadur efficiency as well.

Let we need to estimate parameter \(\boldsymbol{\theta}\in \boldsymbol{\Theta}\subset \mathbb{R}^d\). We say that estimator \(\hat{\boldsymbol{\theta}}_n = \hat{\boldsymbol{\theta}}_n(X_1,\ldots,X_n)\) satisfies Moderate Deviation Principle with rate function \(I \,:\, \mathbb{R}^d \to \mathbb{R}_+\), if there hold

  • for any \(L > 0\) the set \(\{\boldsymbol{x}: I(\boldsymbol{x}) < L\}\) is compact,

  • for any sequence \(u_n > 0\), \(u_n \to 0\), \(nu_n^2 \to \infty\), for any open set \(\boldsymbol{G}\subset \mathbb{R}^d\), we have \[\liminf_{n \to \infty} (nu_n^2/2)^{-1}\log \mathbf{P}_{\boldsymbol{\theta}*}(\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}\in u_n \boldsymbol{G}) \ge -\inf_{\boldsymbol{x}\in \boldsymbol{G}} I(\boldsymbol{x}),\]

  • for any sequence \(u_n > 0\), \(u_n \to 0\), \(nu_n^2 \to \infty\), for any closed set \(\boldsymbol{F}\subset \mathbb{R}^d\), we have \[\limsup_{n \to \infty} (nu_n^2/2)^{-1}\log \mathbf{P}_{\boldsymbol{\theta}}^*(\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}\in u_n \boldsymbol{F}) \le -\inf_{\boldsymbol{x}\in \boldsymbol{F}} I(\boldsymbol{x}).\]

Here \(\mathbf{P}_{\boldsymbol{\theta}*}(A)\) and \(\mathbf{P}_{\boldsymbol{\theta}}^*(A)\) denote outer and inner probabilities of a set \(A \subset \mathbb{R}^d\).

We say that estimator \(\hat{\boldsymbol{\theta}}_n = \hat{\boldsymbol{\theta}}_n(X_1,\ldots,X_n)\) satisfies local Bahadur Large Deviation Principle with rate function \(I \,:\, \mathbb{R}^d \to \mathbb{R}_+\), if there hold

  • for any \(L > 0\) the set \(\{\boldsymbol{x}: I(\boldsymbol{x}) < L\}\) is compact,

  • for any open set \(\boldsymbol{G}\subset \mathbb{R}^d\), we have \[\lim_{u\to 0}\liminf_{n \to \infty} (nu^2/2)^{-1}\log \mathbf{P}_{\boldsymbol{\theta}*}(\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}\in u \boldsymbol{G}) \ge -\inf_{\boldsymbol{x}\in \boldsymbol{G}} I(\boldsymbol{x}),\]

  • for any closed set \(\boldsymbol{F}\subset \mathbb{R}^d\), we have \[\lim_{u\to 0}\limsup_{n \to \infty} (nu^2/2)^{-1}\log \mathbf{P}_{\boldsymbol{\theta}}^*(\hat{\boldsymbol{\theta}}_n - \boldsymbol{\theta}\in u \boldsymbol{F}) \le -\inf_{\boldsymbol{x}\in \boldsymbol{F}} I(\boldsymbol{x}).\]

Theorem 11. Let estimator \(\hat{\theta}_n\) satisfy Moderate Deviation Principle with rate function \(I\). Then \(\hat{\theta}_n\) satisfies local Bahadur Large Deviation Principle with the rate function \(I\) as well.

Proof of Theorem 11. Let we take arbitrary sequence \(v_k \to 0\) as \(k \to \infty\). For proof of local Bahadur Large Deviation Principle, it suffices to show that, for any subsequence \(n_k \to \infty\) and \(n_k v_k^2 \to \infty\) as \(k \to \infty\), there hold \[\liminf_{k \to \infty} (n_k v_k^2/2)^{-1}\log \mathbf{P}_{\boldsymbol{\theta}*}(\hat{\boldsymbol{\theta}}_{n_k} - \boldsymbol{\theta}\in v_k G) \ge -\inf_{\boldsymbol{x}\in \boldsymbol{G}} I(\boldsymbol{x})\] and \[\limsup_{k \to \infty} (n_k v_k^2/2)^{-1}\log \mathbf{P}_{\boldsymbol{\theta}}^*(\hat{\boldsymbol{\theta}}_{n_k} - \boldsymbol{\theta}\in v_k F) \le -\inf_{\boldsymbol{x}\in \boldsymbol{F}} I(\boldsymbol{x}).\] However this is Moderate Deviation Principle, if we put \(u_{n_k}= v_k\). ◻

References↩︎

[1]
J.Hajek, Local asymptotic minimax and admissibility in estimation. Proc.Sixth Berkeley Symp. on Math. Statist. and Probab. 1, Berkeley, California Univ. Press. (1972), 175–194.
[2]
L. Le Cam, Asymptotic Methods in Statistical Decision Theory. Berlin: Springer. 1986.
[3]
I.A.Ibragimov, R.Z. Hasminskii, Statistical Estimation: Asymptotic Theory. Berlin: Springer. 1981.
[4]
A.W. Van der Vaart, Asymptotic Statistics. Cambridge, UK: Cambridge Univ. Press. 1998.
[5]
A. Puhalskii, V. Spokoiny, On large-deviation efficiency in statistical inference. Bernoulli. 4, (1998), 203–272.
[6]
R.R. Bahadur, Asymptotic efficiency of tests and estimates. Sankhya. 22(1960) 229–252.
[7]
R.R. Bahadur, Rates of convergence of estimates and test statistics. Ann.Math.Stat. 38, (1967), 303–324.
[8]
R.R. Bahadur, J.C. Gupta and S.L. Zabel. Large deviations of tests and estimates. Asymptotic Theory of Statistical Tests and Estimation. (ed. I.M. Chakravari) Academic NY (1980), 33–64.
[9]
M.S. Ermakov, Asymptotically efficient statistical inference for moderate deviation probabilities. Theory Probab. Appl. 48(4), (2003), 676–700.
[10]
M.S. Ermakov, The sharp lower bounds of asymptotic efficiency of estimators in the zone of moderate deviation probabilities. Electronic Journal of Statistics. 6, (2012), 2150–2184.
[11]
M. Radavichius, From asymptotic efficiency in minimax sense to Bahadur efficiency. New Trends in Probab. and Statist. V. Sazonov and T. Shervashidze (Eds) Vilnius, VSP/Mokslas 1, (1991), 629–635.
[12]
J.C. Fu On a theorem of Bahadur on rate of convergence of point estimators. Ann.Stat. 4, (1973), 745–749.
[13]
A. A. Borovkov, A. A. Mogulskii. Large deviations and testing statistical hypothesis. Siber. Adv. Math. 1992 2 1992; 3 1993.
[14]
M. S. Ermakov, Importance sampling for simulation of moderate deviations of statistics. Statistics and Decision. 25, (2007), 265–284.
[15]
M. S. Ermakov, Local asymptotic normality of logarithm of likelihood ratio in the zone of moderate deviation probabilities. Zapiski Nauchn.Semin.POMI. 525, (2023), 71–85.
[16]
M. S. Ermakov, On asymptotically efficient statistical inference on a signal parameter. J. Math. Sci. (N. Y.), 206:2(2015), 159–171.
[17]
P. Bickel, C. Klaassen, Y. Ritov, J. A. Wellner, Efficient and adaptive estimation for the semiparametric models. John Hopkins University Press, Baltimore 1993.
[18]
M.S. Ermakov, On semiparametric statistical inferences in the moderate deviation zone. J. Math. Sci. 152, (2008), 869–874.
[19]
Yu. A. Koshevnik, B. Ya. Levit, On nonparametric version of information matrix. Theory Probab.Appl. 21, (1976), 738–753.
[20]
Ch. Stein, Efficient nonparametric testing and estimation. Third Berkeley Symp. Math. Statist. and Probab. Berkeley, Univ. California Press. 1, (1956), 187–195.
[21]
Ya. Yu. Nikitin, Asymptotic efficiency of nonparametric tests. Cambridge, UK: Cambridge Univ. Press. 1995.
[22]
A. Dario, Ya. Yu. Nikitin, Local efficiency of integrated goodness of fit tests under skew alternatives. Stat.Prob.Let. 117, (2016), 136–143.
[23]
M.S. Ermakov, On lower bounds of moderate large deviations of tests and estimators. J. Math. Sci., 88(1), (1998), 36–42.
[24]
R. J. Serfling, Approximation Theorems of Mathematical Statistics. Wiley, New York. 1980.
[25]
F.Gao, X.Zhao Delta Method in Large and Moderate Deviations for Estimators. Ann.Stat. 39, (2011), 1211–1240.