论文检索

概率预测的尾部校准AI 解读

Probabilistic forecasts comprehensively describe the uncertainty in the unknown future outcome, making them essential for decision making and risk management. While several methods have been introduced to evaluate probabilistic forecasts, existing evaluation techniques are ill-suited to the evaluation of tail properties of such forecasts. However, these tail properties are often of particular interest to forecast users due to the severe impacts caused by extreme outcomes. In…

多元极端事件的 X-vine 模型AI 解读

Abstract Regular vine sequences permit the organization of variables in a random vector along a sequence of trees. Vine-based dependence models have become greatly popular as a way to combine arbitrary bivariate copulas into higher-dimensional ones, offering flexibility, parsimony, and tractability. In this project, we use regular vine sequences to decompose and construct the exponent measure density of a multivariate extreme value distribution, or, equivalently, the tail…

通过矩阵补全进行 Hüsler–Reiss 图模型的统计推断AI 解读

The severity of multivariate extreme events is driven by the dependence between the largest marginal observations. The Hüsler–Reiss distribution is a versatile model for this extremal dependence, and it is usually parameterized by a variogram matrix. In order to represent conditional independence relations and obtain sparse parameterizations, we introduce the novel Hüsler–Reiss precision matrix. Similarly to the Gaussian case, this matrix appears naturally in density…

函数型数据的经验尾部 CopulaAI 解读

For multivariate distributions in the domain of attraction of a max-stable distribution, the tail copula and the stable tail dependence function are equivalent ways to capture the dependence in the upper tail. The empirical versions of these functions are rank-based estimators whose inflated estimation errors are known to converge weakly to a Gaussian process that is similar in structure to the weak limit of the empirical copula process. We extend this multivariate result to…

尾过程推断及其在金融时间序列建模中的应用AI 解读

To draw inference on serial extremal dependence within heavy-tailed Markov chains, Drees et al., (2015) proposed nonparametric estimators of the spectral tail process. The methodology can be extended to the more general setting of a stationary, regularly varying time series. The large-sample distribution of the estimators is derived via empirical process theory for cluster functionals. The finite-sample performance of these estimators is evaluated via Monte Carlo…

空间尾部依赖的 M 估计量AI 解读

Summary Tail dependence models for distributions attracted to a max-stable law are fitted by using observations above a high threshold. To cope with spatial, high dimensional data, a rank-based M-estimator is proposed relying on bivariate margins only. A data-driven weight matrix is used to minimize the asymptotic variance. Empirical process arguments show that the estimator is consistent and asymptotically normal. Its finite sample performance is assessed in simulation…

半参数高斯 Copula 模型：几何与有效秩估计AI 解读

We propose, for multivariate Gaussian copula models with unknown margins and structured correlation matrices, a rank-based, semiparametrically efficient estimator for the Euclidean copula parameter. This estimator is defined as a one-step update of a rank-based pilot estimator in the direction of the efficient influence function, which is calculated explicitly. Moreover, finite-dimensional algebraic conditions are given that completely characterize efficiency of the…

一致弱收敛失效时：借助上图与下图研究依赖函数和残差经验过程AI 解读

In the past decades, weak convergence theory for stochastic processes has become a standard tool for analyzing the asymptotic properties of various statistics. Routinely, weak convergence is considered in the space of bounded functions equipped with the supremum metric. However, there are cases when weak convergence in those spaces fails to hold. Examples include empirical copula and tail dependence processes and residual empirical processes in linear regression models in…

任意维度尾部依赖的 M 估计量AI 解读

Consider a random sample in the max-domain of attraction of a multivariate extreme value distribution such that the dependence structure of the attractor belongs to a parametric model. A new estimator for the unknown parameter is defined as the value that minimizes the distance between a vector of weighted integrals of the tail dependence function and their empirical counterparts. The minimization problem has, with probability tending to one, a unique, global solution. The…

二元极值的非参数贝叶斯推断AI 解读

Summary The tail of a bivariate distribution function in the domain of attraction of a bivariate extreme value distribution may be approximated by that of its extreme value attractor. The extreme value attractor has margins that belong to a three-parameter family and a dependence structure which is characterized by a probability measure on the unit interval with mean equal to 12, which is called the spectral measure. Inference is done in a Bayesian framework using a censored…

极值分布谱测度的最大经验似然估计AI 解读

Consider a random sample from a bivariate distribution function F in the max-domain of attraction of an extreme-value distribution function G. This G is characterized by two extreme-value indices and a spectral measure, the latter determining the tail dependence structure of F. A major issue in multivariate extreme-value theory is the estimation of the spectral measure Φp with respect to the Lp norm. For every p∈[1, ∞], a nonparametric maximum empirical likelihood estimator…

双变量极值 Copula 的秩推断AI 解读

Consider a continuous random pair (X, Y) whose dependence is characterized by an extreme-value copula with Pickands dependence function A. When the marginal distributions of X and Y are known, several consistent estimators of A are available. Most of them are variants of the estimators due to Pickands [Bull. Inst. Internat. Statist. 49 (1981) 859–878] and Capéraà, Fougères and Genest [Biometrika 84 (1997) 567–577]. In this paper, rank-based versions of these estimators are…

极端值簇的统计推断AI 解读

Summary Inference for clusters of extreme values of a time series typically requires the identification of independent clusters of exceedances over a high threshold. The choice of declustering scheme often has a significant effect on estimates of cluster characteristics. We propose an automatic declustering scheme that is justified by an asymptotic result for the times between threshold exceedances. The scheme relies on the extremal index, which we show may be estimated…