论文检索

高效稀疏典型相关分析AI 解读

In high-dimensional settings, Canonical Correlation Analysis (CCA) often fails, and existing sparse methods force an untenable choice between computational speed and statistical rigor. This work introduces a fast and provably consistent sparse CCA algorithm (ECCAR) that resolves this trade-off. We formulate CCA as a high-dimensional reduced-rank regression problem, which allows us to derive consistent estimators with high-probability error bounds without relying on…

利用市场信息网络建模并评估金融极端事件预测AI 解读

Modeling the joint distribution of extreme values in high-dimensional financial time series is challenging because extremes are sparse and locally extreme observations are not necessarily extreme relative to their full marginal distribution. To address this, we introduce a time-dependent network Hüsler-Reiss model in which market-informed adjacency matrices determine how strongly observations contribute to the estimation. We propose binary and weighted specifications,…

熵正则化逆强化学习的统计分析AI 解读

Inverse reinforcement learning aims to infer the reward function that explains expert behavior observed through trajectories of state--action pairs. A long-standing difficulty in classical IRL is the non-uniqueness of the recovered reward: many reward functions can induce the same optimal policy, rendering the inverse problem ill-posed. In this paper, we develop a statistical framework for Inverse Entropy-regularized Reinforcement Learning that resolves this ambiguity by…

心理测量结局缺失时高维预测变量的贝叶斯选择AI 解读

High-dimensional, multimodal predictors and partially observed multivariate outcomes are common in psychometric research. However, existing regularization methods often do not accommodate hierarchical predictor structures and are primarily designed for univariate outcomes. We propose SHIM, a Bayesian framework for structured variable selection that combines hierarchical horseshoe shrinkage with a Bayesian treatment of missing outcomes. The framework jointly accommodates…

面向政策选择的实验设计AI 解读

We show how to optimally design experiments when the resulting data will be used to choose a welfare-maximizing policy subject to constraints. A decision maker seeks to maximize Bayes expected welfare by choosing a policy whose effects depend on an unknown finite-dimensional parameter. The decision maker has access to a first wave of experimental data with a fixed design but may choose the design of a second wave that will be collected before choosing the policy. The…

注意力过载AI 解读

We introduce an Attention Overload Model (AOM) in which alternatives compete for attention, so each alternative's consideration probability weakly decreases as the choice problem expands. This nonparametric restriction has a search-capacity foundation. We identify exactly which preference rankings are compatible with observed choices and establish sharp bounds on latent attention. We then consider heterogeneous preferences in settings where alternatives are presented in a…

基于正交机器学习的非参数异质性因果中介分析AI 解读

Causal mediation analysis decomposes the total effect of an intervention on an outcome into a direct pathway and an indirect pathway transmitted through a mediator, but standard methods typically summarize these pathways using population average effects. In many applications, however, the indirect effect may vary substantially across individual profiles. We propose an orthogonal statistical learning framework for estimating heterogeneous causal mediation effects conditional…

DFNN：学习度量空间值响应的深度弗雷歇神经网络框架AI 解读

Regression with non-Euclidean responses---e.g., probability distributions, networks, symmetric positive-definite matrices, and compositions---has become increasingly important in modern applications. In this paper, we propose deep Fréchet neural networks (DFNNs), an end-to-end deep learning framework for predicting non-Euclidean responses---which are considered as random objects in a metric space---from Euclidean predictors. Our method utilizes the representation-learning…

稀疏正则化多边际最优传输与重心的中心极限定理及自助法AI 解读

Wasserstein barycenters are a fundamental tool for the analysis of distribution-valued data, but their computation and statistical analysis become challenging in high-dimensional and multi-sample settings. The unregularized barycenter problem is computationally demanding and suffers severely from the curse of dimensionality, making regularization essential in many applications. While regularized optimal transport methods are widely used, approaches based on entropic…

通过动态社区检测实现高维时间序列的线性复杂度因果发现AI 解读

Understanding which parts of a dynamical system cause each other is extremely relevant in fundamental and applied sciences. However, inferring causal links from observational data, namely without direct manipulations of the system, is still computationally challenging, especially if the data are high-dimensional. In this study we introduce a framework for constructing causal graphs from high-dimensional time series, whose computational cost scales linearly with the number of…

低温下的高磁化采样：Ising模型与贝叶斯稀疏线性回归AI 解读

Sparsity is a powerful structural resource in optimization and statistics. We develop frameworks for leveraging sparsity in sampling problems over the Hamming slice $\mathcal{X}_k^d:=\{\mathbf{x}\in\{\pm 1\}^d:|\{i:\mathbf{x}_i=1\}|=k\}$, in high-dimensional regimes where $k\ll d$ (i.e., where $\mathcal{X}_k^d$ is \emph{highly magnetized}). We use our frameworks to design improved samplers for canonical problems in the study of \emph{Ising models} and \emph{Bayesian sparse…

Lipschitz 谱算法下 RKHS 回归与序列模型的风险等价AI 解读

Kernel spectral algorithms are often summarized by convergence rates, which hide how their risk depends jointly on regularization, noise, the population spectrum, target coefficients, and the chosen filter. Gaussian sequence models arise as a simplified but characteristic setting for studying the interplay of these factors, where the kernel spectral algorithm corresponds to a coordinatewise shrinkage estimator. Under mild assumptions, we show that the risk of a kernel…

异质特征空间下线性回归的迁移学习AI 解读

Transfer learning improves target-task performance by leveraging related source data. Most methods assume shared feature spaces, yet in many applications, each source observes only a subset of target covariates. Classical imputation fails here due to block missingness, and standard imputation matrices are not optimized for target parameter estimation. We study low- and high-dimensional linear regression and propose Heterogeneous Importance Weighting (HIW). Our method aligns…

基于结构信息的迁移学习AI 解读

Transfer learning improves estimation in a target study using information from related sources. Classical transfer learning is typically data-based, requiring access to the source data or to a model fitted on them. Neither is available in many modern studies, as both are often proprietary or unreported. What can be transferred instead is structure: summarized information derived from a source, such as the supports of predictors, which is available and interpretable without…

Softmax 混合模型中的 EM 算法与矩估计AI 解读

Softmax Mixture Models (SMMs) are discrete $K$-component mixture models for the probabilities of selecting one of $p$ candidate feature vectors $X_1,\ldots,X_p\in\mathbb{R}^L$ in heterogeneous populations and are widely used in econometrics and scientific applications. Related softmax mixture mechanisms also appear in modern LLM architectures. We provide a theoretical and methodological study of SMMs, focusing on the Expectation-Maximization (EM) algorithm and the Method of…

通过等变神经网络实现相关误差离散选择模型的摊销推断AI 解读

Discrete choice models are fundamental tools in management science, economics, and marketing for understanding and predicting decision-making. Logit-based models are dominant in applied work, largely due to their convenient closed-form expressions for choice probabilities. However, they impose restrictive assumptions on the stochastic utility component, constraining our ability to capture realistic substitution patterns. We propose an amortized inference approach that relies…

因果树与因果森林的中位数分裂规则AI 解读

Heavy-tailed and skewed outcomes are common in the randomized experiments and observational studies used to estimate heterogeneous treatment effects, yet the mean-squared-error criterion that guides splitting in honest causal trees is sensitive to the extreme values they generate. Building on the causal forest framework (Athey and Imbens, 2016; Wager and Athey, 2018), we introduce the Median Squared Deviation (MSD) criterion, which replaces the leafwise difference in means…

预测误差为何不足以评价因果估计中的辅助函数预测AI 解读

Prediction error is widely used to evaluate nuisance-function estimators in causal inference, but its relationship with causal estimator performance may differ across performance measures. We studied this question in a partially linear model using Monte Carlo simulations. We compared ordinary least squares (OLS), generalized additive models (GAMs), XGBoost, and Double Machine Learning with XGBoost (DML-XGBoost), evaluating nuisance-function prediction error, bias, RMSE, and…

集成信息滤波：在集成卡尔曼方法中学习与编码稀疏结构AI 解读

Ensemble-based Data Assimilation faces significant challenges in high-dimensional systems due to spurious correlations and ensemble collapse. We propose the Ensemble Information Filter, which addresses these issues by encoding locality directly in the precision matrix through sparse Markov structure. This approach is motivated by connections to SPDE-based models, where local operators induce sparse precision representations and provide a principled form of regularisation.…

具有结构化收缩与持续性先验的贝叶斯广义网络自回归模型AI 解读

We propose a Bayesian generalized network autoregressive (BGNAR) model for multivariate time series whose component series are associated with the nodes of a known network. The proposed framework combines the parsimonious network structure of the generalized network autoregressive (GNAR) model with structured shrinkage and persistence priors adapted from Bayesian vector autoregressive (BVAR) modeling. We adapt Minnesota-type shrinkage to both own-lag and network-lag…

通过 Q 函数差的正交估计构建以决策为中心的状态抽象AI 解读

Offline reinforcement learning enables evaluation and optimization of sequential decisions from historical data, when it is not possible to deploy new policies online due to safety, cost, and other concerns. Big data advances enable rich state information, but may naively include reward- and action- irrelevant dynamics that are ultimately unnecessary for learning optimal actions. We introduce state abstractions that target preservation of the difference-of-Q functions, and…

仿射估计量聚合的最优收敛率AI 解读

Aggregation of estimation procedures has found important applications in econometrics, statistics, and machine learning. Classical statistical aggregation theory has mainly focused on a \emph{pure aggregation} setting, where the candidate estimators are either deterministic or constructed using a held-out sample independent of that used for aggregation. When the candidate estimators and the aggregation weights are estimated from the same dataset without sample splitting,…

通过Johnson–Lindenstrauss变换实现差分隐私Model-X KnockoffsAI 解读

We introduce a novel privatization framework for high-dimensional controlled variable selection. Our framework enables rigorous False Discovery Rate (FDR) control under differential privacy constraints. While the Model-X knockoff procedure provides FDR guarantees by constructing provably exchangeable ``negative control" features, existing privacy mechanisms like Gaussian noise injection disrupt its core exchangeability conditions. In this work we consider privatizing the…

收缩使 Hosmer–Lemeshow 检验失效：惩罚逻辑回归拟合优度及青光眼应用AI 解读

Clinical prediction models are increasingly fitted by penalized logistic regression, because collinearity or many candidate predictors makes maximum likelihood unstable or impossible. Calibration is then almost always assessed by a grouped goodness-of-fit test such as the Hosmer-Lemeshow test. We show that this combination is invalid. Under ridge regression the grouped standardized residuals acquire a non-centrality induced by shrinkage, so the reference distribution used in…