每日简报

基于最优传输的稳定因果估计AI 解读

In observational studies, the overlap assumption, also called positivity, is frequently strained in practice. Limited overlap destabilizes widely used estimators such as inverse propensity weighting (IPW), whose variance depends on density ratios that explode as propensity scores approach zero or one. To address this challenge, we propose the Stable Transport Estimator (STE), an optimal transport-based approach for estimating average causal effects when overlap holds but…

基于正则化对抗重加权的前验知情可泛化低秩表示学习AI 解读

Modern learning problems increasingly leverage data from heterogeneous sources to improve robustness and generalizability under distribution shift, often with high-dimensional parameters admitting low-rank structure. Existing group distributionally robust optimization (group-DRO) approaches optimize against adverse source mixtures, but extending this principle to low-rank matrix estimation with a broad class of losses leads to a challenging nonconvex-concave problem for…

相关矩阵的平衡参数化AI 解读

We introduce the balanced correlation parametrization (BCP), which maps positive-definite correlation matrices one-to-one onto the set of symmetric hollow matrices. A key feature of the parametrization is that both the transformation and its inverse are available in closed form. It combines marginal and partial correlations, is inverse-consistent and equivariant under variable permutations and sign changes, and preserves block structure. A novel property of BCP is that it…

社会网络数据中处理效应的识别与估计：当社会连接存在混杂时AI 解读

In observational network data, the adoption of a treatment and the formation of social ties often depend on the same characteristics that affect outcomes. We propose a generalized propensity score for each unit's effective treatment, built from a model for treatment assignment and a dyadic model for network formation, which may include latent node heterogeneity. The score is marginalized over the network given covariates rather than conditioned on the realized network, and…

协整回归变量：折叠凹惩罚何时超越 LASSOAI 解读

LASSO is one of the most popular regularization methods for high-dimensional regression models. While cointegration is common in practical applications of predictive regressions with many regressors, the convex penalty of LASSO overly suppresses the coefficients of cointegrated regressors and therefore fails to deliver consistent parameter estimation. We employ folded concave penalties (FCP), including the well-known SCAD and MCP, to address this issue. Using FCP, we…

读者与标注条件依赖参考标签下乳腺病理AI一致性的贝叶斯不确定性量化AI 解读

Human reference labels used to evaluate medical AI can vary across readers and annotation workflows. We quantified agreement of a fixed pathology AI system with a future qualified reader without treating inferred consensus as error-free biological truth. Linked Evaluation and Unbiased NuCLS multirater data were analyzed using a fixed external HoVer-Net decision vector. The selected frame contained 1,144 anchors, 52 fields of view, five slides/patients, and five primary…

随机试验的比较：试验参与效应与效应迁移AI 解读

Disagreements between randomized trials that address the same causal question pose challenges for the interpretation and synthesis of evidence. We sketch a causal framework for comparing the results of randomized trials that explicitly accommodates the possibility of trial engagement effects. Using counterfactual outcomes defined under joint interventions on treatment assignment and trial-related actions, we compare trial-native treatment effects with the effects transported…

循环重心编码器：预测、模拟及其在时间序列分析中的应用AI 解读

This dissertation has two parts. In the first part we theoretically develop a framework that extends the optimal transport barycenter problem from independent data with observed covariates to processes whose relevant covariate is their own history. Given a stationary stochastic process, our framework shows there exists an invertible transport map that extracts from it an iid component whose distribution is the barycenter of the conditional distributions of the input process…

重尾模型中的基于比率的因果发现AI 解读

In many complex systems, such as river networks and financial markets, extreme events propagate from causes to their effects, and the largest observations carry the most information about the underlying causal structure. Existing methods for causal discovery in extremes, however, are tailored to specific mechanisms, such as linear or max-linear models. This work develops causal discovery for heavy-tailed homogeneous structural causal models, a flexible class that contains…

记录链接存在歧义时的随机实验AI 解读

Randomized experiments are often linked to administrative data to measure outcomes, but coarse identifiers can leave multiple administrative records consistent with each experimental unit. We show that unbiased estimation of the sample average treatment effect is possible without resolving these ambiguous links or specifying an outcome model. Our key linkage requirement is that the true administrative outcome is contained among the candidate outcomes for each experimental…

基于相容性的贝叶斯推断：渐近极限、变分原理与 Wasserstein 几何AI 解读

Approximate Bayesian Computation (ABC) replaces intractable likelihood evaluations with comparisons between observed and simulated data. We develop a measure-theoretic formulation of discrepancy-based Bayesian inference in which compatibility is encoded through nonnegative weights. For vanishing thresholds, we establish convergence of the corresponding posterior distributions in total variation. In the large-sample regime, we identify conditions under which the posterior…

矩阵值 CP 因子模型的识别问题与准极大似然估计AI 解读

Matrix-valued time series, arising in diverse fields such as economics, neuroscience, and recommender systems, have become increasingly prominent in modern data analysis. Among various modeling frameworks, the matrix-variate CP-factor model represents an important and widely applicable class for capturing low-rank structures in matrix time series. In this paper, we provide a unified treatment for the identification problem of CP factor models using both analytic and…

高维 Ornstein–Uhlenbeck 过程漂移项的稀疏估计AI 解读

We study sparsity-regularized maximum likelihood estimation for the drift parameter of high-dimensional non-stationary Ornstein--Uhlenbeck processes given repeated measurements of i.i.d. paths. In particular, we show that Lasso and Slope estimators can achieve the minimax optimal rate of convergence. We exhibit numerical experiments for sparse estimation methods and show their performance.