论文检索

Chatterjee 图相关系数的偏差修正AI 解读

Summary Azadkia & Chatterjee (2021) recently introduced a simple nearest-neighbour graph-based correlation coefficient that consistently detects both independence and functional dependence, in both unconditional and conditional settings. Specifically, it approximates a measure of dependence that equals 0 if and only if the variables are (conditionally) independent, and 1 if and only if they are (conditionally) functionally dependent. However, this nearest-neighbour estimator…

匹配估计量的自助法一致性AI 解读

Summary In a landmark paper, Abadie & Imbens (2008)showed that the naive bootstrap is inconsistent when applied to nearest neighbour matching estimators of the average treatment effect with a fixed number of matches. Since then, this finding has inspired numerous efforts to address the inconsistency issue, typically by employing alternative bootstrap methods. In contrast, in this work we show that the naive bootstrap is provably consistent for the original matching…

平均处理效应的回归调整插补估计AI 解读

Imputing missing potential outcomes using an estimated regression function is a natural idea for estimating causal effects. In the literature, estimators that combine imputation and regression adjustments are believed to be comparable to augmented inverse probability weighting. Accordingly, people for a long time conjectured that such estimators, while avoiding directly constructing the weights, are also doubly robust (Imbens, 2004; Stuart, 2010). Generalizing an earlier…

论 Rosenbaum 的秩匹配估计量AI 解读

Summary In two influential contributions, Rosenbaum (2005, 2020a) advocated for using the distances between componentwise ranks, instead of the original data values, to measure covariate similarity when constructing matching estimators of average treatment effects. While the intuitive benefits of using covariate ranks for matching estimation are apparent, there is no theoretical understanding of such procedures in the literature. We fill this gap by demonstrating that…

匹配数量随样本量增长的倾向得分匹配AI 解读

Abstract This paper re-examines the work of Abadie & Imbens (2016) on propensity score matching for average treatment effect estimation. We explore the asymptotic behaviour of these estimators when the number of nearest neighbours, M, grows with the sample size. It is shown, while not surprising, but technically nontrivial, that the modified estimators can improve upon the original fixed M-estimators in terms of efficiency. Additionally, we demonstrate the potential to…

Chatterjee 秩相关的自助法失效问题AI 解读

Abstract While researchers commonly use the bootstrap to quantify the uncertainty of an estimator, it has been noticed that the standard bootstrap, in general, does not work for Chatterjee’s rank correlation. In this paper, we provide proof of this issue under an additional independence assumption, and complement our theory with simulation evidence for general settings. Chatterjee’s rank correlation thus falls into a category of statistics that are asymptotically normal, but…

基于非参数泊松混合的 Fisher–Pitman 置换检验及其单细胞基因组学应用AI 解读

This article investigates the theoretical and empirical performance of Fisher-Pitman-type permutation tests for assessing the equality of unknown Poisson mixture distributions. Building on nonparametric maximum likelihood estimators (NPMLEs) of the mixing distribution, these tests are theoretically shown to be able to adapt to complicated unspecified structures of count data and also consistent against their corresponding ANOVA-type alternatives; the latter is a result in…

高维半参数高斯 Copula 向量自回归模型的估计与推断AI 解读

This paper develops simple, robust estimation and inference methods for the transition matrix of a high-dimensional semiparametric Gaussian copula vector autoregressive process. Our estimator is based on rank estimators of the large variance and auto-covariance matrices of a transformed latent high-dimensional Gaussian process. We derive rates of convergence of our estimator based on which we develop de-biased inference for Granger causality. Numerical results demonstrate…

基于最近邻匹配的估计：从密度比到平均处理效应AI 解读

Nearest neighbor (NN) matching is widely used in observational studies for causal effects. Abadie and Imbens (2006) provided the first large‐sample analysis of NN matching. Their theory focuses on the case with the number of NNs, M fixed. We reveal something new out of their study and show that once allowing M to diverge with the sample size an intrinsic statistic in their analysis constitutes a consistent estimator of the density ratio with regard to covariates across the…

随机向量独立性的普遍一致、完全分布自由秩检验AI 解读

Rank correlations have found many innovative applications in the last decade. In particular, suitable rank correlations have been used for consistent tests of independence between pairs of random variables. Using ranks is especially appealing for continuous data as tests become distribution-free. However, the traditional concept of ranks relies on ordering data and is, thus, tied to univariate observations. As a result, it has long remained unclear how one may construct…

基于中心向外秩与符号的分布无关一致独立性检验AI 解读

This article investigates the problem of testing independence of two random vectors of general dimensions. For this, we give for the first time a distribution-free consistent test. Our approach combines distance covariance with the center-outward ranks and signs developed by Marc Hallin and collaborators. In technical terms, the proposed test is consistent and distribution-free in the family of multivariate distributions with nonvanishing (Lebesgue) probability densities.…

随机设计非参数回归中的最优方差估计AI 解读

Consider the heteroscedastic nonparametric regression model with random design \begin{equation*}Y_{i}=f(X_{i})+V^{1/2}(X_{i})\varepsilon _{i},\quad i=1,2,\ldots ,n,\end{equation*} with $f(\cdot )$ and $V(\cdot )$ $\alpha $- and $\beta $-Hölder smooth, respectively. We show that the minimax rate of estimating $V(\cdot )$ under both local and global squared risks is of the order \begin{equation*}n^{-\frac{8\alpha \beta }{4\alpha \beta +2\alpha +\beta }}\vee n^{-\frac{2\beta }{2\beta +1}},\end{equation*}…

广义尖峰总体模型中大样本协方差矩阵极端特征值与迹的联合渐近分布AI 解读

This paper studies the joint limiting behavior of extreme eigenvalues and trace of large sample covariance matrix in a generalized spiked population model, where the asymptotic regime is such that the dimension and sample size grow proportionally. The form of the joint limiting distribution is applied to conduct Johnson–Graybill-type tests, a family of approaches testing for signals in a statistical model. For this, higher order correction is further made, helping alleviate…

基于秩相关最大值的高维一致独立性检验AI 解读

Testing mutual independence for high-dimensional observations is a fundamental statistical challenge. Popular tests based on linear and simple rank correlations are known to be incapable of detecting nonlinear, nonmonotone relationships, calling for methods that can account for such dependences. To address this challenge, we propose a family of tests that are constructed using maxima of pairwise rank correlations that permit consistent assessment of pairwise independence.…

单调分段常数信号的估计AI 解读

Consider a sequence of real data points $X_{1},\ldots ,X_{n}$ with underlying means $\theta ^{*}_{1},\dots ,\theta ^{*}_{n}$. This paper starts from studying the setting that $\theta ^{*}_{i}$ is both piecewise constant and monotone as a function of the index $i$. For this, we establish the exact minimax rate of estimating such monotone functions, and thus give a nontrivial answer to an open problem in the shape-constrained analysis literature. The minimax rate under the…

维度增长下的秩估计量AI 解读

The family of rank estimators, including Han’s maximum rank correlation (Han, 1987) as a notable example, has been widely exploited in studying regression problems. For these estimators, although the linear index is introduced for alleviating the impact of dimensionality, the effect of large dimension on inference is rarely studied. This paper fills this gap via studying the statistical properties of a larger family of M-estimators, whose objective functions are formulated…

ECA：非高斯分布下的高维椭圆成分分析AI 解读

We present a robust alternative to principal component analysis (PCA)—called elliptical component analysis (ECA)—for analyzing high-dimensional, elliptically distributed data. ECA estimates the eigenspace of the covariance matrix of the elliptical data. To cope with heavy-tailed elliptical distributions, a multivariate rank statistic is exploited. At the model-level, we consider two settings: either that the leading eigenvectors of the covariance matrix are nonsparse or that…

高维情形下的分布无关独立性检验AI 解读

We consider the testing of mutual independence among all entries in a $d$-dimensional random vector based on $n$ independent observations. We study two families of distribution-free test statistics, which include Kendall’s tau and Spearman’s rho as important examples. We show that under the null hypothesis the test statistics of these two families converge weakly to Gumbel distributions, and we propose tests that control the Type I error in the high-dimensional setting where…

大型投资组合风险的稳健推断AI 解读

We propose a bootstrap-based robust high-confidence level upper bound (Robust H-CLUB) for assessing the risks of large portfolios. The proposed approach exploits rank-based and quantile-based estimators, and can be viewed as a robust extension of the H-CLUB procedure (Fan et al., 2015). Such an extension allows us to handle possibly misspecified models and heavy-tailed data, which are stylized features in financial returns. Under mixing conditions, we analyze the proposed…

高维时间序列中多个图模型的联合估计AI 解读

Summary We consider the problem of jointly estimating multiple graphical models in high dimensions. We assume that the data are collected from n subjects, each of which consists of T possibly dependent observations. The graphical models of subjects vary, but are assumed to change smoothly corresponding to a measure of closeness between subjects. We propose a kernel-based method for jointly estimating all graphical models. Theoretically, under a double asymptotic framework,…

高维元椭圆数据的尺度不变稀疏主成分分析AI 解读

We propose a semiparametric method for conducting scale-invariant sparse principal component analysis (PCA) on high dimensional non-Gaussian data. Compared with sparse PCA, our method has weaker modeling assumption and is more robust to possible data contamination. Theoretically, the proposed method achieves a parametric rate of convergence in estimating the parameter of interests under a flexible semiparametric distribution family; Computationally, the proposed method…

高维半参数高斯 Copula 图模型AI 解读

We propose a semiparametric approach called the nonparanormal SKEPTIC for efficiently and robustly estimating high-dimensional undirected graphical models. To achieve modeling flexibility, we consider the nonparanormal graphical models proposed by Liu, Lafferty and Wasserman [J. Mach. Learn. Res. 10 (2009) 2295–2328]. To achieve estimation robustness, we exploit nonparametric rank-based correlation coefficient estimators, including Spearman’s rho and Kendall’s tau. We prove…