论文检索

主成分分析中方差解释比例的统计推断AI 解读

Principal component analysis (PCA) is a longstanding approach for dimension reduction. It rests upon the assumption that the underlying signal has low rank, and thus can be well-summarized using a small number of dimensions. The output of PCA is typically represented using a scree plot, which displays the proportion of variance explained (PVE) by each principal component. While the PVE is extensively reported in routine analyses, to the best of our knowledge the notion of…

相关阈值筛选后高斯变量集合的独立性推断AI 解读

We consider testing whether a set of Gaussian variables, selected from the data, is independent of the remaining variables. This set is selected via a very simple approach: these are the variables for which the correlation with all other variables falls below some threshold. Unlike other settings in selective inference, failure to account for the selection step leads to excessively conservative (as opposed to anti-conservative) results. We propose a new test that conditions…

层次聚类的选择后推断AI 解读

Classical tests for a difference in means control the Type I error rate when the groups are defined a priori. However, when the groups are instead defined via clustering, then applying a classical test yields an extremely inflated Type I error rate. Notably, this problem persists even if two separate and independent datasets are used to define the groups and to test for a difference in their means. To address this problem, in this article, we propose a selective inference…

高维稀疏降秩 Huber 回归AI 解读

We propose a sparse reduced rank Huber regression for analyzing large and complex high-dimensional data with heavy-tailed random noise. The proposed method is based on a convex relaxation of a rank- and sparsity-constrained nonconvex optimization problem, which is then solved using a block coordinate descent and an alternating direction method of multipliers algorithm. We establish nonasymptotic estimation error bounds under both Frobenius and nuclear norms in the…

变点检测后的均值变化检验AI 解读

Abstract While many methods are available to detect structural changes in a time series, few procedures are available to quantify the uncertainty of these estimates post-detection. In this work, we fill this gap by proposing a new framework to test the null hypothesis that there is no change in mean around an estimated changepoint. We further show that it is possible to efficiently carry out this framework in the case of changepoints estimated by binary segmentation and its…

随机设计非参数回归中的最优方差估计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*}…