论文检索

指数随机图模型的经验贝叶斯弹性网计算AI 解读

Exponential random graph models (ERGMs) describe dependence among network ties, but inference becomes difficult when the likelihood is intractable and candidate network statistics are strongly correlated. We introduce BERGM Elastic Net, an adaptive empirical-Bayes approach that combines lasso shrinkage with ridge stabilization in a Bayesian ERGM. A latent-variable formulation supports approximate exchange sampling, while empirical-Bayes updates adapt the amount of…

一般处理类型下稳健匹配观察研究：一致性、效率与适应性AI 解读

To ensure reliable causal conclusions from observational studies, researchers routinely conduct sensitivity analysis to assess robustness to unmeasured confounding. In matched observational studies (one of the most popular observational study designs), two foundational concepts, design sensitivity and Bahadur-Rosenbaum efficiency, are used to quantify the robustness of test statistics and study designs in sensitivity analyses. Unfortunately, these measures of robustness are…

面向空间转录组与遥感数据的空间正交因子模型AI 解读

Principal component analyses are often applied to spatial data towards inference on latent modes of spatial variation. These analyses are widespread across domains including spatial transcriptomics and environmental sciences, where the modes of spatial variation are represented by corresponding factors of gene expression or remotely sensed time series measurements. Many methods have been proposed for incorporating spatial information into a probabilistic PCA framework;…

利用网络数据识别和估计半参数 Logit 模型AI 解读

This paper studies identification and estimation of a semiparametric logit model in which an unobserved individual characteristic affects both a binary outcome and the formation of social links. In this setting, the endogeneity of the network is informative rather than a nuisance: because the same latent trait drives linking behavior, observed network data can be used to control for unobserved heterogeneity in the outcome equation without imposing a parametric model of link…

广义 Riesz 回归：基于 Bregman 散度拟合的去偏机器学习统一框架AI 解读

Estimating the Riesz representer is central to debiased machine learning, yet the generator and representer model determine which regression directions their first-order conditions protect. We introduce generalized Riesz regression, which minimizes a Bregman divergence made observable by the Riesz identity. Squared and Kullback--Leibler-type choices recover Riesz regression, tailored loss minimization, and density-ratio objectives. For any twice-differentiable generator and…

基于最大似然的图模型选择后推断AI 解读

The graphical lasso is a widely used algorithm for fitting undirected Gaussian graphical models. However, for inference on functionals of edge values in the learned graph, standard tools lack formal statistical guarantees, such as control of the type I error rate. We introduce a selective inference method for asymptotically valid inference after graphical lasso selection with added randomization. We obtain a selective likelihood, conditional on the event of selection,…

去偏Cox回归的野生自助法与Efron自助法AI 解读

Cox regression with Lasso penalization is widely used for variable selection in time-to-event data, but reliable coefficient inference after selection remains difficult. We investigate bootstrap inference for the debiased Cox estimator after Cox Lasso selection. Two score-based procedures are considered: a wild bootstrap using independent multipliers and an Efron bootstrap using centered multinomial resampling weights. Both procedures keep the original Cox Lasso fit and…

非平稳时间序列中稳定区间的检验AI 解读

Many time series are not stable over their full observation horizon, but may contain scientifically meaningful periods during which a signal remains stable up to a prescribed tolerance. We formulate this as an existence test for stable intervals in a non-stationary regression model with dependent, locally stationary errors. For a signal $d$ derived from the mean function, including deviations from reference levels and derivatives, stability over duration $δ$ is encoded by $d_\infty=\inf_{t\in[0,1-δ]}\sup_{s\in[t,t+δ]}|d(s)|$…

通过等周方法改进二元线性分类的泛化界AI 解读

We examine the concentration of uniform generalization errors around their expectation in binary linear classification problems via an isoperimetric argument. In particular, we establish Poincaré and log-Sobolev inequalities for the joint distribution of the output labels and the label-weighted input vectors, which we apply to derive concentration bounds. The derived results improve upon existing bounds obtained from general unbounded empirical processes, as well as that…

非对称 Huber 周期图AI 解读

This paper introduces a novel spectral M-estimator, called the asymmetric Huber periodogram (AHP), as a generalization of the ordinary periodogram (PG), the quantile periodogram (QP), and the Huber periodogram (HP). The AHP is constructed via trigonometric asymmetric Huber regression (AHR), in which a specially designed loss function replaces the squared $\ell_2$ loss used to define the PG. Relative to the QP, the AHP can be more computationally efficient, and relative to…

高维单指标模型：连接函数估计与坐标推断AI 解读

This study proposes a novel method for estimation and hypothesis testing in high-dimensional single-index models. We address a common scenario where the sample size and the dimension of regression coefficients are large and comparable. Unlike previous approaches, which often overlook the estimation of the unknown link function, we introduce a new method for link function estimation. Leveraging the information from the estimated link function, we propose more efficient…

网络实现 GARCH–Itô 模型：基于高频识别的波动率溢出AI 解读

We introduce a network realized GARCH-Itô model in which volatility transmission is a dynamic relation among the latent daily integrated volatilities of multiple assets. An unknown directed and signed network is embedded in a continuous-time variance process and appears in the resulting exponential daily recursion. Intraday returns identify integrated volatility and hence the network that governs its propagation. For a fixed network template, feasible estimation based on…

正值性违反下修正处理政策的因果效应：部分识别方法AI 解读

Modified treatment policies (MTPs) are interventions based on each individual's natural treatment value. We study mean outcomes under MTPs for continuous treatments, including exposure mixtures. Positivity is the standard sufficient condition for identifying these mean outcomes without extrapolation: policy-generated values remain supported given covariates. With multivariate treatments or continuous covariates, treatment--covariate combinations can be sparse or unsupported.…

基于约束的因果模型选择：一种审慎方法AI 解读

We study the data-driven selection of causal graphical models using constraint-based algorithms, which determine the existence or non-existence of edges (causal connections) in a graph based on testing a series of conditional independence hypotheses. In settings where the ultimate scientific goal is to use the selected graph to inform estimation of some causal effect of interest (e.g., by selecting a valid and sufficient set of adjustment variables), we argue that a…

基于最大均值差异的时间序列估计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 解读

In cluster-randomized trials (CRTs), entire clusters of individuals are randomized to treatment, and outcomes within a cluster are typically correlated. While frequentist approaches are standard practice for CRT analysis, Bayesian methods have emerged as a strong alternative. Previous work has investigated the use of Bayesian hierarchical models for continuous, binary, and count outcomes in CRTs, but these approaches focus on model-based treatment effect coefficients as the…

贝叶斯趋势滤波的图依赖收缩先验AI 解读

Many common data dependencies can be characterized by graphs: time series data are sequential (chain graph), images appear as pixels (lattice graph), areal data are defined by neighboring units (spatial adjacency graph), etc. Graph trend filtering seeks to smooth and predict such data. However, classical trend filtering only incorporates the graph for estimation of the trend, which limits its adaptivity, and is brittle in the presence of missing data. Further, it lacks…

加速住宅太阳能系统采用：动态结构模型的政策分析AI 解读

Problem definition: Solar electricity generation is a strategic component of energy portfolios designed to meet growing demand and reduce carbon emissions. Governments and municipalities encourage household photovoltaic (PV) adoption through upfront rebates and tax credits. Limited budgets require principled, data-driven policies that account for the drivers of adoption and the effects of incentives on adoption rates. Methodology/results: We develop a dynamic structural…

通过 Riesz 校准最优传输将随机试验效应迁移至现实人群AI 解读

Randomized trials support causal inference, but differences between trial and target populations can limit the transportability of treatment effects to real-world settings. Many existing approaches model the propensity of trial participation and can therefore be sensitive to model misspecification and weak overlap of the covariate distributions. Optimal Transport (OT) offers a different route by comparing the trial and target populations directly in covariate space. We…

分类检验：从定量估计得出定性结论的新框架AI 解读

Social scientists rely on hypothesis testing to support their research conclusions, but the standard tests are designed for testing one hypothesis rather than adjudicating between rival possibilities. We develop a new framework, "classification testing", as an alternative. Instead of selecting one hypothesis to test, a researcher conducting a classification test decides what qualitative distinctions ("classes") are most substantively relevant; the test either assigns the…

通过留一变量法交叉验证因果发现AI 解读

We propose a new approach to falsify causal discovery algorithms without ground truth, which is based on testing the causal model on a variable pair excluded during learning the causal model. Specifically, given data on $X, Y, \boldsymbol{Z}=X, Y, Z_1,\dots,Z_k$, we apply the causal discovery algorithm separately to the 'leave-one-out' data sets $X, \boldsymbol{Z}$ and $Y, \boldsymbol{Z}$. We demonstrate that the two resulting causal models, in the form DAGs, ADMGs, CPDAGs…

计算预算约束下双重机器学习的均匀设计子抽样AI 解读

Double machine learning (DML) combines orthogonal scores with flexible nuisance estimation, but repeated cross-fitting and repeated analysis can make full-data workflows expensive. When a fixed computational budget requires a working sample of size $r\ll n$, simple random subsampling may cover the covariate space poorly and produce unstable treated--control composition. We propose Uniform Design Double Machine Learning (UD-DML), which maps a common low-discrepancy skeleton…

概率通胀预测的序贯有效推断AI 解读

Traditional statistical tests are poorly suited for the sequential evaluation of probabilistic forecast calibration. We address this limitation in macroeconomic forecasting by applying a new sequential testing method based on e-values. The e-value-based methodology enables anytime-valid inference. It allows practitioners to test against calibration continuously without invalidating statistical guarantees. To illustrate the framework's practical value, we apply it to…

利用结构化均值变化的矩阵时间序列自适应变点检测AI 解读

In high-dimensional time series, the component processes are often assembled into a matrix to display their interrelationship. We focus on detecting mean shifts with unknown change point locations in these matrix time series. Series that are activated by a change may cluster along certain rows (columns), which forms mode-specific change point alignment. Leveraging mode-specific change point alignments may substantially enhance the power for change point detection. Yet, there…