论文检索

广义 Fisher 变换下相关矩阵的快速逆变换AI 解读

The generalized Fisher transformation maps a non-singular correlation matrix to an unconstrained real vector through the off-diagonal elements of its matrix logarithm. Evaluating its inverse is a computational bottleneck in dynamic correlation and multivariate volatility models. We develop a fast inversion algorithm by characterizing the unknown diagonal as the minimizer of a smooth, strictly convex, and coercive objective. An explicit Hessian and global spectral bounds…

一种稳健的相似性估计量AI 解读

We analyze a measure of statistical association based on the similarity of the outcomes of random variables, in both sign and magnitude. Motivated by its attractive properties, we propose a class of estimators for the linear correlation coefficient, a sample-average and a maximum-likelihood version, that operate directly on the Fisher scale and possess a robust sampling distribution that is invariant over the entire class of elliptical distributions. Under scale homogeneity,…

广义 Fisher 变换：有限样本性质与推断AI 解读

We study the finite-sample behavior of the Generalized Fisher Transformation (GFT), the parametrization of a correlation matrix $C$ by $γ(C)=\operatorname{vecl}\log C$. The GFT coordinates extend Fisher's transformation to dimension $n>2$: for elliptical data their finite-sample distributions are close to Gaussian. More strikingly, the coordinates are nearly uncorrelated and their covariance is largely invariant to $C$. This approximate orthogonality and invariance make…

Cluster GARCH：具有聚类依赖结构的多元波动模型AI 解读

We introduce a novel multivariate GARCH model with flexible convolution-t distributions that is applicable in high-dimensional systems. The model is called Cluster GARCH because it can accommodate cluster structures in the conditional correlation matrix and in the tail dependencies. The expressions for the log-likelihood function and its derivatives are tractable, and the latter facilitate a score-drive model for the dynamic correlation structure. We apply the Cluster GARCH…

生成随机相关矩阵的一种新方法AI 解读

We propose a new method for generating random correlation matrices that makes it simple to control both location and dispersion. The method is based on a vector parameterization, gamma = g(C), which maps any distribution on R^d, d = n(n-1)/2 to a distribution on the space of non-singular nxn correlation matrices. Correlation matrices with certain properties, such as being well-conditioned, having block structures, and having strictly positive elements, are simple to…