论文检索

相关任务间的经验贝叶斯谱部分汇聚AI 解读

Spectral methods are central to high-dimensional statistics and machine learning, underlying procedures for covariance estimation, matrix denoising, representation learning, clustering, and latent variable modeling. In this work, we focus primarily on spectral estimators for high-dimensional factor models, where leading singular vectors of the data matrix are used to estimate latent structure and covariance parameters. In many modern applications, however, data are collected…

分数岭回归AI 解读

Regularization methods such as the Lasso combine shrinkage and variable selection, but strong penalization drives their solutions toward the null model. We introduce Fractional Ridge (Fridge) regression, a penalized regression method that instead shrinks toward models of a prespecified target size. Its penalty vanishes whenever the number of nonzero coefficients does not exceed that target. This behavior connects continuous shrinkage with best subset selection. We develop an…

两阶段优化器的高维理论AI 解读

The trend towards larger training setups has brought a renewed interest in partially asynchronous two-phase optimizers which optimize locally and then synchronize across workers. Additionally, recent work suggests that the one-worker version of one of these algorithms, DiLoCo, shows promising results as a (synchronous) optimizer. Motivated by these studies we present an analysis of LA-DiLoCo, a simple member of the DiLoCo family, on a high-dimensional linear regression…

用于多元时间序列的逆交叉谱神经网络AI 解读

CoVariance Neural Networks and their extensions have emerged as effective tools for processing multivariate data, deriving graph shift operators directly from second-order statistics. These architectures, however, are designed for independent and identically distributed observations and do not fully capture the joint structure of temporal and cross-variable dependencies in multivariate time series. In this work, we introduce Inverse Cross-Spectral Neural Networks (iCSNNs), a…

高维因子定价模型的柯西聚合岭检验AI 解读

In high-dimensional factor pricing models, the power of regularized alpha tests depends on the ridge parameter, whose optimal value varies with the unknown direction of pricing errors. We address this tuning uncertainty by combining ridge-specific p-values using the Cauchy rule. The resulting test retains the least-squares alpha estimator and residual sample covariance and accommodates more assets than observations. We establish the joint Gaussian limits of the component…

DAG-CLIP：存在潜变量时的有向无环图学习框架AI 解读

Learning directed acyclic graphs (DAGs) to uncover causal mechanisms has attracted substantial attention in machine learning. While most existing methods focus exclusively on observed variables, many variables of substantive interest are latent constructs defined by statistical measurement models. Such constructs are particularly common in the social and behavioral sciences. In this paper, we propose a general statistical framework for DAG learning when some or all nodes of…

差分隐私下的稀疏支持学习：自适应算法与极小极大界限AI 解读

We study exact support recovery under $(ε,δ)$-differential privacy in sparse high-dimensional linear regression. We introduce Saturated Propose-test-release, a general mechanism that privately releases the output of a discrete selector with probability one once its stability certificate reaches a finite threshold. Exploiting the coordinatewise geometry of the LASSO, we construct a computable support-stability score. The resulting computationally efficient Saturated LASSO…

I show that ordinary least squares (OLS) predictions can be rewritten as the output of a restricted attention module, akin to those forming the backbone of large language models. The connection comes from viewing OLS as a similarity-based prediction rule in a learned embedding space. In this representation, least squares does not estimate coefficients per se. Instead, it selects an embedding that minimizes squared prediction error by matching training and test vectors…

通过正交化自适应估计发现存在混杂的时间序列因果滞后结构AI 解读

Finding which variables cause which others in multivariate time series, and at what lags, is central to science and policy, yet existing methods force a choice between flexible confounder adjustment, data-driven lag selection, and inference that controls the false discovery rate (FDR). ORACLE-VARX does all three in one pipeline. First, double/debiased machine learning (DML) removes nonlinear confounder effects from the outcomes and the lagged series. Second, adaptive causal…

有序组成数据的回归模型AI 解读

We present a unified, transformation-free linear regression framework tailored for ordinal compositional data, such as distributions across educational levels or aggregate Likert-scale survey responses. Traditional log-ratio approaches often obscure interpretability, ignore the inherent ordering of categories, and struggle with boundary zero values. To overcome these limitations, we propose a deterministic model constrained to the space of column-stochastic transformation…

混合分布之间的桥接AI 解读

The construction and the stability of bridges between mixture probability measures are investigated. Given a collection of Markov transitions bridging the components of two mixtures, together with a coupling of the mixture labels, we construct a bridge between the mixtures on an extended state space, and we show that this bridge inherits the entropic optimality of the component bridges. We then turn to Gaussian mixtures bridged by Gaussian Schrödinger bridges, whose…

Google Play 用户评论情绪指数的统计基础：信号融合、收缩、分布验证与动态平滑AI 解读

The decision problem is whether valence among the users who write reviews of an app has changed enough to warrant investigation of a release, outage, or support issue. We propose a statistical specification for that decision, applied to written Google Play reviews collected under a declared locale, language, sort order, retrieval cap, and window rule. That endpoint returns a selected collection rather than a random sample, so the index describes review writers under the…

小噪声下维度发散的网络随机微分方程推断AI 解读

We consider inference for network stochastic differential equations in a small-noise, high-dimensional regime, where the diffusion coefficient vanishes with $\ep\to0$ while the network size and parameter dimension may diverge. We develop a minimum-distance estimation framework based on a deterministic measurement model that may omit nuisance terms in the drift, and derive a non-asymptotic error bound decomposing the estimation error into stochastic fluctuation, nuisance…

稀疏依赖下二元配置概率的对抗估计AI 解读

We consider the problem of estimating binary configuration probabilities, which is common in operations management applications, including product bundling, advertising, etc. Existing approaches typically model each assortment as a category and apply multinomial models to estimate the choice probabilities; while computationally convenient, these methods do not exploit independence structures in the joint distribution and may therefore be statistically inefficient when the…

作为自然变换的统计模型：马尔可夫范畴中的有意义性、协调性与先验状态AI 解读

We show that a statistical model in the sense of McCullagh, in the form given by Brøns, is a natural transformation between two functors from the category of designs to the Kleisli category Stoch of the Giry monad, provided that its components are measurable in the parameter. The condition is empty for finite models. A design-indexed quantity is a family of morphisms of Stoch defined on the parameter objects, called meaningful if it is natural. We prove that Tjur's…

具有个性化多样性的个性化联邦向量自回归AI 解读

Personalized federated learning can improve estimation for high-dimensional time series while preserving client-specific dynamics. However, parameter heterogeneity creates a fundamental ambiguity between shared and personalized structure. We introduce the principle of personalization diversity, under which genuinely personalized effects recur in only a limited fraction of clients. Based on this principle, we propose PerFeCT-VAR, Personalized Federated Vector Autoregression…

一般随机块模型中谱初始化变分 EM 的最优社区恢复AI 解读

We prove a Chernoff-exponent guarantee for the output of spectrally initialized batch variational EM after a prescribed iteration budget, without assuming global maximization of its variational objective. The iteration repeatedly estimates the entire block probability matrix and community proportions from the same sparse graph. We consider a fixed number of communities with proportions bounded away from zero and fixed, positive, distinct connectivity profiles; neither…

基于逆随机控制的漂移势Galerkin估计AI 解读

We consider the ill-posed inverse problem of recovering the drift potential of an overdamped Langevin diffusion from discrete, possibly irregular position observations. Specializing the suboptimality gap for inverse stochastic control to drift-potential recovery, we parametrize the associated value function in a finite basis. Under a basis nondegeneracy condition, the resulting Galerkin estimator is obtained from one positive-definite linear system whose entries are smooth…

高维Hettmansperger–Randles位置检验的柯西组合方法AI 解读

High-dimensional mean testing is challenging under strong dependence and heavy tails, since classical Hotelling statistics are ill posed and regularized versions based on sample moments remain sensitive to outliers. This paper develops a robust regularized Hotelling framework for one-sample mean inference under elliptical distributions. The proposed HRST statistic combines a Hettmansperger-Randles spatial location estimator with the inverse of a trace-normalized shrinkage…

利用切片 Gibbs 采样器高效快速地从任意概率核采样AI 解读

An Automated Sliced Gibbs framework is proposed for fully automated Markov chain Monte Carlo sampling from arbitrary finite dimensional probability kernels. The method targets unnormalized, non-smooth, heavy tailed, and highly multimodal densities. A Cauchy transformation based effective support estimator is combined with slice driven Gibbs updates. This construction removes the need for user specified truncation bounds, proposal scales, step-size tuning, or conditional…

Comparing dependence structures between two related multivariate time series is of fundamental interest in many scientific applications, where changes may occur in both directed temporal interactions and contemporaneous connectivity. Modeling each time series by a vector autoregressive (VAR) model, we propose a new framework for estimation and inference of differential Granger causality (DiffGC) and differential network (DiffNet) structures in high dimensions. The proposed…

多维速度变化检测中惩罚最大似然估计的一致性AI 解读

We establish statistical consistency for the penalized maximum-likelihood estimator underlying CPLASS, a method for detecting changes in velocity in $d$-dimensional time-series data. The signal is modeled as a continuous piecewise-linear trajectory observed with independent Gaussian noise. Unlike classical change-in-mean models, continuity across adjacent segments couples their parameters and prevents direct application of standard segmentation arguments. Under compact…

贝叶斯算子学习：高斯先验下后验存在性与点估计收敛AI 解读

We develop a Bayesian framework for learning nonlinear operators between infinite-dimensional spaces. Given a map $g_0:\mathcal{X}\to\mathcal{Y}$ between separable Hilbert spaces, we study the recovery of $g_0$ from $n\in\mathbb{N}$ noisy input-output pairs $(\boldsymbol{X},\boldsymbol{Z})=(X_i,Z_i)_{i=1}^n$ with $Z_i= g_0 (X_i ) + E_i$. Here the $X_i\in\mathcal{X}$ are randomly drawn 'design' points in a compact subset of $\mathcal X$, and the $E_i$ are assumed to be i.i.d.…

高维因果外推中的风险校准平衡AI 解读

In observational causal inference, covariate balancing is widely used to reduce source-target covariate shift, but under weak overlap in high dimensions, stronger balance can induce concentrated weights and increase variance. Balance measures how well the target covariate distribution is represented, but does not by itself determine how reliably the counterfactual mean can be estimated. We develop risk-calibrated balancing for the average treatment effect on the treated,…