论文检索

排序惩罚估计量：相关性稳健收缩方法的推断AI 解读

Variable correlations pose significant challenges for various LASSO-type shrinkage methods in big-data modeling. This paper presents a comprehensive framework for a correlation-robust shrinkage estimator, enhancing both the theoretical and practical aspects of high-dimensional estimation. We break down the penalty term into a “shrinkage” term and a “grouping” term, illustrating its distinctive properties in clustering highly correlated variables. We establish the…

基于估计函数的弱条件位置时间序列模型断点推断AI 解读

Drawing on Godambe’s theory of estimating functions, we present a statistical approach for identifying breaks in time series dynamics under weak assumptions. We assume a parametric form for the conditional mean but make no specific assumptions about the data-generating process (DGP), nor about the other conditional moments. The cumulative sum (CUSUM) statistics and segmentation of minimal cost (SMC) statistics that we consider depend on a sequence of weights that influence…

含交互固定效应的非平衡面板模型估计与推断AI 解读

This paper establishes the inferential theory for unbalanced panel data models with interactive fixed effects. We propose a two-step estimation algorithm with the first step obtaining an initial consistent estimator followed by an alternating maximization procedure. We prove that the alternating maximization procedure is a contractionary mapping and the final estimator is asymptotically normal, as long as the initial estimator is consistent. We also develop analytical bias…

动态随机系数模型的识别与估计AI 解读

Abstract I study linear panel data models with predetermined regressors (such as lagged dependent variables) where coefficients are individual-specific, allowing for heterogeneity in the effects of the regressors on the dependent variable. I show that the model is not point-identified in a short panel context but rather partially identified, and I characterize the identified sets for the mean, variance, and CDF of the coefficient distribution. This characterization is…

一般条件下基于局部投影的推断AI 解读

Abstract This article develops the uniform asymptotic theory for local projection (LP) regression when the true lag order of the model is unknown and potentially infinite. The theory allows for varying degrees of persistence in the data, growing response horizons, and general conditionally heteroskedastic martingale-difference shocks. Based on the theory, we make two main contributions. First, we show that LPs can achieve semiparametric efficiency at a given horizon under…

结合目标学习推断的在线元层级自适应设计框架AI 解读

Adaptive designs are increasingly used in clinical trials and online experiments to improve participant outcomes by dynamically updating treatment allocation as data accumulate. In practice, experimenters often consider multiple candidate designs, each with distinct trade-offs. However, typically only one design is implemented at a time, leaving benefits and costs of alternative designs unobserved and unquantified. To address this, we propose a novel meta-level adaptive…

利用充分维度关联进行高维统计推断与变量选择AI 解读

Simultaneous variable selection and statistical inference is challenging in high-dimensional data analysis. Most existing post-selection inference methods require explicitly specified regression models, which are often linear, as well as sparsity in the regression model. The performance of such procedures can be poor under either misspecified nonlinear models or a violation of the sparsity assumption. In this article, we propose a sufficient dimension association (SDA)…

高维空间极值的空间尺度感知尾部依赖建模AI 解读

Extreme events over large spatial domains may exhibit highly heterogeneous tail dependence characteristics, yet most existing spatial extremes models yield only one dependence class over the entire spatial domain. To accurately characterize dependence in extreme events, we propose a mixture model that achieves flexible dependence properties and allows high-dimensional inference (∼600 spatial locations in our data example) for extremes of spatial processes. We modify the…

序贯变点定位的检测后推断AI 解读

Abstract This article addresses a fundamental but largely unexplored challenge in sequential changepoint analysis: conducting inference following a detected change. We develop a very general framework to construct confidence sets for the unknown changepoint using only the data observed up to a data-dependent stopping time at which an arbitrary sequential detection algorithm declares a change. Our framework is nonparametric, making no assumption on the composite postchange…

因果 K 均值聚类AI 解读

Abstract Causal effects are often characterized at the population level, which can mask important heterogeneity across latent subgroups. Since the subgroup structure is unknown, identifying and evaluating subgroup specific effects is substantially more challenging than standard population level analysis. We address this problem by proposing Causal k-Means Clustering, a framework that uses k-means clustering ideas to recover unknown subgroup structure from individual level…

深度学习中分支与嵌套超参数的贝叶斯优化AI 解读

Hyperparameter optimization plays a crucial role in the success of neural networks as hyperparameters directly control the behavior and performance of the training algorithms. To obtain efficient tuning, Bayesian optimization based on Gaussian process is widely used. Despite numerous applications in deep learning, the existing methods rely on a convenient but restrictive assumption that the tuning parameters are independent of each other. However, tuning parameters with…

微分方程建模中的非参数先验学习AI 解读

This article addresses Bayesian inference related to partial differential equations (PDEs), particularly nonparametric regression constrained by PDEs. To effectively encode prior information, we propose a novel framework that learns a prediction function of the prior distribution from historical training datasets. We introduce hyper-prior and hyper-posterior distributions and derive a generalization error estimate, which accommodates data-dependent priors by extending the…

随机实验中协变量平衡的高斯化设计优化AI 解读

Abstract Achieving covariate balance in randomized experiments enhances the precision of treatment effect estimation. However, existing methods often require heuristic adjustments based on domain knowledge and are primarily developed for binary treatments. This paper presents Gaussianized Design Optimization, a novel framework for optimally balancing covariates in experimental design. The core idea is to Gaussianize the treatment assignments: we model treatments as…

通过近似消息传递实现高维 Newey–Powell 检验AI 解读

We propose a high-dimensional extension of the heteroscedasticity test proposed in Newey and Powell (1987). Our test is based on expectile regression in the proportional asymptotic regime where $n/p \to \delta \in (0,1]$ . The asymptotic analysis of the test statistic uses the approximate message passing algorithm, from which we obtain the limiting distribution of the test and establish its asymptotic power. The numerical performance of the test is validated through an…

具有依赖边的自回归网络AI 解读

Abstract We propose an autoregressive framework for modelling dynamic networks with dependent edges. It encompasses models that accommodate, for example, transitivity, degree heterogenenity, and other stylized features often observed in real network data. By assuming the edges of networks at each time are independent conditionally on their lagged values, the models, which exhibit a close connection with temporal exponential random graph models, facilitate both simulation and…

有限混合模型的拜占庭容错分布式学习AI 解读

Abstract Traditional statistical methods need to be updated to work with modern distributed data storage paradigms. The split-and-conquer framework that learns models on local machines and averaging their parameter estimates is common. However, this does not work for the important problem of learning finite mixture models, because subpopulation indices on each local machine may be arbitrarily permuted (the ‘label switching problem’). Earlier work proposed mixture reduction…

小区域估计中的双重稳健方法AI 解读

In the context of robust small area estimation (SAE), there are two types of robustness considerations, robustness against model misspecification and robustness against outliers. We propose a method of SAE that has both types of robustness features. The method combines the idea of observed best prediction (OBP), which is known to be more robust against model misspecification than the traditional best linear unbiased prediction (EBLUP) method, and the method of density power…

高维向量与张量时间序列的重尾稳健因子建模AI 解读

Summary We study the problem of factor modelling vector- and tensor-valued time series in the presence of heavy tails in the data, which produce extreme observations with nonnegligible probability. We propose combining a two-step procedure for tensor decomposition with data truncation, which is easy to implement and does not require an iterative search for a numerical solution. Departing from the light-tail assumptions often adopted in the time series factor-modelling…

模型误设下的稳健通用推断AI 解读

Summary In statistical inference, it is rarely realistic to assume that the hypothesized statistical model is well specified; consequently, it is important to understand the effects of misspecification on inferential procedures. When the hypothesized statistical model is misspecified, the natural target of inference is a projection of the data-generating distribution onto the model. We present a general method for constructing valid confidence sets for such projections,…

基于积分条件矩的一致卡方设定检验AI 解读

In spite of the omnibus property of integrated conditional moment (ICM) specification tests, they are not commonly used in empirical practice owing to features such as the non-pivotality of the test and the high computational cost of available bootstrap schemes, especially in large samples. This article proposes specification and mean independence tests based on ICM metrics. The proposed test exhibits consistency, asymptotic $\chi ^2$ -distribution under the null hypothesis,…

流形假说的统计探索AI 解读

Abstract The manifold hypothesis is a widely accepted tenet of machine learning which asserts that nominally high-dimensional data are in fact concentrated near a low-dimensional manifold, embedded in high-dimensional space. This phenomenon is observed empirically in many real-world situations, has led to development of a wide range of statistical methods in the last few decades, and has been suggested as a key factor in the success of modern AI technologies. We show that…

Chang 与 Lei 对《流形假设的统计探索》的讨论AI 解读

We congratulate the authors on an insightful paper that spans both a general theory of manifold emergence, and methodology for exploring hidden manifold structure in high-dimensional data. In summary, assuming the result of Theorem 1 holds, the effectiveness of PCA in elucidating the geometry of the latent domain from high-dimensional data is closely related to the statistical properties of the random functions (Xj)1≤j≤p such as distinguishability and stationarity. To…

Kundu与Schmidt-Hieber对《流形假说的统计探索》的讨论AI 解读

The authors have done an admirable job by combining new methodology, meaningful statistical theory and applications all within one article. The work is both deep and accessible. As a first discussion point, let us relate the proposed latent metric model (LMM) to functional PCA. This comparison can serve as basis to borrow strength and to advance the understanding of both approaches or even to unify them. The latent metric model assumes that we observe where Z1,…,Zn∼μ are…

Simon 等对《流形假说的统计探索》的讨论AI 解读

We congratulate the authors on their impressive effort and commend their tour de force. Our comments follow below. Theoretical foundations. The authors contribution is driven by embedding the manifold hypothesis in a rigorous statistical framework. The Latent Manifold Model (LMM) plays a central role by integrating latent variables, random functions, and structured noise within a unified construction. Grounded in Mercer’s theorem, the approach links correlation kernels with…