每日简报

基于统计微分方案的抗噪声惩罚算子AI 解读

Classical approaches to penalized smoothing often rely on basis or kernel expansions, which constrain the estimator to a fixed span and may be restrictive for discretely observed data. We instead regularize a single noisy trajectory directly on its observation grid, using difference operators that remain genuine finite-difference approximations to derivatives while being statistically normalized and mutually decorrelated under a reference noise law. We extend this…

超越有效性：利用多种代理变量识别结构向量自回归AI 解读

This paper develops a framework for robust identification in SVARs when researchers face a zoo of proxy variables. Instead of imposing exact exogeneity, we introduce generalized ranking restrictions (GRR) that bound the relative correlation of each proxy with the target and non-target shocks through a continuous proxy-quality parameter. Combining GRR with standard sign and narrative restrictions, we characterize identified sets for structural impulse responses and show how…

时间序列分析中基于似然的遍历性变换AI 解读

Time series often exhibit non-ergodic behaviour that complicates forecasting and inference. This article proposes a likelihood-based approach for estimating ergodicity transformations that addresses such challenges. The method is broadly compatible with standard models, including Gaussian processes, ARMA, and GARCH. A detailed simulation study using geometric and arithmetic Brownian motion demonstrates the ability of the approach to recover known ergodicity transformations.…

随机实验处理效应的非渐近置信区间AI 解读

We study nonasymptotic (finite-sample) confidence intervals for treatment effects in randomized experiments. In the existing literature, the effective sample sizes of nonasymptotic confidence intervals tend to be looser than the corresponding central-limit-theorem-based confidence intervals by a factor depending on the square root of the propensity score. We show that this performance gap can be closed, designing nonasymptotic confidence intervals that have the same…

基于最大均值差异的时间序列估计AI 解读

We define two minimum distance estimators for dependent data by minimizing some approximated Maximum Mean Discrepancy distances between the true empirical distribution of observations and their assumed (parametric) model distribution. When the latter one is intractable, it is approximated by simulation, allowing to accommodate most dynamic processes with latent variables. We derive the non-asymptotic and the large sample properties of our estimators in the context of…

如何解释近期双重差分方法的事件研究图AI 解读

This note discusses the interpretation of event-study plots produced by recent difference-in-differences methods. I show that even when specialized to the case of non-staggered treatment timing, the default plots produced by software for several of the most popular recent methods do not match those of traditional two-way fixed effects (TWFE) event-studies. The plots produced by the new methods may show a kink or jump at the time of treatment even when the TWFE event-study…

自适应实验中的最优条件推断AI 解读

We study batched bandit experiments and consider the problem of inference conditional on the realized stopping time, assignment probabilities, and target parameter, where all of these may be chosen adaptively using information up to the last batch of the experiment. Absent further restrictions on the experiment, we show that inference using only the results of the last batch is optimal. When the adaptive aspects of the experiment are known to be location-invariant, in the…

利用信息准则识别稀疏金融网络AI 解读

Empirical measures of financial connectedness based on Forecast Error Variance Decompositions (FEVDs) often yield dense network structures that obscure true transmission channels and complicate the identification of systemic risk. This paper proposes a novel information-criterion-based approach to uncover sparse, economically meaningful financial networks. By reformulating FEVD-based connectedness as a regression problem, we develop a model selection framework that…

双向聚类依赖下的极端分位数AI 解读

This paper studies extremal quantiles under two-way clustered dependence. We show that the limiting distribution of unconditional intermediate-order tail quantiles is Gaussian. This result is notable because two-way clustering typically leads to non-Gaussian limiting behavior. Remarkably, extremal quantiles remain asymptotically Gaussian even in degenerate cases. Building on this insight, we extend our analysis to extremal quantile regression at intermediate orders.…

高维尾指数回归AI 解读

Motivated by the empirical observation of power-law distributions in the credits (e.g., ``likes'') of viral posts in social media, we introduce a high-dimensional tail index regression model and propose methods for estimation and inference of its parameters. First, we propose a regularized estimator, establish its consistency, and derive its convergence rate. Second, we debias the regularized estimator to facilitate inference and prove its asymptotic normality. Simulation…

利用工具变量在内生性下学习政策规则AI 解读

I propose a framework for learning individualized policy rules in observational data settings characterized by endogenous treatment selection and the availability of an instrumental variable. I introduce encouragement rules that manipulate the instrument. By incorporating the marginal treatment effect (MTE) as a policy invariant parameter, I establish the identification of the social welfare criterion for the optimal encouragement rule. Focusing on binary encouragement…

阈值操纵下的因果推断：贝叶斯混合模型与异质处理效应AI 解读

Many marketing applications, including credit card incentive programs, offer rewards to customers who exceed specific spending thresholds to encourage increased consumption. Quantifying the causal effect of these thresholds on customers is crucial for effective marketing strategy design. Although regression discontinuity design is a standard method for such causal inference tasks, its assumptions can be violated when customers, aware of the thresholds, strategically…

Chatterjee 图相关系数的偏差校正AI 解读

Azadkia and Chatterjee (2021) recently introduced a simple nearest neighbor (NN) graph-based correlation coefficient that consistently detects both independence and functional dependence. Specifically, it approximates a measure of dependence that equals 0 if and only if the variables are independent, and 1 if and only if they are functionally dependent. However, this NN estimator includes a bias term that may vanish at a rate slower than root-$n$, preventing root-$n$ consiste…