论文检索

针对两个响应变量交互关系的有效降维AI 解读

Abstract In this paper, we propose the novel theory and methodologies for dimension reduction with respect to the interaction between two response variables, which is a new research problem that has wide applications in missing data analysis, causal inference, graphical models, etc. We formulate the parameters of interest to be the locally and the globally efficient dimension reduction subspaces, and justify the generality of the corresponding low-dimensional assumption. We…

低秩张量推断：无需去偏AI 解读

In this paper, we consider the statistical inference for several low-rank tensor models. Specifically, in the Tucker low-rank tensor PCA or regression model, provided with any estimates achieving some attainable error rate, we develop the data-driven confidence regions for the singular subspace of the parameter tensor based on the asymptotic distribution of an updated estimate by two-iteration alternating minimization. The asymptotic distributions are established under some…

裂区实验中设计式与模型式因果推断的协调AI 解读

The split-plot design arose from agricultural science with experimental units, also known as the subplots, nested within groups known as the whole plots. It assigns different interventions at the whole-plot and subplot levels, respectively, providing a convenient way to accommodate hard-to-change factors. By design, subplots within the same whole plot receive the same level of the whole-plot intervention, and thereby induce a group structure on the final treatment…

尖峰协方差矩阵主成分的统计推断AI 解读

In this paper, we study the asymptotic behavior of the extreme eigenvalues and eigenvectors of the high-dimensional spiked sample covariance matrices, in the supercritical case when a reliable detection of spikes is possible. In particular, we derive the joint distribution of the extreme eigenvalues and the generalized components of the associated eigenvectors, that is, the projections of the eigenvectors onto arbitrary given direction, assuming that the dimension and sample…

未知零假设分布下的错误发现率控制：能否模拟理想程序？AI 解读

Classical multiple testing theory prescribes the null distribution, which is often too stringent an assumption for nowadays large scale experiments. This paper presents theoretical foundations to understand the limitations caused by ignoring the null distribution, and how it can be properly learned from the same data set, when possible. We explore this issue in the setting where the null distributions are Gaussian with unknown rescaling parameters (mean and variance) whereas…

离散结构恢复的迭代算法AI 解读

We propose a general modeling and algorithmic framework for discrete structure recovery that can be applied to a wide range of problems. Under this framework, we are able to study the recovery of clustering labels, ranks of players, signs of regression coefficients, cyclic shifts and even group elements from a unified perspective. A simple iterative algorithm is proposed for discrete structure recovery, which generalizes methods including Lloyd’s algorithm and the power…

紧致度量空间随机场渐近最优线性预测的充要条件AI 解读

Optimal linear prediction (aka. kriging) of a random field {Z(x)}x∈X indexed by a compact metric space (X,dX) can be obtained if the mean value function m:X→R and the covariance function ϱ:X×X→R of Z are known. We consider the problem of predicting the value of Z(x∗) at some location x∗∈X based on observations at locations {xj}j=1n, which accumulate at x∗ as n→∞ (or, more generally, predicting φ(Z) based on {φj(Z)}j=1n for linear functionals φ,φ1,…,φn). Our main result…

多重插补数据集的一般且可实施检验AI 解读

Multiple imputation (MI) is a technique especially designed for handling missing data in public-use datasets. It allows analysts to perform incomplete-data inference straightforwardly by using several already imputed datasets released by the dataset owners. However, the existing MI tests require either a restrictive assumption on the missing-data mechanism, known as equal odds of missing information (EOMI), or an infinite number of imputations. Some of them also require…

基于平均 Fréchet 导数的函数型充分降维AI 解读

Sufficient dimension reduction (SDR) embodies a family of methods that aim for reduction of dimensionality without loss of information in a regression setting. In this article, we propose a new method for nonparametric function-on-function SDR, where both the response and the predictor are a function. We first develop the notions of functional central mean subspace and functional central subspace, which form the population targets of our functional SDR. We then introduce an…

基于 HSIC 的自适应独立性检验AI 解读

The Hilbert–Schmidt Independence Criterion (HSIC) is a dependence measure based on reproducing kernel Hilbert spaces that is widely used to test independence between two random vectors. Remains the delicate choice of the kernel. In this work, we develop a new HSIC-based aggregated procedure which avoids such a kernel choice, and provide theoretical guarantees for this procedure. To achieve this, on the one hand, we introduce non-asymptotic single tests based on Gaussian…

利用辅助信息的大规模多重检验最优错误发现率控制AI 解读

Large-scale multiple testing is a fundamental problem in high dimensional statistical inference. It is increasingly common that various types of auxiliary information, reflecting the structural relationship among the hypotheses, are available. Exploiting such auxiliary information can boost statistical power. To this end, we propose a framework based on a two-group mixture model with varying probabilities of being null for different hypotheses a priori, where a…

基于自归一化的高维数据变点推断AI 解读

This article considers change-point testing and estimation for a sequence of high-dimensional data. In the case of testing for a mean shift for high-dimensional independent data, we propose a new test which is based on U-statistic in Chen and Qin (Ann. Statist. 38 (2010) 808–835) and utilizes the self-normalization principle (Shao J. R. Stat. Soc. Ser. B. Stat. Methodol. 72 (2010) 343–366; Shao and Zhang J. Amer. Statist. Assoc. 105 (2010) 1228–1240). Our test targets dense…

适用于非参数与半参数回归的参数化 Copula 估计AI 解读

We consider a multivariate response regression model where each coordinate is described by a location-scale non- or semiparametric regression and where the dependence structure of the “noise term” is described by a parametric copula. Our goal is to estimate the associated Euclidean copula parameter, given a sample of the response and the covariate. In the absence of the copula sample, the usual oracle ranks are no longer computable. Instead, we study the normal scores…

分布式非参数函数估计：最优收敛率与自适应代价AI 解读

Distributed minimax estimation and distributed adaptive estimation under communication constraints for Gaussian sequence model and white noise model are studied. The minimax rate of convergence for distributed estimation over a given Besov class, which serves as a benchmark for the cost of adaptation, is established. We then quantify the exact communication cost for adaptation and construct an optimally adaptive procedure for distributed estimation over a range of Besov…

一般自标准化和的精细 Cramér 型中偏差定理及相关变量与缩尾均值应用AI 解读

Let {(Xi,Yi)}i=1n be a sequence of independent bivariate random vectors. In this paper, we establish a refined Cramér-type moderate deviation theorem for the general self-normalized sum ∑ i=1nXi/(∑i=1nYi2)1/2, which unifies and extends the classical Cramér (Actual. Sci. Ind. 736 (1938) 5–23) theorem and the self-normalized Cramér-type moderate deviation theorems by Jing, Shao and Wang (Ann. Probab. 31 (2003) 2167–2215) as well as the further refined version by Wang (J.…

含隐变量的多响应回归自适应估计AI 解读

A prominent concern of scientific investigators is the presence of unobserved hidden variables in association analysis. Ignoring hidden variables often yields biased statistical results and misleading scientific conclusions. Motivated by this practical issue, this paper studies the multivariate response regression with hidden variables, Y=(Ψ∗)TX+(B∗)TZ+E, where Y∈Rm is the response vector, X∈Rp is the observable feature, Z∈RK represents the vector of unobserved hidden…

非稀疏高维线性模型的可检验性AI 解读

Understanding statistical inference under possibly nonsparse high-dimensional models has gained much interest recently. For a given component of the regression coefficient, we show that the difficulty of the problem depends on the sparsity of the corresponding row of the precision matrix of the covariates, not the sparsity of the regression coefficients. We develop new concepts of uniform and essentially uniform nontestability that allow the study of limitations of tests…

兼具多种性质的高斯均值稳健估计量AI 解读

The goal of this paper is to show that a single robust estimator of the mean of a multivariate Gaussian distribution can enjoy five desirable properties. First, it is computationally tractable in the sense that it can be computed in a time, which is at most polynomial in dimension, sample size and the logarithm of the inverse of the contamination rate. Second, it is equivariant by translations, uniform scaling and orthogonal transformations. Third, it has a high breakdown…

高维面板数据截面独立性的最大值—求和检验AI 解读

We consider a testing problem for cross-sectional independence for high-dimensional panel data, where the number of cross-sectional units is potentially much larger than the number of observations. The cross-sectional independence is described through linear regression models. We study three tests named the sum, the max and the max-sum tests, where the latter two are new. The sum test is initially proposed by Breusch and Pagan (1980). We design the max and sum tests for…

最优传输定义的多元秩与分位数：一致性、速率和非参数检验AI 解读

In this paper, we study multivariate ranks and quantiles, defined using the theory of optimal transport, and build on the work of Chernozhukov et al. (Ann. Statist. 45 (2017) 223–256) and Hallin et al. (Ann. Statist. 49 (2021) 1139–1165). We study the characterization, computation and properties of the multivariate rank and quantile functions and their empirical counterparts. We derive the uniform consistency of these empirical estimates to their population versions, under…

通过子图抽样估计网络模体：四阶矩现象AI 解读

Network sampling is an indispensable tool for understanding features of large complex networks where it is practically impossible to search over the entire graph. In this paper, we develop a framework for statistical inference for counting network motifs, such as edges, triangles and wedges, in the widely used subgraph sampling model, where each vertex is sampled independently, and the subgraph induced by the sampled vertices is observed. We derive necessary and sufficient…

高维无岭最小二乘插值中的意外现象AI 解读

Interpolators—estimators that achieve zero training error—have attracted growing attention in machine learning, mainly because state-of-the art neural networks appear to be models of this type. In this paper, we study minimum ℓ2 norm (“ridgeless”) interpolation least squares regression, focusing on the high-dimensional regime in which the number of unknown parameters p is of the same order as the number of samples n. We consider two different models for the feature…

稀疏高维线性回归：平方误差估计与相变AI 解读

We consider a sparse high-dimensional regression model where the goal is to recover a k-sparse unknown binary vector β∗ from n noisy linear observations of the form Y=Xβ∗+W∈Rn where X∈Rn×p has i.i.d. N(0,1) entries and W∈Rn has i.i.d. N(0,σ2) entries. In the high signal-to-noise ratio regime and sublinear sparsity regime, while the order of the sample size needed to recover the unknown vector information-theoretically is known to be n∗:=2klogp/log(k/σ2+1), no polynomial-time…

网络矩统计量的 Edgeworth 展开AI 解读

Network method of moments (Ann. Statist. 39 (2011) 2280–2301) is an important tool for nonparametric network inference. However, there has been little investigation on accurate descriptions of the sampling distributions of network moment statistics. In this paper, we present the first higher-order accurate approximation to the sampling CDF of a studentized network moment by Edgeworth expansion. In sharp contrast to classical literature on noiseless U-statistics, we show that…