论文检索

不可观测异质性的去偏机器学习：高维面板与测量误差模型AI 解读

Developing robust inference for models with nonparametric Unobserved Heterogeneity (UH) is both important and challenging. We propose novel Debiased Machine Learning (DML) procedures for valid inference on functionals of UH, allowing for partial identification of multivariate target and high-dimensional nuisance parameters. Our main contribution is a full characterization of all relevant Neyman-orthogonal moments in models with nonparametric UH, where relevance means…

基于残差化 Walsh–Hadamard 得分的异质析因效应修饰因子去偏与同时推断AI 解读

In factorial randomized experiments with $K$ binary treatment components, we study which baseline covariates modify component main effects and interactions. We define effect-modifier cells $(j,S)$, $j\in[p]$ and $\emptyset\neq S\subseteq[K]$, through the coefficients $θ^\ast_{jS}$ of population linear projections of conditional Walsh--Hadamard contrasts $τ_{S}$ onto standardized covariates. Using baseline-robust direct scores, we develop frequentist inference for all $p(2^K-1)$…

谁驱动系统？根据轨迹数据分类平均场粒子系统AI 解读

We study the supervised classification problem for interacting particle systems (IPS) from trajectory observations. The IPS belongs to one of K classes, each characterized by a distinct interaction drift. Given a learning dataset, the goal is then to predict the class label of a newly observed system based on the trajectory of a single particle. This setting raises several statistical challenges. First, the particles within each system interact and are therefore dependent.…

BRP-GABLE：适用于多种结果类型的可解释规则预测框架AI 解读

Interpretable prediction models are important in biomedical research, where predictive accuracy must often be balanced against the ability to examine predictor-outcome relationships. Automatic Binary Logistic Estimation (ABLE) provides interpretable rule-based representations by constructing additive models using threshold rules. However, the original method is restricted to binary outcomes, and its greedy forward construction follows a search path, making candidate rules…

工具变量回归中维度自适应的自助法 Anderson–Rubin 检验AI 解读

Weak-identification-robust tests for instrumental variable (IV) regressions are typically developed separately depending on whether the number of IVs is treated as fixed or increasing with the sample size, forcing researchers to make a stance on the asymptotic behavior, which is often ambiguous in practice. This paper proposes a bootstrap-based, dimension-agnostic Anderson-Rubin (AR) test that achieves correct asymptotic size regardless of whether the number of IVs is fixed…

核设定检验的数据驱动调参：选择渐近理论、有效性与功效AI 解读

We develop model checks for conditional moment restrictions whose tuning parameters, the kernel bandwidth and the regularization level, are selected by cross-validation. The tests regress the estimated residuals on the covariates via kernel ridge regression (KRR), yielding a coefficient function in a reproducing kernel Hilbert space (RKHS) that vanishes under the null and is nonzero for any misspecification not annihilated by the Neyman projection. Our central contribution…

通过最小二乘近似实现自适应 LASSO 惩罚的密度幂散度估计AI 解读

Linear mixed-effect panel data models are widely used in longitudinal biomedical, environmental, and social studies, but are often sensitive to data contamination and numerous covariates. To address these challenges, we propose a robust variable selection approach based on a least squares approximation (LSA) of the density power divergence (DPD) objective function combined with the Adaptive LASSO penalty. The LSA converts the nonlinear DPD objective into a computationally…

用收缩先验建模动态相关矩阵AI 解读

Estimating time-varying correlation matrices is challenging because existing methods may adapt slowly to structural changes, impose insufficient regularization, or produce diffuse posterior uncertainty. In moderate dimensions, an additional difficulty is summarizing the estimated evolving dependence structure for downstream decision-making tasks. We propose a Bayesian approach based on a low-rank factor representation, with latent states evolving under a dynamic shrinkage…

测度线性表示模型中识别、计算与推断的对抗方法AI 解读

We develop a framework for identification, computation, and inference in econometric models with a linear-in-measures representation. These models express maintained restrictions as moment conditions linear in the joint probability measure of observed and latent inputs, and map that measure linearly to the distribution of outputs, even with nonlinear outcome equations. We construct an adversarial discrepancy function whose zeros characterize the identified set for structural…

利用算子值核与正则化随机梯度下降学习算子AI 解读

We consider a class of statistical inverse problems involving the estimation of a regression operator from a Polish space to a separable Hilbert space, where the target lies in a vector-valued reproducing kernel Hilbert space induced by an operator-valued kernel. To address the associated ill-posedness, we analyze regularized stochastic gradient descent (SGD) algorithms in both online and finite-horizon settings. The former uses polynomially decaying step sizes and…

保持收敛率的收缩支撑高斯过程预测AI 解读

Gaussian process prediction is a central tool in spatial statistics, but standard implementations require dense matrix operations that become prohibitive for large datasets. We propose a scale-adjusted compactly supported working correlation for Gaussian process prediction, using the generalized Wendland family with a support radius $φ_n$ that is allowed to decrease with the sample size $n$. Under fixed-domain asymptotics with quasi-uniform designs, a fixed support radius…

预测变量相关下基于自适应虚拟变量的可扩展变量选择AI 解读

Reliable high-dimensional variable selection requires scalable error-controlling methods. The Terminating-Random Experiments (T-Rex) selector estimates the false discovery rate (FDR) by aggregating early-terminated forward-selection paths in which predictors compete with synthetic dummies. We address two remaining challenges: i) predictor dependence can bias dummy-predictor competition; ii) computation is wasted on recomputing terms shared across experiments. Building on…

蝾螈视网膜神经节细胞动态感受野的结构化贝叶斯建模AI 解读

Neurons in the visual system are selective for specific spatial and temporal stimulus features, described by their \emph{receptive field}. Estimating one means a coefficient per pixel per time bin from few trials -- a high-dimensional problem requiring regularization. Sparse regularizers such as the LASSO handle the dimension but select pixels independently at each time point, with nothing to keep the region coherent in space or smooth in time; it can fragment or reorganize…

未知对角协方差高斯混合模型的黎曼梯度下降AI 解读

This paper investigates the numerical resolution of the Beurling-LASSO (BLASSO), a convex optimization framework that promotes sparsity in the space of measures. We consider its application to the estimation of Gaussian mixture models (GMMs) with an unknown number of components and unknown diagonal covariance matrices. Our approach combines the Conic Particle Gradient Descent (CPGD) principle with Riemannian gradient descent, to account for the underlying Fisher-Rao geometry…

广义线性模型变量选择的平滑信息准则AI 解读

Variable selection using information criteria has an explicit statistical target but requires discrete search over candidate models. The smooth information criterion (SIC) replaces the discontinuous model-dimension term by a differentiable approximation, with an $ε$-telescoping continuation strategy progressively sharpening this approximation without data-driven selection of a regularisation-strength parameter. We develop SIC as a general procedure for coefficient-level…

基于贝叶斯机器学习的决策论亚组发现AI 解读

We consider the problem of identifying promising subpopulations in terms of treatment effectiveness or treatment effect heterogeneity, from a Bayesian decision theoretic perspective. We first show that a straight-forward application of Bayesian decision theory to subgroup detection leads to a counter-intuitive risk-seeking (RS) behavior. Motivated by this observation, we introduce the Bayesian Risk-Aware Inference and Detection of Subgroups (BRAIDS) utility and use it to…

用CARE升级生存分析模型AI 解读

Clinical risk prediction models are regularly updated as new data, often with additional covariates, become available. We propose CARE (Convex Aggregation of relative Risk Estimators) as a general approach for combining existing "external" estimates with a new data set in a time-to-event survival analysis setting. Our method initially employs the new data to fit a flexible family of reproducing kernel estimators via penalised partial likelihood maximisation. The final…

条件分位数限制识别参数的一致推断AI 解读

Many structural and dynamic economic models imply that key parameters are identified by conditional quantile restrictions. Building on the exponential-weighting approach of Bierens (1990) and recent advances in penalized maximum statistics for conditional moment restrictions (Chen et al., 2025), we develop a unified inference framework for such parameters. We propose an adaptive $\ell_1$-penalized supremum statistic that transforms the conditional restriction into a…

路径正则化：多层神经网络与双下降的非渐近泛化理论AI 解读

Path regularization has shown to be a very effective regularization to train neural networks, leading to a better generalization property than common regularizations i.e. weight decay, etc. We propose a first near-complete (as will be made explicit in the main text) nonasymptotic generalization theory for multilayer neural networks with path regularizations for general learning problems. In particular, it does not require the boundedness of the loss function, as is commonly…

基于条件协方差排序的函数型因果发现AI 解读

We study causal discovery where each node is a random function. Previous studies on this topic rely on structural assumptions, e.g., linearity or non-linearity, and distributional assumptions, e.g., Gaussianity or non-Gaussianity. In contrast, we make use of covariance operators to avoid these assumptions. Under functional additive noise models, we propose a new sufficient condition to identify a valid topological ordering based on comparing norms of conditional covariance…

BLOC：非凸惩罚稀疏协方差估计的全局优化框架AI 解读

We introduce BLOC (Black-box Optimization over Correlation matrices), a general framework for sparse covariance estimation with non-convex penalties. BLOC operates on the manifold of correlation matrices and reparameterizes it via an angular Cholesky mapping, transforming the positive-definite, unit-diagonal constraint into an unconstrained search over a Euclidean hyperrectangle. This enables gradient-free global optimization of diverse objectives, including…

正则化稀疏随机矩阵的集中性：基于非回溯算子的谱边界AI 解读

In sparse random matrices, spectral outliers (eigenvalues and singular values located away from the bulk) emerge due to degree fluctuations: high degrees inflate the operator norm, while low column degrees reduce the least singular value. As proved by Feige and Ofek (2005) and Le, Levina, and Vershynin (2017), degree regularization enforces concentration at the expected norm scale. However, precise bounds incorporating the cutoffs remain unexplored and challenging since…

Hüsler–Reiss 块模型的统计推断AI 解读

Estimating the H{ü}sler-Reiss precision matrix is a fundamental problem for statistical inference in multivariate extremes. In high-dimensional settings, the number of unknown parameters grows quadratically with the dimension, making regularisation indispensable. Existing approaches regularise the estimation problem by exploiting sparsity. In this paper, we consider an alternative structural assumption, namely that the H{ü}sler-Reiss precision matrix is block-structured. To…

超高维变量选择的结构化筛选与选择AI 解读

Ultra-high-dimensional data, with p far exceeding n, are common in genomics and biomedical research. Marginal screening can miss active predictors with weak marginal signals, especially under strong predictor correlation. We develop Structured Screen-and-Select Variable Selection (S3VS), an iterative framework that combines outcome-based screening with correlation-based local predictor sets. At each iteration, S3VS identifies leading variables, forms local sets through…