论文检索

考虑相关结构的高维两样本均值新检验AI 解读

This paper is concerned with high-dimensional two-sample mean problems, which receive considerable attention in recent literature. To utilize the correlation information among variables for enhancing the power of two-sample mean tests, we consider the setting in which the precision matrix of high-dimensional data possesses a linear structure. Thus, we first propose a new precision matrix estimation procedure with considering its linear structure, and further develop…

高维多平台临床基因组数据的功能整合贝叶斯分析AI 解读

Rapid advancements in collection and dissemination of multi-platform molecular and genomics data has resulted in enormous opportunities to aggregate such data in order to understand, prevent, and treat human diseases. While significant improvements have been made in multi-omic data integration methods to discover biological markers and mechanisms underlying both prognosis and treatment, the precise cellular functions governing these complex mechanisms still need detailed and…

稀疏独立成分分析及其在自闭症皮层表面功能磁共振数据中的应用AI 解读

Independent component analysis (ICA) is widely used to estimate spatial resting-state networks and their time courses in neuroimaging studies. It is thought that independent components correspond to sparse patterns of co-activating brain locations. Previous approaches for introducing sparsity to ICA replace the non-smooth objective function with smooth approximations, resulting in components that do not achieve exact zeros. We propose a novel Sparse ICA method that enables…

尖峰噪声协方差下高维多元回归的一般线性假设检验AI 解读

We consider the problem of testing linear hypotheses under a multivariate regression model with a high-dimensional response and spiked noise covariance. The proposed family of tests consists of test statistics based on a weighted sum of projections of the data onto the estimated latent factor directions, with the weights acting as the regularization parameters. We establish asymptotic normality of the test statistics under the null hypothesis. We also establish the power…

极值随机森林AI 解读

Classical methods for quantile regression fail in cases where the quantile of interest is extreme and only few or no training data points exceed it. Asymptotic results from extreme value theory can be used to extrapolate beyond the range of the data, and several approaches exist that use linear regression, kernel methods or generalized additive models. Most of these methods break down if the predictor space has more than a few dimensions or if the regression function of…

多重比较的分割 Knockoff：控制方向性错误发现率AI 解读

Multiple comparisons in hypothesis testing often encounter structural constraints in various applications. For instance, in structural Magnetic Resonance Imaging for Alzheimer’s Disease, the focus extends beyond examining atrophic brain regions to include comparisons of anatomically adjacent regions. These constraints can be modeled as linear transformations of parameters, where the sign patterns play a crucial role in estimating directional effects. This class of problems,…

利用 Gram–Schmidt Walk 设计平衡随机实验协变量AI 解读

The design of experiments involves a compromise between covariate balance and robustness.This article provides a formalization of this tradeoff and describes an experimental design that allows experimenters to navigate it.The design is specified by a robustness parameter that bounds the worst-case mean squared error of an estimator of the average treatment effect.Subject to the experimenter's desired level of robustness, the design aims to simultaneously balance all linear…

存在偏差时的自助法推断AI 解读

We consider bootstrap inference for estimators which are (asymptotically) biased. We show that, even when the bias term cannot be consistently estimated, valid inference can be obtained by proper implementations of the bootstrap. Specifically, we show that the prepivoting approach of Beran (1987, 1988), originally proposed to deliver higher-order refinements, restores bootstrap validity by transforming the original bootstrap p-value into an asymptotically uniform random…

面向始终有效高维动态定价的在线正则化AI 解读

–Devising a dynamic pricing policy with always valid online statistical learning procedures is an important and as yet unresolved problem. Most existing dynamic pricing policies, which focus on the faithfulness of adopted customer choice models, exhibit a limited capability for adapting to the online uncertainty of learned statistical models during the pricing process. In this article, we propose a novel approach for designing a dynamic pricing policy based on regularized…

非参数与高维模型中的贝叶斯可忽略性是一种信息性先验AI 解读

In problems with large amounts of missing data one must model two distinct data generating processes: the outcome process, which generates the response, and the missing data mechanism, which determines the data we observe. Under the ignorability condition of Rubin, however, likelihood-based inference for the outcome process does not depend on the missing data mechanism so that only the former needs to be estimated; partially because of this simplification, ignorability is…

用于高维回归的因子增强稀疏直通深度 ReLU 神经网络AI 解读

This paper introduces a Factor Augmented Sparse Throughput (FAST) model that utilizes both latent factors and sparse idiosyncratic components for nonparametric regression. The FAST model bridges factor models on one end and sparse nonparametric models on the other end. It encompasses structured nonparametric models such as factor augmented additive models and sparse low-dimensional nonparametric interaction models and covers the cases where the covariates do not admit factor…

基于 Rayleigh 商的稀疏典型相关分析极小极大准贝叶斯估计AI 解读

Canonical correlation analysis (CCA) is a popular statistical technique for exploring relationships between datasets. In recent years, the estimation of sparse canonical vectors has emerged as an important but challenging variant of the CCA problem, with widespread applications. Unfortunately, existing rate-optimal estimators for sparse canonical vectors have high computational cost. We propose a quasi-Bayesian estimation procedure that not only achieves the minimax…

人应当向机器谎报吗？Lasso 与广义线性结构稀疏估计的激励相容性AI 解读

We consider situations where a user feeds her attributes to a machine learning method that tries to predict her best option based on a random sample of other users. The predictor is incentive-compatible if the user has no incentive to misreport her covariates. Focusing on the popular Lasso estimation technique, we borrow tools from high-dimensional statistics to characterize sufficient conditions that ensure that Lasso is incentive compatible in the asymptotic case. We…

动态已实现最小方差投资组合模型AI 解读

This article introduces a dynamic minimum variance portfolio (MVP) model using nonlinear volatility dynamic models, based on high-frequency financial data. Specifically, we impose an autoregressive dynamic structure on MVP processes, which helps capture the MVP dynamics directly. To evaluate the dynamic MVP model, we estimate the inverse volatility matrix using the constrained l1-minimization for inverse matrix estimation (CLIME) and calculate daily realized non-normalized…

自回归依赖回归中基于变量选择的参数变化检验AI 解读

We consider a regression model with autoregressive terms and propose significance tests for the detection of change points in this model. Our tests are applicable to both low- or moderate dimension and to high-dimension with sparse regressors. The dimension may be high from the practical point of view of economic and business applications, but in our theoretical framework it is fixed. To accommodate practically high dimension, variable selection is incorporated as an…

混合识别强度下的相关矩条件选择AI 解读

This paper proposes a robust moment selection method aiming to pick the best model even if this is a moment condition model with mixed identification strength, that is, moment conditions including moment functions that are local to zero uniformly over the parameter set. We show that the relevant moment selection procedure of Hall et al. (2007, Journal of Econometrics 138, 488–512) is inconsistent in this setting as it does not explicitly account for the rate of convergence…

非随机缺失下的矩阵补全及其在因果面板模型中的应用AI 解读

This paper develops an inferential framework for matrix completion when missing is not at random and without the requirement of strong signals. Our development is based on the observation that if the number of missing entries is small enough compared to the panel size, then they can be estimated well even when missing is not at random. Taking advantage of this fact, we divide the missing entries into smaller groups and estimate each group via nuclear norm regularization. In…

范旺、余怡与里纳尔多对网络潜在生长过程根与社区推断的讨论AI 解读

We congratulate Prof. Crane and Dr Xu for introducing a very interesting and appealing statistical model for Markovian network growth. The PAPER model enjoys several qualities. In particular, (i) it strikes a rare balance between analytic elegance and tractability, and expressive power; (ii) it allows for practicable algorithms for statistical inference that scale to networks of very large size, and (iii) it is very flexible and can be readily generalized to model a variety…

江一聪与柯征对《网络潜在增长过程的根节点与社群推断》的讨论AI 解读

We congratulate the authors on an excellent paper! Crane and Xu (2021) proposed novel methods for finding ‘root nodes’ from a single snapshot of a dynamic network process, with several interesting real-data examples. We now consider a new application for finding ‘root papers’ in a citation network. The MADStat dataset (Ji et al., 2022; Ke et al., 2023) consists of the bibtex and citation information of over 83 K papers, which we use to construct paper citation networks.…

随机非线性定义域上函数型数据的可解释判别分析：阿尔茨海默病应用AI 解读

Abstract We introduce a novel framework for the classification of functional data supported on nonlinear, and possibly random, manifold domains. The motivating application is the identification of subjects with Alzheimer’s disease from their cortical surface geometry and associated cortical thickness map. The proposed model is based upon a reformulation of the classification problem as a regularized multivariate functional linear regression model. This allows us to adopt a…

众多弱工具变量与无效工具变量下的工具变量估计AI 解读

Abstract We discuss the fundamental issue of identification in linear instrumental variable (IV) models with unknown IV validity. With the assumption of the ‘sparsest rule’, which is equivalent to the plurality rule but becomes operational in computation algorithms, we investigate and prove the advantages of non-convex penalized approaches over other IV estimators based on two-step selections, in terms of selection consistency and accommodation for individually weak IVs.…

非参数多元有限混合模型的完整模型估计AI 解读

Abstract This paper addresses the problem of full-model estimation for non-parametric finite mixture models. It presents an approach for selecting the number of components and the subset of discriminative variables (i.e. the subset of variables having different distributions among the mixture components) by considering an upper bound on the number of components (this number being allowed to increase with the sample size). The proposed approach considers a discretization of…

高维加性回归的高效函数型 Lasso 核平滑AI 解读

Smooth backfitting has been proposed and proved as a powerful nonparametric estimation technique for additive regression models in various settings. Existing studies are restricted to cases with a moderate number of covariates and are not directly applicable to high dimensional settings. In this paper, we develop new kernel estimators based on the idea of smooth backfitting for high dimensional additive models. We introduce a novel penalization scheme, combining the idea of…

Gromov–Wasserstein距离：熵正则化、对偶与样本复杂度AI 解读

The Gromov–Wasserstein (GW) distance, rooted in optimal transport (OT) theory, quantifies dissimilarity between metric measure spaces and provides a framework for aligning heterogeneous datasets. While computational aspects of the GW problem have been widely studied, a duality theory and fundamental statistical questions concerning empirical convergence rates remained obscure. This work closes these gaps for the quadratic GW distance over Euclidean spaces of different…