Bias-corrected empirical likelihood-based inference for the tail index under heavy-tailed models


Abstract

The tail index parameter of heavy-tailed probability models plays a key role in characterizing the tail decay of the underlying distribution function and is often involved in extrapolation procedures for various extreme value analysis questions. In this paper we revisit the question of tail index estimation and combine the ideas of bias-correction and empirical likelihood estimation to propose an estimator that offers an attractive alternative to some of the existing estimators. We develop an asymptotic theory for the proposed estimator and conduct simulation studies to demonstrate its performance in finite sample situations. The method is also applied to a data example for illustration.

1 Introduction↩︎

Heavy-tailed distributions are frequently used to model data from a variety of fields including finance, insurance and data networks; [1]. The tail behaviour of such probability models is characterized by the tail index, a parameter that captures the rate of tail decay of the underlying distribution function. Estimates of the tail index are often of interest in themselves signifying how heavy-tailed a model for a given dataset is. However, an estimate of the tail index is also often required for estimation of risk functionals such as high quantiles [2], marginal expected shortfall [3], extreme conditional excess probabilities [4], extreme conditional quantiles [5], stress scenarios [6]. In this paper, we revisit the question of inference for the tail index in the setting of independent and identically distributed (i.i.d.) observations under the semi-parametric assumption of regular variation on the tail of the underlying distribution function.

Let \(X_1,\ldots,X_n\) be i.i.d. random variables with a distribution function \(F\) satisfying the regular variation condition: \(1-F(x) = x^{-1/\gamma}L_F(x)\) for \(x>0\) and some \(\gamma>0\), where \(L_F(x)\) is a slowly varying function, i.e., for \(x>0\), \(L_F(tx)/L_F(t)\to1\) as \(t\to\infty\). We write \(1-F\in{\rm RV}_{-1/\gamma}\). Here \(\gamma\) is the unknown tail index to be estimated. Equivalently, the quantile function admits the following representation: \[\label{reg46var} F^{-1}\left(1-\frac{1}{x}\right) = x^{\gamma}L(x),\qquad x>0,\tag{1}\] where \(L(\cdot)\) is again slowly varying.

Denote the order statistics based on \(n\) observations by \(X_{n,1} \leq \ldots \leq X_{n,n}\). Let \(k = k_n\) be an intermediate sequence such that \(k/n\to 0\), \(k\to\infty\) as \(n\to\infty\). A classic estimator of \(\gamma\) is the Hill estimator [7] given by \[\label{qhill} \widehat\gamma_{H} = \frac{1}{k}\sum_{i=1}^{k} \log X_{n,n-k+i} - \log X_{n,n-k}.\tag{2}\] Under regularity conditions, \(\widehat\gamma_H\) is consistent and asymptotically normal: \(\sqrt{k}(\widehat\gamma_H - \gamma) \buildrel\rm d\over\rightarrow{\cal N}(0,\gamma^2)\) for \(n\to\infty\). This leads to an approximate \(100(1-\alpha)\%\) confidence interval of the form: \[\label{ci46hill} \mathcal{I}_{H}(\alpha) = [\widehat{\gamma}_H - z_{1-\alpha/2}\frac{\widehat{\gamma}_H}{\sqrt{k}},\widehat{\gamma}_H + z_{1-\alpha/2}\frac{\widehat{\gamma}_H}{\sqrt{k}}],\tag{3}\] where \(z_{1-\alpha/2}\) is the \((1-\alpha/2)\)-quantile of the standard normal distribution. The performance of the Hill estimator and confidence interval in 3 is often sensitive to the choice of sample fraction \(k\). While various methods exist to guide selection of \(k\) (see, e.g., [8][10]), their effectiveness depends on the properties of the underlying distribution. The behaviour of the slowly varying function \(L(\cdot)\) in 1 can lead to substantial bias of \(\widehat\gamma_H\), which also affects coverage properties of \(\mathcal{I}_{H}\), especially when sample size \(n\) is not sufficiently large.

Empirical likelihood (EL), as an alternative method for inference, has low model-misspecification risk and allows construction of confidence regions that are data-driven and range-respecting. [11] propose the following procedure for deriving an EL-based confidence interval for tail index \(\gamma\). Let \(Y_j = j(\log X_{n,n-j+1} - \log X_{n,n-j})\) for \(j = 1,\ldots,k\). Then the Hill estimator can alternatively be written as \[\widehat{\gamma}_H = \frac{1}{k} \sum_{j=1}^{k} Y_j.\] It follows from [2] that, for \(n\) large, \(Y_j\)’s (\(j=1,\ldots,k\)) are approximately i.i.d. exponential random variables with mean \(\gamma\). Now regard \(\widehat\gamma_H\) as the mean of i.i.d. random variables \(Y_1,\ldots,Y_k\) without any parametric model assumptions. The empirical log-likelihood ratio function of \(\gamma\) is given by \[W_n(\gamma) = \sup_{p_1,\ldots,p_k}\left\{\sum_{j=1}^{k} \log(kp_j): \sum_{j=1}^{k} p_j = 1,\, \sum_{j=1}^{k}p_j (Y_j-\gamma) = 0,\, p_1,\ldots,p_k > 0 \right\}.\] Under certain general conditions, [11] show that \[-2W_n(\gamma) \buildrel\rm d\over\rightarrow\chi^2_1,\qquad n\to\infty.\] Then a \(100(1-\alpha)\%\) asymptotic EL-based confidence interval for \(\gamma\) can be constructed as \[\label{ci46el} \mathcal{I}_{EL}(\alpha) = \{\gamma: -2W_n(\gamma) < \chi^2_{1,1-\alpha}\},\tag{4}\] where \(\chi^2_{1,1-\alpha}\) is the \((1-\alpha)\)-quantile of the \(\chi^2_1\) distribution.

Numerical experiments in [11] indicate that confidence intervals constructed using the empirical likelihood tend to provide better coverage than the intervals based on the normal approximation in 3 . Coverage properties of \(\mathcal{I}_{EL}\) can be further improved using the adjusted empirical likelihood (AEL) as suggested by [12].

However, both the EL and AEL confidence intervals will have low coverage probabilities when the Hill estimator displays a bias in finite sample settings. This suggests exploring the possibility of combining the EL-based method for tail index estimation and confidence interval construction with bias correction.

One approach to correcting for bias in the estimation of the tail index is based on an exponential regression model as proposed by [13], in which the authors impose an additional second-order condition:

Condition (\(R_L\)): There exists a real constant \(\rho < 0\) and a rate function \(h(\cdot)\) satisfying \(h(x) \to 0\) as \(x\to \infty\), such that for all \(t \ge 1,\) as \(x\to\infty\), \[\log \frac{L(t x)}{L(x)} \sim h(x) \frac{t^{\rho}-1}{\rho}.\] Under this condition, [13] show that, for \(n\) large, the log-spacings \(Y_1,\ldots,Y_k\) are approximately independent and exponentially distributed: \[\label{approximation} Y_j \stackrel{\cdot}{\sim} Exp\Big(\Big[\gamma + b_{n,k} \Big(\frac{j}{k+1}\Big)^{-\rho}\Big]^{-1}\Big),\qquad j=1,\dots,k\tag{5}\] with \[b_{n,k} = h\Big(\frac{n+1}{k+1}\Big), \qquad 2\le k\le n-1.\] They propose to estimate tail index \(\gamma\) and nuisance parameters \(b_{n,k}\) and \(\rho\) jointly using the maximum likelihood approach.

When \(\rho\) can be estimated consistently, the asymptotic variance of the maximum likelihood estimator of \(\gamma\) from the exponential regression model is \(((1-\rho)/\rho)^2\) that of the Hill estimator [10]. So bias reduction comes at the cost of increased variance. Additionally, the maximum likelihood estimator of \(\rho\) through the joint estimation is generally inconsistent (see Remark 4 in [10]), leading to inaccurate estimation of the asymptotic variance, which will impact the coverage properties of confidence intervals for \(\gamma\).

Instead of assuming an exponential model on \(Y_j\)’s in 5 , we consider a method which only relies on the associated mean approximation: \[{\mathbb{E}}(Y_j) = \gamma + b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho},\quad j=1,\ldots,k.\] Furthermore, rather than dealing with three parameters (\(\gamma\), \(b_{n,k}\) and \(\rho\)), we propose to replace the estimator of \(\rho\) with a canonical value, motivated by a similar strategy adopted in [14]. Simulation studies show that this works reasonably well across a range of probability distributions with reduction in variance and improved coverage properties of confidence intervals compared to the bias-corrected MLE of [13].

The remainder of the paper is organized as follows. The methodology is described in Section 2. We establish an asymptotic normality result for the proposed estimator of the tail index and show that the EL ratio statistic has a simple chi-squared limiting distribution. The latter result serves as a basis for constructing the bias-corrected EL confidence intervals. In Section 3, we report results of simulation studies that assess finite sample performance of the proposed estimator and empirical coverage probabilities of the associated confidence intervals. Section 4 presents an application of the method to a real life data example. Concluding remarks are provided in Section 5. Proofs are relegated to the Appendix.

2 Methodology↩︎

In this section, we introduce a bias-corrected empirical likelihood estimator of the tail index. It is constructed using estimating functions that arise from the least squares objective function motivated by the approximation in 5 .

Based on 5 , we have the following mean approximation: \[{\mathbb{E}}(Y_j)\approx \gamma + b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho},\qquad j=1,\ldots,k.\] Since the second-order parameter \(\rho\) is difficult to estimate in general, an alternative is to replace its value by a canonical choice \(\rho_c<0\), as was suggested in [14]. This leads to the least squares objective function of the form:

\[S(\boldsymbol{\theta}) = \sum_{j=1}^{k} \Big (Y_j - \gamma - b_{n,k} \Big(\frac{j}{k+1}\Big)^{-\rho_c}\Big)^2,\qquad \boldsymbol{\theta}= (\gamma,b_{n,k}).\] The partial derivatives of \(S(\boldsymbol{\theta})\) can be used to specify the estimating functions in the definition of the empirical likelihood. Here, the partial derivatives of \(S(\boldsymbol{\theta})\) are given by \[\frac{\partial S(\boldsymbol{\theta})}{\partial\gamma } = -2\sum_{j=1}^{k} \left\{ Y_j - \gamma - b_{n,k}\Big(\frac{j}{k+1}\Big)^{-\rho_c}\right\},\quad\frac{\partial S(\boldsymbol{\theta})}{\partial b_{n,k}} = -2\sum_{j=1}^{k}\left\{Y_j - \gamma - b_{n,k}\Big(\frac{j}{k+1}\right)^{-\rho_c}\Big\}\Big(\frac{j}{k+1}\Big)^{-\rho_c}.\] Now let \[\begin{align} g_{1j}(Y_j;\boldsymbol{\theta}) &= Y_j - \gamma - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_c},\\ g_{2j}(Y_j;\boldsymbol{\theta}) &= \left (Y_j - \gamma - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_c}\right )\left(\frac{j}{k+1}\right)^{-\rho_c}, \end{align}\] and set \[{\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta}) = \begin{pmatrix} g_{1j}(Y_j;\boldsymbol{\theta})\\ g_{2j}(Y_j; \boldsymbol{\theta})\\ \end{pmatrix},\qquad j=1,\ldots,k.\] The empirical log-likelihood function of \(\boldsymbol{\theta}\) using \(g_{1j}\) and \(g_{2j}\) (\(j=1,\ldots,k\)) above as the estimating functions is equal to \[\label{optimization} \ell_{E}(\boldsymbol{\theta}) = \sup_{p_1,\ldots,p_k}\Big\{\sum_{j=1}^{k}\log p_j: p_1,\ldots,p_k\ge0,\;\sum_{j=1}^{k} p_j = 1,\; \sum_{j=1}^{k} p_j {\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta}) = \boldsymbol{0} \Big\}.\tag{6}\] We then define a bias-corrected maximum empirical likelihood estimator (MELE) of \(\boldsymbol{\theta}= (\gamma,b_{n,k})\) as the maximizer of the above empirical log-likelihood: \[\label{qMELE} \widehat\boldsymbol{\theta}_{E} = (\widehat\gamma_E,\widehat b_E) = \mathop{\mathrm{arg\,max}}_{\boldsymbol{\theta}} \ell_{E}(\boldsymbol{\theta}).\tag{7}\]

The standard empirical likelihood theory requires the estimating functions to be unbiased [15]. Replacing \(\rho\) by \(\rho_c\) in the least square objective function \(S(\boldsymbol{\theta})\) leads to biased estimating functions \(g_{1j}\) and \(g_{2j}\). Under certain conditions on \(b_{n,k},\) the bias term is sufficiently small so that the asymptotic properties of \(\widehat\boldsymbol{\theta}_E\) and the chi-squared limiting distribution of the empirical likelihood ratio statistic still hold, as will be shown later.

The unique solution to the optimization problem in 7 exists provided the convex hull of points \({\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})\) for \(j=1,\ldots,k\) contains \({\boldsymbol{0}}\) [16], and is given by \[p_j = \frac{1}{k[1+\boldsymbol{\lambda}^{\top}(\boldsymbol{\theta}){\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})]},\] where \(\boldsymbol{\lambda}(\boldsymbol{\theta})\) is the Lagrange multiplier satisfying \[\label{Lagrange} \sum_{j=1}^k \frac{1}{1+\boldsymbol{\lambda}^{\top}(\boldsymbol{\theta}){\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})} = \boldsymbol{0}.\tag{8}\] This leads to the following expression for the empirical log-likelihood function: \[\label{el46function} \ell_E(\boldsymbol{\theta}) = - k\log k - \sum_{j=1}^k \log[1+\boldsymbol{\lambda}^{\top}(\boldsymbol{\theta}){\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})].\tag{9}\] When the convex hull of points \({\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})\) does not contain \({\boldsymbol{0}}\), by convention \(\ell_E(\boldsymbol{\theta}) = -\infty.\)

In the next theorem we prove asymptotic normality of \(\widehat\boldsymbol{\theta}_E\) and in particular that of \(\widehat\gamma_E\) under an order condition on \(b_{n,k}\).

Theorem 1. Consider a random sample \(X_1,\ldots,X_n\) with distribution function \(F\) satisfying \(1-F \in RV_{-1/\gamma}\) for some \(\gamma>0\) and Condition \((R_L)\) with rate function \(h\). Let \(b_{n,k}=h\left(\dfrac{n+1}{k+1}\right)\) for \(2\le k\le n-1\) and assume that, for any \(\delta > 0\), \(k^{1/2 + \delta} b_{n,k} = O(1)\) as \(k,n\to \infty\) with \(k/n \to 0\). Then the maximum empirical likelihood estimator \(\widehat\gamma_E\) of \(\gamma\) defined in 7 satisfies: \[\sqrt{k}(\widehat{\gamma}_E - \gamma) \overset{d}{\to} \mathcal{N}\left(0,\left(\frac{1-\rho_c}{\rho_c}\right)^2\gamma^2\right),\quad n\to\infty,\quad k=k_n\to\infty,\quad k/n\to0.\qquad\]

The proof is given in Appendix 6.1.

Remark 1. Note that by replacing \(\rho\) in the objective function \(S(\boldsymbol{\theta})\) with a canonical value \(\rho_c<0\), rather than a consistent estimator of \(\rho\), we have to impose a slightly stronger condition on the rate of decay of \(b_{n,k}\): \(k^{1/2 + \delta} b_{n,k} = O(1)\) compared to \(\sqrt{k} b_{n,k} = O(1)\) in [10] (Theorem 3.2). However, there are potential gains in the asymptotic variance when \(\rho_c<\rho\).

Theorem 1 serves as a basis for establishing the limiting distribution of the EL ratio statistic, which can then be used to construct confidence intervals for the tail index parameter. Unlike the bias-corrected parametric method, the empirical likelihood does not require explicitly estimating the asymptotic variance, and one of the advantages of the empirical likelihood approach is the data-driven shape of the resulting confidence intervals (and regions).

The empirical log-likelihood ratio function for tail index \(\gamma\) is given by \[R(\gamma) := -2 \left[\max_{b} \ell_E(\gamma,b) - \max_{\boldsymbol{\theta}\in (0,\infty) \times \mathbb{R}}\ell_E(\boldsymbol{\theta})\right],\] where \(\ell_E\) is the empirical log-likelihood function in 6 . We state the main result in the following theorem giving the asymptotic behaviour of \(R(\gamma_0)\), where \(\gamma_0\) is the true value of the tail index.

Theorem 2. Under the same assumptions as in Theorem 1 with the true value of tail index parameter equal to \(\gamma_0>0\), \[R(\gamma_0) \buildrel\rm d\over\rightarrow\chi_1^2,\qquad n\to\infty.\]

See Apprendix 6.2 for the proof.

Theorem 2 can be used to construct a confidence interval for the tail index. We hence define a \(100(1-\alpha)\%\) bias-corrected empirical likelihood (BCEL) confidence interval for \(\gamma_0\) as \[\label{bel46ci} \mathcal{I}_{BCEL}(\alpha)=\{\gamma: R(\gamma) \leq \chi^2_{1,1-\alpha}\},\tag{10}\] where \(\chi^2_{1,1-\alpha}\) is the \((1-\alpha)\)th quantile of the \(\chi^2_1\) distribution.

Remark 2. In [11], the EL is defined based on \(\mathbb{E}(Y_j) = \gamma.\) The EL function of \(\gamma\) is well defined for \(\gamma\in (\min_j Y_j, \max_j Y_j),\) so the corresponding EL confidence interval is range-respecting. After introducing a second order parameter \(b_{n,k}\), when \(n\) is small, the bias-corrected EL confidence intervals in 10 may include negative values of \(\gamma\). As \(n\) becomes larger, \(b_{n,k}\) tends to 0, and the range-respecting property of the EL confidence interval (region) will generally be retained.

3 Simulation study↩︎

In this section, we conduct a simulation study to examine the finite sample performance of the proposed bias-corrected maximum empirical likelihood estimator across a range of probability distributions with different values of tail index \(\gamma\) and second order parameter \(\rho\).

We consider the following two families of probability distributions to generate random samples:

  • Student t distribution with \(\nu\) degrees of freedom for \(\nu\in\{2,3,4,5\}\). The tail index is \(\gamma=1/\nu\) and the second order parameter is \(\rho=-2/\nu\).

  • Burr distribution with shape parameters \(\lambda\) and \(\tau\) and scale \(\beta=1\), whose survival function has the form: \[1-F(x) = \left( \dfrac{1}{1+x^\tau} \right)^\lambda,\qquad x>0,\qquad \lambda,\tau>0.\] We consider \(\lambda\in\{1,4/3,2,3\}\) and set \(\tau=1/\lambda\). The tail index is \(\gamma=1/(\tau\lambda)\) and the second order parameter is \(\rho=-1/\lambda\).

The choice of the parameter values above is made with the focus on cases where \(-1\le\rho<0\) for which the Hill estimator \(\widehat\gamma_H=\widehat\gamma_H(k)\) is known to exhibit a bias over a range of \(k\) values. This makes the Hill plot \(\{(k,\widehat\gamma_H(k))\}\), a graphical tool for selecting the sample fraction \(k\), difficult to interpret due to trends. [1] refers to these situations as Hill horror plots. Figure 1 illustrates a Hill plot for a random sample of size \(n=500\) from a Student t distribution with \(\nu=5\) degrees of freedom for which \(\rho=-2/5\). Without knowing the true value of tail index \(\gamma\), it is difficult to choose a suitable range of \(k\) values where the tail index estimates are stable.

Figure 1: Hill plot for a random sample of size n=500 from a Student t distribution with degrees of freedom \nu=5. The tail index is \gamma=0.2 and second order parameter is \rho=-0.4. The dotted lines indicate approximate 95% confidence intervals; the true value of \gamma is indicated by the dashed red line.

3.1 Choice of the canonical value \(\rho_c\) in the bias-corrected MELE↩︎

We begin by first examining the impact of the choice of the canonical value \(\rho_c\) in the proposed bias-corrected MELE of tail index \(\gamma\) in 7 . For each of the probability distributions given above, we generate 1,000 random samples of size \(n= 500\). We consider three values of \(\rho_c\in\{-2,-1,-0.5\}\). Figures 2 and 3 summarize the behaviour of the empirical relative squared bias, variance and mean squared error (MSE) as a function of sample fraction \(k\) for the Student t and Burr distributions, respectively. As expected, based on the form of the asymptotic variance (see Theorem 1), the empirical variance is directly influenced to the value of \(\rho_c\) with smaller values of \(\rho_c\) leading to smaller variances. In our set-up, \(\rho_c=-2\) results in the smallest variance across the full range of considered \(k\) values. For the Student t distributions (Figure 2), in case (a) when \(\rho=-1\), the bias is small and of similar magnitude for \(\rho_c=-2\) and \(\rho_c=-1\), but increases sharply for larger values of \(k\) when \(\rho_c=-0.5\). The overall impact is that MSE is smallest when \(\rho_c=-2\), followed by \(\rho_c=-1\), driven by the ordering of variances. In case (b) with \(\rho=-2/3\), \(\rho_c=-1\) results in the smallest bias and, for \(k\) above 60, also leads to smaller MSE compared to \(\rho_c=-2\). In the remaining two cases with \(\rho=-1/2\) and \(\rho=-2/5\), we observe that while setting \(\rho_c=-0.5\) produces lowest bias for smaller values of \(k\), due to variance differences, \(\rho_c=-1\) provides the most optimal compromise in terms of MSE. It is notable that when \(\rho_c=-1\) the squared bias remains quite stable over the entire range of considered \(k\) values. For Burr distributions (Figure 3), when \(\rho\in\{-1,-3/4\}\), the bias is small for all three choices of \(\rho_c\) and ordering of MSE curves aligns with that of variances. However, for \(\rho=-1/2\) and especially \(\rho=-1/3\), we begin to see the impact of \(\rho_c\) on the bias which in turn affects the performance of the estimator from the MSE perspective. For the smallest value of \(\rho=-1/3\), setting \(\rho_c=-1\) offers the best gains in MSE.

In Figures 4 and 5, we display the empirical coverage rates of 95% confidence intervals based on 10 across different values of \(k\). The accuracy appears to be directly linked to the behaviour of bias. In particular, for the Student t distributions (Figure 4), setting \(\rho_c=-1\) leads to either comparable or better coverage rates relative to the other two choices of \(\rho_c\). We also see that when \(\rho_c=-1\) the coverage accuracy improves for larger values of \(k\). In the case of Burr distributions (Figure 5), coverage rates behave similarly across \(\rho\in\{-1,-3/4,-1/2\}\) cases with \(\rho_c=-2\) leading to slightly more accurate results for smaller values of \(k\). In the right most panel for \(\rho=-1/3\) only \(\rho_c=-0.5\) setting maintains coverage rates close to the nominal level of 95%.

While there appears to be no one single optimal choice of \(\rho_c\) across all simulation settings, the above results do support the choice of \(\rho_c=-1\) suggested by [14] as the one that provides a good balance between bias and variance. Furthermore, the relative performance tends to improve for moderate values of \(k\). In terms of coverage precision, this choice works well for \(\rho\le -0.5\) settings, although the performance may deteriorate as \(\rho\) gets closer to zero as seen in the Burr examples. In practice, one can consider several \(\rho_c\) values to assess which choice leads to a more stable behaviour of the tail index estimates over a range of \(k\) values. For example, as discussed above, when \(\rho\) is close to \(-1\), there may be a benefit of taking \(\rho_c=-2\) due to both control of bias and variance.

a
b
c
d

Figure 2: Empirical relative bias squared, variance and MSE of the bias-corrected MELE of tail index \(\gamma\) in 7 for three canonical values \(\rho_c\) based on 1000 replications of random samples of size \(n=500\) from Student t distributions with \(\nu\) degrees of freedom, \(\nu\in\{2,3,4,5\}\).. a — \(\nu=2\), \(\rho=-1\), b — \(\nu=3\), \(\rho=-2/3\), c — \(\nu=4\), \(\rho=-1/2\), d — \(\nu=5\), \(\rho=-2/5\)

a
b
c
d

Figure 3: Empirical relative bias squared, variance and MSE of the bias-corrected MELE of tail index \(\gamma\) in 7 for three canonical values \(\rho_c\) based on 1000 replications of random samples of size \(n=500\) from Burr distributions with parameters \(\tau=1/\lambda\) and \(\lambda\in\{1,4/3,2,3\}\); second order parameter is \(\rho=-1/\lambda\).. a — \(\rho=-1\), b — \(\rho=-3/4\), c — \(\rho=-1/2\), d — \(\rho=-1/3\)

Figure 4: Empirical coverage probabilities for 95% confidence intervals based on the bias-corrected MELE of tail index \gamma in 7 for three canonical values \rho_c based on 1000 replications of random samples of size n=500 from Student t distributions with \nu degrees of freedom, \nu\in\{2,3,4,5\}.
Figure 5: Empirical coverage probabilities for 95% confidence intervals based on the bias-corrected MELE of tail index \gamma in 7 for three canonical values \rho_c based on 1000 replications of random samples of size n=500 from Burr distributions with parameters \tau=1/\lambda and \lambda\in\{1,4/3,2,3\}; second order parameter is \rho=-1/\lambda.

3.2 Comparison of tail index estimators and confidence interval constructions↩︎

We next compare the proposed estimator of the tail index with its direct competitors: the Hill estimator in 2 and the bias-corrected (parametric) MLE of [13]. Based on the asymptotic behaviour of these three estimators, the Hill estimator has the smallest (asymptotic) variance and this is confirmed by the middle panel plots in Figures 6 and 7. Due to the choice of \(\rho\) values in the simulation settings, as expected, the Hill estimator shows bias in finite sample situations, which can be substantial for larger values of \(\rho\). The bias-corrected MLE exhibits the largest empirical variance1, which can be attributed to estimation of an extra parameter, \(\rho\), but it does lead to the lowest bias in most cases, particularly when \(\rho\ge-0.5\). In comparison, the proposed estimator seems to trade some of the bias (due to \(\rho\) misspecification) for variance reduction which manifests in overall lowest MSE over moderate values of \(k\) when \(-1<\rho\le -0.5\) and outperforms other method for \(\rho> -0.5\).

a
b
c
d

Figure 6: Empirical relative bias squared, variance and MSE of the bias-corrected MELE of tail index \(\gamma\) in 7 for two canonical values \(\rho_c\), the bias-corrected MLE and the Hill estimator based on 1000 replications of random samples of size \(n=500\) from Student t distributions with \(\nu\) degrees of freedom, \(\nu\in\{2,3,4,5\}\).. a — \(\nu=2\), \(\rho=-1\), b — \(\nu=3\), \(\rho=-2/3\), c — \(\nu=4\), \(\rho=-1/2\), d — \(\nu=5\), \(\rho=-2/5\)

a
b
c
d

Figure 7: Empirical relative bias squared, variance and MSE of the bias-corrected MELE of tail index \(\gamma\) in 7 for two canonical values \(\rho_c\), the bias-corrected MLE and the Hill estimator based on 1000 replications of random samples of size \(n=500\) from Burr distributions with parameters \(\tau=1/\lambda\) and \(\lambda\in\{1,4/3,2,3\}\); second order parameter is \(\rho=-1/\lambda\).. a — \(\rho=-1\), b — \(\rho=-3/4\), c — \(\rho=-1/2\), d — \(\rho=-1/3\)

Finally, we examine the empirical coverage rates across the following four confidence interval constructions:

  • the bias-corrected empirical likelihood confidence interval (BCEL), \(\mathcal{I}_{BCEL}\) in 10 with \(\rho_c=-1\);

  • the parametric bias-corrected confidence interval (BCMLE) of [13] with upper bound of -0.5 for optimization of \(\rho\);

  • the empirical likelihood-based confidence interval (EL), \(\mathcal{I}_{EL}\) in 4 ;

  • the confidence interval based on asymptotic normality of the Hill estimator (Hill), \(\mathcal{I}_{H}\) in 3 .

In Figures 8 and 9 we show the empirical coverage rates for 95% confidence intervals under the different constructions listed above. As already mentioned earlier, the coverage rates appear to be largely influenced by the bias of underlying tail index estimators. This explains substantial undercoverage for the Hill and EL confidence intervals when \(\rho\) is increasing away from \(-1\) or \(k\) moves towards a more moderate range. The estimation of the asymptotic variance of the tail index estimator also has an impact on the coverage rates. For the parametric bias-corrected MLE, lack of a consistent estimator of \(\rho\) is likely to lead to inaccurate estimation of the asymptotic variance. It is interesting to note that the parametric bias-corrected confidence interval often has coverage rates above the nominal level due to overestimation of the asymptotic variance, and coverage rates either above or below the nominal level for larger values of \(k\). The proposed bias-corrected empirical likelihood confidence interval (with \(\rho_c=-1\)) mostly maintains the nominal coverage for \(-1\le\rho\le-0.5\) and moderate values of \(k\), but does begin to show undercoverage when \(\rho>-0.5\) due to larger discrepancies between \(\rho\) and \(\rho_c\).

Figure 8: Empirical coverage probabilities for 95% confidence intervals under different constructions including the bias-correct EL interval in 10 with canonical value \rho_c=-1 (denoted "BC MELE") and confidence intervals based on the bias-corrected MLE of [13] (denoted "BC MLE"), the Hill estimator in 3 and the empirical likelihood in 4 (denoted "MELE"). The results are based on 1000 replications of random samples of size n=500 from Student t distributions with \nu degrees of freedom, \nu\in\{2,3,4,5\}.
Figure 9: Empirical coverage probabilities for 95% confidence intervals under different constructions including the bias-correct EL interval in 10 with canonical value \rho_c=-1 (denoted "BC MELE") and confidence intervals based on the bias-corrected MLE of [13] (denoted "BC MLE"), the Hill estimator in 3 and the empirical likelihood in 4 (denoted "MELE"). The results are based on 1000 replications of random samples of size n=500 from Burr distributions with parameters \tau=1/\lambda and \lambda\in\{1,4/3,2,3\}; second order parameter is \rho=-1/\lambda.

4 Application↩︎

In this section, we illustrate the proposed estimator of the tail index on a real life dataset. We consider the Internet trace data downloaded from the Boston University’s Computer Science Department in December 1994; the data can be accessed at the following link: https://ita.ee.lbl.gov/html/contrib/BU-Web-Client.html. During the period of study, a total of 21,108 files were requested, and the size of each requested file (in bytes) was recorded. A large number of the files have zero size, and many files in the dataset contain duplicates. After removing empty and duplicate files, the dataset contains \(n=2,785\) distinct files. Figure 10 shows a log-log survival plot with the ordered observations (on the horizontal axis) plotted against empirical estimates of their exceedance probability. Under the regular variation model in 1 , we expect the tail of the logarithm of the survival function to be approximately linear in \(\log x\) with slope \(-1/\gamma\). For this dataset, the tail does appear to taper off linearly, thus justifying the regular variation assumption.

Figure 10: Log-log survival plot for the file size dataset based on 2,785 distinct files.

An important step in the application of many extreme value methods is deciding where the tail begins so an asymptotic model can be relied on to provide an accurate approximation to the tail of the underlying distribution. In our set-up, this requires the choice of sample fraction \(k\). For the classical Hill estimator, a standard approach to choosing \(k\) is to explore tail index estimates over a range of values of \(k\) and select a value of \(k\) where the estimates have plateaued. A similar technique can be adopted to select \(k\) in the proposed bias-corrected MELE in 7 . Figure 11 illustrates the two plots based on the Hill estimator and bias-corrected MELE with \(\rho_c=-1\). Both plots exhibit a fluctuating behaviour for smaller values of \(k\). The Hill plot seems to settle only from about \(k=470\) to \(k=680\) (indicated by vertical dashed lines), with the average value of the estimates in this region giving \(\widehat\gamma_H \approx 1.30\). However, these values of \(k\) are rather large relative to the sample size here, corresponding to the range from 17% to 24% of the sample, and thus are likely to lead to an estimate that is biased. The bias-corrected MELE plot has a stable region in a range \(600 \le k\le 750\). This range of \(k\) values is less of an issue for the bias-corrected estimator as it incorporates second-order terms in the asymptotic model, which allows to select larger values of \(k\), a fact also supported by the simulation studies. Taking the average over estimates in the above region leads to \(\widehat\gamma_E \approx 1.10\).

To validate these estimates, we also consider the log-tail probability plot for the largest 10% of the sample, or 278 observations in our case; see Figure 12. Superimposed on this plot are lines obtained by fitting the intercept using least squares while keeping the slope fixed at \(-1/\widehat\gamma\) for each of the two tail index estimates. On the basis of this plot, we find that the tail index estimate resulted from the proposed bias-corrected MELE provides a better fit to the tail observations, more accurately capturing the rate of decay compared to the Hill estimator based on the plateau region of the Hill plot. The residual sums of squares are 0.44 and 0.71 for the bias-corrected MELE and Hill estimator, respectively. As a final note on the comparison of the two estimators, we remark that while the Hill estimator leads to a more narrow confidence band (see Figure 11), this band likely underestimates its sampling variability as was captured by the coverage rates in the simulation studies.

Figure 11: Plots of the tail index estimates (solid red curves) and corresponding 95% confidence intervals (dotted curves) as a function of sample fraction k based on the Hill estimator in 2 (left panel) and bias-corrected maximum empirical likelihood estimator in 7 for the file size dataset.
Figure 12: Log-tail probability plot based the largest 278 observations (10% of the sample) in the file size dataset. The lines indicate least-squares fits to these tail observations with slopes held fixed at -1/\widehat\gamma_H and -1/\widehat\gamma_E for the Hill estimate and bias-corrected MELE, respectively.

5 Conclusion↩︎

The paper makes a contribution to the literature on tail index estimation for heavy-tailed data, an important yet often challenging problem arising in a wide range of applications. We combine the idea of bias correction from [13] with the empirical likelihood approach to propose a bias-corrected estimator for the tail index based on the partial derivatives of the least squares objective function. Instead of jointly estimating the three parameters as in [13], we replace the second order parameter \(\rho\) by a canonical choice \(\rho_c\). This step is motivated by the fact that estimation of \(\rho\) through joint optimization of the parametric likelihood function is generally numerically unstable and inconsistent, often leading to inconsistent estimation of the asymptotic variance of the MLE of \(\gamma\) and, as a consequence, poor coverage rates of corresponding confidence intervals. The proposed bias-corrected estimator under suitable normalization has an asymptotically normal distribution with asymptotic variance depending on the choice of \(\rho_c\). The resulting bias-corrected EL ratio statistic has a \(\chi^2\) limiting distribution, which guarantees accurate coverage when sample size \(n\) is large. The resulting bias-corrected EL confidence interval is data driven and does not require explicit estimation of the asymptotic variance. While the use of a canonical value \(\rho_c\) may introduce a bias in finite samples when \(\rho\) and \(\rho_c\) are far apart, the asymptotic results as well as the simulation studies show that, when setting \(\rho_c = -1\), a reduction in variance often outweighs the effect of bias and results in lower MSE when comparing the proposed estimator with the bias-corrected parametric MLE. The proposed estimator also offers a competitive alternative to the Hill estimator in cases of slow convergence when \(\rho>-1\).

Theoretical considerations and simulation studies suggest \(\rho_c=-1\) as a preferred choice across most of the considered data generating processes both in terms of point estimation metrics and confidence interval coverage rates. The choice of sample fraction \(k\) plays an important role in the performance of tail index estimators discussed above. In contrast to the Hill estimator for which bias increases rapidly with \(k\), the proposed bias-corrected estimator tends to work well across a wider range of \(k\) values, thus allowing to select a larger value of \(k\) for a reduced variance but without sacrificing much in terms of bias. Empirical coverage rates also tend to improve for moderate values of \(k\).

As a final remark, we note that the proposed estimator continues to share some of the drawbacks of the Hill estimator, in particular, lack of location-invariance due to reliance on log-spacings. While the use of empirical likelihood generally leads to range-respecting confidence intervals, the proposed interval in 10 does not have this property due to the form of the objective function which requires estimation of the rate function \(b_{n,k}\). In practice, this would be an issue only in cases of lighter-tailed data with small values of \(\gamma\).

Acknowledgements↩︎

The authors acknowledge financial support of the Natural Sciences and Engineering Research Council of Canada.

6 Proofs↩︎

6.1 Proof of Theorem 1↩︎

Proof. In the proof we will use \(\boldsymbol{\theta}_0=(\gamma_0,b_{n,k})\) and \(\rho_0\) to denote the true values of the model parameters. Let \[Z_j = \left[\gamma_0 + b_{n,k} \Big(\frac{j}{k+1}\Big)^{-\rho_0}\right] E_j,\qquad j=1,\ldots,k,\] where \(E_1,\ldots,E_k\) are i.i.d. standard exponential random variables, and set \[\sigma_j^2 := Var(Z_j) = \left\{\gamma_0 + b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0}\right\}^2,\qquad j=1,\ldots,k.\] According to Theorem 2.1 of [13], there exist random variables \(\beta_j\) such that \[\max_{1\leq j \leq k}|Y_j - Z_j - \beta_j| = o_p(b_{n,k})\] with \(\sum_{j=1}^k |\beta_j / j| = o_p(b_{n,k}\log k).\)

To determine the order of \(\sum_{j=1}^k g_{1j}(Y_j;\boldsymbol{\theta}_0)\), we write \[\begin{align} \sum_{j=1}^k g_{1j}(Y_j;\boldsymbol{\theta}_0) &= \sum_{j=1}^k \left[Y_j - \gamma_0 - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_c}\right] \\&= \sum_{j=1}^k \left[Z_j - \gamma_0 - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0}\right]\\ & \quad + b_{n,k}\sum_{j=1}^k \left[\left(\frac{j}{k+1}\right)^{-\rho_0} - \left(\frac{j}{k+1}\right)^{-\rho_c}\right] + \sum_{j=1}^k (Y_j - Z_j - \beta_j) + \sum_{j=1}^k \beta_j. \end{align}\]

Under the condition that \(k^{1/2 + \delta} b_{n,k} = O(1)\), we obtain the following bound on the second term in the sum above: \[\left|b_{n,k}\sum_{j=1}^k \left[\left(\frac{j}{k+1}\right)^{-\rho_0} - \left(\frac{j}{k+1}\right)^{-\rho_c}\right] \right| \leq 2kb_{n,k} = o(\sqrt{k}).\] The order of the third term is \[\left |\sum_{j=1}^k Y_j - Z_j - \beta_j\right | \leq k\max_{1\leq j\leq k}|Y_j-Z_j-\beta_j| = o_p(kb_{n,k}) = o_p(\sqrt k),\] and the order of the fourth term is \[\left|\sum_{j=1}^k \beta_j\right| \leq \sum_{j=1}^k |\beta_j| \leq k\sum_{j=1}^{k}\left|\frac{\beta_j}{j}\right| = o_p(kb_{n,k}\log k) = o_p(\sqrt{k}).\] Combining the above arguments, we have \[\sum_{j=1}^k g_{1j}(Y_j;\boldsymbol{\theta}_0) = \sum_{j=1}^k \left[Z_j - \gamma_0 - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0}\right] + o_p(\sqrt k).\] Note the following relationship between \(g_{1j}(Y_j;\boldsymbol{\theta})\) and \(g_{2j}(Y_j;\boldsymbol{\theta})\): \[g_{2j}(Y_j;\boldsymbol{\theta}) = g_{1j}(Y_j;\boldsymbol{\theta})\left(\frac{j}{k+1}\right)^{-\rho_c}.\] By the integral approximation, \[\lim_{k\to\infty}\sum_{j=1}^k \left(\frac{j}{k+1}\right)^{-\rho_c} = \frac{1}{1-\rho_c}.\] Hence, \[\sum_{j=1}^k g_{2j}(Y_j;\boldsymbol{\theta}_0) = \sum_{j=1}^k \left[Z_j - \gamma_0 - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0}\right]\left(\frac{j}{k+1}\right)^{-\rho_c} + o_p(\sqrt{k})\] so that \[\sum_{j=1}^k {\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta}_0) = \sum_{j=1}^k \begin{pmatrix} g_{1j}(Y_j;\boldsymbol{\theta}_0) \\ g_{2j}(Y_j;\boldsymbol{\theta}_0) \\ \end{pmatrix} = \sum_{j=1}^k \begin{pmatrix} Z_j - \gamma_0 - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0} \\ \left[Z_j - \gamma_0 - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0}\right]\left(\frac{j}{k+1}\right)^{-\rho_c} \end{pmatrix} + o_p(\sqrt k).\]

Note \[\begin{align} v_j &:= Var\begin{pmatrix} Z_j - \gamma_0 - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0} \\ \left[Z_j - \gamma_0 - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0}\right]\left(\frac{j}{k+1}\right)^{-\rho_c} \end{pmatrix} \\& = \left[\gamma_0 + b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0}\right]^2 \begin{pmatrix} 1 & \left(\frac{j}{k+1}\right)^{-\rho_c} \\ \left(\frac{j}{k+1}\right)^{-\rho_c} & \left(\frac{j}{k+1}\right)^{-2\rho_c} \end{pmatrix} \end{align}\] and \[V_k := (1/k)\sum_{j=1}^k v_j = \frac{1}{k}\sum_{j=1}^k \left[\gamma_0 + b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0}\right]^2 \begin{pmatrix} 1 & \left(\frac{j}{k+1}\right)^{-\rho_c} \\ \left(\frac{j}{k+1}\right)^{-\rho_c} & \left(\frac{j}{k+1}\right)^{-2\rho_c} \end{pmatrix}.\] This leads to an upper bound: \[\begin{align} V_k &\leq \frac{1}{k}\sum_{j=1}^k (\gamma_0 + |b_{n,k}|)^2 \begin{pmatrix} 1 & \left(\frac{j}{k+1}\right)^{-\rho_c} \\ \left(\frac{j}{k+1}\right)^{-\rho_c} & \left(\frac{j}{k+1}\right)^{-2\rho_c} \end{pmatrix} = (\gamma_0 + |b_{n,k}|)^2 \frac{1}{k}\sum_{j=1}^k \begin{pmatrix} 1 & \left(\frac{j}{k+1}\right)^{-\rho_c} \\ \left(\frac{j}{k+1}\right)^{-\rho_c} & \left(\frac{j}{k+1}\right)^{-2\rho_c} \end{pmatrix}, \end{align}\] where the inequality is interpreted component-wise. By the integral approximation, \[\frac{1}{k}\sum_{j=1}^k \begin{pmatrix} 1 & \left(\frac{j}{k+1}\right)^{-\rho_c} \\ \left(\frac{j}{k+1}\right)^{-\rho_c} & \left(\frac{j}{k+1}\right)^{-2\rho_c} \end{pmatrix} \to \begin{pmatrix} 1 & \frac{1}{1-\rho_c}\\ \frac{1}{1-\rho_c} & \frac{1}{1-2\rho_c} \end{pmatrix},\qquad k\to\infty.\] Hence, \[\limsup_{k\to\infty} V_k \leq \gamma_0 ^2 \begin{pmatrix} 1 & \frac{1}{1-\rho_c}\\ \frac{1}{1-\rho_c} & \frac{1}{1-2\rho_c} \end{pmatrix}.\] Similarly, \[\liminf_{k\to\infty} V_k \geq \gamma_0^2 \begin{pmatrix} 1 & \frac{1}{1-\rho_c}\\ \frac{1}{1-\rho_c} & \frac{1}{1-2\rho_c} \end{pmatrix}.\] Therefore, \[\lim_{k\to \infty} V_k = \limsup_{k\to\infty} V_k = \liminf_{k\to\infty} V_k = \gamma_0^2 \begin{pmatrix} 1 & \frac{1}{1-\rho_c}\\ \frac{1}{1-\rho_c} & \frac{1}{1-2\rho_c} \end{pmatrix} =: S_{11}.\]

Next we verify the conditions for the Lindberg Feller’s Central Limit Theorem (CLT). We have: \[\max_{1\leq j \leq k}\frac{(v_j)_{1,1}}{\sum_{j=1}^k (v_j)_{1,1}} \leq \frac{(\gamma_0 + |b_{n,k}|)^2}{k(\gamma_0 - |b_{n,k}|)^2} \to 0,\qquad k \to \infty.\] Furthermore, \[\max_{1\leq j \leq k}\frac{(v_j)_{1,2}}{\sum_{j=1}^k (v_j)_{1,2}} \leq \frac{(\gamma_0 + |b_{n,k}|)^2}{(\gamma_0 - |b_{n,k}|)^2\sum_{j=1}^k \left(\frac{j}{k+1}\right)^{-\rho_c}}\sim \frac{(1-\rho_c)(\gamma_0 + |b_{n,k}|)^2}{k(\gamma_0 - |b_{n,k}|)^2} \to 0,\qquad k\to\infty,\] and, similarly, \[\max_{1\leq j \leq k}\frac{(v_j)_{2,2}}{\sum_{j=1}^k (v_j)_{2,2}} \leq \frac{(\gamma_0 + |b_{n,k}|)^2}{(\gamma_0 - |b_{n,k}|)^2\sum_{j=1}^k \left(\frac{j}{k+1}\right)^{-2\rho_c}}\sim \frac{(1-2\rho_c)(\gamma_0 + |b_{n,k}|)^2}{k(\gamma_0 - |b_{n,k}|)^2} \to 0,\qquad k\to\infty.\] Hence, by the Lindberg Feller’s CLT, \[\frac{1}{\sqrt{k}}\sum_{j=1}^k \begin{pmatrix} Z_j - \gamma_0 - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0} \\ \left[Z_j - \gamma_0 - b_{n,k}\left(\frac{j}{k+1}\right)^{-\rho_0}\right]\left(\frac{j}{k+1}\right)^{-\rho_c} \end{pmatrix} \buildrel\rm d\over\rightarrow\mathcal{N}_2(0,S_{11}),\qquad k\to\infty,\quad n\to\infty.\] and applying the Slutsky’s theorem gives \[\dfrac1{\sqrt{k}}\sum_{j=1}^k {\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta}_0) \buildrel\rm d\over\rightarrow\mathcal{N}_2(0,S_{11}).\]

Recall that from 9 that the empirical log-likelihood function of \(\boldsymbol{\theta}\) is given by \[\ell_E(\boldsymbol{\theta}) = -k\log k - \sum_{j=1}^k \log[1+\boldsymbol{\lambda}^{\top}{\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})],\] where \(\boldsymbol{\lambda}\) is the Lagrange multiplier that satisfies 8. At the MELE \(\widehat\boldsymbol{\theta}_E\), we have \[\frac{\partial \ell_E(\boldsymbol{\theta})}{\partial \boldsymbol{\theta}}\bigg|_{\boldsymbol{\theta}=\widehat\boldsymbol{\theta}_E} = \sum_{j=1}^{k} \frac{\frac{\partial {\boldsymbol{g}}_j(Y_j;\widehat\boldsymbol{\theta}_E)}{\partial \boldsymbol{\theta}^{\top}}\widehat\boldsymbol{\lambda}}{1+\widehat{\boldsymbol{\lambda}}^{\top}{\boldsymbol{g}}_j(Y_j;\widehat\boldsymbol{\theta}_E)} = \boldsymbol{0},\] where \(\widehat\boldsymbol{\lambda}\) is the Lagrange multiplier at \(\widehat\boldsymbol{\theta}_E\) that satisfies \[\sum_{j=1}^k \frac{{\boldsymbol{g}}_j(Y_j;\widehat\boldsymbol{\theta}_E)}{1+\widehat\boldsymbol{\lambda}^{\top}{\boldsymbol{g}}_j(Y_j;\widehat\boldsymbol{\theta}_E)} = \boldsymbol{0}.\] Define a function of \((\boldsymbol{\theta},\boldsymbol{\lambda})\): \[Q_k(\boldsymbol{\theta},\boldsymbol{\lambda}) = \begin{pmatrix} Q_{1k}(\boldsymbol{\theta},\boldsymbol{\lambda}) \\ Q_{2k}(\boldsymbol{\theta},\boldsymbol{\lambda}) \end{pmatrix} = \frac{1}{k}\sum_{j=1}^k \begin{pmatrix} \dfrac{{\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})}{1+\boldsymbol{\lambda}^{\top}{\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})} \\ \dfrac{\frac{\partial {\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})}{\partial \boldsymbol{\theta}^{\top}}\boldsymbol{\lambda}}{1+\boldsymbol{\lambda}^{\top}{\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})}\\ \end{pmatrix}.\] Let \(\bar {\boldsymbol{g}}= (1/k)\sum_{j=1}^k {\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta}_0).\) We then have \[Q_k(\boldsymbol{\theta}_0,{\boldsymbol{0}}) = \begin{pmatrix} \bar {\boldsymbol{g}}\\ \boldsymbol{0}\\ \end{pmatrix}.\] By the Taylor expansion of \(Q_k\) at \((\boldsymbol{\theta}_0,{\boldsymbol{0}})\) (see [15]), we obtain \[\boldsymbol{0}= Q_k(\widehat\boldsymbol{\theta}_E,\widehat\boldsymbol{\lambda}) = Q_k(\boldsymbol{\theta}_0,{\boldsymbol{0}}) + \begin{pmatrix} \dfrac{\partial Q_{1k}(\boldsymbol{\theta}_0,{\boldsymbol{0}})}{\partial \boldsymbol{\theta}} & \dfrac{\partial Q_{1k}(\boldsymbol{\theta}_0,{\boldsymbol{0}})}{\partial \boldsymbol{\lambda}} \\ \dfrac{\partial Q_{2k}(\boldsymbol{\theta}_0,{\boldsymbol{0}})}{\partial \boldsymbol{\theta}} & \dfrac{\partial Q_{2k}(\boldsymbol{\theta}_0,{\boldsymbol{0}})}{\partial \boldsymbol{\lambda}} \\ \end{pmatrix} \begin{pmatrix} \widehat\boldsymbol{\theta}_E - \boldsymbol{\theta}_0 \\ \widehat\boldsymbol{\lambda}- {\boldsymbol{0}}\\ \end{pmatrix} + o_p(\lVert\widehat\boldsymbol{\theta}_E - \boldsymbol{\theta}_0\rVert + \lVert\widehat\boldsymbol{\lambda}\rVert).\] We next calculate the derivatives of \(Q_k\). The partial derivatives of \(Q_{1k}\) are \[\frac{\partial Q_{1k}(\boldsymbol{\theta}_0,{\boldsymbol{0}})}{\partial \boldsymbol{\theta}} = \frac{1}{k}\sum_{j=1}^k \frac{\partial {\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta}_0)}{\partial \boldsymbol{\theta}} = \frac{1}{k}\sum_{j=1}^k \begin{pmatrix} -1 & -(\frac{j}{k+1})^{-\rho_c} \\ -(\frac{j}{k+1})^{-\rho_c} & -(\frac{j}{k+1})^{-2\rho_c} \\ \end{pmatrix} = S_{12} + o(1),\] where \[S_{12} = \begin{pmatrix} -1 & -\frac{1}{1-\rho_c} \\ -\frac{1}{1-\rho_c} & -\frac{1}{1-2\rho_c} \\ \end{pmatrix}\] and \[\frac{\partial Q_{1k}(\boldsymbol{\theta}_0,{\boldsymbol{0}})}{\partial \boldsymbol{\lambda}} = \frac{1}{k}\sum_{j=1}^k {\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta}_0){\boldsymbol{g}}_j^{\top}(Y_j;\boldsymbol{\theta}_0) = - S_{11} + o(1).\] The partial derivatives of \(Q_{2k}\) are \[\frac{\partial Q_{2k}(\boldsymbol{\theta}_0,{\boldsymbol{0}})}{\partial \boldsymbol{\theta}} = \begin{pmatrix} 0 & 0 \\ 0 & 0 \\ \end{pmatrix}\] and \[\frac{\partial Q_{2k}(\boldsymbol{\theta}_0,{\boldsymbol{0}})}{\partial \boldsymbol{\lambda}} = \frac{1}{k}\sum_{j=1}^k \frac{\partial {\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta}_0)}{\partial\boldsymbol{\theta}} = S_{12} + o(1).\] To summarize, we have \[\begin{pmatrix} \bar {\boldsymbol{g}}\\ \boldsymbol{0}\\ \end{pmatrix} + \begin{pmatrix} S_{12} & -S_{11} \\ \boldsymbol{0} & S_{12} \\ \end{pmatrix} \begin{pmatrix} \widehat\boldsymbol{\theta}_E - \boldsymbol{\theta}_0 \\ \widehat\boldsymbol{\lambda}\\ \end{pmatrix} = o_p(\lVert\widehat\boldsymbol{\theta}_E - \boldsymbol{\theta}_0\rVert + \lVert\widehat\boldsymbol{\lambda}\rVert).\] Since \(\sqrt k \bar {\boldsymbol{g}}\buildrel\rm d\over\rightarrow\mathcal{N}_2(\boldsymbol{0}, S_{11})\), then \(\bar {\boldsymbol{g}}= O_p(k^{-1/2})\), and \(\lVert\widehat\boldsymbol{\theta}_E - \boldsymbol{\theta}_0\rVert + \lVert\widehat\boldsymbol{\lambda}\rVert = O_p(k^{-1/2}).\) Hence, \[\label{eqn1} S_{12}(\widehat\boldsymbol{\theta}_E - \boldsymbol{\theta}_0) - S_{11}\widehat\boldsymbol{\lambda}= -\bar{{\boldsymbol{g}}} + o_p(k^{-1/2}),\tag{11}\] and \[\label{eqn2} S_{12}\widehat\boldsymbol{\lambda}= o_p(k^{-1/2}).\tag{12}\] Multiplying 11 by \(S_{12}S_{11}^{-1}\), we get \[S_{12}S_{11}^{-1}S_{12}(\widehat\boldsymbol{\theta}_E - \boldsymbol{\theta}_0) = -S_{12}S_{11}^{-1}\bar {\boldsymbol{g}}+ o_p(k^{-1/2}).\] Therefore, \[\sqrt{k}(\widehat\boldsymbol{\theta}_E - \boldsymbol{\theta}_0) = -[S_{12}S_{11}^{-1}S_{12}]^{-1}S_{12}S_{11}^{-1}\sqrt{k}\bar{{\boldsymbol{g}}} + o_p(1).\] Again using the fact that \(\sqrt k \bar {\boldsymbol{g}}\buildrel\rm d\over\rightarrow\mathcal{N}_2(\boldsymbol{0}, S_{11})\), we obtain \[\sqrt k(\widehat\boldsymbol{\theta}_E - \boldsymbol{\theta}_0) \buildrel\rm d\over\rightarrow\mathcal{N}_2(\boldsymbol{0}, \Sigma),\] where \[\begin{align} \Sigma &= [S_{12}S_{11}^{-1}S_{12}]^{-1}S_{12}S_{11}^{-1}S_{11}S_{11}^{-1}S_{12}[S_{12}S_{11}^{-1}S_{12}]^{-1} \\&= [S_{12}S_{11}^{-1}S_{12}]^{-1} \\& = \frac{\gamma_0^2}{\rho_c^2}\begin{pmatrix} (1-\rho_c)^2 & -(1-\rho_c)(1-2\rho_c) \\ -(1-\rho_c)(1-2\rho_c) & (1-\rho_c)^2(1-2\rho_c) \\ \end{pmatrix}. \end{align}\] Therefore, as \(n\to \infty\), \[\sqrt{k}(\widehat\gamma_E - \gamma_0) \buildrel\rm d\over\rightarrow\mathcal{N}\left(0,\left(\frac{1-\rho_c}{\rho_c}\right)^2\gamma_0^2\right),\] and \[\sqrt{k}(\widehat b_E - b_{n,k}) \buildrel\rm d\over\rightarrow\mathcal{N}\left(0,\frac{(1-\rho_c)^2(1-2\rho_c)}{\rho_c^2}\gamma_0^2\right).\] ◻

6.2 Proof of Theorem 2↩︎

Proof. From 9 , the empirical log-likelihood function of \(\boldsymbol{\theta}\) is \[\ell_E(\boldsymbol{\theta}) = -k\log k - \sum_{j=1}^k \log[1+\boldsymbol{\lambda}^{\top}{\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})],\] where \(\boldsymbol{\lambda}\) is the Lagrange multiplier satisfying \[\sum_{j=1}^k \frac{{\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})}{1+\boldsymbol{\lambda}^{\top}{\boldsymbol{g}}_j(Y_j;\boldsymbol{\theta})} = \boldsymbol{0}.\] Since \(\dim({\boldsymbol{g}}_j) = \dim(\boldsymbol{\theta})\), at \(\boldsymbol{\theta}= \widehat\boldsymbol{\theta}_E\), the solutions to the optimization problem in 6 are \(p_j = 1/k\), \(j=1,\ldots, k\). Hence \(\max_{\boldsymbol{\theta}}\ell_E(\boldsymbol{\theta}) = \ell_E(\widehat\boldsymbol{\theta}_E) = -k\log k\).

Let \((\gamma_0,\tilde{b})\) denote the MELE under \(H_0: \gamma = \gamma_0\), and \(\tilde{\boldsymbol{\lambda}}\) the Lagrange multiplier at \(\boldsymbol{\theta}= (\gamma_0,\tilde{b})\), which is a \(2\times 1\) vector. Hence, \(R(\gamma_0) = 2\sum_{j=1}^k \log[1+\tilde{\boldsymbol{\lambda}}^{\top}{\boldsymbol{g}}_j(Y_j;\gamma_0,\tilde{b})].\)

Furthermore, \[\frac{\partial \ell_E(\gamma_0,b)}{\partial b}\Bigg |_{b=\tilde{b}} = \sum_{j=1}^k \frac{ \left(\frac{\partial {\boldsymbol{g}}_j(Y_j;\gamma_0,\tilde{b})}{\partial b}\right)^{\top}\tilde{\boldsymbol{\lambda}}}{1+\tilde{\boldsymbol{\lambda}}^{\top}{\boldsymbol{g}}_j(Y_j;\gamma_0,\tilde{b})} = 0.\] Due to 8 , we also have \[\sum_{j=1}^k \frac{{\boldsymbol{g}}_j(Y_j;\gamma_0,\tilde{b})}{1+\tilde{\boldsymbol{\lambda}}^{\top}{\boldsymbol{g}}_j(Y_j;\gamma_0,\tilde{b})} = \boldsymbol{0}.\] Define a function of \(b\) and \(\boldsymbol{\lambda}\): \[P_k(b,\boldsymbol{\lambda}) = \dfrac{1}{k}\sum_{j=1}^k \begin{pmatrix} \dfrac{{\boldsymbol{g}}_j(Y_j;\gamma_0,b)}{1+\boldsymbol{\lambda}^{\top}{\boldsymbol{g}}_j(Y_j;\gamma_0,b)}\\ \dfrac{\left(\frac{\partial {\boldsymbol{g}}_j(Y_j;\gamma_0,b)}{\partial b}\right)^{\top}\boldsymbol{\lambda}}{1+\boldsymbol{\lambda}^{\top}{\boldsymbol{g}}_j(Y_j;\gamma_0,b)}\\ \end{pmatrix}.\] Note that \[P_k(b_{n,k},{\boldsymbol{0}}) = \begin{pmatrix} \bar{{\boldsymbol{g}}} \\ 0 \\ \end{pmatrix}\quad\text{with } \bar{\boldsymbol{g}}= (1/k)\sum_{j=1}^k {\boldsymbol{g}}_j(Y_j;\gamma_0, b_{n,k}).\] By a similar Taylor expansion of \(P_k\) at \((\boldsymbol{\theta}_0,\boldsymbol{0})\) and calculations as in the proof of Theorem 1, we get \[\boldsymbol{0}= P_k(\tilde{b},\tilde{\boldsymbol{\lambda}}) = \begin{pmatrix} \bar{{\boldsymbol{g}}} \\ 0 \\ \end{pmatrix} + \begin{pmatrix} A_{12} & -S_{11} \\ \boldsymbol{0}& A_{12} \\ \end{pmatrix} \begin{pmatrix} \tilde{b} - b_{n,k}\\ \tilde{\boldsymbol{\lambda}}\\ \end{pmatrix} + o_p(\lVert\tilde{b} - b_{n,k}\rVert + \lVert\tilde{\boldsymbol{\lambda}}\rVert),\] where \[A_{12} = \begin{pmatrix} -\frac{1}{1-\rho_c} \\ -\frac{1}{1-2\rho_c}\\ \end{pmatrix}.\] Since \(\bar{{\boldsymbol{g}}} = O_p(k^{-1/2})\), then similar to the proof of Theorem 1 we see that \[\lVert\tilde{b} - b_{n,k}\rVert + \lVert\tilde{\boldsymbol{\lambda}}\rVert = O_p(k^{-1/2}).\] Hence, \[\label{eqn3} A_{12}(\tilde{b} - b_{n,k}) - S_{11}\tilde{\boldsymbol{\lambda}} = -\bar{{\boldsymbol{g}}} + o_p(k^{-1/2})\tag{13}\] and \[\label{eqn4} A_{12}^{\top}\tilde{\boldsymbol{\lambda}} = o_p(k^{-1/2}).\tag{14}\] Define \(I_d\) as the identity matrix with rank \(d\). Through similar derivations as in the proof of Theorem 1, \[\tilde{b} - b_{n,k} = -[A_{12}S_{11}^{-1}A_{12}]^{-1}A_{12}S_{11}^{-1}\bar{{\boldsymbol{g}}}.\] Multiplying both sides of 13 by \(A_{12}S_{11}^{-1},\) and substituting this expression for \(\tilde{b},\) we get \[\tilde{\boldsymbol{\lambda}} = [I_2-A_{12}(A_{12}^{\top}S_{11}^{-1}A_{12})^{-1}A_{12}^{\top}S_{11}^{-1}]\;\bar{{\boldsymbol{g}}} + o_p(k^{-1/2}).\] Therefore, \[\begin{align} R(\gamma_0) &= 2\sum_{j=1}^k \log[1+\tilde{\boldsymbol{\lambda}}^{\top}{\boldsymbol{g}}_j(Y_j;\gamma_0,\tilde{b})] \\&= 2\tilde{\boldsymbol{\lambda}}^{\top}\sum_{j=1}^k {\boldsymbol{g}}_j(Y_j;\gamma_0,\tilde{b}) - \tilde{\boldsymbol{\lambda}}^{\top}\sum_{j=1}^k {\boldsymbol{g}}_j(Y_j;\gamma_0,\tilde{b}){\boldsymbol{g}}_j^{\top}(Y_j;\gamma_0,\tilde{b}) \tilde{\boldsymbol{\lambda}} + o_p(1) \\&= (\sqrt{k}S_{11}^{-1/2}\bar{{\boldsymbol{g}}})^{\top}\{S_{11}^{-1/2}[I_2-A_{12}(A_{12}^{\top}S_{11}^{-1}A_{12})^{-1}A_{12}^{\top}]S_{11}^{-1/2}\}\sqrt{k}S_{11}^{-1/2}\bar{{\boldsymbol{g}}} + o_p(1). \end{align}\]

Let \(H = S_{11}^{-1/2}[A_{12}(A_{12}^{\top}S_{11}^{-1}A_{12})^{-1}A_{12}^{\top}]S_{11}^{-1/2}.\) Here \(A_{12}^{\top}S_{11}^{-1}A_{12}\) is a scalar. So, \[{\rm rank}(A_{12}(A_{12}^{\top}S_{11}^{-1}A_{12})^{-1}A_{12}^{\top}) = {\rm rank}(A_{12}A_{12}^{\top}) = 1.\] Since \(S_{11}^{-1/2}\) has full rank, then \({\rm rank}(H) = {\rm rank}(A_{12}A_{12}^{\top}) = 1.\) We have \(H^{\top} = H\) and \[\begin{align} H^2 &= S_{11}^{-1/2}A_{12}(A_{12}^{\top}S_{11}^{-1}A_{12})^{-1}(A_{12}^{\top}S_{11}^{-1}A_{12})(A_{12}^{\top}S_{11}^{-1}A_{12})^{-1}A_{12}^{\top}S_{11}^{-1/2} \\&= S_{11}^{-1/2}[A_{12}(A_{12}^{\top}S_{11}^{-1}A_{12})^{-1}A_{12}^{\top}]S_{11}^{-1/2} \\&= H. \end{align}\] Hence, \(H\) is symmetric and idempotent. Therefore, \[I_2 - H = I_2-S_{11}^{-1/2}[A_{12}(A_{12}^{\top}S_{11}^{-1}A_{12})^{-1}A_{12}^{\top}]S_{11}^{-1/2}.\] Since \(\sqrt{k}S_{11}^{-1/2}\bar{{\boldsymbol{g}}} \buildrel\rm d\over\rightarrow\mathcal{N}_2(\boldsymbol{0},I_2)\), then by the Cochran’s theorem [17], \(R(\gamma_0) \buildrel\rm d\over\rightarrow\chi_1^2.\) ◻

References↩︎

[1]
S. I. Resnick, Heavy-tail phenomenon. Ithaca: Springer, 2007.
[2]
I. Weissman, “Estimation of parameters and larger quantiles based on the \(k\) largest observations,” Journal of the American Statistical Association, vol. 73(364), pp. 812–815, 1978.
[3]
J. Cai, J. Einmahl, L. de Haan, and C. Zhou, “Estimation of the marginal expected shortfall: The mean when a related variable is extreme,” Journal of the Royal Statistical Society: Series B, vol. 77, pp. 417–442, 2014.
[4]
B. Abdous, A.-L. Fougères, and K. Ghoudi, “Extreme behaviour for bivariate elliptical distributions.” Canad. J. Statist., vol. 33, pp. 317–334, 2005.
[5]
N. Nolde and J. Zhang, “Conditional extremes in asymmetric financial markets,” Journal of Business & Economic Statistics, pp. 1–29, 2020.
[6]
M. Zhou and N. Nolde, “Extreme value techniques for stress scenario selection under elliptical symmetry and beyond,” Statistics & Risk Modeling, vol. 42, pp. 19–53, 2025.
[7]
B. M. Hill, “A simple general approach to inference about the tail of a distribution,” The Annals of Statistics, vol. 3(5), pp. 1163–1174, 1975.
[8]
H. Drees and E. Kaufmann, “Selecting the optimal sample fraction in univariate extreme value estimation,” Stochastic Processes and their Applications, vol. 75, pp. 149–172, 1998.
[9]
J. Danielsson, L. de Haan, L. Peng, and C. G. de Vries, “Using a bootstrap method to choose the sample fraction in tail index estimation,” Journal of Multivariate Analysis, vol. 76, pp. 226–248, 2001.
[10]
J. Beirlant, G. Dierckx, A. Guillou, and C. Stǎricǎ, “On exponential representation of log-spacings of extreme order statistics,” Extremes, vol. 5, pp. 157–180, 2002.
[11]
J. C. Lu and L. Peng, “Likelihood based confidence intervals for the tail index,” Extremes, vol. 5, pp. 337–352, 2002.
[12]
Y. Li and Y. Qi, “Adjusted empirical likelihood method for the tail index of a heavy-tailed distribution,” Statistics and Probability Letters, vol. 152, pp. 150–158, 2019.
[13]
J. Beirlant, G. Dierckx, Y. Goegebeur, and G. Matthys, “Tail index estimation and an exponential regression model,” Extremes, vol. 2(2), pp. 177–200, 1999.
[14]
A. Feuerverger and P. Hall, “Estimating a tail exponent by modelling departure from a Pareto distribution,” The Annals of Statistics, vol. 27(2), pp. 760–781, 1999.
[15]
J. Qin and J. Lawless, “Empirical likelihood and general estimating equations,” The Annals of Statistics, vol. 22(1), pp. 300–325, 1994.
[16]
A. B. Owen, “Empirical likelihood confidence regions,” The Annals of Statistics, vol. 18, pp. 90–120, 1990.
[17]
W. G. Cochran, “The distribution of quadratic forms in a normal system, with applications to the analysis of covariance,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 30(2), pp. 178–191, 1934.

  1. Since estimation of \(\rho\) is inconsistent, [13] set an upper bound of -0.5 in estimation of \(\rho\) to stabilize estimation of the tail index. The variance of bias-corrected MLE depends on this upper bound.↩︎