2026 年的期刊文章 · 第 20 页

共 1756 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2026-06-04 到 2026-05-30。

按期刊、按主题看 →

第 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 页

JRSSB Causal Inference Networks & Graphs · 发表于 2026-06-04,收录于 2026-06-12

Causal inference under uniformly bounded neighbourhood interference

Xin Lu, Hongzi Li, Hanzhong Liu

摘要

Randomized experiments remain the gold standard for estimating treatment effects; however, network interference compromises the validity of traditional estimators by violating the stable unit treatment value assumption and introducing bias. Although cluster-randomized designs help mitigate some bias, they struggle to accommodate complex network structures and cannot disentangle direct from indirect effects. To address these challenges, we develop a design-based asymptotic theory for Horvitz–Thompson estimators of the direct, indirect, and total average treatment effects under Bernoulli designs, assuming uniformly bounded neighbourhood interference. Given the poor performance of classical Horvitz–Thompson point and variance estimators in dense networks, we propose eigenvector-adjusted point estimators along with novel variance estimators to improve inference. We establish theoretical guarantees for the proposed estimators within the design-based framework, allowing for robust conclusions that are independent of the stochastic properties of the network or the potential outcome model. The adaptability of the method is showcased under two structured interference scenarios: partial interference and local interference in a two-sided marketplace. Numerical studies further highlight the practical utility of the proposed estimators.

JASA Bayesian Methods · 发表于 2026-06-04,收录于 2026-06-05

Bayesian Phase 1–2 Designs with Adaptive Rules for Staggering Patient Entry

Shuqi Wang, Peter F. Thall, Ying Yuan, Suyu Liu

摘要

For first-in-human dose-finding trials, to protect patient safety, regulatory agencies may enforce strict within-cohort staggering rules that require delaying treatment of each patient in the first cohort at an untried dose until dose-limiting toxicities (DLTs) of all previously treated patients have been evaluated. Consequently, many new patients may face therapy delays, which reduces their probability of achieving a response due to disease progression, or be treated off-protocol, which may significantly extend trial duration. To address this, we propose a Bayesian phase 1-2 design, Adaptive Stagger, that reduces delays while protecting patients by making adaptive within-cohort staggering decisions. Adaptive Stagger exploits the relationship between the number of low-grade toxicities and DLT, and accounts for the risk of disease progression. A utility function is used to quantify the tradeoff between DLT and response, with a patient’s treatment delayed only if it has greater expected utility than immediate treatment at the current recommended dose, or the current dose fails a safety requirement. Otherwise, the patient is treated without delay at the current dose. Simulations show that, compared to a design with strict within-cohort staggering rules, Adaptive Stagger improves safety slightly, increases the optimal dose selection rate, and substantially shortens trial duration. The design is illustrated by a trial of CD70 natural killer cells for treating hematologic malignancies. *(abstract via OpenAlex)*

JASA High-Dimensional Missing Data & Measurement Error · 发表于 2026-06-04,收录于 2026-06-05

Another Look at High-Dimensional Regression in Principal Components Space and The Blessing of Dimensionality

Yang Song, Hui Zou

摘要

Benefits of exploiting sparsity in the space of principal components have been well documented both empirically and theoretically (Lang and Zou; Silin and Fan). In this article, we further reveal another unexpected advantage of exploiting sparsity in the space of principal components when the data are contaminated by measurement errors. Assuming the coefficient vector resides in an lq ball (0≤q≤1), we show that an l1 penalized principal components regression has a prediction performance on error-contaminated data that reaches the minimax-optimal rate obtained from clean data. Moreover, our theory does not require any knowledge of the covariance matrix of measurement errors. Our theory also reveals an interesting blessing-of-dimensionality phenomenon: the impact of measurement errors on prediction performance diminishes as the number of covariates increases. This is fundamentally different from the sparse measurement-error regression in the original input variables space where the negative impact of measurement errors only increases with the number of covariates. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work. *(abstract via OpenAlex)*

JASA Causal Inference Bayesian Methods Machine Learning · 发表于 2026-06-04,收录于 2026-04-17

An AI-powered Bayesian generative modeling approach for causal inference in observational studies

Qiao Liu, Wing Hung Wong

摘要

Causal inference in observational studies with high-dimensional covariates presents significant challenges. We introduce CausalBGM, an AI-powered Bayesian generative modeling approach that captures the causal relationship among covariates, treatment, and outcome variables. The core innovation of CausalBGM lies in its ability to estimate the individual treatment effect (ITE) by learning individual-specific distributions of a low-dimensional latent feature set (e.g., latent confounders) that drives changes in both treatment and outcome. This approach not only effectively mitigates confounding effects but also provides comprehensive uncertainty quantification, offering reliable and interpretable causal effect estimates at the individual level. CausalBGM adopts a Bayesian model and uses a novel iterative algorithm to update the model parameters and the posterior distribution of latent features until convergence. This framework leverages the power of AI to capture complex dependencies among variables while adhering to the Bayesian principles. Extensive experiments demonstrate that CausalBGM consistently outperforms state-of-the-art methods, particularly in scenarios with high-dimensional covariates and large-scale datasets. Its Bayesian foundation ensures statistical rigor, providing robust and well-calibrated posterior intervals. By addressing key limitations of existing methods, CausalBGM emerges as a robust and promising framework for advancing causal inference in modern applications in fields such as genomics, healthcare, and social sciences." (JASA's own abstract page could not be fetched directly — tandfonline.com blocked automated access; this text was verified against the author's lab-hosted copy of the same published paper.) *Publication/online date: date unknown (tandfonline access blocked)*

JASA High-Dimensional · 发表于 2026-06-04,收录于 2026-06-05

Adaptive Debiased Lasso in High-Dimensional Generalized Linear Models with Streaming Data

Ruijian Han, Lan Luo, Yuanhang Luo, Yuanyuan Lin, Jian Huang

摘要

Online statistical inference facilitates real-time analysis of sequentially collected data, making it different from traditional methods that rely on static datasets. This article introduces a novel approach to online inference in high-dimensional generalized linear models, where we update regression coefficient estimates and their standard errors upon each new data arrival. In contrast to existing methods that either require full dataset access or large-dimensional summary statistics storage, our method operates in a single-pass mode, significantly reducing both time and space complexity. The core of our methodological innovation lies in an adaptive stochastic gradient descent algorithm tailored for dynamic objective functions, coupled with a novel online debiasing procedure. This allows us to maintain low-dimensional summary statistics while effectively controlling the optimization error introduced by the dynamically changing loss functions. We establish the asymptotic normality of our proposed Adaptive Debiased Lasso (ADL) estimator. We conduct extensive simulation experiments to show the statistical validity and computational efficiency of our ADL estimator across various settings. Its computational efficiency is further demonstrated via a real data application to the spam email classification. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work. *(abstract via PubMed)*

JASA Other · 发表于 2026-06-04,收录于 2026-06-05

Adapting to Noise Tails in Private Linear Regression

Jinyuan Chang, Lin Yang, Mengyue Zha, Wen-Xin Zhou

摘要

While the traditional goal of statistics is to infer population parameters, modern practice increasingly demands protection of individual privacy. One way to address this need is to adapt classical statistical procedures into privacy-preserving algorithms. In this article, we develop differentially private tail-robust methods for linear regression. The tradeoff among bias, privacy, and robustness is controlled by a tunable robustification parameter in the Huber loss. We implement noisy clipped gradient descent for low-dimensional settings and noisy iterative hard thresholding for high-dimensional sparse models. Under sub-Gaussian errors, our method achieves near-optimal convergence rates while relaxing several assumptions required in earlier work. For heavy-tailed errors, we explicitly characterize how the non-asymptotic convergence rate depends on the moment index, privacy parameters, sample size, and intrinsic dimension. Our analysis shows how the moment index influences the choice of robustification parameters and, in turn, the resulting statistical error and privacy cost. By quantifying the interplay among bias, privacy, and robustness, we extend classical perspectives on privacy-preserving robust regression. The proposed methods are evaluated through simulations and two real datasets. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work. *(abstract via OpenAlex)*

JASA Spatial & Time Series Machine Learning Networks & Graphs · 发表于 2026-06-04,收录于 2026-06-05

A Statistician’s Overview of Physics-Informed Neural Networks for Spatio-Temporal Data

Christopher K. Wikle, Joshua North, Giri Gopalan, Myungsoo Yoo

摘要

(verbatim from arXiv:2507.14336)*: "The recent success of deep neural network models with physical constraints (so-called, Physics-Informed Neural Networks, PINNs) has led to renewed interest in the incorporation of mechanistic information in predictive models. Statisticians and others have long been interested in this problem, which has led to several practical and innovative solutions dating back decades. In this overview, we focus on the problem of data-driven prediction and inference of dynamic spatio-temporal processes that include mechanistic information, such as would be available from partial differential equations, with a strong focus on the quantification of uncertainty associated with data, process, and parameters. We give a brief review of several paradigms and focus our attention on Bayesian implementations given they naturally accommodate uncertainty quantification. We then show that it is straight-forward to include the Bayesian PINN (B-PINN) within the Bayesian hierarchical model (BHM) framework that has long been considered for modeling dynamic spatio-temporal processes. Such a BHM-PINN is illustrated via a simulation study in which a latent nonlinear Burgers' equation PDE governs the dynamics of Poisson distributed spatio-temporal data.

JASA Other · 发表于 2026-06-04,收录于 2026-06-05

A Burden Shared is a Burden Halved: A Fairness-Adjusted Approach to Classification

Bradley Rava, Wenguang Sun, Gareth M. James, Xin Tong

摘要

We investigate the fairness issue in classification, where automated decisions are made for individuals from different protected groups. In high-consequence scenarios, decision errors can disproportionately affect certain protected groups, leading to unfair outcomes. To address this issue, we propose a fairness-adjusted selective inference (FASI) framework and develop data-driven algorithms that achieve statistical parity by controlling the false selection rate (FSR) among protected groups. Our FASI algorithm operates by converting the outputs of black-box classifiers into R-values, which are both intuitive and computationally efficient. These R-values serve as the basis for selection rules that are provably valid for FSR control in finite samples for protected groups, effectively mitigating the unfairness in group-wise error rates. We demonstrate the numerical performance of our approach using both simulated and real data. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work. *(abstract via OpenAlex)*

JRSSB High-Dimensional Networks & Graphs · 发表于 2026-06-03,收录于 2026-06-05

KL-BSS: rethinking optimality for neighbourhood selection in structural equation models

Ming Gao, Wai Ming Tai, Bryon Aragam

摘要

We introduce a new method for neighbourhood selection in linear structural equation models that improves over classical methods such as best subset selection (BSS) and the Lasso. Our method, called KL-BSS, takes advantage of the existence of underlying structure in SEM—even when this structure is unknown—and is easily implemented using existing solvers. Under weaker eigenvalue conditions compared to BSS and the Lasso, KL-BSS can provably recover the support of linear models with fewer samples. We establish both the pointwise and minimax sample complexity for support recovery, which KL-BSS obtains. Extensive experiments on both real and simulated data confirm the improvements offered by KL-BSS. While it is well-known that the Lasso encounters difficulties under structured dependencies, it is less well-known that even BSS runs into trouble as well, and can be substantially improved. These results have implications for structure learning in graphical models, which often relies on neighbourhood selection as a subroutine.

SiM High-Dimensional Causal Inference · 发表于 2026-06-02,收录于 2026-06-05

Variable Selection in Multistate Models for Correlated Data With Application in a COVID ‐19 Vaccination Study

Jason Mao, Yang Li, Wanzhu Tu

摘要

Depicting patient transitions among multiple clinical states is a common objective in health services and epidemiological research. Multistate models (MSM) are the primary analytical approach used in such studies. Although the structure of an MSM is typically determined by the research questions of a specific application, models are typically complex, with multiple transition paths and a large number of parameters. This complexity introduces computational and numerical challenges in parameter estimation and scientific difficulties in model interpretation. Compounding these issues is the inherent within‐subject correlation. For example, in studies of care transitions among patients receiving coronavirus disease 2019 (COVID‐19) vaccines, the transition times among different states within the same subject tend to be correlated. Failing to accommodate these correlations may lead to inefficient estimation and questionable inference. In this paper, we propose a method for variable selection in MSM with correlated data by reparameterizing the likelihood function and approximating the penalty term with a smooth hyperbolic tangent function. This approach enforces sparsity in the MSM. We conducted an extensive simulation study to evaluate the accuracy of variable selection and parameter estimation. Finally, we applied the method to analyze data from an observational study of care transitions among individuals receiving COVID‐19 vaccines, focusing on four health states: healthy, infection, emergency department or hospital admission, and death.

SiM Survival Analysis Meta-Analysis & Data Integration · 发表于 2026-06-02,收录于 2026-06-05

Rank‐Based Transfer Learning for High‐Dimensional Survival Data With Application to Sepsis Data

Nan Qiao, Haowei Jiang, Cunjie Lin

摘要

Sepsis remains a critical challenge due to its high mortality and complex prognosis. To address data limitations in studying MSSA sepsis, we extend existing transfer learning frameworks to accommodate transformation models for high‐dimensional survival data. Specifically, we construct a measurement index based on the C‐index for intelligently identifying the helpful source datasets, and the target model performance is improved by leveraging information from the identified source datasets via performing the transfer step and debiasing step. Another significant development is that statistical properties are rigorously established, including ‐estimation error bounds of the transfer learning algorithm and detection consistency property of the transferable source detection algorithm. Extensive simulations and analysis of MIMIC‐IV sepsis data demonstrate the estimation and prediction accuracy, and practical advantages of our approach, providing significant improvements in survival estimates for MSSA sepsis patients.

JRSSB Networks & Graphs Nonparametric & Semiparametric · 发表于 2026-06-02,收录于 2026-06-05

Parametric and nonparametric symmetries in graphical models for extremes

Frank Röttger, Jane Ivy Coons, Alexandros Grosdos

摘要

Coloured graphical models provide a parsimonious approach to modeling high-dimensional data by exploiting symmetries in the model parameters. In this work, we introduce the notion of colouring for extremal graphical models on generalized multivariate Pareto distributions, a natural class of limiting distributions for threshold exceedances. Thanks to a stability property of the generalized multivariate Pareto distributions, coloured extremal tree models can be defined fully nonparametrically. For more general graphs, the parametric family of Hüsler–Reiss distributions allows for two alternative approaches to coloured graphical models. We study both model classes and introduce statistical methodology for parameter estimation. It turns out that for Hüsler–Reiss tree models the different definitions of coloured graphical models coincide. In addition, we show a general parametric description of extremal conditional independence statements for Hüsler–Reiss distributions. Finally, we demonstrate that our methodology outperforms existing approaches on a real data set.

Biometrics Causal Inference Clinical Trials · 发表于 2026-06-02,收录于 2026-06-05

Integrative learning of individualized treatment rules from multiple studies with partially overlapping treatments

Yuan Bian, Donglin Zeng, Hyun-Joon Yang, Leanne M Williams, Yuanjia Wang

摘要

(verbatim from the journal page)*: "An individualized treatment rule (ITR) tailors treatments to a patient's specific characteristics. However, randomized controlled trials (RCTs) are often underpowered to detect the treatment effect heterogeneity needed for reliable ITR estimation. To address this limitation, there is growing interest in leveraging information from multiple studies to improve statistical power and support individualized decision-making. A key challenge in this context is that available RCTs may not evaluate the same set of treatments. In this paper, we propose an integrative learning framework that synthesizes evidence across multiple RCTs that share a common comparator but differ in their alternative treatment arms. Our method integrates information through a regularized weighted misclassification risk function and adaptively determines the contribution of each study to the ITRs of the others. We rigorously study the excess risk of the resulting estimator. Simulation studies demonstrate that the proposed approaches improve the estimation of both value and benefit functions. We illustrate the utility of our methodology using data from two landmark studies of major depressive disorder: the Establishing Moderators and Biosignatures of Antidepressant Response in Clinical Care study and the International Study to Predict Optimized Treatment in Depression study, both of which include a selective serotonin reuptake inhibitor as a common treatment arm. We find that the separate learning method outperforms one-size-fits-all methods, and our integrative methods further improve performance." *(Online: 2 June 2026)*

AoS Other · 发表于 2026-06-01

Vecchia Gaussian processes: On probabilistic and statistical properties

Botond Szabo, Yichen Zhu

摘要

Gaussian Processes (GPs) are widely used to model dependencies in spatial statistics and machine learning. However, exact inference is computationally intractable for GP regression, with a time complexity of O(n3). The Vecchia approximation scales up computation by introducing sparsity into the spatial dependency structure, represented by a directed acyclic graph (DAG). Despite its practical popularity, this approach lacks rigorous theoretical foundations, and the choice of DAG structure remains an open problem. In this paper, we systematically study the Vecchia approximation of the popular, isotropic Matérn GP as standalone stochastic process and uncover key probabilistic and statistical properties. We propose selecting parent sets as norming sets with fixed cardinality in the Vecchia approximation. On the probabilistic side, we show that the conditional distributions of Matérn GPs, as well as their Vecchia approximations, can be characterized by polynomial interpolations. This enables us to establish several results on small ball probabilities and the Reproducing Kernel Hilbert Spaces (RKHSs) of Vecchia GPs. Building on these probabilistic results, we prove that in the nonparametric regression model, the corresponding posterior contracts around the truth at the optimal minimax rate, both under oracle rescaling and hierarchical tuning of the prior. We illustrate the theoretical findings through numerical experiments on synthetic datasets. Our core algorithms are implemented in C++ with an R interface.

AoS Optimization & Learning Theory · 发表于 2026-06-01

Uncertainty quantification for iterative algorithms in linear models with application to early stopping

Pierre C. Bellec, Kai Tan

摘要

This paper investigates the iterates bˆ1,…,bˆT obtained from iterative algorithms in high-dimensional linear regression problems, in the regime where the feature dimension p is comparable with the sample size n, that is, p≍n. The analysis and proposed estimators are applicable to Gradient Descent (GD), proximal GD and their accelerated variants such as Fast Iterative Soft-Thresholding (FISTA). The paper proposes novel estimators for the generalization error of the iterate bˆt for any fixed iteration t along the trajectory. These estimators are proved to be n-consistent under Gaussian designs. Applications to early-stopping are provided: when the generalization error of the iterates is a U-shape function of the iteration t, the estimates allow to select from the data an iteration tˆ that achieves the smallest generalization error along the trajectory. Additionally, we provide a technique for developing debiasing corrections and valid confidence intervals for the components of the true coefficient vector from the iterate bˆt at any finite iteration t. Extensive simulations on synthetic data illustrate the theoretical results.

AoS Nonparametric & Semiparametric · 发表于 2026-06-01

Towards a unified theory for semiparametric data fusion with individual-level data

Ellen Graham, Marco Carone, Andrea Rotnitzky

摘要

We consider inference about a finite-dimensional parameter integrating samples from independent sources. A recently developed theory considers scenarios where sources align with subsets of the conditional distributions of a single factorization of the joint target distribution. While this theory applies in many settings, it falls short in important data fusion problems, such as two-sample instrumental variable analysis, settings that integrate data from epidemiological studies with diverse designs, and studies with mismeasured variables supplemented by external validation studies. In this paper we derive a comprehensive theory that, in particular, covers these settings by allowing the integration of sources aligned with conditional distributions that do not correspond to a single factorization of the target distribution. We provide a universal characterization of the influence functions of regular and asymptotically linear estimators and the efficient influence function of a target parameter, irrespective of the parameter of interest or the statistical model for the target distribution, thus paving the way for a unified theory for machine-learning debiased, semiparametric efficient estimation.

AoS Other · 发表于 2026-06-01

Test of independence using generalized distance correlation

Jianqing Fan, Zhipeng Lou, Danna Zhang

摘要

We study the fundamental statistical inference concerning the testing of independence between two random vectors. Existing asymptotic theories for test statistics based on distance covariance can only apply to either low-dimensional or high-dimensional settings and require stringent distributional assumptions. In this work we develop a new unified distributional theory of the sample generalized distance covariance that works for random vectors of arbitrary dimensions under fairly mild moment conditions. In particular, a Gaussian approximation result is established with a nonasymptotic error bound, and the asymptotic null distribution of the sample generalized distance covariance is shown to be distributed as a linear combination of independently and identically distributed chi-squared random variables. To estimate the asymptotic null distribution practically, we propose a half-permutation procedure and provide the theoretical justification for its validity. The exact asymptotic distribution of the resampling distribution is derived under general marginal moment conditions, and the proposed procedure is shown to be asymptotically equivalent to the oracle procedure with known marginal distributions.

AoS Econometrics & Economics Machine Learning Networks & Graphs · 发表于 2026-06-01

Statistical-computational trade-offs for recursive adaptive partitioning estimators

Yan Shuo Tan, Jason M. Klusowski, Krishnakumar Balasubramanian

摘要

Models based on recursive adaptive partitioning such as decision trees and their ensembles are popular for high-dimensional regression as they can potentially avoid the curse of dimensionality. Because empirical risk minimization (ERM) is computationally infeasible, these models are typically trained using greedy algorithms. Although effective in many cases, these algorithms have been empirically observed to get stuck at local optima. We explore this phenomenon in the context of learning sparse regression functions over d binary features, showing that when the true regression function f∗ does not satisfy Abbe et al. (In Conference on Learning Theory (2022) 4782–4887 PMLR)’s Merged Staircase Property (MSP), a form of heredity restriction similar to that used in classical ANOVA modeling, greedy training requires exp(Ω(d)) samples to achieve low estimation error. Conversely, when f∗ does satisfy MSP, greedy training can attain small estimation error with only O(logd) samples. This dichotomy mirrors that of two-layer neural networks trained with stochastic gradient descent (SGD) in the mean-field regime, thereby establishing a head-to-head comparison between SGD-trained neural networks and greedy recursive partitioning estimators. Furthermore, ERM-trained recursive partitioning estimators achieve low estimation error with O(logd) samples irrespective of whether f∗ satisfies MSP, thereby demonstrating a statistical-computational trade-off for greedy training. Our proofs are based on a novel interpretation of greedy recursive partitioning using stochastic process theory and a coupling technique that may be of independent interest.

AoS Clinical Trials · 发表于 2026-06-01

Statistical inference in tensor completion: Optimal uncertainty quantification and statistical-to-computational gaps

Wanteng Ma, Dong Xia

摘要

This paper presents a simple yet efficient method for statistical inference of tensor linear forms using incomplete and noisy observations. Under the Tucker low-rank tensor model and the missing-at-random assumption, we utilize an appropriate initial estimate along with a debiasing technique followed by a one-step power iteration to construct an asymptotically normal test statistic. This method is suitable for various statistical inference tasks, including constructing confidence intervals, inference under heteroskedastic and sub-exponential noise, and simultaneous testing. We demonstrate that the estimator achieves the Cramér–Rao lower bound on Riemannian manifolds, indicating its optimality in uncertainty quantification. We comprehensively examine statistical-to-computational gaps and investigate the impact of initialization on the minimal conditions regarding sample sizes and signal-to-noise ratios required for accurate inference. Our findings show that, with independent initialization, statistically optimal sample sizes and signal-to-noise ratios are sufficient for accurate inference. Conversely, if only dependent initialization is available, computationally optimal sample sizes and signal-to-noise ratios still guarantee asymptotic normality without the need for data-splitting. We present the phase transition between computational and statistical limits. Numerical simulation results align with the theoretical findings.

AoS High-Dimensional · 发表于 2026-06-01

Statistical inference for low-rank tensors: Heteroskedasticity, subgaussianity, and applications

Joshua Agterberg, Anru R. Zhang

摘要

In this paper, we consider inference and uncertainty quantification for low Tucker rank tensors with additive noise in the high-dimensional regime. Focusing on the output of the higher-order orthogonal iteration (HOOI) algorithm, a commonly used algorithm for tensor singular value decomposition, we establish nonasymptotic distributional theory and study how to construct confidence regions and intervals for both the estimated singular vectors and the tensor entries in the presence of heteroskedastic subgaussian noise, which are further shown to be optimal for homoskedastic Gaussian noise. Furthermore, as a byproduct of our theoretical results, we establish the entrywise convergence of HOOI when initialized via diagonal deletion. To further illustrate the utility of our theoretical results, we then consider several concrete statistical inference tasks. First, in the tensor mixed-membership blockmodel, we consider a two-sample test for equality of membership profiles, and we propose a test statistic with consistency under local alternatives that exhibits a power improvement relative to the corresponding matrix test considered in several previous works. Next, we consider simultaneous inference for small collections of entries of the tensor, and we obtain consistent confidence regions. Finally, focusing on the particular case of testing whether entries of the tensor are equal, we propose a consistent test statistic that shows how index overlap results in different asymptotic standard deviations. All of our proposed procedures are fully data-driven, adaptive to noise distribution and signal strength, and do not rely on sample-splitting, and our main results highlight the effect of higher-order structures on estimation relative to the matrix setting. Our theoretical results are demonstrated through numerical simulations.

AoS High-Dimensional · 发表于 2026-06-01

Sparse PCA: A new scalable estimator based on integer programming

Kayhan Behdin, Rahul Mazumder

摘要

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 estimator for SPCA which can be formulated as a MIP. Different from earlier work, we make use of the underlying spiked covariance model and properties of the multivariate Gaussian distribution to arrive at our estimator. We establish statistical guarantees for our proposed estimator in terms of estimation error and support recovery. We derive guarantees under departures from the spiked covariance model and for approximate solutions to the optimization problem. We propose a custom algorithm to solve the MIP, which scales better than off-the-shelf solvers, and demonstrate that our approach can be much more computationally attractive compared to earlier exact MIP-based approaches for the SPCA problem. Our numerical experiments on synthetic and real datasets show that our algorithms can address problems with up to 20,000 features in minutes; and generally result in favorable statistical properties compared to existing popular approaches for SPCA.

AoS Testing & Uncertainty · 发表于 2026-06-01

Quasi-Monte Carlo confidence intervals using quantiles of randomized nets

Zexin Pan

摘要

Recent advances in quasi-Monte Carlo integration have shown that for linearly scrambled digital net estimators, the convergence rate can be dramatically improved by taking the median rather than the mean of multiple independent replicates. In this work, we demonstrate that the quantiles of such estimators can be used to construct confidence intervals with asymptotically valid coverage for high-dimensional integrals. By analyzing the error distribution for a class of infinitely differentiable integrands, we prove that as the sample size increases, the integration error decomposes into an asymptotically symmetric component and a vanishing remainder. Consequently, the asymptotic error distribution is symmetric about zero, ensuring that a quantile-based interval constructed from independent replicates captures the true integral with probability converging to a nominal level determined by the binomial distribution.

AoS Optimization & Learning Theory Econometrics & Economics · 发表于 2026-06-01

Online tensor learning: Computational and statistical trade-offs, adaptivity and optimal regret

Jingyang Li, Jian-Feng Cai, Yang Chen, Dong Xia

摘要

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 achieves statistical optimality by choosing an appropriate fixed step size. We find that noisy tensor completion particularly benefits from online algorithms by avoiding the trimming procedure and ensuring sharp entrywise statistical error, which is often technically challenging for offline methods. The regret of oRGrad is analyzed, revealing a fascinating trilemma concerning the computational convergence rate, statistical error, and regret bound. By selecting an appropriate constant step size, oRGrad achieves an O(T1/2) regret. We then introduce the adaptive-oRGrad algorithm, which can achieve the optimal O(logT) regret by adaptively selecting step sizes, regardless of whether the time horizon is known. The adaptive-oRGrad algorithm can attain a statistically optimal error rate without knowing the horizon. Comprehensive numerical simulations corroborate our theoretical findings. We show that oRGrad significantly outperforms its offline counterpart in predicting the solar F10.7 index with tensor predictors that monitor space weather impacts.

AoS Other · 发表于 2026-06-01

Minimax optimal seriation in polynomial time

Yann Issartel, Christophe Giraud, Nicolas Verzelen

摘要

We consider the seriation problem, whose goal is to recover a hidden ordering from a noisy observation of a permuted Robinson matrix. We establish sharp minimax rates under average-Lipschitz conditions that strictly extend the bi-Lipschitz framework of Giraud, Issartel and Verzelen (Electron. J. Stat. (2023) 17 1587–1662). We further design a polynomial-time algorithm that attains these optimal rates, thereby resolving two open questions raised in Giraud, Issartel and Verzelen. Finally, our analysis extends to a broader class of matrices beyond those generated by exact permutations.

AoS Bayesian Methods Nonparametric & Semiparametric · 发表于 2026-06-01

Markov stick-breaking processes

María F. Gil-Leyva, Antonio Lijoi, Ramsés H. Mena, Igor Prünster

摘要

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 direction by considering Markov length variables and investigate the corresponding general class of stick-breaking processes, which we term Markov stick-breaking processes. We establish conditions under which the associated species sampling process is proper and the distribution of a Markov stick-breaking process has full topological support, two fundamental desiderata for Bayesian nonparametric models. We also analyze the stochastic ordering of the weights and provide a new characterization of the Pitman–Yor process as the only stick-breaking process invariant under size-biased permutations, under mild conditions. Moreover, we identify two notable subclasses of Markov stick-breaking processes that enjoy appealing properties and include Dirichlet, Pitman–Yor and geometric priors as special cases. Our findings include distributional results enabling posterior inference algorithms and methodological insights.

SiM Causal Inference Clinical Trials · 发表于 2026-06-01,收录于 2026-07-31

Improving Sensitivity Analysis By Synthesizing Randomized Clinical Trials With Limited Overlap

Kuan Jiang, Wenjie Hu, Xinxing Lai, Shu Yang, Xiao‐Hua Zhou

摘要

While randomized clinical trials (RCTs) are widely regarded as the gold standard for estimating average treatment effects, their external validity is often constrained by limited sample sizes and restrictive inclusion/exclusion criteria, which may compromise the generalizability of findings to broader real‐world populations. Conversely, observational studies typically consist of representative real‐world samples but are susceptible to bias due to unmeasured confounders, undermining their internal validity. To address the limitation, sensitivity analysis is often used to estimate bounds for the average treatment effect (ATE) without relying on stringent assumptions of other existing methods. This article introduces a novel synthesis sensitivity analysis estimator that enhances sensitivity analysis in observational studies by incorporating RCT data, even when limited covariate overlap exists between datasets due to differential inclusion/exclusion criteria. We show that the proposed estimator will give a tighter bound when a “separability” condition holds for the sensitivity parameter. Theoretical proofs and simulations show that this method provides a tighter bound than the sensitivity analysis using only observational study data. We apply this method to combine observational study data on drug effectiveness comparison with a partially overlapping RCT data, yielding tighter average treatment effect bounds.

AoS Latent Variables & Mixtures · 发表于 2026-06-01

Identification and estimation for matrix time-series CP-factor models

Jinyuan Chang, Yue Du, Guanglin Huang, Qiwei Yao

摘要

We propose a new method for identifying and estimating the CP-factor models for matrix time series. Unlike the generalized eigenanalysis-based method (J. R. Stat. Soc. Ser. B. Stat. Methodol. 85 (2023) 127–148) for which the convergence rates of the associated estimators may suffer from small eigengaps as the asymptotic theory is based on some matrix perturbation analysis, the proposed new method enjoys faster convergence rates which are free from any eigengaps. It achieves this by turning the problem into a joint diagonalization of several matrices whose elements are determined by a basis of a linear system, and by choosing the basis carefully to avoid near colinearity (see Proposition 5 and Section 4.3). Furthermore, unlike the generalized eigenanalysis-based method which requires the two factor loading matrices to be full-ranked, the proposed new method can handle rank-deficient factor loading matrices. Illustration with both simulated and real matrix time-series data shows the advantages of the proposed new method.

AoS Optimization & Learning Theory · 发表于 2026-06-01

Gradient descent inference in empirical risk minimization

Qiyang Han, Xiaocong Xu

摘要

Gradient descent is one of the most widely used iterative algorithms in modern statistical learning. However, its precise algorithmic dynamics in high-dimensional settings remain only partially understood, which has limited its broader potential for statistical inference applications. This paper provides a precise, nonasymptotic joint distributional characterization of gradient descent iterates and their debiased statistics in a broad class of empirical risk minimization problems, in the so-called mean-field regime where the sample size is proportional to the signal dimension. Our nonasymptotic state evolution theory holds for both general nonconvex loss functions and non-Gaussian data, and reveals the central role of two Onsager correction matrices that precisely characterize the nontrivial dependence among all gradient descent iterates in the mean-field regime. Leveraging the joint state evolution characterization, we show that the gradient descent iterate retrieves approximate normality after a debiasing correction via a linear combination of observable loss derivative directions from all past iterates. Crucially, the debiasing coefficients are directly linked to the Onsager correction matrices, which can be estimated in a fully data-driven manner via the proposed gradient descent inference algorithm. This leads to a new algorithmic statistical inference framework based on debiased gradient descent, which (i) applies to a broad class of models with both convex and nonconvex losses, (ii) remains valid at each iteration without requiring algorithmic convergence and (iii) exhibits a certain robustness to possible model misspecification. As a by-product, our framework also provides algorithmic estimates of the generalization error at each iteration. We demonstrate our theory and inference methods in the canonical single-index regression model and a generalized logistic regression model, where the natural loss functions may exhibit arbitrarily nonconvex landscapes. Our analysis further shows that, in linear regression with squared loss, the proposed debiased gradient descent iterate eventually coincides with the debiased convex regularized estimator in a mean-field distributional sense, and the quality of statistical inference for the unknown signal aligns exactly with the generalization error achieved along the algorithmic trajectory.

AoS High-Dimensional · 发表于 2026-06-01

Dual induction CLT for high-dimensional m-dependent data

Heejong Bong, Arun Kumar Kuchibhotla, Alessandro Rinaldo

摘要

We derive novel and sharp high-dimensional Berry–Esseen bounds for the sum of m-dependent random vectors over the class of hyperrectangles exhibiting only a poly-logarithmic dependence in the dimension. Our results hold under minimal assumptions, such as nondegenerate covariances and finite third moments, and exhibit an optimal sample complexity of order m(q−1)/(q−2)/n. Aside from logarithmic terms, the resulting rates match the optimal rates established in the univariate case. When specialized to the sums of independent nondegenerate random vectors, our results produce sharp and, in some cases, optimal rates under the weakest possible conditions. We develop a novel inductive relationship between anticoncentration inequalities and Berry–Esseen bounds inspired by the classical Lindeberg swapping method and the concentration inequality approach for dependent data that may be of independent interest.

SMMR Clinical Trials Bayesian Methods · 发表于 2026-06-01,收录于 2026-07-24

Bayesian adaptive design for clinical trials with potential subgroup effects

Not available

摘要

Adaptive clinical trial designs increasingly aim to improve efficiency while accommodating subgroup heterogeneity, yet most existing methods fix assumptions about drug efficacy and subgroup effects. We propose a Bayesian adaptive design that explicitly models and learns from uncertainty in both components. A hierarchical mixture prior represents uncertainty about overall treatment efficacy and the magnitude of a biomarker-defined subgroup effect. Interim data are used to update these hyperparameters into posterior distributions, enabling a decision-theoretic framework that adaptively selects the optimal testing strategy among three options: continuing with the overall population, focusing on the subgroup, or conducting a joint test of both. When joint testing is chosen, the posterior information further determines the optimal allocation of Type I error between populations by selecting an evidence-based α -splitting parameter that maximizes expected power under error-rate constraints. The resulting optimization is solved efficiently using GPU-accelerated quasi-Monte Carlo integration and smooth search procedures. Simulation studies across a range of subgroup prevalences and effect sizes demonstrate that the proposed design maintains nominal error control, achieves superior power and decision accuracy, and adapts appropriately to prior misspecification. By unifying posterior learning and adaptive α -allocation within a principled Bayesian framework, this design provides a transparent and computationally practical tool for confirmatory clinical trials with uncertain subgroup effects, supporting precision-medicine decision-making and regulatory reproducibility.

AoS Other · 发表于 2026-06-01

Attainability of two-point testing rates for finite-sample location estimation

Spencer Compton, Gregory Valiant

摘要

Le Cam’s two-point testing method yields perhaps the simplest lower bound for estimating the mean of a distribution: roughly, if it is impossible to well distinguish a distribution centered at μ from the same distribution centered at μ+Δ, then it is impossible to estimate the mean by better than Δ/2. It is setting-dependent, whether or not a nearly matching upper bound is attainable. We study the conditions under which the two-point testing lower bound can be attained for univariate mean estimation; both in the setting of location estimation (where the distribution is known up to translation) and adaptive location estimation (unknown distribution). Roughly, we will say an estimate nearly attains the two-point testing lower bound if it incurs error that is at most polylogarithmically larger than the Hellinger modulus of continuity for Ω˜(n) samples. Adaptive location estimation is particularly interesting, as some distributions admit much better guarantees than sub-Gaussian rates (e.g., Unif(μ−1,μ+1) permit error Θ(1n), while the sub-Gaussian rate is Θ(1n)), yet it is not obvious whether these rates may be adaptively attained by one unified approach. Our main result designs an algorithm that nearly attains the two-point testing rate for mixtures of symmetric, log-concave distributions with a common mean. Moreover, this algorithm runs in near-linear time and is parameter-free. In contrast, we show the two-point testing rate is not nearly attainable, even for symmetric, unimodal distributions. We complement this with results for location estimation, showing the two-point testing rate is nearly attainable for unimodal distributions but unattainable for symmetric distributions.

AoS Other · 发表于 2026-06-01

Approximate independence of permutation mixtures

Yanjun Han, Jonathan Niles-Weed

摘要

We prove bounds on statistical distances between high-dimensional exchangeable mixture distributions (which we call permutation mixtures) and their i.i.d. counterparts. Our results are based on a novel method for controlling χ2 divergences between exchangeable mixtures, which is tighter than the existing methods of moments or cumulants. At a technical level, a key innovation in our proofs is a new Maclaurin-type inequality for elementary symmetric polynomials of variables that sum to zero and an upper bound on permanents of doubly-stochastic positive semidefinite matrices. We obtain as a corollary a new de Finetti-style theorem (in the language of Diaconis and Freedman, 1987) as well as several new statistical results, including a differential privacy guarantee for the “shuffled privacy model” with Gaussian noise and improved generic consistency guarantees for empirical Bayes procedures in compound decision problems.

SMMR Clinical Trials · 发表于 2026-06-01,收录于 2026-07-24

An evaluation of designs for Phase I/IIa dose-finding studies in Tuberculosis

Not available

摘要

Alessandra Serra , Pavel Mozgunov , Patrick PJ Phillips and Thomas Jaki A new information integration framework for complex models with applications to real-world data Jia Liang , Jason Falve , Shuo Chen , Rozalina McCoy and Chixiang Chen A Bayesian phase I/II platform design with survival efficacy endpoint for dose optimization Xian Shi , Jiangyan Zhao , Jin Xu and Rongji Mu Bayesian adaptive design for clinical trials with potential subgroup effects Xuekui Zhang , Qianyun Zhao , Cong Chen , Belaid Moa and Shelley Gao Handling missing data, skewness, and outliers in medical research: A robust factor analysis approach using the canonical fundamental skew-t distribution Wan-Lun Wang , Luis M Castro and Tsung-I Lin Empirical likelihood inference for the area under the receiver operating characteristic (ROC) curve with verification biased data Shirui Wang , Shuangfei Shi and Gengsheng Qin A

AoS Testing & Uncertainty · 发表于 2026-06-01

Adaptive robust confidence intervals

Yuetian Luo, Chao Gao

摘要

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 Gaussian location model by addressing a general family of robust hypothesis testing. In contrast to adaptive robust estimation, our findings reveal that the optimal length of an adaptive robust confidence interval critically depends on the distribution’s shape.

AoS Spatial & Time Series · 发表于 2026-06-01

A two-step estimating approach for heavy-tailed AR models with nonzero median GARCH-type noises

Rui She, Linlin Dai, Shiqing Ling

摘要

This paper develops a novel two-step estimating procedure for heavy-tailed AR models with nonzero median GARCH-type noises, allowing for time-varying volatility. We first establish the self-weighted quantile regression estimator (SQE) across all quantile levels τ∈(0,1) for the AR parameters θ0. We show that the SQE, less a bias, converges weakly to a Gaussian process at a rate of n−1/2. The bias is zero if and only if τ equals τ0, the probability that the noise is less than zero. Based on the SQE, we propose an approach to estimate τ0 in the second step and feed the estimated τ0 back into the SQE to estimate θ0. Both the estimated τ0 and θ0 are shown to be consistent and asymptotically normal. A random weighting bootstrap method is developed to approximate the complex distribution. The problem we study is nonstandard because τ0 may not be identifiable in conventional quantile regression, and the usual methods cannot verify the existence of the SQE bias. Unlike existing procedures for heavy-tailed time series, our method does not require prior information about the symmetry, tail index, or the parametric form of the noise, nor does it require classical identification conditions, such as zero-mean or zero-median.

AoS Other · 发表于 2026-06-01

A novel statistical approach to analyze image classification

Juntong Chen, Sophie Langer, Johannes Schmidt-Hieber

摘要

The recent statistical theory of neural networks focuses on nonparametric denoising problems that treat randomness as additive noise. Variability in image classification datasets does, however, not originate from additive noise but from variation of the shape and other characteristics of the same object across different images. To address this problem, we introduce a tractable model for supervised image classification. While from the function estimation point of view, every pixel in an image is a variable, and large images lead to high-dimensional function recovery tasks suffering from the curse of dimensionality, increasing the number of pixels in the proposed image deformation model enhances the image resolution and makes the object classification problem easier. We introduce and theoretically analyze three approaches. Two methods combine image alignment with a one-nearest neighbor classifier. Under a separation condition, it is shown that perfect classification is possible. The third method fits a convolutional neural network (CNN) to the data. We derive a rate for the misclassification error that depends on the sample size and the complexity of the deformation class. An empirical study corroborates the theoretical findings.

JRSSB Networks & Graphs Nonparametric & Semiparametric Optimization & Learning Theory · 发表于 2026-06-01,收录于 2026-06-05

A copula graphical model for multi-attribute data using optimal transport

Qi Zhang, Bing Li, Lingzhou Xue

摘要

Motivated by modern data types such as images and multi-view data, the multi-attribute graphical model aims to uncover conditional independence structures among vector-valued nodes. Under the Gaussian assumption, such independence is encoded in blockwise zeros of the precision matrix. To relax the restrictive Gaussian assumption, we propose a semiparametric multi-attribute graphical model leveraging a newly introduced cyclically monotone copula. This copula treats the distribution of node vectors as multivariate marginals and transforms them into Gaussian distributions using optimal transport. Since our approach supports arbitrary continuous distributions over node vectors, it is significantly more flexible than existing copula Gaussian graphical models that only perform coordinatewise Gaussianization. We establish concentration inequalities for the estimated covariance matrices and provide sufficient conditions for the selection consistency of the group graphical lasso estimator. To address the curse of dimensionality when handling high-dimensional attributes, we further introduce a projected cyclically monotone copula model. Numerical experiments on both synthetic and real-world datasets demonstrate the effectiveness and flexibility of our methods.

SiM Survival Analysis Clinical Trials · 发表于 2026-05-31,收录于 2026-06-05

Sample Size Determination for Response‐Adaptive Randomization With Recurrent Event Responses and Unequal Follow‐Up Time

Junjiang Zhong, Xianggao Hu, Jingya Gao, Siu Hung Cheung

摘要

Trials with recurrent event responses are frequently encountered during clinical trials. Benefits have been demonstrated in previous studies when trials were conducted with a doubly biased coin design (DBCD). However, there is a lack of discussion about sample size determination. In this paper, we provide the methods to compute the required sample size with a given test power when DBCD is used. More importantly, our proposed sample size determination procedure also allows unequal follow‐up time due mainly to possible patient dropout. Without considering patient dropout, it is shown that the required sample size to reach the prespecified test power is underestimated. Theoretical results are derived to measure the impact of dropouts on the required sample size and treatment allocation proportions. A simulation study is conducted to illustrate the usefulness of our proposed procedure. Finally, a clinical example is used to illustrate the advantages of our proposed procedure in practice.

Biometrics Diagnostics & Prediction Bayesian Methods · 发表于 2026-05-30,收录于 2026-06-05

The underlap coefficient as a measure of a biomarker’s discriminatory ability

Zhaoxi Zhang, Vanda Inácio, Miguel de Carvalho

摘要

The first step in evaluating a potential diagnostic biomarker is to examine how its values vary across disease stages. In a three-class disease setting, the volume under the receiver operating characteristic surface (VUS) and the three-class Youden index are commonly used summary measures of a biomarker’s discriminatory ability. However, the VUS in its classical form and the three-class Youden index are typically defined under a stochastic ordering of biomarker distributions across groups, which can be restrictive and, when violated, may lead to misleading conclusions about a biomarker’s discriminatory ability. Moreover, even when a stochastic ordering exists, it may differ across biomarkers, complicating ranking in studies involving multiple biomarkers. To address these challenges, we propose the underlap coefficient (UNL), a summary index free from stochastic ordering assumptions and classification rules, to quantify a biomarker’s ability to distinguish between three (or more) disease groups. To account for patient heterogeneity, we develop the covariate-specific UNL. We further introduce Bayesian non-parametric estimators for both the unconditional and covariate-specific UNLs. An extensive simulation study demonstrates good performance of the proposed estimators. We illustrate the methodology by assessing how four Alzheimer’s disease biomarkers distinguish between individuals with normal cognition, mild impairment, and dementia, examining the impact of age and gender on discriminatory ability. Data used in the preparation of this paper were obtained from the Alzheimer’s Disease Neuroimaging Initiative database.

SiM Causal Inference · 发表于 2026-05-30,收录于 2026-06-12

Robust Estimation of Population Attributable Fractions in the Presence of Multiple Ordered Mediators

Han‐Chi Peng, Woojoo Lee, An‐Shun Tai

摘要

Population Attributable Fraction (PAF) is a key epidemiological measure used to quantify the contribution of risk factors to the overall disease burden. However, when an exposure affects an outcome through multiple ordered mediators, traditional PAF estimation methods face challenges in accurately identifying the impact of each mediating pathway. These challenges arise from mediator‐outcome relationships, interactions among mediators, and the presence of potential confounders. In this study, we propose new measures, termed mPAFs, to quantify the fraction of disease attributable to a specific mediation pathway. The proposed framework incorporates a multiply robust estimator that yields consistent estimates of mPAFs provided that at least two of the three types of models are correctly specified: the exposure models, mediator models, or outcome model. The asymptotic properties of the estimator are formally established, and a comprehensive simulation study is conducted to demonstrate its robustness against model misspecification. In a real‐data application using TCGA lung cancer cohorts, we analyzed the effect of smoking on mortality mediated through TTK and MAD2L1. In lung adenocarcinoma, the total PAF was estimated at 4.45%, with a direct effect of 1.82% and pathway‐specific contributions of −1.95% (TTK) and 0.68% (MAD2L1). In contrast, lung squamous cell carcinoma showed a higher total PAF of 10.43%, with most of the effect attributable to the direct pathway (10.22%), suggesting minimal mediation via the selected genes.

第 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 页