Simultaneous Confidence Bands for Conditional Risk Measurement and Conditional Expected Loss Based on Generalized Estimators

Abstract

Accurate measurement and valid inference of extreme financial risks remain a fundamental challenge in risk management research. Existing literature on conditional risk measures predominantly focuses on pointwise estimation and confidence intervals for single tail thresholds, failing to support joint statistical inference over the entire extreme tail interval. Meanwhile, traditional asymptotic-based confidence bands suffer from severe finite-sample coverage bias, and the complex limiting Gaussian process under the intermediate asymptotic scenario impedes direct empirical application. Under the location-scale model framework, this paper proposes a multiplier bootstrap approach to construct simultaneous confidence bands (SCBs) for conditional risk measures of Pareto-type heavy-tailed return series. We adopt the generalized moment Hill estimator and select effective sample sizes via a data-driven criterion, with rigorous proof of the bootstrap procedure’s asymptotic validity. Monte Carlo simulations confirm that the proposed method is highly robust to the tail index estimator’s moment order α , with coverage probabilities converging to the 95% nominal level and confidence band lengths shrinking at the rate governed by the effective tail sample size, consistent with the theoretical k ?1/2 rate. The method delivers superior coverage accuracy for core relative risk measures, effectively mitigating finite-sample bias in traditional approaches, balancing theoretical rigor and practical tractability for financial risk management applications.

Share and Cite:

Diao, J. (2026) Simultaneous Confidence Bands for Conditional Risk Measurement and Conditional Expected Loss Based on Generalized Estimators. Journal of Applied Mathematics and Physics, 14, 2250-2272. doi: 10.4236/jamp.2026.146110.

1. Introduction

In financial risk management, accurately measuring the tail risk of asset returns is a core task for investment decisions and risk control. Traditional Value-at-Risk (VaR), defined as the maximum possible loss of an asset at a given confidence level, has been widely adopted by financial institutions since its introduction by J.P. Morgan in 1994. However, VaR suffers from two major drawbacks: first, it is not subadditive and hence not a coherent risk measure; second, it fails to capture extreme losses beyond VaR, i.e., it does not fully utilise information about tail risk. To overcome these deficiencies, Artzner [1] proposed an axiomatic system for coherent risk measures, among which Expected Shortfall (ES, also known as Conditional Value-at-Risk) has become a standard coherent risk measure. In this paper, we investigate both the conditional quantile (traditionally called Value-at-Risk, VaR) and the conditional tail expectation (ES). For consistency with Li et al. [2], we denote the conditional quantile by CVaR and the conditional tail expectation by CES; therefore, in our notation, CVaR corresponds to standard VaR and CES corresponds to standard ES/CVaR.

In actual financial time series, returns often exhibit typical features such as volatility clustering, heavy tails and asymmetry. To capture these features, researchers commonly model returns using a location-scale model:

R t =m( A t1 , β 0 )+σ( A t1 , β 0 ) ε t ,

where the conditional mean m( ) and conditional standard deviation σ( ) depend on the historical information set A t1 , and the innovations ε t are i.i.d. with zero mean and unit variance. Extensive empirical evidence indicates that the distribution of ε t is often Pareto-type heavy-tailed, i.e., its tail distribution function satisfies the regular variation condition:

lim x 1 F ε ( xs ) 1 F ε ( x ) = s 1/ γ R ,s>0,

where γ R >0 is called the right-tail extreme value index. Similarly, the left-tail extreme value index γ L >0 is defined on the tail of ε t . The magnitude of the extreme value index directly determines the thickness of the tail and thereby affects the estimation accuracy of CVaR and CES.

Extreme value theory (EVT) based tail estimation methods provide effective tools for estimating CVaR and CES. McNeil and Frey [3] pioneered the combination of EVT with GARCH models, proposing a two-stage estimation framework: first, fit a conditional heteroskedasticity model to obtain standardised residuals; then, use EVT to estimate tail quantiles and tail expectations of the residuals, thereby obtaining estimates of conditional risk measures. This approach has become the standard paradigm for dynamic risk measurement. Within this framework, the estimation of the extreme value index is a core component. The classical Hill estimator [4] is widely used due to its simplicity and asymptotic normality:

γ ^ R Hill = 1 k 1 i=1 k 1 log ε ( i ) ε ( k 1 +1 ) ,

where ε ( 1 ) ε ( n ) are order statistics. However, the Hill estimator only uses first-order moment information of the log-excesses, is sensitive to outliers, and can have substantial finite-sample bias when the effective sample size k 1 is poorly chosen.

To overcome the limitations of the Hill estimator, researchers have developed several improved methods. Dekkers et al. [5] proposed the moment estimator, extending the estimation range to negative extreme value indices. Gomes and Martins [6] and Segers [7] introduced the generalised moment estimator:

γ ^ R ( α ) = ( M n ( α ) ( k 1 ) Γ( α+1 ) ) 1/α , M n ( α ) ( k 1 )= 1 k 1 i=1 k 1 ( log ε ( i ) ε ( k 1 +1 ) ) α ,

where α>0 is a tuning parameter. This family of estimators allows a trade-off between first-order ( α=1 ) and higher-order moments by adjusting α , thereby achieving a flexible balance between bias and variance. When α=1 , the generalised moment estimator reduces to the Hill estimator. Thus, the generalised moment estimator provides a unified framework for extreme value index estimation.

Although pointwise interval estimation of CVaR and CES at a single tail level is relatively well developed (e.g., Chan et al. [8]; Hoga [9]), in risk management practice regulators and investors often need to monitor multiple tail levels simultaneously, for example, CVaR at 0.5%, 0.8% and 1%. Constructing confidence intervals separately for each tail level would cause the overall coverage probability to deviate severely from the nominal level due to the multiple testing problem. Simultaneous confidence bands (SCBs) effectively address this issue by guaranteeing that the coverage probability over the entire tail region asymptotically attains the nominal level. Li et al. [2] systematically constructed joint SCBs for CVaR and CES under the location-scale model for the first time, established asymptotic theories for both the extrapolation extreme scenario ( a 1 =0 ) and the data-rich intermediate scenario ( a 1 >0 ), and designed a multiplier bootstrap method to improve finite-sample performance. However, that study still used the classical Hill estimator and did not fully exploit the flexibility of the generalised moment estimator family.

Based on the joint SCB framework of Li et al. [2], this paper generalises the extreme value index estimation from the Hill estimator to the generalised moment estimator, aiming to construct a more general joint inference method for conditional risk measures. Specifically, this paper addresses the following issues:

First, the asymptotic properties of the generalised moment estimator under time series dependence have not yet been clarified. Existing theory is mostly based on the i.i.d. assumption, whereas actual financial data often exhibit conditional heteroskedasticity. This paper derives the linear expansion of the generalised moment estimator in the residual sequence of the location-scale model and proves its joint asymptotic normality with order statistics, thereby providing a theoretical foundation for constructing SCBs.

Second, the bootstrap algorithm in the original literature depends on the specific linear form of the Hill estimator. This paper will derive a new linear expansion for the generalised moment estimator and design an adapted multiplier bootstrap statistic, enabling effective approximation of the limiting distribution of the original statistic under the intermediate scenario, thus overcoming the slow convergence rate of theoretical SCBs and the difficulty of approximating the limiting distribution in the intermediate scenario.

Third, the introduction of the tuning parameter α provides a new dimension for the bias-variance trade-off of the estimator. Through systematic Monte Carlo simulations, this paper evaluates the coverage probability and relative length of SCBs under different values of α , analyses the influence of α under symmetric and left-skewed distributions, and provides recommendations for parameter choice in practical applications.

Relative to Li et al. [2], this paper makes the following novel contributions. The overall simultaneous confidence band framework, the location-scale model paradigm, and the multiplier bootstrap strategy are inherited from that work. The new elements are: i) replacing the Hill estimator by the generalized moment estimator of Gomes and Martins [6] and Segers [7], which introduces the moment order α and encompasses the Hill estimator as the special case α=1 ; ii) deriving the linear expansion of the generalized moment estimator and designing a modified bootstrap statistic adapted to this expansion, together with a formal statement of why the bootstrap validity theorem of Li et al. [2] continues to hold; iii) providing a complete asymptotic theory for the generalized moment estimator under the intermediate scenario ( a 1 >0 ), culminating in a joint inference procedure for conditional risk measures.

2. The Framework and Estimation of CVaR and CES

2.1. The Framework

Assumption 2.1. R t follows the location-scale model:

R t =m( A t1 , β 0 )+σ( A t1 , β 0 ) ε t , (2.1)

where m( A t1 , β 0 ) and σ( A t1 , β 0 ) denote the conditional mean and the conditional standard deviation of the return R t given the information set A t1 , respectively. The specific functional forms of these two functions are known, but they depend on an unknown parameter vector β 0 . The innovation ε t is independent of the information set A t1 and forms an independent and identically distributed (i.i.d.) sequence of continuous random variables with mean zero and variance one. The information set at time t is defined as:

A t1 =σ( ε t1 , ε t2 ,; η t1 , η t2 , )

that is, the σ -algebra generated by the historical innovation sequence { ε ti } i=1 and the possibly existing additional random vector sequence { η ti } i=1 . Here, { η t } t= is a sequence of random vectors independent of the innovation sequence { ε t } t= . Furthermore, the functions m( A t1 , β 0 ) and σ( A t1 , β 0 ) are measurable with respect to A t1 .

We suppose that ε t follows a distribution with Pareto-type heavy tails. Let F ε ( )=Pr( ε t ) and F ε ( )=Pr( ε t ) be the distribution functions of ε t and ε t . Then

lim x 1 F ε ( xs ) 1 F ε ( x ) = s γ R 1 ,foralls>0, (2.2)

and

lim x 1 F ε ( xs ) 1 F ε ( x ) = s γ L 1 ,foralls>0, (2.3)

where γ R >0 and γ L >0 denote the extreme value indices corresponding to the right and left tails, respectively. Note that under Assumption 2.1, the innovation ε t is assumed to possess unit variance. This condition means that γ R <1/2 and γ L <1/2 .

By model (2.1), we have

U-CVaR( τ )=m( A t1 , β 0 )+σ( A t1 , β 0 ) Q ε ( 1τ ), (2.4)

U-CES( τ )=m( A t1 , β 0 )+σ( A t1 , β 0 )E[ ε|ε> Q ε ( 1τ ) ], (2.5)

D-CVaR( τ )=m( A t1 , β 0 )σ( A t1 , β 0 ) Q ε ( τ ), (2.6)

D-CES( τ )=m( A t1 , β 0 )σ( A t1 , β 0 )E[ ε|ε< Q ε ( τ ) ]. (2.7)

where Q ε ( ) is the quantile function of ε t . Assume that for each type{ U,D,R } , we have estimators type-CVaR ˜ and type-CES ˜ for the true type-CVaR and type-CES quantities, respectively. Given a tail region [ τ l , τ u ] satisfying 0< τ l τ u , we define the maximum absolute log-ratios as

sup τ[ τ l , τ u ] | log( type-CVaR ˜ ( τ ) type-CVaR( τ ) ) |and sup τ[ τ l , τ u ] | log( type-CES ˜ ( τ ) type-CES( τ ) ) |. (2.8)

2.2. Estimation of CVaR and CES

Suppose that there is a consistent estimator β ^ of β 0 . Let A ˜ t1 be the truncated information set, which is generated by feasible information up to time t1 . The truncation is necessary when the information set relies on infinite past observations. For example, when A t1 ={ R t1 , R t2 ,, R 0 , R 1 , } , the truncated information set is A ˜ t1 ={ R t1 , R t2 ,, R 1 } . We obtain the standardized residuals ε ^ t = R t m( A ˜ t1 , β ^ ) σ( A ˜ t1 , β ^ ) , t=1,,n . For d n <n and d n as n , we discard the residuals for t< d n and work with ε ^ t for t= d n ,,n . This discarding eliminates the effect of information truncation. Similar discarding can be applied to other information. Denote by F ε the left continuous inverse of F ε . Then, for x>0 , the ( 11/x ) -quantile of F ε is

Q ε ( 11/x ) U ε ( x )= F ε ( 11/x ).

By Theorem 1.2.1 and Corollary 1.2.10 of de Haan & Ferreira [10], (2.2) is equivalent to

lim x U ε ( xs ) U ε ( x ) = s γ R ,foralls>0. (2.9)

Similarly, let F ε be the left continuous inverse of F ε and U ε ( x ) F ε ( 11/x ) , for x>0 . Then (2.3) is equivalent to

lim x U ε ( xs ) U ε ( x ) = s γ L ,foralls>0. (2.10)

We first consider estimating the CVaR and CES of the right tail, namely Q ε ( 1τ ) and E[ ε|ε> Q ε ( 1τ ) ] . For positive integers k 1 , it satisfies that k 1 and k 1 /n 0 as n . By (2.9), for a small τ implies

Q ε ( 1τ )= U ε ( 1 τ )~ U ε ( n k 1 ) ( nτ k 1 ) γ R ,asn (2.11)

To obtain an estimate of Q ε ( 1τ ) , we need to estimate γ R and U ε ( n k 1 ) . A suitable estimator for U ε ( n/ k 1 ) is given by ε ^ n k 1 ,n , commonly referred to as the intermediate order statistic de Haan & Ferreira [10]. For estimation of γ R >0 , we use

γ ^ R = γ n ( α ) ( k 1 )= { M n ( α ) ( k 1 ) Γ( α+1 ) } 1 α (2.12)

with α>0 (Gomes and Martins 2001; Segers 2001), where Γ( ) is the gamma function and

(2.13)

By substituting ε ^ n k 1 ,n and γ ^ R into equation (2.11), the following estimate of Q ε ( 1τ ) can be obtained:

Q ^ ε ( 1τ )= ε ^ n k 1 ,n ( nτ k 1 ) γ ^ R (2.14)

By Proposition 4.1 of Pan, Leng, and Hu (2013) [11], we have

lim τ0 E[ ε|ε> Q ε ( 1τ ) ] Q ε ( 1τ ) = 1 1 γ R (2.15)

Since τ is close to 0, the estimation of E[ ε|ε> Q ε ( 1τ ) ] is

E ^ [ ε|ε> Q ε ( 1τ ) ]= Q ^ ε ( 1τ ) 1 γ ^ R (2.16)

Estimation of the left tail proceeds in the same way as what is done for the right tail. Note that U ε ( 1/τ )= Q ε ( τ ) . Therefore, estimation of Q ε ( τ ) is equivalent to estimation of U ε ( 1/τ ) . Then, for positive integers k 2 , it satisfies k 2 and k 2 /n 0 as n , following similar arguments leading to (2.14) and (2.16), we obtain the estimator

Q ^ ε ( τ )= ε ^ d n + k 2 ,n ( nτ k 2 ) γ ^ L

for Q ε ( τ ) , and the estimator

E ^ [ | ε ||ε< Q ε ( τ ) ]= Q ^ ε ( τ ) 1 γ ^ L

for E[ | ε ||ε< Q ε ( τ ) ] , where γ ^ L is estimator of γ L based on { ε ^ i } , defined as

γ ^ L = γ n ( α ) ( k 2 )= { M n ( α ) ( k 2 ) Γ( α+1 ) } 1 α

and

M n ( α ) ( k 2 )= 1 k 2 i=0 k 2 ( log ε ^ i+ d n ,n ε ^ k 2 + d n ,n ) α = 1 k 2 i=0 k 2 ( log ε ^ i+ d n ,n ε ^ k 2 + d n ,n ) α

Plugging the above estimators into (2.4)-(2.7), we have estimators of the risk measures

U-CVaR ˜ ( τ )=m( A ˜ n , β ^ )+σ( A ˜ n , β ^ ) Q ^ ε ( 1τ ), (2.17)

U-CES ˜ ( τ )=m( A ˜ n , β ^ )+σ( A ˜ n , β ^ ) E ^ [ ε|ε> Q ε ( 1τ ) ], (2.18)

D-CVaR ˜ ( τ )=m( A ˜ n , β ^ )σ( A ˜ n , β ^ ) Q ^ ε ( τ ), (2.19)

and

D-CES ˜ ( τ )=m( A ˜ n , β ^ )σ( A ˜ n , β ^ ) E ^ [ ε|ε< Q ε ( τ ) ]. (2.20)

And apparently, we have estimators of the relative risk measures

R-CVaR ˜ ( τ )= U-CVaR ˜ ( τ ) D-CVaR ˜ ( τ ) and R-CES ˜ ( τ )= U-CES ˜ ( τ ) D-CES ˜ ( τ ) . (2.21)

3. Asymptotic Theory

3.1. Assumptions

Assumption 3.1. The estimator β ^ of β 0 satisfies β ^ β 0 = O p ( n υ 0 /2 ) for some positive υ 0 .

Assumption 3.2. Let B 0 be a neighborhood of β 0 .

(i) sup β B 0 m( A n , β 0 )= O p ( 1 ) .

(ii) inf β B 0 σ( A t1 ,β )>c for some c>0 for all t= d n ,,n+1 .

(iii) Both m( A t1 ,β ) and σ( A t1 ,β ) are differentiable with respect to β in B 0 for all t= d n ,,n+1 .

(iv) E[ sup β B 0 m( A t1 ,β ) β υ 1 ]< and E[ sup β B 0 σ( A t1 ,β ) β υ 1 ]< for some υ 1 >2/ υ 0 for all t= d n ,,n+1 , where υ 0 is defined in Assumption 3.1.

Assumption 3.3.

(i) For each β B 0 , m( A ˜ t1 ,β ) and σ( A ˜ t1 ,β ) are measurable with respect to A t1 .

(ii) sup β B 0 | m( A ˜ n ,β )m( A n ,β ) |= O p ( n υ 0 /2 ) and sup β B 0 | σ( A ˜ n ,β )σ( A n ,β ) |= O p ( n υ 0 /2 ) , where υ 0 is defined in Assumption 3.1.

(iii) t= d n n E[ sup β B 0 | m( A ˜ t1 ,β )m( A t1 ,β ) | ] =o( 1 ) and t= d n n E[ sup β B 0 | σ( A ˜ t1 ,β )σ( A t1 ,β ) | ] =o( 1 ) .

Assumption 3.4.

(i) There exist ρ R <0 and a function A R ( ) which is eventually positive or negative with lim x A R ( x )=0 such that

lim x U ε ( xs ) U ε ( x ) s γ R A R ( x ) = s γ R s ρ R 1 ρ R , for all s>0 ,

where k 1 1/2 A R ( n/ k 1 )0 as n .

(ii) There exist ρ L <0 and a function A L ( ) which is eventually positive or negative with lim x A L ( x )=0 such that

lim x U ε ( xs ) U ε ( x ) s γ L A L ( x ) = s γ L s ρ L 1 ρ L , for all s>0 ,

where k 2 1/2 A L ( n/ k 2 )0 as n .

Assumption 3.5.

(i) τ l τ u satisfies τ l 0 as n and τ u =C τ l for some constant C1 .

(ii) There exist two constants a 0 >0 and a 1 >0 such that lim n k 1 / k 2 = a 0 and lim n n τ l / k 1 = a 1 .

(iii) lim n k 1 1/2 log( n τ l / k 1 )=0 and k 1 =o( n δ 0 ) for some 0< δ 0 < υ 0 , where υ 0 is defined in Assumption 3.1.

iv) d n =o( k 1 1/2 ) .

3.2. Scenarios of Asymptotics

Our theoretical findings are grounded in the following three propositions from Proposition 3.1 and 3.2 of Li et al. [2].

Proposition 3.1. Under Assumptions 2.1 and 3.1 - 3.5, we have, uniformly in τ[ τ l , τ u ] ,

U-CVaR ˜ ( τ ) U-CVaR( τ ) 1= Q ^ ε ( 1τ ) Q ε ( 1τ ) 1+ o p ( k 1 1/2 log( nτ/ k 1 ) ),

D-CVaR ˜ ( τ ) D-CVaR( τ ) 1= Q ^ ε ( τ ) Q ε ( τ ) 1+ o p ( k 1 1/2 log( nτ/ k 1 ) ),

U-CES ˜ ( τ ) U-CES( τ ) 1= E ^ [ ε> Q ε ( 1τ ) ] E[ ε> Q ε ( 1τ ) ] 1+ o p ( k 1 1/2 log( nτ/ k 1 ) ),

and

D-CES ˜ ( τ ) D-CES( τ ) 1= E ^ [ ε< Q ε ( τ ) ] E[ ε< Q ε ( τ ) ] 1+ o p ( k 1 1/2 log( nτ/ k 1 ) ).

Proposition 3.2. Under Assumptions 2.1 and 3.1 - 3.5, we have, uniformly in τ[ τ l , τ u ] ,

Q ^ ε ( 1τ ) Q ε ( 1τ ) 1=[ ε ^ n k 1 ,n U ε ( n/ k 1 ) 1 ]+log( k 1 nτ )( γ ^ R γ R )+ o p ( k 1 1/2 log( nτ/ k 1 ) ),

Q ^ ε ( τ ) Q ε ( τ ) 1=[ ε ^ k 2 + d n ,n U ε ( n/ k 2 ) 1 ]+log( k 2 nτ )( γ ^ L γ L )+ o p ( k 1 1/2 log( nτ/ k 1 ) ),

E ^ [ ε> Q ε ( 1τ ) ] E[ ε> Q ε ( 1τ ) ] 1=[ ε ^ n k 1 ,n U ε ( n/ k 1 ) 1 ]+[ log( k 1 nτ )+ 1 1 γ R ]( γ ^ R γ R ) + o p ( k 1 1/2 log( nτ/ k 1 ) ),

and

E ^ [ ε< Q ε ( τ ) ] E[ ε< Q ε ( τ ) ] 1=[ ε ^ k 2 + d n ,n U ε ( n/ k 2 ) 1 ]+[ log( k 2 nτ )+ 1 1 γ L ]( γ ^ L γ L ) + o p ( k 1 1/2 log( nτ/ k 1 ) ).

Proposition 3.3. Under Assumptions 2.1 and 3.1 - 3.5, as n ,

( k 1 1/2 γ R 1 [ ε ^ n k 1 ,n / U ε ( n/ k 1 ) 1 ] k 1 1/2 γ R 1 V ˜ 1/2 ( α )( γ ^ R γ R ) k 2 1/2 γ L 1 [ ε ^ k 2 + d n ,n / U ε ( n/ k 2 ) 1 ] k 2 1/2 γ L 1 V ˜ 1/2 ( α )( γ ^ L γ L ) )

is asymptotically four-dimensional standard normal where V ˜ ( α )= 1 α 2 [ Γ( 2α+1 ) Γ 2 ( α+1 ) 1 ] .

Proof. Let ε 1 ,, ε n be i.i.d. random variables satisfying Assumptions 3.4(i) and (ii). Define

γ ^ ε,R = { k 1 1 i=0 k 1 [ log( ε ni:n / ε n k 1 :n ) ] α Γ( α+1 ) } 1 α , γ ^ ε,L = { k 2 1 i=0 k 2 [ log( ε i+1:n / ε k 2 +1:n ) ] α Γ( α+1 ) } 1 α .

By Lemma 1.5 in the supplementary material of Li, Peng and Song [2],

( k 1 1/2 γ R 1 ( ε n k 1 :n / U ε ( n/ k 1 ) 1 ) k 2 1/2 γ L 1 ( ε k 2 +1:n / U ε ( n/ k 2 ) 1 ) ) D N( 0, I 2 ),

and the two components are asymptotically independent. Gomes and Martins [6] proved that for any α>0 ,

k 1 1/2 ( γ ^ ε,R γ R ) D N( 0, γ R 2 V ˜ ( α ) ), k 2 1/2 ( γ ^ ε,L γ L ) D N( 0, γ L 2 V ˜ ( α ) ).

Therefore, to obtain the joint convergence of the four-dimensional vector, it suffices to establish the asymptotic independence among the four components.

Using the probability integral transformation, set U i = F ε ( ε i ) ; then U i ~U( 0,1 ) are independent. Define the Pareto variables ζ i =1/ ( 1 U i ) , which are i.i.d. with distribution F ζ ( y )=11/y ( y1 ) , and we have ε i = U ε ( ζ i ) , where U ε ( t )= Q ε ( 11/t ) . The order statistics satisfy ε i:n = U ε ( ζ i:n ) . For the left tail, let V i = F ε ( ε i )=1 U i ; then ε i = U ε ( 1/ ( 1 V i ) ) and ε i:n = U ε ( ζ i:n ) with ζ i:n =1/ ( 1 V i:n ) .

By Rényi’s representation [12], there exist i.i.d. Exp( 1 ) random variables E 1 ,, E n such that

ζ i:n = d n E 1 ++ E ni+1 ,i=1,,n.

Consequently,

ζ n k 1 :n = d n S k 1 +1 , S k 1 +1 = E 1 ++ E k 1 +1 ,

and the ratios

ζ ni:n ζ n k 1 :n = d S k 1 +1 S k 1 +1i ,i=1,, k 1 ,

depend only on E 1 ,, E k 1 and are independent of ζ n k 1 :n (because ζ n k 1 :n also depends on E k 1 +1 ). Similarly, for the left tail, ζ k 2 +1:n depends on E n k 2 ,, E n . Since k 1 + k 2 <n for sufficiently large n , the sets { E 1 ,, E k 1 +1 } and { E n k 2 ,, E n } are disjoint; hence the right-tail block ( ζ n k 1 :n , { ζ ni:n / ζ n k 1 :n } i=1 k 1 ) and the left-tail block ( ζ k 2 +1:n , { ζ i:n / ζ k 2 +1:n } i=1 k 2 ) are independent.

Notice that γ ^ ε,R depends only on { log( ζ ni:n / ζ n k 1 :n ) } i=1 k 1 , so γ ^ ε,R is independent of ζ n k 1 :n . Therefore,

k 1 1/2 γ R 1 ( ε n k 1 :n / U ε ( n/ k 1 ) 1 )and k 1 1/2 γ R 1 V ˜ 1/2 ( α )( γ ^ ε,R γ R )

are asymptotically independent. The same holds for the two standardized statistics on the left tail, and the left and right tails are independent of each other. Combining marginal asymptotic normality with the Cramér-Wold theorem yields

( k 1 1/2 γ R 1 ( ε n k 1 :n / U ε ( n/ k 1 ) 1 ) k 1 1/2 γ R 1 V ˜ 1/2 ( α )( γ ^ ε,R γ R ) k 2 1/2 γ L 1 ( ε k 2 +1:n / U ε ( n/ k 2 ) 1 ) k 2 1/2 γ L 1 V ˜ 1/2 ( α )( γ ^ ε,L γ L ) ) D N( 0, I 4 ).

Now consider the standardized residuals ε ^ t defined in the proposition. By Lemma S1.9(ii) in the supplementary material of Li, Peng and Song [2],

ε ^ ( k 1 ) = ε ( k 1 ) + o p ( k 1 1/2 ), γ ^ R = γ ^ ε,R + o p ( k 1 1/2 ),

and analogous relations hold for the left tail. Hence, replacing the true residuals with the standardized residuals changes each component of the four-dimensional vector by o p ( 1 ) , so the limiting distribution remains unchanged.

Moreover, the left-tail quantile in the proposition uses ε ^ k 2 + d n ,n , whereas the lemma uses ε k 2 +1,n . By Assumption 3.5(iv) and the fact that k 2 is of the same order as k 1 , we have d n =o( min( k 1 1/2 , k 2 1/2 ) ) , thus

k 2 1/2 ( ε ^ k 2 + d n ,n ε ^ k 2 +1,n )= o p ( 1 ),

so replacing k 2 +1 with k 2 + d n does not affect the asymptotic distribution. This completes the proof of Proposition 3. □

3.3. Main Results

The following theorem establishes the uniform convergence of the maximum absolute log-ratios under the intermediate scenario a 1 >0 .

Theorem 3.1. Suppose that Assumptions 2.1 and 3.1 - 3.5 hold. As n ,

sup u[ 1,C ] | k 1 1/2 { log[ type-CVaR ˜ ( u τ l ) type-CVaR( u τ l ) ] } | sup u[ 1,C ] | G 1,type ( u ) | and

sup u[ 1,C ] | k 1 1/2 { log[ type-CES ˜ ( u τ l ) type-CES( u τ l ) ] } | sup u[ 1,C ] | G 2,type ( u ) |

in distribution, where G 1,type ( u ) and G 2,type ( u ) are centered Gaussian processes with variance-covariance functions γ 1,type ( u 1 , u 2 )=Cov( G 1,type ( u 1 ), G 1,type ( u 2 ) ) and γ 2,type ( u 1 , u 2 )=Cov( G 2,type ( u 1 ), G 2,type ( u 2 ) ) satisfying that

γ 1,type ( u 1 , u 2 )={ γ R 2 [ 1+ V ˜ ( α )log( a 1 u 1 )log( a 1 u 2 ) ], iftype=U, a 0 γ L 2 [ 1+ V ˜ ( α )log( a 0 a 1 u 1 )log( a 0 a 1 u 2 ) ], iftype=D, γ R 2 [ 1+ V ˜ ( α )log( a 1 u 1 )log( a 1 u 2 ) ] + a 0 γ L 2 [ 1+ V ˜ ( α )log( a 0 a 1 u 1 )log( a 0 a 1 u 2 ) ], iftype=R.

and

γ 2,type ( u 1 , u 2 ) ={ γ R 2 { 1+ V ˜ ( α )[ ( 1 γ R ) 1 log( a 1 u 1 ) ][ ( 1 γ R ) 1 log( a 1 u 2 ) ] }, iftype=U, a 0 γ L 2 { 1+ V ˜ ( α )[ ( 1 γ L ) 1 log( a 0 a 1 u 1 ) ][ ( 1 γ L ) 1 log( a 0 a 1 u 2 ) ] }, iftype=D, γ R 2 { 1+ V ˜ ( α )[ ( 1 γ R ) 1 log( a 1 u 1 ) ][ ( 1 γ R ) 1 log( a 1 u 2 ) ] } + a 0 γ L 2 { 1+ V ˜ ( α )[ ( 1 γ L ) 1 log( a 0 a 1 u 1 ) ][ ( 1 γ L ) 1 log( a 0 a 1 u 2 ) ] }, iftype=R.

Proof. For type{ U } ,

F U ( u )= k 1 1/2 { log[ U-CVaR ˜ ( u τ l ) U-CVaR( u τ l ) ] } = k 1 1/2 ( U-CVaR ˜ ( u τ l ) U-CVaR( u τ l ) 1 )+ o p ( 1 ) = k 1 1/2 ( Q ˜ ε ( 1uτ ) Q ε ( 1uτ ) 1 )+ o p ( 1 ) = k 1 1/2 [ ε ^ n k 1 ,n U ε ( n/ k 1 ) 1 ]+[ log( k 1 nτ )log( u ) ] k 1 1/2 ( γ ^ R γ R )+ o p ( 1 )

For any u 1 ,, u m [ 1,C ] and fixed m , by Lemma S1.11 in the supplementary material of Li et al. [2], Proposition 3 and the continuous mapping theorem, ( F U ( u 1 ),, F U ( u m ) ) converges weakly to ( G 1,U ( u 1 ),, G 1,U ( u m ) ) . Let X 1 = k 1 1/2 [ ε ^ n k 1 ,n U ε ( n/ k 1 ) 1 ] , Y 1 =[ log( k 1 nτ )log( u 1 ) ] k 1 1/2 ( γ ^ R γ R ) , Y 2 =[ log( k 1 nτ )log( u 2 ) ] k 1 1/2 ( γ ^ R γ R ) . Then

Cov( G 1,U ( u 1 ), G 1,U ( u 2 ) )= γ R 2 ( 1+ V ˜ ( α )log( a 1 u 1 )log( a 1 u 2 ) ).

For type{ D } ,

F D ( u )= k 1 1/2 { log[ D-CVaR ˜ ( u τ l ) D-CVaR( u τ l ) ] } = k 1 1/2 ( D-CVaR ˜ ( u τ l ) D-CVaR( u τ l ) 1 )+ o p ( 1 ) = k 1 1/2 ( Q ˜ ε ( uτ ) Q ε ( uτ ) 1 )+ o p ( 1 ) = k 1 1/2 k 2 1/2 { k 2 1/2 [ ε ^ k 2 + d n ,n U ε ( n/ k 2 ) 1 ]+[ log( k 2 nτ )log( u ) ] k 2 1/2 ( γ ^ L γ L ) }+ o p ( 1 )

Cov( G 1,D ( u 1 ), G 1,D ( u 2 ) )= a 0 γ L 2 ( 1+ V ˜ ( α )log( a 0 a 1 u 1 )log( a 0 a 1 u 2 ) ).

For type{ R } ,

F R ( u )= k 1 1/2 { log[ R-CVaR ˜ ( u τ l ) R-CVaR( u τ l ) ] } = k 1 1/2 { log[ U-CVaR ˜ ( u τ l ) U-CVaR( u τ l ) ]log[ D-CVaR ˜ ( u τ l ) D-CVaR( u τ l ) ] }+ o p ( 1 ) = k 1 1/2 [ ε ^ n k 1 ,n U ε ( n/ k 1 ) 1 ]+[ log( k 1 nτ )log( u ) ] k 1 1/2 ( γ ^ R γ R ) k 1 1/2 k 2 1/2 { k 2 1/2 [ ε ^ k 2 + d n ,n U ε ( n/ k 2 ) 1 ]+[ log( k 2 nτ )log( u ) ] k 2 1/2 ( γ ^ L γ L ) }+ o p ( 1 )

Because the right- and left-tail components are asymptotically independent,

Cov( G 1,R ( u 1 ), G 1,R ( u 2 ) )= γ R 2 ( 1+ V ˜ ( α )log( a 1 u 1 )log( a 1 u 2 ) ) + a 0 γ L 2 ( 1+ V ˜ ( α )log( a 0 a 1 u 1 )log( a 0 a 1 u 2 ) ).

The proof method of CES is similar to that of CVaR, and the proof is omitted here. □

For the intermediate scenario a 1 >0 , the limiting distribution is a non-degenerate Gaussian process with a complicated covariance structure (Theorem 3.1). Direct computation of critical values is therefore difficult, and we instead employ the bootstrap method described in Section 4.

The results of this section extend the pointwise inference procedures of Chan et al. [8] and Hoga [9] to the joint inference setting, under the intermediate scenario that has been studied by Martins-Filho et al. [13] among others for pointwise estimation. Our simultaneous SCBs provide inference over the whole tail interval.

4. Bootstrap Implementation

Although Theorem 3.1 provides the limiting distributions of the maximum absolute log-ratio, two major difficulties arise when applying these theorems to construct simultaneous confidence bands (SCBs) in practice. First, because the effective sample sizes k 1 , k 2 are small relative to the total sample size n and the tail level τ approaches zero, the convergence rate of the maximum absolute log-ratio is slow. As a result, theoretical SCBs directly derived from Theorem 3.1 may exhibit severely distorted coverage probabilities in finite samples. Second, the limiting distribution is a complicated Gaussian process whose covariance structure heavily depends on the underlying model and is difficult to approximate directly. To overcome these difficulties, this paper adopts the bootstrap method proposed by Li et al. [2] for finite-sample inference.

Proposition 4.1. Under Assumptions 2.1 and 3.1-3.5, the generalized moment estimators admit the linear expansions

γ ^ R γ R = H R ( α )+ o p ( k 1 1/2 ), γ ^ L γ L = H L ( α )+ o p ( k 2 1/2 ),

where

H R ( α )= 1 αΓ( α+1 ) γ R α1 ( M n,R ( α ) ( k 1 )Γ( α+1 ) γ R α ) = 1 αΓ( α+1 ) γ R α1 ( 1 k 1 t= d n n I( ε t > ε n k 1 ,n ) ( log ε t ε n k 1 ,n ) α Γ( α+1 ) γ R α ), (4.1)

and

H L ( α )= 1 αΓ( α+1 ) γ L α1 ( M n,L ( α ) ( k 2 )Γ( α+1 ) γ L α ) = 1 αΓ( α+1 ) γ L α1 ( 1 k 2 t= d n n I( ε t < ε k 2 + d n ,n ) ( log ε t ε k 2 + d n ,n ) α Γ( α+1 ) γ L α ). (4.2)

Proof. We only prove the case for the right tail; the proof for the left tail is completely analogous. According to Theorem 4.1 of Segers [7], under Assumptions 2.1 and 3.1-3.5, the sample moment M n,R ( α ) ( k 1 ) satisfies the following asymptotic normality:

k 1 ( M n,R ( α ) ( k 1 )Γ( α+1 ) γ R α ) d N( 0, σ 2 ( γ R ,α ) ),

where σ 2 ( γ R ,α ) is the asymptotic variance; its explicit form can be found in Segers [7] or de Haan & Ferreira [10]. This result implies

M n,R ( α ) ( k 1 )Γ( α+1 ) γ R α = O p ( k 1 1/2 ).

Consider γ ^ R as a differentiable function of M n,R ( α ) ( k 1 ) : define

g( t )= ( t Γ( α+1 ) ) 1/α ,t>0.

From (2.14), γ ^ R =g( M n,R ( α ) ( k 1 ) ) . Expanding g at the true value t 0 =Γ( α+1 ) γ R α using a first-order Taylor expansion gives

γ ^ R γ R =g( M n,R ( α ) ( k 1 ) )g( t 0 )= g ( t 0 )( M n,R ( α ) ( k 1 ) t 0 )+ R n ,

where the remainder satisfies R n = o p ( | M n,R ( α ) ( k 1 ) t 0 | ) . Since M n,R ( α ) ( k 1 ) t 0 = O p ( k 1 1/2 ) , we have R n = o p ( k 1 1/2 ) .

Compute the derivative:

g ( t )= 1 α ( t Γ( α+1 ) ) 1 α 1 1 Γ( α+1 ) = 1 αΓ( α+1 ) ( t Γ( α+1 ) ) 1 α 1 .

Evaluating at t= t 0 yields

g ( t 0 )= 1 αΓ( α+1 ) ( Γ( α+1 ) γ R α Γ( α+1 ) ) 1 α 1 = 1 αΓ( α+1 ) ( γ R α ) 1 α 1 = 1 αΓ( α+1 ) γ R 1α .

Therefore,

γ ^ R γ R = 1 αΓ( α+1 ) γ R α1 ( M n,R ( α ) ( k 1 )Γ( α+1 ) γ R α )+ o p ( k 1 1/2 ).

This is exactly the definition of H R ( α ) . For the left tail, we replace ε t by ε t and symmetrically adjust the order statistics indicators to obtain the expression for H L ( α ) . This completes the proof of the proposition. □

Proposition 4.1 provides a linear expansion for the generalized moment estimator that is structurally identical to that of the Hill estimator (up to a deterministic factor). The multiplier bootstrap consistency theorem of Li et al. [2] (Theorem 4.1) relies only on such a linear representation and on the independence between the summands of the left- and right-tail expansions; therefore, it applies directly to the present setting. The only difference is the presence of the factor αΓ( α+1 ) γ R α1 (resp. γ L ) in the influence function; this factor is consistently estimated by replacing γ R with γ ^ R , and the bootstrap weights in (4.3)-(4.4) are constructed accordingly. Consequently, the bootstrap procedure described below yields asymptotically valid simultaneous confidence bands for the intermediate scenario.

Following the idea of the multiplier bootstrap in Li et al. [2], we use the linear expansion and the asymptotic independence of the left- and right-tail estimators

(Proposition 3) to approximate the uncertainty characterised by γ ^ R γ R and γ ^ L γ L . Specifically, assume the existence of two independent multiplier sequences { ξ t } t= d n n and { ν t } t= d n n consisting of i.i.d. random variables with zero mean, unit variance, and bounded support, independent of the original data. By multiplying the sums in equations (4.1) and (4.2) by { ξ t } t= d n n and { ν t } t= d n n , respectively, we obtain the corresponding bootstrap approximations:

H R ( α ) * = 1 αΓ( α+1 ) γ ^ R α1 ( 1 k 1 t= d n n ( I( ε ^ t > ε ^ n k 1 ,n ) ( log ε ^ t ε ^ n k 1 ,n ) α Γ( α+1 ) γ ^ R α ) ξ t ), (4.3)

and

H L ( α ) * = 1 αΓ( α+1 ) γ ^ L α1 ( 1 k 2 t= d n n ( I( ε ^ t < ε ^ k 2 + d n ,n ) ( log ε ^ t ε ^ k 2 + d n ,n ) α Γ( α+1 ) γ ^ L α ) ν t ). (4.4)

We now present the bootstrap inference procedure for the scenario a 1 >0 . Under Assumptions 2.1 and 3.1 - 3.5, for any type type{ U,D,R } , the proof of Theorem 3.1 yields the following asymptotic expansions:

k 1 1/2 log[ type-CVaR ˜ ( τ ) type-CVaR( τ ) ] =I( type{ U,R } )[ log( k 1 / ( nτ ) ) k 1 1/2 ( γ ^ R γ R )+ X R ] I( type{ D,R } ){ ( k 1 / k 2 ) 1/2 [ log( k 2 / ( nτ ) ) k 2 1/2 ( γ ^ L γ L )+ X L ] }+ o p ( 1 ),

and

k 1 1/2 log[ type-CES ˜ ( τ ) type-CES ( τ ) ] =I( type{ U,R } ){ [ log( k 1 / ( nτ ) )+ ( 1 γ R ) 1 ] k 1 1/2 ( γ ^ R γ R )+ X R } I( type{ D,R } ){ ( k 1 / k 2 ) 1/2 [ log( k 2 / ( nτ ) )+ ( 1 γ L ) 1 ] k 2 1/2 ( γ ^ L γ L )+ X L } + o p ( 1 ),

where τ[ τ l , τ u ] ; X R ~N( 0, γ R 2 ) , X L ~N( 0, γ L 2 ) , and X R and X L are independent; X R and X L are independent of γ ^ R γ R and γ ^ L γ L .

We therefore independently draw random samples X R * and X L * from normal distributions with zero mean and variances γ ^ R 2 and γ ^ L 2 , respectively, and independent of the sequences { ξ t } t= d n n and { ν t } t= d n n .

L type-CVaR ( τ ) =I( type{ U,R } )[ log( k 1 / ( nτ ) ) k 1 1/2 H R ( α ) * + X R * ] I( type{ D,R } ){ ( k 1 / k 2 ) 1/2 [ log( k 2 / ( nτ ) ) k 2 1/2 H L ( α ) * + X L * ] }, (4.5)

where H R ( α ) * and H L ( α ) * are defined in (4.3) and (4.4).

L type-CVaR ( τ ) is used to estimate k 1 1/2 { log[ type-CVaR ˜ ( τ )/ type-CVaR( τ ) ] } .

Similarly, for CES we have

L type-CES ( τ ) =I( type{ U,R } ){ [ log( k 1 / ( nτ ) )+ ( 1 γ ^ R ) 1 ] k 1 1/2 H R ( α ) * + X R * } I( type{ D,R } ) ( k 1 / k 2 ) 1/2 { [ log( k 2 / ( nτ ) )+ ( 1 γ ^ L ) 1 ] k 2 1/2 H L ( α ) * + X L * }. (4.6)

L type-CES ( τ )isusedtoestimate k 1 1/2 { log[ type-CES ˜ ( τ )/ type-CES( τ ) ] }.

Bootstrap Algorithm under a 1 >0

1) Model specification and residual extraction

Choose an appropriate dynamic model and estimate it to obtain the residual series { ε ^ t } . Compute the tail index estimates γ ^ R and γ ^ L , as well as the maximum absolute log-ratios defined in (2.8) and (2.9).

2) Generate random perturbations and construct statistics

Generate independent i.i.d. random sequences { ξ t } and { ν t } from a distribution with zero mean and unit variance, and compute H R ( α ) * and H L ( α ) * . Then draw X R * and X L * from normal distributions with zero mean and variances γ ^ R 2 and γ ^ L 2 , respectively. For τ[ τ l , τ u ] , compute L type-CVaR ( τ ) and L type-CES ( τ ) .

3) Resampling to build empirical quantiles

Take a sufficiently large integer B , repeat step 2 B times to obtain { L type-CVaR ( τ ) } b=1 B and { L type-CES ( τ ) } b=1 B . Then, for a prescribed significance level α( 0,1 ) , compute c type,1α 1 and c type,1α 2 , which are the ( 1α ) sample quantiles of { sup τ[ τ l , τ u ] | L type-CVaR ( τ ) | } b=1 B and { sup τ[ τ l , τ u ] | L type-CES ( τ ) | } b=1 B , respectively.

4) Construct asymptotic simultaneous confidence bands (SCBs)

For type{ U,D,R } , the ( 1α ) asymptotic SCBs for type-CVaR( τ ) and type-CES( τ ) are respectively:

  • Confidence interval for CVaR:

[ type-CVaR ˜ ( τ )exp( c type,1α 1 k 1 1/2 ), type-CVaR ˜ ( τ )exp( c type,1α 1 k 1 1/2 ) ]

  • Confidence interval for CES:

[ type-CES ˜ ( τ )exp( c type,1α 2 k 1 1/2 ), type-CES ˜ ( τ )exp( c type,1α 2 k 1 1/2 ) ]

The validity of this bootstrap method follows from Theorem 4.1 of Li et al. [2], which guarantees that the bootstrap statistic shares the same limiting distribution as the original statistic under the intermediate scenario.

5. Numerical Study

This section first presents a specific criterion for selecting the effective sample sizes k 1 and k 2 to implement our method, and then reports the results of Monte Carlo simulations.

5.1. Data-Driven Selection of k 1 and k 2

The implementation of the proposed method requires choosing the effective sample sizes k 1 and k 2 . Studies on risk measure estimation based on extreme value theory (EVT) have confirmed that the choice of the effective sample size is crucial (e.g., Chan et al. [8]; Martins-Filho et al. [13]). Several empirical suggestions have been made. For instance, when constructing pointwise confidence intervals for

downside CVaR, Chan et al. [8] suggested using 1.5 ( logn ) 2 (where denotes the integer part) for a sample size n=1000 . However, this suggestion was based on their simulation experiments with n=1000 , and Spierdijk [14] found that it is no longer suitable for larger sample sizes. Compared with such ad-hoc suggestions, a data-driven rule is more desirable because it selects k 1 and k 2 according to the specific features of the data at hand.

In this section, we adopt the data-driven approach of Li et al. [2] for selecting k 1 and k 2 . They follow the idea of Danielsson et al. [15] and use the maximum distance between the fitted Pareto-type tail and the empirical quantile to measure the approximation quality, choosing the effective sample size that minimises this measure as the optimal one. Since the estimation of conditional value at risk (CVaR) is intrinsically linked to quantile estimation, this quantile-based method is suitable for CVaR estimation. Our estimation procedure relies on a Pareto approximation to the tail of the distribution of ε , and k 1 and k 2 essentially determine where this approximation starts on the right and left tails, respectively. Therefore, it is reasonable to choose the effective sample sizes that optimise the Pareto fit.

Following the ideas of Danielsson et al. [15] and Li et al. [2], for estimating the upper CVaR, k 1 is chosen as

k 1 * =arg min l= k min ,, k max { max j=1,, k max [ | ε ^ nj,n ε ^ nl+1,n ( j/l ) γ ^ R ( l ) | ] }, (5.1)

where 1 k min < k max n , and γ ^ R ( l ) is the estimator of γ R with k 1 =l . Here ε ^ nj,n is the empirical quantile, and ε ^ nl+1,n ( j/l ) γ ^ R is the Pareto-based approximate quantile estimator. Similarly, for estimating the lower CVaR, the effective sample size k 2 is chosen as k 2 * by substituting ε ^ t into (5.1).

For CES estimation, a similar approach based on the tail mean is used to modify formula (5.1). Specifically, when estimating the upper CES, k 1 is chosen as

k 1 * =arg min l= k min ,, k max { max j=1,, k max [ | t= d n n I( ε ^ t > ε ^ nj,n ) ε ^ t t= d n n I( ε ^ t > ε ^ nj,n ) ε ^ nl+1,n ( j/l ) γ ^ R ( l ) 1 γ ^ R ( l ) | ] }, (5.2)

where t= d n n I( ε ^ t > ε ^ nj,n ) ε ^ t t= d n n I( ε ^ t > ε ^ nj,n ) is the empirical tail mean at the ( 1j/n ) -quantile, and ε ^ ( l ) ( j/l ) γ ^ R ( l ) 1 γ ^ R ( l ) is the tail mean estimator based on the Pareto approximation. Similarly, for estimating the lower CES, the effective sample size k 2 is chosen as k ^ 2 * by replacing { ε ^ t } with { ε ^ t } in formula (5.2).

Finally, it should be noted that Assumptions 3.5(ii) and (iii) impose constraints on the selection of k 1 and k 2 . We now provide specific suggestions that satisfy these conditions. First, k 1 and k 2 are both taken from the same interval [ k min , k max ] , which ensures the comparability required by Assumption 3.5(ii). Second, in the case a 1 >0 , k 1 and k 2 should be comparable to nτ . To this end, we set k min =an τ u and k max =bn τ u with 0<a<b . For example, if the tail interval is [ 0.5%,1% ] , we may take k min =2%×n and k max =15%×n , corresponding to a=2 and b=15 . Moreover, this choice of k max means that at most 15% of the sample is used, satisfying Assumption 3.5(iii) that k max is small relative to n υ 0 with υ 0 typically equal or close to 1. Under the above selection rules, k 1 1/2 is typically larger than | log( n τ l / k 1 ) | , so the limiting condition lim n k 1 1/2 log( n τ l / k 1 )=0 in Assumption 3.5(iii) holds automatically.

In practice, the simulation results in Section 5.2 demonstrate that the performance of the SCBs is highly robust to the choice of α . Hence, the user may simply fix α=1 , which recovers the classical Hill estimator and avoids additional tuning. If a small improvement in efficiency is desired, any value in [ 0.5,2 ] yields similar coverage and length. The effective sample sizes k 1 and k 2 selected by the data-driven procedure above are then used for both CVaR and CES estimation; that is, the same k 1 (resp. k 2 ) is employed for the right-tail (resp. left-tail) risk measures. This ensures that the risk measures are based on the same tail subsample and facilitates coherent joint inference.

5.2. Monte Carlo Simulations

This section evaluates the finite-sample performance of the proposed method through a series of Monte Carlo simulations. To facilitate the comparison of model performance after changing the extreme value index, we follow the simulation design of Li et al. [2]. In the bootstrap implementation, the number of bootstrap replications is set to B=1000 , and the multipliers are drawn from a

two-point distribution with P( ξ=1 )=P( ξ=1 )=1/2 . The confidence level is fixed at 95%. The number of discarded observations is defined as d n = 5× ( n τ l ) 1/3 , which satisfies d n =o( k 1 1/2 ) to ensure Assumption 3.5 holds. Note that in the case a 1 >0 , k 1 is of the same order as n τ l . Therefore, setting d n = 5× ( n τ l ) 1/3 satisfies the required order conditions for d n . All simulation results reported are based on 1000 independent replications.

The data are generated from a GARCH(1,1) model:

R t = σ t ε t , σ t 2 =ω+ ω 1 R t1 2 + ω 2 σ t1 2 , (5.3)

with ω=0.001 , ω 1 =0.04 , ω 2 =0.85 . The innovations ε t ~sstd( ν,λ ) ; see Fernández and Steel [16], where the distribution is characterised by a shape parameter ν and a skewness parameter λ=1 .

We compare the finite-sample performance of simultaneous confidence bands (SCBs). The tail interval is [ 0.5%,1% ] and the sample sizes are n{ 500,1000,1500 } . The effective sample sizes k 1 and k 2 are selected using the data-driven method described in Section 5.1. We set k min =2%×n and k max =15%×n ; The confidence level is 95%, and the relative length is defined as the ratio of the upper bound to the lower bound of the SCBs.

In terms of parameter robustness, the choice of the moment order α has no significant impact on the performance of the proposed method. Across all sample sizes and risk measure specifications, the variation in coverage probabilities with respect to α does not exceed 0.05; notably, the variation in coverage probability for the core focus, the relative risk measure R-CVaR, is less than 0.015. Meanwhile, the variation in the relative length of confidence bands with respect to α is less than 0.03 for all specifications. This result verifies the robustness of the generalized moment-based tail index estimator, indicating that the proposed method does not require complex parameter tuning for α and exhibits strong practical applicability.

Regarding large-sample asymptotic properties, the experimental results are fully consistent with the theoretical conclusions of Theorem 3.1 in this paper. As the sample size increases from 500 to 1500, the coverage probabilities of all risk measures converge consistently towards the 95% nominal confidence level. Specifically, the average coverage probability of R-CVaR converges gradually from 0.957 to 0.948, and its deviation from the nominal level narrows from 0.007 to 0.002; the over-coverage issue of R-CES is also continuously alleviated as the sample size increases. Meanwhile, the relative length of the confidence bands decreases monotonically as the sample size grows. This behavior is consistent with the k 1 1/2 rate implied by the asymptotic theory, since the effective tail sample size k 1 increases with n . The average relative length of R-CVaR decreases from 2.045 to 1.521, representing a 25.6% reduction, while that of R-CES decreases from 3.111 to 1.970, a 36.7% reduction, indicating a substantial improvement in the estimation precision of the method for large samples.

Figure 1. Relationship between CVaR, CES coverage and α with sample sizes of 500, 1000, and 1500.

Figure 2. Relationship of relative lengths of CVaR and CES versus α for sample sizes of 500, 1000, and 1500.

Table 1. Coverage and relative length under different values of α ( n=500 , ε t ~sstd( 5,1 ) ).

α

Coverage of CVaR

Coverage of CES

Relative length of CVaR

Relative length of CES

(lr)2-4 (lr)5-7 (lr)8-10 (lr)11-13

U

D

R

U

D

R

U

D

R

U

D

R

0.5

0.876

0.858

0.960

0.931

0.941

0.973

1.646

1.640

2.046

2.191

2.180

3.106

0.8

0.891

0.867

0.953

0.933

0.928

0.966

1.646

1.640

2.046

2.187

2.184

3.117

1.0

0.858

0.855

0.956

0.928

0.918

0.973

1.646

1.641

2.047

2.205

2.183

3.126

1.2

0.882

0.869

0.966

0.940

0.922

0.980

1.630

1.654

2.043

2.161

2.218

3.117

1.5

0.863

0.862

0.955

0.929

0.920

0.971

1.648

1.635

2.039

2.196

2.180

3.104

2.0

0.860

0.853

0.953

0.932

0.921

0.970

1.647

1.646

2.047

2.179

2.187

3.095

Table 2. Coverage and relative length under different values of α ( n=1000 , ε t ~sstd( 5,1 ) ).

α

Coverage of CVaR

Coverage of CES

Relative length of CVaR

Relative length of CES

(lr)2-4 (lr)5-7 (lr)8-10 (lr)11-13

U

D

R

U

D

R

U

D

R

U

D

R

0.5

0.831

0.842

0.956

0.920

0.915

0.965

1.432

1.427

1.668

1.771

1.759

2.264

0.8

0.862

0.844

0.964

0.930

0.924

0.975

1.425

1.422

1.657

1.758

1.755

2.249

1.0

0.855

0.859

0.956

0.917

0.930

0.968

1.431

1.430

1.668

1.773

1.768

2.274

1.2

0.844

0.863

0.951

0.918

0.922

0.972

1.424

1.427

1.663

1.763

1.765

2.265

1.5

0.844

0.850

0.963

0.913

0.923

0.975

1.424

1.421

1.656

1.763

1.756

2.250

2.0

0.829

0.823

0.950

0.922

0.909

0.969

1.427

1.424

1.659

1.766

1.762

2.261

Table 3. Coverage and relative length under different values of α ( n=1500 , ε t ~sstd( 5,1 ) ).

α

Coverage of CVaR

Coverage of CES

Relative length of CVaR

Relative length of CES

(lr)2-4 (lr)5-7 (lr)8-10 (lr)11-13

U

D

R

U

D

R

U

D

R

U

D

R

0.5

0.852

0.864

0.952

0.921

0.920

0.965

1.348

1.342

1.526

1.615

1.604

1.975

0.8

0.861

0.841

0.946

0.920

0.913

0.946

1.342

1.343

1.522

1.606

1.607

1.971

1.0

0.842

0.835

0.947

0.913

0.916

0.966

1.343

1.342

1.522

1.607

1.607

1.970

1.2

0.847

0.868

0.942

0.911

0.923

0.956

1.341

1.346

1.524

1.604

1.619

1.980

1.5

0.824

0.819

0.952

0.919

0.891

0.968

1.342

1.337

1.519

1.608

1.597

1.966

2.0

0.828

0.834

0.946

0.897

0.900

0.967

1.338

1.336

1.514

1.601

1.599

1.960

In terms of performance across different risk types, the inference performance of the proposed method for relative risk measures is significantly superior to that for one-sided upside and downside risk measures. Across all sample sizes, the coverage probabilities of R-CVaR and R-CES remain stable in the interval [ 0.94,0.98 ] , which is extremely close to the 95% nominal confidence level. In contrast, one-sided upside (U) and downside (D) risks exhibit mild systematic under-coverage. This result is consistent with the theoretical derivation in this paper: relative risk measures incorporate estimation information from both the right and left tails, effectively offsetting the bias in single-tail estimation, making them the core advantageous application scenario of the proposed method. A comparison of different risk measures shows that CES generally outperforms CVaR in terms of coverage accuracy, with coverage probabilities of CES up to 7% higher than those of CVaR in one-sided scenarios. However, since CES, as a tail conditional expectation, inherently has higher estimation uncertainty than quantile-based CVaR, the relative length of its confidence bands is also significantly larger than that of CVaR. The proposed method accurately captures the differences in the statistical properties of the two types of risk measures.

Overall, the trends presented in Figure 1 and Figure 2 are fully consistent with the numerical results in Tables 1-3. The bootstrap simultaneous confidence bands (SCBs) method proposed in this paper exhibits excellent finite-sample performance, strong parameter robustness, and large-sample convergence properties consistent with theoretical expectations, providing a reliable statistical tool for the joint inference of conditional risk measures.

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1] Artzner, P. (1999) Application of Coherent Risk Measures to Capital Requirements in Insurance. North American Actuarial Journal, 3, 11-25.[CrossRef]
[2] Li, S., Peng, L. and Song, X. (2023) Simultaneous Confidence Bands for Conditional Value-at-Risk and Expected Shortfall. Econometric Theory, 39, 1009-1043.[CrossRef]
[3] McNeil, A.J. and Frey, R. (2000) Estimation of Tail-Related Risk Measures for Heteroscedastic Financial Time Series: An Extreme Value Approach. Journal of Empirical Finance, 7, 271-300.[CrossRef]
[4] Hill, B.M. (1975) A Simple General Approach to Inference about the Tail of a Distribution. The Annals of Statistics, 3, 1163-1174.[CrossRef]
[5] Dekkers, A.L.M., Einmahl, J.H.J. and Haan, L.D. (1989) A Moment Estimator for the Index of an Extreme-Value Distribution. The Annals of Statistics, 17, 1833-1855.[CrossRef]
[6] Gomes, M.I. and Martins, M.J. (2001) Generalizations of the Hill Estimator—Asymptotic versus Finite Sample Behaviour. Journal of Statistical Planning and Inference, 93, 161-180.[CrossRef]
[7] Segers, J. (2001) Residual Estimators. Journal of Statistical Planning and Inference, 98, 15-27.[CrossRef]
[8] Hang Chan, N., Deng, S., Peng, L. and Xia, Z. (2007) Interval Estimation of Value-At-Risk Based on GARCH Models with Heavy-Tailed Innovations. Journal of Econometrics, 137, 556-576.[CrossRef]
[9] Hoga, Y. (2019) Confidence Intervals for Conditional Tail Risk Measures in ARMA-GARCH Models. Journal of Business & Economic Statistics, 37, 613-624.[CrossRef]
[10] de Haan, L. and Ferreira, A. (2006) Extreme Value Theory: An Introduction. Springer.
[11] Pan, X., Leng, X. and Hu, T. (2013) The Second-Order Version of Karamata’s Theorem with Applications. Statistics & Probability Letters, 83, 1397-1403.[CrossRef]
[12] Rényi, A. (1953) On the Theory of Order Statistics. Acta Mathematica Academiae Scientiarum Hungaricae, 4, 191-231.[CrossRef]
[13] Martins-Filho, C., Yao, F. and Torero, M. (2018) Nonparametric Estimation of Conditional Value-at-Risk and Expected Shortfall Based on Extreme Value Theory. Econometric Theory, 34, 23-67.[CrossRef]
[14] Spierdijk, L. (2016) Confidence Intervals for ARMA-GARCH Value-at-Risk: The Case of Heavy Tails and Skewness. Computational Statistics & Data Analysis, 100, 545-559.[CrossRef]
[15] Danielsson, J., Ergun, L.M., de Haan, L. and de Vries, C.G. (2016) Tail Index Estimation: Quantile Driven Threshold Selection. Computational Statistics and Data Analysis, 100, 545-559.
[16] Fernández, C. and Steel, M.F.J. (1998) On Bayesian Modeling of Fat Tails and Skewness. Journal of the American Statistical Association, 93, 359-371.[CrossRef]

Copyright © 2026 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.