论文检索

高维噪声下的广义稳健自适应带宽多视图流形学习AI 解读

Multiview datasets are common in scientific and engineering applications, yet existing fusion methods offer limited theoretical guarantees, particularly in the presence of heterogeneous and high-dimensional noise. We propose Generalized Robust Adaptive-Bandwidth Multiview Diffusion Maps (GRAB-MDM), a new kernel-based diffusion geometry framework for integrating multiple noisy data sources. The key innovation of GRAB-MDM is a view-dependent bandwidth selection strategy that…

交叉设计的因果效应、有效估计与稳健推断AI 解读

Crossover designs randomly assign each unit to receive a sequence of treatments. By comparing outcomes within the same unit, these designs can effectively eliminate between-unit variation and facilitate the identification of both instantaneous effects of current treatments and carryover effects from past treatments. They are widely used in traditional biomedical studies and are increasingly adopted in modern digital platforms. However, standard analyses of crossover designs…

基于最近邻图的两样本检验的功效性质AI 解读

In this paper, we study the problem of testing the equality of two multivariate distributions. One class of tests used for this purpose utilizes geometric graphs constructed using interpoint distances. So far, the asymptotic theory of these tests applies only to graphs, which fall under the stabilizing graphs framework of Penrose and Yukich (Ann. Appl. Probab. 13 (2003) 277–303). We study the case of the K-nearest neighbors graph where K=kN increases with the sample size,…

基于张量收缩的高维张量信号对齐与匹配检验AI 解读

We consider two hypothesis testing problems for low-rank and high-dimensional tensor signals, namely the tensor signal alignment and tensor signal matching problems. These problems are challenging due to the high dimension of tensors and the lack of suitable test statistics. By exploiting a recent tensor contraction method, we propose and validate relevant test statistics using eigenvalues of a data matrix resulting from the tensor contraction. The matrix entries exhibit…

SIMPLE-RC：非尖锐原假设与弱信号下的群组网络推断AI 解读

Large-scale network inference with uncertainty quantification has important applications in natural, social and medical sciences. The recent work of Fan et al. (J. R. Stat. Soc. Ser. B. Stat. Methodol. 84 (2022) 630–653) introduced a general framework of statistical inference on membership profiles in large networks (SIMPLE) for testing the sharp null hypothesis that a pair of given nodes share the same membership profile. In real applications, there are often groups of…

神经网络雅可比矩阵的谱渐近：收敛、普适性与相变AI 解读

We study the spectral properties of the Jacobian matrix in artificial neural networks and establish both its limiting spectral distribution and the second-order fluctuations of its spectrum. Our analysis uncovers fundamental phenomena, including universality properties with respect to the weight distribution and a phase transition in spectral behavior driven by the choice of activation function. Leveraging tools from random matrix theory, we first analyze a class of…

基于预测生成树方法的贝叶斯空间区域划分一致估计AI 解读

Bayesian model-based spatial clustering methods are widely used for their flexibility in estimating latent clusters with an unknown number of clusters while accounting for spatial proximity. Many existing methods are designed for clustering finite spatial units, limiting their ability to make predictions or may impose restrictive geometric constraints on the shapes of subregions. Furthermore, the posterior clustering consistency theory of spatial clustering models remains…

空间混杂下高斯随机场回归斜率的填充渐近一致可估性AI 解读

The problem of estimating the slope parameter in regression between two spatial processes under confounding by an unmeasured spatial process has received widespread attention in the recent statistical literature. Yet, a fundamental question remains unresolved: when is this slope consistently estimable under spatial confounding, with existing insights being largely empirical or estimator-specific. In this manuscript, we characterize conditions for consistent estimability of…

流形上的粒度平滑AI 解读

Given a random sample from a density function supported on a manifold M, a new method for the estimating highest density regions of the underlying population is introduced. The new proposal is based on the empirical version of the opening operator from mathematical morphology combined with a preliminary estimator of the density function. This results in an estimator that is easy-to-compute since it simply consists of a list of centers and a radius r that are adequately…

二维 Navier–Stokes 方程的数据同化：后验测度的最优高斯渐近性质AI 解读

A functional Bernstein–von Mises theorem is proved for posterior measures arising in a data assimilation problem with the two-dimensional Navier–Stokes equation where a Gaussian process prior is assigned to the initial condition of the system. The posterior measure, which provides the update in the space of all trajectories arising from a discrete sample of the (deterministic) dynamics, is shown to be approximated by a Gaussian random vector field obtained as the solution to…

数据增强的高斯与非高斯普适性AI 解读

We provide universality results that quantify how data augmentation affects the variance and limiting distribution of estimates through simple surrogates, and analyze several specific models in detail. The results confirm some observations made in machine learning practice, but also lead to unexpected findings: Data augmentation may increase rather than decrease the uncertainty of estimates, such as the empirical prediction risk. It can act as a regularizer, but fails to do…

半收缩漂移分数布朗运动驱动随机微分方程的平稳密度快速估计AI 解读

We study the estimation of the invariant density of additive fractional stochastic differential equations with Hurst parameter H∈(0,1). We first focus on continuous observations and develop a kernel-based estimator achieving faster convergence rates than previously available. This result stems from a martingale decomposition combined with new bounds on the (conditional) convergence in total variation to equilibrium of fractional SDEs. For H<1/2, we further refine the rates…

基于抛物型Monge–Ampère偏微分方程的无遗憾生成建模AI 解读

We introduce a novel generative modeling framework based on a discretized parabolic Monge–Ampère PDE, which emerges as a continuous limit of the Sinkhorn algorithm commonly used in optimal transport. Our method performs iterative refinement in the space of Brenier maps using a mirror gradient descent step. We establish theoretical guarantees for generative modeling through the lens of no-regret analysis, demonstrating that the iterates converge to the optimal Brenier map…

从杀死扩散过程推断扩散率AI 解读

We consider diffusion of independent molecules in an insulated Euclidean domain with unknown diffusivity parameter. At a random time and position, the molecules may bind and stop diffusing in dependence of a given “binding potential.” The binding process can be modeled by an additive random functional corresponding to the canonical construction of a “killed” diffusion Markov process. We study the problem of conducting inference on the infinite-dimensional diffusion parameter…

异质性调整下分布式精度矩阵的最优整合估计AI 解读

Distributed learning offers a practical solution for the integrative analysis of multisource datasets, especially under privacy or communication constraints. However, addressing prospective distributional heterogeneity and ensuring communication efficiency pose significant challenges on distributed statistical analysis. In this article we focus on integrative estimation of distributed heterogeneous precision matrices, a crucial task related to joint precision matrix…

观察性研究中因果推断的样本量与检验力计算AI 解读

This paper investigates the theoretical foundation and develops analytical formulas for sample size and power calculations for causal inference with observational data. By analyzing the variance of an inverse probability weighting estimator of the average treatment effect, we decompose the power calculation into three components: propensity score distribution, potential outcome distribution and their correlation. We show that to determine the minimal sample size of an…

匹配型平均处理效应估计量的高斯与自助法近似AI 解读

We establish Gaussian approximation bounds for covariate and rank-matching-based Average Treatment Effect (ATE) estimators. By analyzing these estimators through the lens of stabilization theory, we employ the Malliavin–Stein method to derive our results. Our bounds precisely quantify the impact of key problem parameters, including the number of matches and treatment balance, on the accuracy of the Gaussian approximation. Additionally, we develop multiplier bootstrap…

高阶图极限函数理论：波动、退化与推断AI 解读

Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a natural way to sample exchangeable random graphs. It is well known that network moments (motif/subgraph counts) identify a graphon (up to an isomorphism); hence, understanding the sampling distribution of subgraph counts in random graphs…

数据增强算法的快速混合：贝叶斯 probit、logit 与 lasso 回归AI 解读

We propose using a modified conductance-based method to study the mixing time of an important class of two-block Gibbs samplers, the data augmentation (DA) algorithm. Using this method, we prove the first non-asymptotic polynomial upper bounds on mixing times of three important DA algorithms: DA algorithms for Bayesian Probit regression (ProbitDA) and Bayesian Logit regression (LogitDA), and Bayesian Lasso Regression (LassoDA). Concretely, for ProbitDA and LogitDA, we…

超越随机缺失与完全随机缺失的估计AI 解读

We study the effects of missingness on the estimation of population parameters. Moving beyond restrictive missing completely at random (MCAR) assumptions, we first formulate a missing data analogue of Huber’s arbitrary ϵ-contamination model. For mean estimation with respect to squared Euclidean error loss, we show that the minimax quantiles decompose as a sum of the corresponding minimax quantiles under a heterogeneous, MCAR assumption and a robust error term, depending on…

高维秩一推断的伪最大似然理论AI 解读

We develop a pseudo-likelihood theory for rank one matrix estimation problems in the high-dimensional limit. We prove a variational principle for the limiting pseudo-maximum likelihood, which also characterizes the performance of the corresponding pseudo-maximum likelihood estimator. We show that this variational principle is universal and depends only on four parameters determined by the corresponding null model. Through this universality, we introduce a notion of…

阈值空间由直线划分的广义多元阈值自回归模型AI 解读

We consider a k-dimensional multiple-regime vector threshold autoregressive model, in which the regime-switching mechanism is governed by a bivariate threshold variable. Specifically, the regimes are induced by a partition of the threshold space by an unknown number of threshold lines. Within each regime, the process follows a specific vector autoregressive (VAR) model. We formulate the model selection and parameter estimation into a minimization problem based on the Minimum…

高度分层实验的估计效率AI 解读

This paper studies the use of highly stratified designs for the efficient estimation of a large class of treatment effect parameters that arise in the analysis of experiments. By a “highly stratified” design, we mean experiments in which units are divided into blocks of a fixed size and a proportion within each block is assigned to a binary treatment uniformly at random. The class of parameters considered are those that can be expressed as the solution to a set of moment…

随机对象的关联度量与独立性检验AI 解读

We develop a unified framework for testing independence and quantifying association between random objects that are located in general metric spaces. Special cases include functional and high-dimensional data as well as networks, covariance matrices and data on Riemannian manifolds, among other metric space-valued data. A key concept is the profile association, a measure based on distance profiles that intrinsically characterize the distributions of random objects in metric…