论文检索

WIRED：结构化依赖下的加权自适应多序列概率预测AI 解读

This paper presents WIRED, an R package algorithm for joint probabilistic forecasting of multiple related time series. WIRED combines a library of simple marginal predictive distributions, CRPS-based adaptive mixture weights, and a Gaussian or Student t copula for cross-series simulation. We evaluate the implementation in a benchmark with four synthetic data-generating processes (DGPs), three forecast horizons, 30 replicates per DGP-horizon pair, nine ablations and external…

Ornstein–Uhlenbeck过程低秩及近低秩漂移矩阵的加权核弹性网估计AI 解读

We study estimation of the drift matrix in a continuously observed high-dimensional Ornstein-Uhlenbeck process when the drift is exactly or approximately low rank. In this setting, exact low rank induces non-stable directions and hence a non-ergodic regime, resulting in a poorly conditioned empirical covariance matrix. To address this difficulty, we introduce a Weighted Nuclear Elastic Net Estimator that combines ridge regularization with a nuclear-norm penalty expressed in…

高维稀疏谱精度矩阵的统计推断AI 解读

Statistical inference for the spectral precision matrix at a given frequency allows us to assess frequency-specific conditional relationships among the components of a stationary multivariate time series. Compared with classical analogues, inference in the spectral domain is more challenging due to the absence of closed-form asymptotic variance expressions for complex-valued estimators, the limited asymptotic theory in high-dimensional settings, and the presence of…

发育分叉附近 RNA 速度图正则化的统计理论AI 解读

Graph-based regularization is widely used to stabilize noisy RNA-velocity estimates by encouraging transcriptionally similar cells to share similar velocity vectors. Near developmental bifurcations, however, proximity-based graphs may connect cells from distinct daughter lineages, reducing estimation variance at the cost of attenuating biologically meaningful lineage-specific dynamics. We formulate graph-regularized RNA velocity as a statistical estimation problem on a…

面向预测的推断：对偶与误差AI 解读

Predictively oriented (PrO) inference quantifies uncertainty by selecting a distribution over model parameters to optimize a scoring rule applied to the induced predictive distribution, together with a divergence penalty from a reference distribution. By applying the scoring rule after averaging model densities, PrO inference targets predictive performance, accounting for model misspecification. We focus on the logarithmic score with general $φ$-divergence regularization.…

精细分层实验的图拉普拉斯方差估计量AI 解读

This paper considers design-based inference on the average treatment effect in finely stratified experiments, where uncertainty arises only from the randomized treatment assignment. We focus on settings in which units are first stratified into groups of fixed size according to baseline covariates and, then within each group, exactly one unit is assigned to treatment. In this setting, we introduce a class of graph-Laplacian variance estimators in which strata form the…

非平稳时间序列条件独立检验的动态广义协方差度量AI 解读

Identifying relationships among stochastic processes is a core objective in many fields, such as economics. While the standard toolkit for multivariate time series analysis has many advantages, it can be difficult to capture nonlinear dynamics using linear vector autoregressive models. This difficulty has motivated the development of methods for causal discovery and variable selection for nonlinear time series, which routinely employ tests for conditional independence. In…

电力现货价格预测中的高维变量选择方法比较AI 解读

The paper considers the problem of variable selection for forecasting electricity spot prices. High-dimensional methods such as LASSO and Elastic Net are widely used for this purpose, and while they exhibit strong predictive performance, their tendency to select over-parameterized models raises questions about interpretability. We evaluate the performance of six variable selection procedures, includingthe recently proposed Boosting Multiple Testing (BMT) method, using an…

尖峰与厚尾先验高维线性回归的 Rényi α 散度变分贝叶斯方法AI 解读

Sparse high-dimensional linear regression is a central problem in statistics, where the goal is often variable selection and/or coefficient estimation. We propose a mean-field variational Bayes approximation for sparse regression with spike-and-slab Laplace priors that replaces the standard Kullback-Leibler (KL) divergence objective with the Rényi's $α$ divergence: a one-parameter generalization of KL divergence indexed by $α\in (0, \infty) \setminus \{1\}$ that allows…

网络不确定性下的网络调整 GMM 估计AI 解读

This paper proposes a network-adjusted generalized method of moments (NA-GMM) estimator for social interaction models when the observed network may differ from the true interaction network. NA-GMM is a novel penalized GMM approach that allows the elements of the observed interaction matrix to be modified to improve the fit of the moment conditions. To avoid unrestricted network adjustments, the NA-GMM criterion introduces a penalty on the amount of adjustment. Since NA-GMM…

马尔可夫数据下非线性随机逼近的在线统计推断AI 解读

Many stochastic approximation (SA) algorithms evolve along a single trajectory, making uncertainty quantification challenging under nonlinear dynamics and Markov dependence. We develop an online inference framework for nonlinear SA with decreasing step sizes. Under local stability and verifiable conditions, we establish a functional central limit theorem for the partial-sum path. The proof uses a Poisson-equation decomposition to handle Markov dependence and a uniform bound…

稀疏情形下具有线性依赖协变量的 Lasso 普适性AI 解读

Throughout the last decade, Gaussian universality has been widely studied for high-dimensional estimation problems. Most of the literature focuses on i.i.d. sensing matrices or accounts for special forms of dependence, such as block dependence or other specific row/column dependencies. More general simultaneous row and column mixing has not yet been fully studied. In this paper, we focus on that setting. We prove a Gaussian universality theorem for the lasso in the sparse…

交错双重差分中的部分同质性AI 解读

In staggered difference-in-differences (DiD) designs, units enter treatment at different calendar times, so the treatment effect is not a single number but a set of Cohort-Average Treatment effects on the Treated (CATTs), one per cohort-time cell. Estimating every CATT as its own parameter, as the standard fully flexible estimator does, is unbiased but inefficient when some of these effects are in fact equal, whereas pooling them all into a single two-way fixed effects…

借助多项式逼近建立高斯经验贝叶斯的尖锐遗憾界AI 解读

A central problem in the theory of empirical Bayes is to control the regret (excess risk) of a learned Bayes rule by the Hellinger distance between the estimated and true marginal densities. In the normal means model, the classical result of Jiang and Zhang (2009) achieves this only after regularizing the Bayes rule and incurs an extraneous cubic logarithmic factor through a delicate recursive argument. This paper introduces a new technique, based on polynomial approximation…

带节点乘性效应的网络潜在空间模型AI 解读

Latent space models represent network nodes as points in a geometric space, with connection probabilities determined by distances between latent positions under a fixed metric, typically Euclidean, spherical, or hyperbolic. We generalize the classical formulation by introducing nodal multiplicative effects motivated by a local deformation of the latent metric. This modification approximates a conformal deformation of the metric tensor while preserving the logistic predictor…

校正优化偏差的熵型决定系数AI 解读

Classical likelihood-ratio tests and $Δ$AIC exacerbate the statistical significance crisis by scaling with sample size, often flagging negligible improvements as highly significant. While causal estimands like the average treatment effect (ATE) quantify practical magnitude, their reliance on the expectation operator ties them to the data's original coordinate scale. Furthermore, existing pseudo-$R^2$ metrics are inadequate: variance-based measures ignore higher-order…

较弱尾部假设下的 Lasso 去偏推断AI 解读

We consider the problem of high-dimensional inference with the lasso estimator. Different methods including 'double selection' techniques and multiple versions of the 'debiased lasso' have been proposed for this task with noticeable success. However, most guarantees assume strong hypotheses on the underlying data process and the errors in the linear regression model, such as subgaussian designs and independence between errors and the data itself. We show that 'standardizing'…

高维混合模型的贝叶斯蒸馏聚类AI 解读

Latent subgroup analysis is central to fields such as genomics, precision medicine, and social science, where the goal is to identify heterogeneous populations with distinct covariate structures or response behaviors. Mixture models provide a natural probabilistic framework for this task, representing the data-generating distribution as a weighted combination of subgroup-specific laws with unobserved labels. In high-dimensional regimes, these analyses face significant…

可扩展的 VARMA 模型估计AI 解读

Vector autoregressive moving-average (VARMA) models have long been considered impractical beyond moderate dimensions: the likelihood is non-convex, the parametrization is identified only up to equivalence, and every evaluation costs a pass over the entire series. Yet their moving-average term captures with a few parameters what a pure autoregression matches only with many lags. We introduce an estimation framework that removes this computational barrier: each optimization…

参数数量发散时的估计渐近理论：稀疏与非稀疏情形AI 解读

We develop a general asymptotic theory for estimating equations whose dimension diverges with the sample size. For both unpenalized and sparse penalized problems, we establish population-level conditions for existence, consistency, uniqueness, and asymptotic normality; in the penalized setting, we also establish selection consistency under a generalized version of the mutual incoherence condition. Our results cover stepwise procedures with a diverging number of steps,…

协变量漂移下的非参数拟合优度检验AI 解读

This paper develops procedures for nonparametric goodness-of-fit testing under covariate shift, where labelled data are drawn from a source population but goodness-of-fit is evaluated for a target population. The distribution mismatch is quantified by either a bounded moment condition or a sub-exponential tail condition on the target-to-source density ratio. Our method combines truncated importance-weighting kernel ridge regression with a multiplier bootstrap to construct…

基于小波的分布式数据稀疏主成分分析AI 解读

The large volume of data and concerns about data privacy have motivated the development of techniques for distributed data, a problem also known as federated learning. In this scenario, sub-samples of the data are divided across different machines, and statistics must be computed over that data without direct access to the full sample. Johnstone & Lu (2009, JASA) show that principal component analysis (PCA) is statistically inconsistent in the high-dimensional regime, and…

近端估计与推断AI 解读

We build a unifying convex analysis framework characterizing the statistical properties of a large class of penalized estimators, both under a regular and an irregular design. Our framework interprets penalized estimators as proximal estimators, defined by a proximal operator applied to a corresponding initial estimator. We characterize the asymptotic properties of proximal estimators, showing that their asymptotic distribution follows a closed-form formula depending only on…

协变量漂移下岭回归的合并与集成比较AI 解读

Datasets in many settings naturally partition into clusters arising from sub-populations, batch effects, or aggregation across multiple sources. A common response to such heterogeneity is to ensemble learners trained on each cluster rather than fit a single model to the pooled data. Prior work motivating such approaches has typically considered settings in which both the covariate distribution and the conditional outcome model differ across clusters; the role of…