论文检索

面板双重差分估计的简单变换方法AI 解读

In the case of panel data with staggered interventions, we propose a simple time-series transformation that can be combined with various treatment effect estimators. The transformation is at the unit level, and simply requires computing the average outcome prior to an intervention, subtracting it from a post-treatment outcome, and then carefully selecting the control units in each time period. We show that under no anticipation and parallel trends assumptions, the cohort…

再随机化与分层再随机化下灵活协变量调整的渐近推断AI 解读

Abstract Rerandomization is an effective treatment allocation procedure to control for baseline covariate imbalance. For estimating the average treatment effect, rerandomization has been previously shown to improve the precision of the unadjusted and the linearly adjusted estimators over simple randomization without compromising consistency. However, it remains unclear whether such results apply more generally to the class of M-estimators, including the g-computation formula…

利用高阶多元累积量估计弱因子AI 解读

When factors are weak, covariance-based factor analysis methods tend to exhibit poor performance. To address this issue in the case of non-Gaussian data, we propose a new method called Higher-order multi-cumulant Factor Analysis (HFA). HFA estimates factors and factor loadings via the eigenvalue decomposition of the product of a higher-order multi-cumulant matrix and its transpose. We derive the asymptotic properties of HFA under a weak factor model where non-Gaussianity…

平滑结构变化下 FAVAR 模型的时变模型平均AI 解读

Factor-augmented vector autoregressive (FAVAR) models serve as a powerful tool for forecasting economic and financial variables, particularly in environments with a large number of predictors. In this study, we propose a time-varying model-averaging method for FAVAR (TVMA-FAVAR) that accommodates smooth structural changes. To estimate the optimal time-varying combination weights, we develop a local leave-one-out cross-validation (LLOCV) criterion that is asymptotically…

区间值时间序列的正则化建模AI 解读

By treating intervals as inseparable sets, this paper proposes sparse machine learning regressions for high-dimensional interval-valued time series. With LASSO or adaptive LASSO techniques, we develop a penalized minimum distance estimation method, which covers point-based estimators are special cases. We establish the consistency and oracle properties of the proposed penalized estimator, regardless of whether the number of predictors grows slower or faster than the sample…

含变量测量误差的门槛回归AI 解读

We propose a novel generalized method of moments (GMM) estimator for linear threshold regression models with a mismeasured regressor and an exogenous threshold variable. The estimator addresses a key challenge in empirical applications: identifying model parameters in the absence of valid external instruments for the mismeasured regressor. We establish the consistency and asymptotic normality of the proposed estimator and develop test statistics for detecting threshold…

以分位数为目标的有限样本极小极大遗憾处理规则AI 解读

Consider a setup in which a decision maker is informed about the population by a finite sample and, based on that sample, has to decide whether or not to apply a certain treatment. We work out finite sample minimax regret treatment rules under various sampling schemes when potential outcomes are restricted onto the unit interval. In contrast to Stoye (2009, Journal of Econometrics 151, 70–81), where the focus is on the maximization of expected utility, the focus here is…

基于因子模型的高维降秩时间序列估计AI 解读

High-dimensional time series are very common in reality. Analyzing each series separately may not be a good strategy, as it may miss some important information and result in a less optimal outcome. Even worse, in some cases, it may not even provide an answer to the question of interest. Reduced-rank model is an important tool for joint analysis of high-dimensional multiple-response time series. In this paper, we develop a new and powerful method for estimating the…

采用可扩展子采样的 Metropolis–Hastings 算法AI 解读

The Metropolis–Hastings (MH) algorithm is one of the most widely used Markov Chain Monte Carlo schemes for generating samples from Bayesian posterior distributions. The algorithm is asymptotically exact, flexible and easy to implement. However, in the context of Bayesian inference for large datasets, evaluating the likelihood on the full data for thousands of iterations until convergence can be prohibitively expensive. This paper introduces a new subsample MH algorithm that…

双重序贯在线推断中的安全且随时有效的Alpha投资规则AI 解读

Dynamic decision-making in rapidly evolving research domains, including marketing, finance, and pharmaceutical development, presents a significant challenge. Researchers frequently confront the need for real-time action within a doubly sequential framework characterized by the continuous influx of high-volume data streams and the intermittent arrival of novel tasks. This calls for the development and implementation of new online inference protocols capable of handling both…

重尾与污染下基于核的自适应Huber均值回归AI 解读

We consider robust conditional mean learning in the mathematical framework of reproducing kernel Hilbert spaces, assuming the errors can be heavy-tailed and at the same time some responses are subject to arbitrary contamination. Simultaneous robustness to both heavy tails and contamination are of interest. When there is no contamination, we establish rates when the (1+θ)-moment ( θ>0) of the error exists, which matches the minimax rate for the least squares regression as…

公平性感知的高斯图回归及脑共表达QTL研究应用AI 解读

Glioblastoma multiforme (GBM) is a highly aggressive brain cancer with largely ineffective treatment. It is imperative to explore more effective therapies, such as gene-based treatments. For co-expression QTL studies of GBM, we develop fairness-aware Gaussian graphical regression models (Fair RegGGMs), which can determine how genetic variants modulate subject-level gene networks, and recover both population-level and subject-level gene graphs, while ensuring that the…

高维环境中的涵盖检验与递进检验AI 解读

This paper introduces the Subseries-based Cauchy Combination Test (SCT), a novel procedure for testing encompassing relationships or model validity using identification conditions formulated as multiple moment restrictions. SCT applies to weakly or short-range-dependent data and eliminates the need to estimate high-dimensional covariance matrices. Unlike Wald- or J-type tests, it remains reliable in both low- and high-dimensional settings. The test is asymptotically unbiased…

区间识别集参数推断的功效性质AI 解读

This article studies the power properties of confidence intervals (CIs) for a partially-identified parameter of interest with an interval identified set. We assume that the researcher has bounds estimators needed to construct the CIs proposed by Imbens and Manski (2004), Stoye (2009), and Stoye (2020), denoted by C I α 1 $CI_{\alpha }^{1}$ upper C upper I Subscript alpha Superscript 1 , C I α 2 $CI_{\alpha }^{2}$ upper C upper I Subscript alpha Superscript 2 , C I α 3 $CI_{\alpha }^{3}$…

含交互固定效应面板中的稳健估计与推断AI 解读

We consider estimation and inference for a regression coefficient in panels with interactive fixed effects (i.e., a factor structure). We show that previously developed estimators and confidence intervals (CIs) are heavily biased and size distorted when some of the factors are weak. Combining the theory of minimax linear estimation with a nuclear norm bound on the error of an initial estimate of the interactive effects, we propose estimators with improved rates of…

观察性研究中因果推断的样本量与检验力计算AI 解读

This paper investigates the theoretical foundation and develops analytical formulas for sample size and power calculations for causal inference with observational data. By analyzing the variance of an inverse probability weighting estimator of the average treatment effect, we decompose the power calculation into three components: propensity score distribution, potential outcome distribution and their correlation. We show that to determine the minimal sample size of an…

匹配型平均处理效应估计量的高斯与自助法近似AI 解读

We establish Gaussian approximation bounds for covariate and rank-matching-based Average Treatment Effect (ATE) estimators. By analyzing these estimators through the lens of stabilization theory, we employ the Malliavin–Stein method to derive our results. Our bounds precisely quantify the impact of key problem parameters, including the number of matches and treatment balance, on the accuracy of the Gaussian approximation. Additionally, we develop multiplier bootstrap…

高阶图极限函数理论：波动、退化与推断AI 解读

Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a natural way to sample exchangeable random graphs. It is well known that network moments (motif/subgraph counts) identify a graphon (up to an isomorphism); hence, understanding the sampling distribution of subgraph counts in random graphs…

数据增强算法的快速混合：贝叶斯 probit、logit 与 lasso 回归AI 解读

We propose using a modified conductance-based method to study the mixing time of an important class of two-block Gibbs samplers, the data augmentation (DA) algorithm. Using this method, we prove the first non-asymptotic polynomial upper bounds on mixing times of three important DA algorithms: DA algorithms for Bayesian Probit regression (ProbitDA) and Bayesian Logit regression (LogitDA), and Bayesian Lasso Regression (LassoDA). Concretely, for ProbitDA and LogitDA, we…

超越随机缺失与完全随机缺失的估计AI 解读

We study the effects of missingness on the estimation of population parameters. Moving beyond restrictive missing completely at random (MCAR) assumptions, we first formulate a missing data analogue of Huber’s arbitrary ϵ-contamination model. For mean estimation with respect to squared Euclidean error loss, we show that the minimax quantiles decompose as a sum of the corresponding minimax quantiles under a heterogeneous, MCAR assumption and a robust error term, depending on…

高维秩一推断的伪最大似然理论AI 解读

We develop a pseudo-likelihood theory for rank one matrix estimation problems in the high-dimensional limit. We prove a variational principle for the limiting pseudo-maximum likelihood, which also characterizes the performance of the corresponding pseudo-maximum likelihood estimator. We show that this variational principle is universal and depends only on four parameters determined by the corresponding null model. Through this universality, we introduce a notion of…

高度分层实验的估计效率AI 解读

This paper studies the use of highly stratified designs for the efficient estimation of a large class of treatment effect parameters that arise in the analysis of experiments. By a “highly stratified” design, we mean experiments in which units are divided into blocks of a fixed size and a proportion within each block is assigned to a binary treatment uniformly at random. The class of parameters considered are those that can be expressed as the solution to a set of moment…

随机对象的关联度量与独立性检验AI 解读

We develop a unified framework for testing independence and quantifying association between random objects that are located in general metric spaces. Special cases include functional and high-dimensional data as well as networks, covariance matrices and data on Riemannian manifolds, among other metric space-valued data. A key concept is the profile association, a measure based on distance profiles that intrinsically characterize the distributions of random objects in metric…

污染机制下后验采样的隐私保证AI 解读

In recent years, differential privacy has been adopted by tech-companies and governmental agencies as the standard for measuring privacy in algorithms. In this article, we study differential privacy in Bayesian posterior sampling settings. We begin by considering differential privacy in the most common privatisation setting in which Laplace or Gaussian noise is injected into the output. In an effort to achieve better differential privacy, we consider adopting Huber’s…