论文检索

稀疏主成分分析：基于整数规划的可扩展新估计量AI 解读

We consider the sparse principal component analysis (SPCA) problem under the well-known spiked covariance model. Recent work has shown that the SPCA problem can be reformulated as a mixed integer program (MIP) and can be solved to global optimality, leading to estimators that are known to enjoy optimal statistical properties. However, prior MIP algorithms for SPCA appear to be limited in terms of scalability to up to a thousand features or so. In this paper we propose a new…

马尔可夫折棒过程AI 解读

Stick-breaking has a long history and is one of the most popular procedures for constructing random discrete distributions in statistics and machine learning. In particular, due to their intuitive construction and computational tractability they are ubiquitous in modern Bayesian nonparametric inference. Most widely used models, such as the Dirichlet and the Pitman–Yor processes, rely on i.i.d. or independent length variables. Here, we pursue a completely unexplored research…

在线张量学习：计算与统计权衡、自适应性及最优遗憾AI 解读

Large tensor learning algorithms are typically computationally expensive and require storing a vast amount of data. In this paper we propose a unified online Riemannian gradient descent (oRGrad) algorithm for tensor learning, which is computationally efficient, consumes much less memory, and can handle sequentially arriving data while making timely predictions. The algorithm is applicable to both linear and generalized linear models. If the time horizon T is known, oRGrad…

自适应稳健置信区间AI 解读

This paper studies the construction of adaptive confidence intervals under Huber’s contamination model when the contamination proportion is unknown. For the robust confidence interval of a Gaussian mean, we show that the optimal length of an adaptive interval must be exponentially wider than that of a nonadaptive one. An optimal construction is achieved through simultaneous uncertainty quantification of quantiles at all levels. The results are further extended beyond the…

低内在维度数据上的自适应贝叶斯回归AI 解读

We study how the posterior contraction rate under a Gaussian process (GP) prior depends on the intrinsic dimension of the predictors and the smoothness of the regression function. An open question is whether a generic GP prior that does not incorporate knowledge of the intrinsic lower-dimensional structure of the predictors can attain an adaptive rate for a broad class of such structures. We show that this is indeed the case, establishing conditions under which the posterior…

重探伪逆：高维 Moore–Penrose 逆与岭型逆的渐近性质及应用AI 解读

In this paper, we derive high-dimensional asymptotic properties of the Moore–Penrose inverse and, as a byproduct, of various ridge-type inverses of the sample covariance matrix. In particular, the analytical expressions of the asymptotic behavior of the weighted sample trace moments of generalized inverse matrices are deduced in terms of the partial exponential Bell polynomials, which can be easily computed in practice. The existent results for pseudo-inverses are extended…

高维样本协方差矩阵的广义线性谱统计及其应用AI 解读

In this paper, we introduce the Generalized Linear Spectral Statistics (GLSS) of a high-dimensional sample covariance matrix Sn, denoted as trf(Sn)Bn, which effectively captures distinct spectral properties of Sn by incorporating an ancillary matrix Bn and a test function f. The joint asymptotic normality of GLSS associated with different test functions is established under mild assumptions on Bn and the underlying distribution, when the dimension n and sample size N are…

LASSO 及相关估计量的分布鲁棒预测误差AI 解读

We study the classical problem of predicting an outcome variable, Y, using a linear combination of a d-dimensional covariate vector, X. We are interested in linear predictors whose coefficients solve infβ∈Rd(EPn[|Y−X⊤β|r])1/r+δρ(β), where δ>0 is a regularization parameter, ρ:Rd→R+ is a convex penalty function, Pn is the empirical distribution of the data and r≥1. Our main contribution is a new bound on the out-of-distribution prediction error of such estimators. The new…

张量预测变量充分降维的广义多线性模型AI 解读

We consider supervised learning problems with tensor-valued input. We derive multilinear sufficient reductions for the regression or classification problem by modeling the conditional distribution of the predictors given the response as a member of the quadratic exponential family. We develop estimation procedures of sufficient reductions for both continuous and binary tensor-valued predictors. We prove the consistency and asymptotic normality of the estimated sufficient…

一般混杂下线性非高斯因果模型的参数识别AI 解读

Linear non-Gaussian causal models postulate that each random variable is a linear function of parent variables and non-Gaussian exogenous error terms. We study identification of the linear coefficients when such models contain latent variables. Our focus is on the commonly studied acyclic setting, where each model corresponds to a directed acyclic graph (DAG). For this case, prior literature has demonstrated that connections to overcomplete independent component analysis…

预印本版本摘要 · 查看来源

点过程的主成分分析AI 解读

We introduce a novel statistical framework for the analysis of replicated point processes that allows for the study of point pattern variability at a population level. By treating point process realizations as random measures, we adopt a functional analysis perspective and propose a form of functional Principal Component Analysis (fPCA) for point processes. The originality of our method is to base our analysis on the cumulative mass functions of the random measures, which…

大样本协方差矩阵的特征向量重叠与非线性收缩估计AI 解读

Consider a data matrix $Y = [\mathbf{y}_1, \cdots, \mathbf{y}_N]$ of size $M \times N$, where the columns are independent observations from a random vector $\mathbf{y}$ with zero mean and population covariance $Σ$. Let $\mathbf{u}_i$ and $\mathbf{v}_j$ denote the left and right singular vectors of $Y$, respectively. This study investigates the eigenvector/singular vector overlaps $\langle {\mathbf{u}_i, D_1 \mathbf{u}_j} \rangle$, $\langle {\mathbf{v}_i, D_2 \mathbf{v}_j} \rangle$…

高维二元图模型的依赖图密度推断AI 解读

We consider a system of binary interacting chains describing the dynamics of a group of N components that, at each time unit, either send some signal to the others or remain silent otherwise. The interactions among the chains are encoded by a directed Erdös–Rényi random graph with unknown parameter p∈(0,1). Moreover, the system is structured within two populations (excitatory chains versus inhibitory ones), which are coupled via a mean field interaction on the underlying…

利用再现样本进行高维线性回归模型与系数的有限样本及大样本推断AI 解读

In this paper, we present a novel and effective inference approach to conduct both finite and large sample inference for high-dimensional linear regression models. This approach is developed under the so-called repro samples framework, in which we conduct statistical inference by creating and studying the behavior of artificial samples that are obtained by mimicking the sampling mechanism of the data. We construct confidence sets for (a) the true model corresponding to the…

正则化M估计量装袋集成的精确渐近分析AI 解读

We characterize the squared prediction risk of ensemble estimators obtained through subagging (subsample bootstrap aggregating) regularized M-estimators and construct a consistent estimator for the risk. Specifically, we consider a heterogeneous collection of M≥1 regularized M-estimators, each trained with (possibly different) subsample sizes, convex differentiable losses, and convex regularizers. We operate under the proportional asymptotics regime, where the sample size n,…

再生核希尔伯特空间中非参数随机逼近的可扩展推断AI 解读

Stochastic approximation (SA) is a powerful and scalable computational method for iteratively estimating the solution of optimization problems in the presence of randomness, particularly well suited for large-scale and streaming data settings. In this work we propose a theoretical framework for stochastic approximation (SA) applied to nonparametric least squares in reproducing kernel Hilbert spaces (RKHS), enabling online statistical inference in nonparametric regression…

谱感知去偏：现代推断框架及其在主成分回归中的应用AI 解读

Debiasing is a fundamental concept in high-dimensional statistics. While degrees-of-freedom adjustment is the state-of-the-art debiasing technique in high-dimensional linear regression, it largely remains limited to independent, identically distributed samples and sub-Gaussian covariates. These limitations hinder its wider practical use. In this paper we break this barrier and introduce Spectrum-Aware Debiasing—a novel inference method that applies to challenging…

半圆极限下的最优特征值收缩AI 解读

In response to the increasing dimensionality of modern datasets, recent theoretical studies of covariance estimation frequently adopt the proportional-growth asymptotic framework in which the sample size n and dimension p are comparable, with n,p→∞ and γn:=p/n→γ>0. However, in many datasets—perhaps most—the sample size and dimension are highly imbalanced. To address this, we consider the disproportional-growth asymptotic framework, where n,p→∞ and γn→0 or γn→∞. These regimes…

适用于一般损失函数的灵活差分隐私学习AI 解读

This paper aims to provide a versatile privacy-preserving release mechanism along with a unified approach for subsequent parameter estimation and statistical inference. We propose a privacy mechanism based on zero-inflated symmetric multivariate Laplace (ZIL) noise, which requires no prior specification of subsequent analysis tasks, allows for general loss functions under minimal conditions, imposes no limit on the number of analyses, and is adaptable to increasing data…

大规模多重检验：错误发现率控制的基本界限与复合预言规则AI 解读

The false discovery rate (FDR) and the false nondiscovery rate (FNR), defined as the expected false discovery proportion (FDP) and the false nondiscovery proportion (FNP), are the most popular benchmarks for multiple testing. Despite the theoretical and algorithmic advances in recent years, the optimal trade-off between the FDR and the FNR has been largely unknown, except for certain restricted classes of decision rules, for example, separable rules, or for other performance…

分组时变网络向量自回归模型的估计AI 解读

This paper introduces a flexible time-varying network vector autoregressive model framework for large-scale time series. A latent group structure is imposed on the heterogeneous and node-specific time-varying momentum and network spillover effects so that the number of unknown time-varying coefficients to be estimated can be reduced considerably. A classic agglomerative clustering algorithm with nonparametrically estimated distance matrix is combined with a ratio criterion…

高维协整的迹检验AI 解读

This paper studies Johansen’s (J. Econom. Dynam. Control 12 (1988) 231–254) trace test for cointegration in high-dimensional data. We show that when both cross-sectional and temporal dimension of the data go to infinity proportionally, the shifted and scaled modified trace statistic converges to a Gaussian random variable. We give explicit formulae for the shift and scale parameters as well as for the mean and variance of the Gaussian limit. Monte Carlo analysis shows…

多源无监督域适应的分布鲁棒学习AI 解读

Empirical risk minimization often performs poorly when the distribution of the target domain differs from those of the source domains. To address such potential distributional shifts, we develop an unsupervised domain adaptation approach that leverages labeled data from multiple source domains and unlabeled data from the target domain. We introduce a distributionally robust model that optimizes an adversarial reward based on explained variance across a class of target…

弱可识别条件下主成分分析的秩检验AI 解读

In a triangular array framework where n observations are randomly sampled from a p-dimensional elliptical distribution with shape matrix Vn, we consider the problem of testing the null hypothesis H0:θ=θ0 against the alternative hypothesis H1:θ≠θ0, where θ is the (fixed) leading unit eigenvector of Vn and θ0 is a given unit p-vector. The dependence of the shape matrix on the sample size allows us to consider challenging asymptotic scenarios in which the parameter of interest…