论文检索

数字孪生的相似性预测：面板数据、理论与应用AI 解读

Prediction from sequential panel data is central to digital-twin modeling, where new panels arrive over time and the predictive system is updated sequentially. Existing methods often rely on temporal proximity, which can fail when similar input-output patterns recur at nonadjacent times or when recent panels differ from the target panel. We propose State-Local Prediction (StaLoP), a nonparametric dynamic panel prediction framework that utilizes information through…

高维推断中的合成数据正则化AI 解读

To address the challenges of obtaining reliable inference in high-dimensional models, we introduce the Synthetic-data Regularized Estimator (SRE). Unlike traditional regularization methods, the SRE regularizes the complex target model via a weighted likelihood based on synthetic data generated from a simpler, more stable model. This method provides a theoretically sound and practically effective alternative to parameter penalization. We establish key theoretical properties…

基于诱导平滑的删失断崖自适应岭秩回归AI 解读

Broken adaptive ridge (BAR) penalty approximates $L_0$-regularization through iterative reweighting of L2 penalties. This penalty enjoys both the oracle property and the grouping effect for highly correlated covariates, making it particularly attractive for penalized regression with complex dependence among predictors. In this paper, we develop a BAR-penalized linear rank regression method for the semiparametric accelerated failure time model with right-censored data.…

基于非凸对偶全变差正则化的指数族张量补全AI 解读

With the emergence of various tensor data, tensor completion from partial measurements has attracted widespread attention in data science and signal processing. Total Variation (TV) has been widely used as an effective regularization technique for tensor completion; however, theoretical studies on TV regularization in this context remain limited. In this work, we present a rigorous theoretical analysis of TV regularization for tensor completion. Specifically, we consider…

生成结果与生成回归量：递归因果估计中的等价关系AI 解读

Time-varying treatment effects, surrogate-identified treatment effects, and mediation effects can all be written as recursive regressions, in which each regression's predicted values become generated outcomes for the next regression. We study how standard causal estimators behave in this setting. Formally, we compare the recursive plug-in, recursive balancing weight, and recursive doubly robust estimators. When every stage is fitted by ordinary least squares (OLS), the three…

迁移学习中最小范数插值器的泛化误差AI 解读

This paper establishes the generalization error of pooled min-$\ell_2$-norm interpolation in transfer learning, where data from diverse distributions are available. Min-norm interpolators arise naturally as implicit regularized limits of modern machine learning algorithms. Prior work has characterized their out-of-distribution risk when samples from the test distribution are unavailable during training. In many applications, however, limited test samples may be available at…

基于局部自适应回归样条的时空模型AI 解读

This paper focuses on the estimation of a non-parametric regression function in the presence of data with spatio-temporal dependencies. In such a context, we study Locally Adaptive Regression Splines, a nonparametric estimator introduced by Mammen and Van De Geer (1997) and Rudin et al. (1992). To the best of our knowledge, this estimator has not previously been examined in a similar context. For univariate settings, the signals we consider are assumed to have a kth weak…

用学校人口特征与教师特征建模教育表现AI 解读

High-dimensional educational datasets often exhibit sparsity, grouped predictors, and locally correlated covariates, limiting the effectiveness of conventional regression methods. We propose an Adaptive Weighted Group Fused LASSO estimator that jointly performs adaptive variable selection, group regularization, and coefficient fusion within a unified penalized regression framework. An efficient ADMM algorithm is developed, and asymptotic properties, including consistency,…

利用网络结构的工具变量回归：因果节点发现与估计AI 解读

Estimating causal effects from high-dimensional, structured exposures is a fundamental challenge in modern applications ranging from neuroscience and finance to environmental science. While the literature has addressed high-dimensional instrumental variable (IV) regression, and separately leveraged graph structure in penalized regression, the integration of both, especially for causal support recovery in the presence of latent confounding, remains unexplored. In this work,…

无需梯度的快速混合马尔可夫链AI 解读

Most approaches for accelerating Markov chain mixing either rely on incorporating expensive geometric information in the proposals, or reduce the per-step cost of sampling via surrogate densities. We propose a localisation principle that allows a surrogate-based Metropolis-Hastings proposal to exploit gradient-level geometric information of the target density, without evaluating either the target gradient or the surrogate gradient. The construction relies on regularisation…

高维有界离散图模型的正则化广义得分匹配估计AI 解读

Graphical models for multivariate count data are widely used to characterize conditional dependence structures. For count variables with unbounded support, however, ensuring a finite normalizing constant typically imposes restrictive constraints on interaction parameters. We propose bounded discrete graphical models for multivariate discrete responses with finite support, which remove such constraints by construction while retaining interpretable dependence on the observed…

XMSE 感知的自适应经验贝叶斯估计AI 解读

Empirical Bayes (EB) estimators can match the first-order asymptotic risk of maximum likelihood (ML) while behaving very differently at second order: recent excess mean squared error (XMSE) analysis shows that kernel-based EB estimation may be worse than ML when the kernel is poorly aligned with the true parameter. This paper turns that diagnostic into a design principle. We propose an XMSE-aware mixed estimator that interpolates between ML and EB shrinkage. Its fixed-weight…

正交化合成控制AI 解读

When conducting inference for the average treatment effect on the treated with a Synthetic Control Estimator, the vector of control weights is a nuisance parameter that is often constrained, high-dimensional, and may be only partially identified even when the average treatment effect on the treated is point-identified. All three of these features of a nuisance parameter can lead to failure of asymptotic normality for the estimate of the parameter of interest when using…

复杂抽样设计下多分格相关的稳健最小散度估计AI 解读

Standard maximum likelihood estimation of polychoric correlations is highly sensitive to contamination in survey data, including response errors, interviewer effects, and careless responding, yet assigns equal weight to all observations regardless of data quality. We develop robust estimators for polychoric correlation under complex survey designs based on two minimum divergence criteria -- Hellinger distance (HD) and negative exponential disparity (NED) -- incorporating…

Lasso 中 K 折交叉验证的渐近理论与 Bootstrap 有效性AI 解读

Least absolute shrinkage and selection operator or Lasso is one of the widely used regularization methods in regression. Statisticians usually implement Lasso in practice by choosing the penalty parameter in a data-dependent way, the most popular being the $K-$fold cross-validation (or $K-$fold CV). However, inferential properties, such as the variable selection consistency and $n^{1/2}-$consistency, of the $K-$fold CV based Lasso estimator and validity of the Bootstrap…

不完整矩阵回归AI 解读

Matrix completion seeks to recover a low-rank matrix from a sparse and noisy subset of its entries. In many applications, such as recommendation systems and urban mobility, the observed matrix is accompanied by auxiliary covariates on its rows and columns and exhibits dependence across them. We propose Incomplete Matrix Regression (IMR), a distribution-free penalized regression framework that integrates such information into matrix completion. The target matrix is modeled as…

正则化最优传输的有限样本界AI 解读

We study the sample complexity of regularized optimal transport for general convex regularizations including the Kullback--Leibler divergence and $L^p$ penalties. Our main results are non-asymptotic bias and variance bounds for the empirical cost, with explicit dependence on the regularization parameter and on the intrinsic dimension of the marginals. Our approach simultaneously improves, unifies, and extends existing finite-sample bounds. In particular, we improve the state…

高维数据的椭圆正则化Hotelling检验AI 解读

We consider one-sample testing of a high-dimensional location parameter under elliptically symmetric distributions with heavy tails and pervasive cross-sectional dependence. We propose an elliptical regularized Hotelling test with Cauchy combination (ERHT--CC), based on the sample spatial median and the spatial-sign covariance matrix centered at that median. We derive its null asymptotic normality, consistent estimators of the centering and variance, and an explicit local…

弱矩方法用于统计推断：兼论稳健估计应用AI 解读

A companion paper develops a generalised framework in which a probability law is represented by a tempered distribution $T\in\mathcal{S}'$ - on the same footing as a density or characteristic function - and information is extracted by pairing $T$ with a positive Schwartz kernel $\varphi$ that acts as a measurement instrument rather than as part of the law; the resulting weak moments of all orders exist unconditionally. The present paper turns this into a methodology for…

若干广义变分推断问题的闭式解AI 解读

The Donsker--Varadhan formula characterizes the ordinary Bayesian posterior as the solution of an unrestricted $\mathsf{KL}$-regularized variational problem. Generalized variational inference replaces this regularizer by other divergences, but the resulting measure-valued optimization problem is often studied only after restriction to a parametric variational family. This paper studies the unrestricted measure-level problem. Given a measurable space $(\mathcal{Z},\mathfrak{Z})$…

多层网络向量自回归的时变模型平均AI 解读

In this paper, we introduce a flexible time-varying multi-layer network vector autoregression (VAR) model framework for large-scale time series, allowing agents in dynamic systems to interact through multiple channels and incorporating multiple adjacency matrices to capture network spillover effects. We propose a penalized model averaging method to determine a time-varying optimal combination of multi-layer network VAR candidate models whose number may be divergent. Under…

非平衡熵正则最优传输的样本复杂度AI 解读

Optimal transport (OT) has become a central language for comparing probability measures, but exact balanced OT is often both too rigid for data with missing, created, or destroyed mass and subject to unfavorable high-dimensional sample complexity. Entropic regularization and unbalanced relaxations address these limitations in complementary ways. Entropy smooths the geometry, improves statistical behavior, and enables fast Sinkhorn-type algorithms, while unbalanced marginal…

分布统计模型：弱矩、累积量与中心极限定理AI 解读

Many important statistical models fall outside classical moment-based methods due to the non-existence of moments or moment generating functions. We propose a generalised probabilistic framework in which a probability law is represented by a tempered distribution $T \in \mathcal{S}'$, on the same footing as a density, a distribution function, or a characteristic function. Information about the law is extracted by evaluating $T$ on test functions regularised by a given…

稀疏恢复中遗忘模型与自适应模型的可分离性AI 解读

Sparse recovery is among the most well-studied problems in learning theory and high-dimensional statistics. In this work, we investigate the statistical and computational landscapes of sparse recovery with $\ell_\infty$ error guarantees. This variant of the problem is motivated by \emph{variable selection} tasks, where the goal is to estimate the support of a $k$-sparse signal in $\mathbb{R}^d$. Our main contribution is a provable separation between the \emph{oblivious}…