论文检索

网络变系数模型AI 解读

We propose a novel network-varying coefficient model that extends traditional varying coefficient models to accommodate network data. The main idea is to model the regression coefficients as the functions of the latent “locations” of network nodes that drive formation of the network. To estimate the model, we identify the latent “locations” via the latent space model and then develop an iterative projected gradient descent algorithm by optimizing the network parameters and…

高维卷积秩回归的统计推断AI 解读

High-dimensional penalized rank regression is a powerful tool for modeling high-dimensional data due to its robustness and estimation efficiency. However, the non-smoothness of the rank loss brings great challenges to the computation. To solve this critical issue, high-dimensional convoluted rank regression has been recently proposed, introducing penalized convoluted rank regression estimators. However, these developed estimators cannot be directly used to make inference. In…

大型向量自回归模型中的网络格兰杰因果关系发现AI 解读

This article proposes novel inferential procedures for discovering the network Granger causality in highdimensional vector autoregressive models.In particular, we mainly offer two multiple testing procedures designed to control the false discovery rate (FDR).The first procedure is based on the limiting normal distribution of the t-statistics with the debiased lasso estimator.The second procedure is its bootstrap version.We also provide a robustification of the first…

再生核希尔伯特空间上的非参数期望短缺回归估计与推断AI 解读

Expected shortfall (ES) has emerged as an important metric for characterizing the tail behavior of a random outcome, specifically associated with rarer events that entail severe consequences. In climate science, the threats of flooding and heatwaves loom large, impacting natural environments and human communities. In actuarial studies, a key observation in modeling insurance claim sizes is that features exhibit distinct effects in explaining small and large claims. This…

含随机变点的区间删失失效时间数据估计与变量选择AI 解读

Motivated by a breast cancer study, we consider regression analysis of interval-censored failure time data in the presence of a random change point. Although a great deal of literature on interval-censored data has been established, there does not seem to exist an established method that can allow for the existence of random change points. Such data can occur in, for example, clinical trials where the risk of a disease may dramatically change when some biological indexes of…

利用广义变系数模型检测不规则区域中的局部信号AI 解读

In spatial analysis, it is essential to understand and quantify spatial or temporal heterogeneity. This paper focuses on the generalized spatially varying coefficient model (GSVCM), a powerful framework to accommodate spatial heterogeneity by allowing regression coefficients to vary in a given spatial domain. We propose a penalized bivariate spline method for detecting local signals in GSVCM. The key idea is to use bivariate splines defined on triangulation to approximate…

多元函数型线性回归中的系数形状对齐AI 解读

In multivariate functional data analysis, different functional covariates often exhibit homogeneity. The covariates with pronounced homogeneity can be analyzed jointly within the same group, offering a parsimonious approach to modeling multivariate functional data. In this article, a novel grouped multiple functional regression model with a new regularization approach termed “coefficient shape alignment” is developed to tackle functional covariates homogeneity. The modeling…

灵活的贝叶斯 MIDAS：时变性、分组收缩与稀疏化AI 解读

We propose a mixed-frequency regression prediction approach that models a time-varying trend and stochastic volatility in the trend and in the variable of interest.The coefficients of high-frequency indicators are regularized via a shrinkage prior that accounts for the grouping structure and within-group correlation among lags.A new sparsification algorithm on the posterior motivated by Bayesian decision theory derives inclusion probabilities over lag groups, thus making the…

基于最近邻的效用最大化二元预测及信用评分应用AI 解读

We propose nonparametric k-nearest neighbor prediction rules under the framework of utility-maximizing binary prediction with possibly many predictors. One of these prediction rules, with an attempt to “break” the curse of dimensionality, is constructed based on the predictors selected by variable selection methods. We establish that allowing for the data-dependent selection of parameter k, these prediction rules are utility consistent under regularity assumptions. Such…

精度矩阵最小二乘：高维估计与推断AI 解读

The least squares estimator can be cast as depending only on the precision matrix of the data, similar to the weights of a global minimum variance portfolio. We give conditions under which any plug-in precision matrix estimator produces an unbiased and consistent least squares estimator for stationary time series regressions, in both low- and high-dimensional settings. Such conditions define a class of “Precision Least Squares” (PrLS) estimators, which are shown to be…

观察性研究中多值处理政策学习的模型选择AI 解读

This study investigates the policy learning problem in observational studies, where the treatment variable can be multivalued and the propensity scores are unknown. We approximate the optimal policy in a global policy class with infinite complexity (VC/Natarajan) dimension, using a sequence of sieve policy classes with finite complexity dimension. The optimal policy within each sieve class is estimated by maximizing the empirical welfare, constructed through the doubly…

去偏 Lasso 的小调参选择AI 解读

In this study, we investigate the bias and variance properties of the debiased Lasso in linear regression when the tuning parameter of the node-wise Lasso is selected to be smaller than in previous studies. We consider the case where the number of covariates p is bounded by a constant multiple of the sample size n. First, we show that the bias of the debiased Lasso can be reduced without diverging the asymptotic variance by setting the order of the tuning parameter to 1/n.…

交叉验证后自助法选择高维 M 估计量的惩罚参数AI 解读

We develop a new method for selecting the penalty parameter for ℓ1-penalized M-estimators in high dimensions, which we refer to as bootstrapping after cross validation. We derive rates of convergence for the corresponding ℓ1-penalized M-estimator and also for the post-ℓ1-penalized M-estimator, which refits the nonzero entries of the former estimator without penalty in the criterion function. We demonstrate via simulations that our methods are not dominated by cross…

通过神经对抗不变性学习从异质环境中追寻因果关系AI 解读

Pursuing causality from data is a fundamental problem in scientific discovery, treatment intervention, and transfer learning. This paper introduces a novel algorithmic method for addressing nonparametric invariance and causality learning in regression models across multiple environments, where the joint distribution of response variables and covariates varies, but the conditional expectations of outcome given an unknown set of quasi-causal variables are invariant. The…

预印本版本摘要 · 查看来源

离散观测数据的函数主成分分析理论AI 解读

Functional data analysis is an important research field in statistics which treats data as random functions drawn from some infinite-dimensional functional space, and functional principal component analysis (FPCA) based on eigen-decomposition plays a central role for data reduction and representation. After nearly three decades of research, there remains a key problem unsolved, namely, the perturbation analysis of covariance operator for diverging number of eigencomponents…

函数型图形套索AI 解读

We consider the problem of recovering conditional independence relationships between p jointly distributed Hilbertian random elements given n realizations thereof. We operate in the sparse high-dimensional regime, where n ≪ p and no element is related to more than d ≪ p other elements. In this context, we propose an infinite-dimensional generalization of the graphical lasso. We prove model selection consistency under natural assumptions and extend many classical results to…

空间相关数据模型的Moran’s I lasso估计AI 解读

Summary This paper proposes a lasso-based estimator which uses information embedded in the Moran statistic to develop a selection procedure called Moran’s I lasso (Mi-lasso) to solve the eigenvector spatial filtering (ESF) eigenvector selection problem. ESF uses a subset of eigenvectors from a spatial weights matrix to efficiently account for any omitted spatially correlated terms in a classical linear regression framework, thus eliminating the need for the researcher to…

高维广义线性模型部分惩罚检验的强 Oracle 保证AI 解读

Abstract Partial penalized tests provide flexible approaches to testing linear hypotheses in high-dimensional generalized linear models. However, because the estimators used in these tests are local minimizers of potentially nonconvex folded-concave penalized objectives, the solutions one computes in practice may not coincide with the unknown local minima for which we have nice theoretical guarantees. To close this gap between theory and computation, we introduce local…

贝叶斯惩罚经验似然与马尔可夫链蒙特卡洛抽样AI 解读

Abstract In this study, we introduce a novel methodological framework called Bayesian penalized empirical likelihood (BPEL), designed to address the computational challenges inherent in empirical likelihood (EL) approaches. Our approach has two primary objectives: (i) to enhance the inherent flexibility of EL in accommodating diverse model conditions, and (ii) to facilitate the use of well-established Markov Chain Monte Carlo sampling schemes as a convenient alternative to…

半参数后验修正AI 解读

Abstract We present a new approach to semiparametric inference using corrected posterior distributions. The method allows us to leverage the adaptivity, regularization, and predictive power of nonparametric Bayesian procedures to estimate low-dimensional functionals of interest without being restricted by the holistic Bayesian formalism. Starting from a conventional posterior on the whole data-generating distribution, we correct the marginal posterior for each functional of…

贝叶斯局部投影AI 解读

Abstract We propose a Bayesian approach to Local Projections (LPs) that optimally addresses the empirical bias-variance trade-off intrinsic in the choice between direct and iterative methods. Bayesian Local Projections (BLPs) regularize LP regressions via informative priors and estimate impulse response functions that capture the properties of the data more accurately than iterative VARs. BLPs preserve the flexibility of LPs while retaining a degree of estimation uncertainty…

多重结构突变与多因子误差下空间面板模型的收缩估计AI 解读

This study investigates spatial panel data models with a multifactor error structure and multiple structural breaks occurring in the coefficients of both spatial lagged and explanatory variables. While extensive research has addressed cross-sectional dependence in panel data, including approaches that integrate spatial and factor structures within a single framework, few studies account for time-varying model parameters and achieving consistent estimation remains a…

未知异方差或工具变量下的高维二元选择模型AI 解读

This paper proposes a new method for estimating high-dimensional binary choice models. We consider a semiparametric model that places no distributional assumptions on the error term, allows for heteroskedastic errors, and permits endogenous regressors. Our approaches extend the special regressor estimator originally proposed by Lewbel (2000). This estimator becomes impractical in high-dimensional settings due to the curse of dimensionality associated with high-dimensional…

状态变化因子模型的筛估计AI 解读

In this paper, we propose a sieve approach to estimate state-varying factor models, where the factor loadings vary over specific state variables. Our methodology consists of a two-step estimation procedure for the parameters of interest. In the first step, we achieve preliminary consistent estimates of the factors and factor loadings via nuclear norm regularization (NNR). In the second step, we perform post-NNR iterative least squares estimations for the factors and factor…