2026 年的期刊文章 · 第 34 页

共 1756 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2026-02-03 到 2026-01-27。

按期刊、按主题看 →

第 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 页

Biometrics Bayesian Methods Survival Analysis · 发表于 2026-02-03

Bayesian inference for Cox regression models using catalytic prior distributions

Weihao Li, Dongming Huang

摘要

The Cox proportional hazards model (Cox model) is a popular model for survival data analysis. When the sample size is small relative to the dimension of the model, the standard maximum partial likelihood inference is often problematic. In this work, we propose the Cox catalytic prior distribution for Bayesian inference on Cox models, which extends a general class of prior distributions originally designed to stabilize complex parametric models. The Cox catalytic prior is formulated as a weighted likelihood of the regression coefficients derived from synthetic data and a surrogate baseline hazard constant. This surrogate hazard can be either provided by the user or estimated from the data, and the synthetic data are generated from the predictive distribution of a fitted simpler model. For point estimation, we derive an approximation of the marginal posterior mode, which can be computed conveniently as a regularized log partial likelihood estimator. We prove that our prior distribution is proper and the resulting estimator is consistent under mild conditions. In simulation studies, our proposed method outperforms standard maximum partial likelihood inference and is on par with existing shrinkage methods. We further illustrate the application of our method to a real dataset.

Biometrika Causal Inference · 发表于 2026-02-03

Assumption-lean post-integrated inference with surrogate-control outcomes

Jin-Hong Du, Kathryn Roeder, Larry Wasserman

摘要

Summary: Data integration methods aim to extract low-dimensional embeddings from high-dimensional outcomes to remove unwanted variation, such as batch effects and unmeasured covariates, across heterogeneous datasets. However, multiple hypothesis testing after integration can be biased due to data-dependent processes. We introduce a robust post-integrated inference method that accounts for latent heterogeneity by leveraging control outcomes. Using causal interpretations, we derive nonparametric identifiability of direct effects via negative-control outcomes. By utilizing surrogate-control outcomes as an extension of negative-control outcomes, we develop semiparametric inference on projected direct-effect estimands, accounting for hidden mediators, confounders and moderators. These estimands remain statistically meaningful under model misspecification and in the presence of error-prone embeddings. We provide bias quantifications and finite-sample linear expansions with uniform concentration bounds. The proposed doubly robust estimators are consistent and efficient under minimal assumptions and potential misspecification, facilitating data-adaptive estimation using machine learning algorithms. We evaluate our approach with random forests through simulations and the analysis of single-cell CRISPR-perturbed datasets, which may contain potential unmeasured confounders.

JRSSB Other · 发表于 2026-02-03

ART: distribution-free and model-agnostic changepoint detection with finite-sample guarantees

Xiaolong Cui, Haoyu Geng, Guanghui Wang, Zhaojun Wang, Changliang Zou

摘要

We introduce ART, a distribution-free and model-agnostic framework for changepoint analysis with finite-sample guarantees. ART transforms independent observations into real-valued scores via a symmetric function; under the null hypothesis of no changepoint these scores are exchangeable. Ranking and aggregating the scores yields test statistics whose null distribution is known exactly from the permutation law of ranks, enabling exact finite-sample Type I error control without repeated refitting under permutations. ART extends naturally to a multi-scale setting: by locally ranking scores over a family of intervals and aggregating them, it supports multiple changepoint testing, localization with inference, and post-detection inference, while retaining distribution-free calibration. The approach is model-agnostic: it imposes minimal structural or distributional assumptions and accommodates diverse score constructions, including features learned by statistical or machine-learning models. Across simulations and real-data applications, ART delivers valid error control and competitive power across a range of models and distributions. These properties make ART a reliable and versatile tool for modern changepoint analysis.

Biometrics Nonparametric & Semiparametric · 发表于 2026-02-02

Multiple-index interaction models to accommodate exposure grouping in environmental mixtures

Myeonggyun Lee, Mengling Liu, Shanshan Zhao

摘要

An important goal of environmental health research is to assess risks posed by mixtures of environmental exposures. Studies in different fields often group exposures based on their shared biological features. However, such grouping information has not been widely utilized in population-based environmental mixtures analyses due to the lack of appropriate statistical tools. Inspired by data from the National Health and Nutrition Examination Survey (NHANES), we propose a semiparametric multiple-index interaction model (MIIM) to explore the impact of three groups of persistent organic pollutants (POPs) on leukocyte telomere length (LTL). MIIM effectively addresses the challenge of high dimensionality by summarizing exposures into group-level indices, while allowing for nonlinear effects and interactions among exposures through these group indices. This formulation provides interpretable insights into both overall group effects and between-group interactions on the outcome, and allows for identification of key contributors within each group. MIIM can be applied to different types of health outcomes, including continuous, binary, and survival outcomes. We conducted Monte Carlo simulation studies to evaluate the performance of MIIM under various scenarios with high-dimensional and correlated exposure mixtures and illustrated its application to the NHANES data. By bridging biological insights with population-based epidemiological data, MIIM serves as a translational tool to explore the effects of environmental mixtures on health outcomes.

AoS Other · 发表于 2026-02-01

Solving the Poisson equation using coupled Markov chains

Randal Douc, Pierre E. Jacob, Anthony Lee, Dootika Vats

摘要

This article shows how coupled Markov chains that meet exactly after a random number of iterations can be used to generate unbiased estimators of the solutions of the Poisson equation. Through this connection, we rederive known unbiased estimators of expectations with respect to the stationary distribution of a Markov chain and provide conditions for the finiteness of their moments. We further construct unbiased estimators of the asymptotic variance of Markov chain ergodic averages, and provide conditions for the finiteness of the estimators’ moments of any order. If their second moment is finite, the average of independent copies of such estimators converges to the asymptotic variance at the Monte Carlo rate, comparing favorably to known rates for batch means and spectral variance estimators. The results are illustrated with numerical experiments.

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

Semiparametric Bernstein–von Mises phenomenon via Isotonized Posterior in Wicksell’s problem

Francesco Gili, Geurt Jongbloed, Aad van der Vaart

摘要

In this paper, we propose a novel Bayesian approach for nonparametric estimation in Wicksell’s problem. This has important applications in astronomy for estimating the distribution of the positions of the stars in a galaxy given projected stellar positions and in materials science to determine the 3D microstructure of a material, using its 2D cross-sections. We deviate from the classical Bayesian nonparametric approach, which would place a Dirichlet Process (DP) prior on the distribution function of the unobservables, by directly placing a DP prior on the distribution function of the observables. Our method offers computational simplicity due to the conjugacy of the posterior and allows for asymptotically efficient estimation by projecting the posterior onto the L2 subspace of increasing, right-continuous functions. Indeed, the resulting Isotonized Inverse Posterior (IIP) satisfies a Bernstein–von Mises (BvM) phenomenon with minimax asymptotic variance g0(x)/2γ, where γ>1/2 reflects the degree of Hölder continuity of the true cdf at x. Since the IIP gives automatic uncertainty quantification, it eliminates the need to estimate γ. Our results provide the first semiparametric Bernstein–von Mises theorem for projection-based posteriors with a DP prior in inverse problems.

AoS Other · 发表于 2026-02-01

Scalable inference in functional linear regression with streaming data

Jinhan Xie, Enze Shi, Peijun Sang, Zuofeng Shang, Bei Jiang, Linglong Kong

摘要

Traditional static functional data analysis is facing new challenges due to streaming data, where data constantly flows in. A major challenge is that storing such an ever-increasing amount of data in memory is nearly infeasible. In addition, existing inferential tools in online learning are mainly developed for finite-dimensional problems, while inference methods for functional data are focused on the offline settings. In this paper, we focus on the online estimation of functional linear regression with a scalar response and a functional covariate. To tackle these issues in this setting, we develop a functional stochastic gradient descent algorithm and propose an online bootstrap resampling procedure that enables us to perform the local (and global) inference for the slope function in functional linear regression. In particular, the proposed estimation and inference procedures use only one pass over the data; thus they are easy to implement and suitable to the situation where data arrive in a streaming manner. Furthermore, we establish the convergence rate and the asymptotic distribution for the proposed slope function estimator. The proposed perturbed estimator from the bootstrap procedure is shown to enjoy the same theoretical properties, which provide the theoretical justification for our online inference tool. As far as we know, this is the first inference result on functional linear regression with streaming data. Numerical studies are conducted to demonstrate the finite-sample performance of our proposed procedure.

AoS Networks & Graphs · 发表于 2026-02-01

Pseudo-likelihood-based M-estimation of random graphs with dependent edges and parameter vectors of increasing dimension

Jonathan R. Stewart, Michael Schweinberger

摘要

An important question in statistical network analysis is how to estimate models of discrete and dependent network data with intractable likelihood functions, without sacrificing computational scalability and statistical guarantees. We demonstrate that scalable estimation of random graph models with dependent edges is possible, by establishing convergence rates of pseudo-likelihood-based M-estimators for discrete undirected graphical models with exponential parameterizations and parameter vectors of increasing dimension in single-observation scenarios. We highlight the impact of two complex phenomena on the convergence rate: phase transitions and model near-degeneracy. The main results have possible applications to discrete and dependent network, spatial, and temporal data. To showcase convergence rates, we introduce a novel class of generalized β-models with dependent edges and parameter vectors of increasing dimension, which leverage additional structure in the form of overlapping subpopulations to control dependence. We establish convergence rates of pseudo-likelihood-based M-estimators for generalized β-models in dense- and sparse-graph settings.

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

Pseudo-Labeling for kernel ridge regression under covariate shift

Kaizheng Wang

摘要

We develop and analyze a principled approach to kernel ridge regression under covariate shift. The goal is to learn a regression function with small mean squared error over a target distribution, based on unlabeled data from there and labeled data that may have a different feature distribution. We propose to split the labeled data into two subsets, and conduct kernel ridge regression on them separately to obtain a collection of candidate models and an imputation model. We use the latter to fill the missing labels and then select the best candidate accordingly. Our nonasymptotic excess risk bounds demonstrate that our estimator adapts effectively to both the structure of the target distribution and the covariate shift. This adaptation is quantified through a notion of effective sample size that reflects the value of labeled source data for the target regression task. Our estimator achieves the minimax optimal error rate up to a polylogarithmic factor, and we find that using pseudo-labels for model selection does not significantly hinder performance.

AoS Bayesian Methods Optimization & Learning Theory · 发表于 2026-02-01

Poisson empirical Bayes estimation: When does g-modeling beat f-modeling in theory (and in practice)?

Yandi Shen, Yihong Wu

摘要

Empirical Bayes (EB) is a popular framework for large-scale inference that aims to find data-driven estimators to compete with the Bayesian oracle that knows the true prior. Two principled approaches to EB estimation have emerged over the years: f-modeling, which constructs an approximate Bayes rule by estimating the marginal distribution of the data, and g-modeling, which estimates the prior from data and then applies the learned Bayes rule. For the Poisson model, the prototypical examples are the celebrated Robbins estimator and the nonparametric MLE (NPMLE), respectively. It has long been recognized in practice that the Robbins estimator, while being conceptually appealing and computationally simple, lacks robustness and can be easily derailed by “outliers” (data points that were rarely observed before), unlike the NPMLE which provides more stable and interpretable fit thanks to its Bayes form. On the other hand, not only do the existing theories shed little light on this phenomenon, but they all point to the opposite, as both methods have recently been shown optimal in terms of the regret (excess over the Bayes risk) for compactly supported and subexponential priors with exact logarithmic factors (Brown, Greenshtein and Ritov (2013) J. Amer. Statist. Assoc. 108 741–749; Polyanskiy and Wu (2021) arXiv:2008.08244). In this paper we provide a theoretical justification for the superiority of g-modeling over f-modeling for heavy-tailed data by considering priors with bounded pth moment, a class previously studied for the Gaussian model (Jiang and Zhang (2009) Ann. Statist. 37 1647–1684). For the Poisson model with sample size n, assuming p>1 (for otherwise triviality arises), we show that with mild regularization, any g-modeling method that is Hellinger rate-optimal in density estimation achieves a total regret Θ˜(n 32p+1), which is minimax optimal within logarithmic factors; in particular, the special case of NPMLE succeeds without regularization. In constrast, there exists an f-modeling estimator whose density estimation rate is optimal but whose EB regret is suboptimal by a polynomial factor. These results show that the proper Bayes form provides a “general recipe of success” for optimal EB estimation that applies to all g-modeling (but not f-modeling) methods. As by-products of our analysis, we also obtain: (a) the minimax Hellinger rate of estimating Poisson mixture over the moment class, (b) the characterization of the regret suboptimality of the Robbins estimator, (c) an extension to the compound setting.

AoS Other · 发表于 2026-02-01

Optimality of approximate message passing for spiked matrix models with rotationally invariant noise

Rishabh Dudeja, Songbin Liu, Junjie Ma

摘要

We study the problem of estimating a rank-one signal matrix from a noisy observed matrix corrupted by additive rotationally invariant noise. We develop a new class of approximate message passing algorithms for this problem and provide a simple and concise characterization of their dynamics in the high-dimensional limit. At each iteration, these algorithms leverage prior knowledge about the noise structure by applying a nonlinear matrix denoiser to the eigenvalues of the observed matrix, and utilize prior information regarding the signal structure by applying a nonlinear iterate denoiser to the previous iterates generated by the algorithm. We derive the optimal choices for both the matrix and iterate denoisers and demonstrate that the resulting algorithm achieves the lowest possible asymptotic estimation error among a broad class of iterative algorithms under a fixed iteration budget.

AoS Other · 发表于 2026-02-01

Optimal convex M-estimation via score matching

Oliver Y. Feng, Yu-Chun Kao, Min Xu, Richard J. Samworth

摘要

In the context of linear regression, we construct a data-driven convex loss function with respect to which empirical risk minimisation yields optimal asymptotic variance in the downstream estimation of the regression coefficients. At the population level, the negative derivative of the optimal convex loss is the best decreasing approximation of the derivative of the log-density of the noise distribution. This motivates a fitting process via a nonparametric extension of score matching, corresponding to a log-concave projection of the noise distribution with respect to the Fisher divergence. At the sample level, our semiparametric estimator is computationally efficient, and we prove that it attains the minimal asymptotic covariance among all convex M-estimators. As an example of a non-log-concave setting, the optimal convex loss function for Cauchy errors is Huber-like, and our procedure yields asymptotic efficiency greater than 0.87 relative to the maximum likelihood estimator of the regression coefficients that uses oracle knowledge of this error distribution. In this sense, we provide robustness and facilitate computation without sacrificing much statistical efficiency. Numerical experiments using our accompanying R package asm confirm the practical merits of our proposal.

AoS Other · 发表于 2026-02-01

Optimal and exact recovery on the general nonuniform Hypergraph Stochastic Block Model

Ioana Dumitriu, Hai-Xiao Wang

摘要

Consider the community detection problem in random hypergraphs under the nonuniform hypergraph stochastic block model (HSBM), where each hyperedge appears independently with some given probability depending only on the labels of its vertices. We establish, for the first time in the literature, a sharp threshold for exact recovery for the nonuniform, multiple-community case, subject to only minor constraints. One crucial point here is that, by aggregating information from all the uniform layers, we may obtain exact recovery, even in cases when this is impossible if each layer were considered alone. In addition, for the almost exact recovery regime, we prove a wide-ranging, information-theoretic lower bound on the number of misclassified vertices for any algorithm. The bound depends on a generalized Chernoff–Hellinger divergence involving model parameters. We provide two efficient algorithms (one for the minimal information case, another for the full information case) which successfully achieve exact recovery when above the threshold and attain the lowest possible mismatch ratio when the exact recovery is impossible. The theoretical analysis of our algorithms relies on the concentration and regularization of the adjacency matrix for nonuniform random hypergraphs, which could be of independent interest. We also address some open problems regarding parameter knowledge and estimation.

AoS Other · 发表于 2026-02-01

On the structural dimension of sliced inverse regression

Dongming Huang, Songtao Tian, Qian Lin

摘要

In this work, we address the longstanding puzzle that Sliced Inverse Regression (SIR) often performs poorly for sufficient dimension reduction when the structural dimension d (the dimension of the central space) exceeds 4. We first show that in the multiple index model Y=f(PX)+ϵ where X is a p-standard normal vector, ϵ is an independent noise, and P is a projection operator from Rp to Rd, if the link function f follows the law of a Gaussian process. Then with high probability, the dth eigenvalue λd of Cov[E(X|Y)] satisfies λd≤Ce−θd for some positive constants C and θ. We then focus on the low signal regime where λd can be arbitrarily small and not larger than d−8.1, and prove that the minimax risk of estimating the central space is lower bounded by dp nλd. Combining these two results, we provide a convincing explanation for the poor performance of SIR when d is large, a phenomenon that has perplexed researchers for nearly three decades. The technical tools developed here may be of independent interest for studying other sufficient dimension reduction methods.

AoS Machine Learning Networks & Graphs · 发表于 2026-02-01

Neural networks generalize on low complexity data

Sourav Chatterjee, Timothy Sudijono

摘要

We show that feedforward neural networks with ReLU activation generalize on low complexity data, suitably defined. Given i.i.d. data generated from a simple programming language, the minimum description length (MDL) feedforward neural network which interpolates the data generalizes with high probability. We define this simple programming language, along with a notion of description length of such networks. We provide several examples on basic computational tasks, such as checking primality of a natural number. For primality testing, our theorem shows the following and more. Suppose that we draw an i.i.d. sample of n numbers uniformly at random from 1 to N. For each number xi, let yi=1 if xi is a prime and 0 if it is not. Then the interpolating MDL network accurately answers, with probability 1−O((lnN)/n), whether a newly drawn number between 1 and N is a prime or not. Note that the network is not designed to detect primes; minimum description learning discovers a network which does so. Extensions to noisy data are also discussed, suggesting that MDL neural network interpolators can demonstrate tempered overfitting.

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

Near optimal sample complexity for matrix and tensor normal models via geodesic convexity

Cole Franks, Rafael Oliveira, Akshay Ramachandran, Michael Walter

摘要

The matrix normal model, that is, the family of Gaussian matrix-variate distributions whose covariance matrices are the Kronecker product of two lower-dimensional factors, is frequently used to model matrix-variate data. The tensor normal model generalizes this family to Kronecker products of three or more factors. We study the estimation of the Kronecker factors of the covariance matrix in the matrix and tensor normal models. For the above models, we show that the maximum likelihood estimator (MLE) achieves nearly optimal nonasymptotic sample complexity and nearly tight error rates in the Fisher–Rao and Thompson metrics. In contrast to prior work, our results do not rely on the factors being well conditioned or sparse, nor do we need to assume an accurate enough initial guess. For the matrix normal model, all our bounds are minimax optimal up to logarithmic factors, and for the tensor normal model our bounds for the largest factor and for overall covariance matrix are minimax optimal up to constant factors provided there are enough samples for any estimator to obtain constant Frobenius error. In the same regimes as our sample complexity bounds, we show that the flip-flop algorithm, a practical and widely used iterative procedure to compute the MLE, converges linearly with high probability. Our main technical insight is that, given enough samples, the negative log-likelihood function is strongly geodesically convex in the geometry on positive-definite matrices induced by the Fisher information metric. This strong convexity is determined by the expansion of certain random quantum channels.

AoS Other · 发表于 2026-02-01

Multivariate root-n-consistent smoothing parameter-free matching estimators and estimators of inverse density weighted expectations

Hajo Holzmann, Alexander Meister

摘要

Expected values weighted by the inverse of a multivariate density or, equivalently, Lebesgue integrals of regression functions with multivariate regressors occur in various areas of applications, including estimating average treatment effects, nonparametric estimators in random coefficient regression models or deconvolution estimators in Berkson errors-in-variables models. The frequently used nearest-neighbor and matching estimators suffer from bias problems in multiple dimensions. By using polynomial least squares fits on each cell of the Kth-order Voronoi tessellation for sufficiently large K, we develop novel modifications of nearest-neighbor and matching estimators, which again converge at the parametric n-rate under mild smoothness assumptions on the unknown regression function and without any smoothness conditions on the unknown density of the covariates. We stress that in contrast to competing methods for correcting for the bias of matching estimators, our estimators do not involve nonparametric function estimators and in particular do not rely on sample-size dependent smoothing parameters. We complement the upper bounds with appropriate lower bounds derived from information-theoretic arguments, which show that some smoothness of the regression function is indeed required to achieve the parametric rate. Simulations illustrate the practical feasibility of the proposed methods.

AoS Other · 发表于 2026-02-01

Information theoretic limits of robust sub-Gaussian mean estimation under star-shaped constraints

Akshay Prasadan, Matey Neykov

摘要

We obtain the minimax rate for a mean location model with a bounded star-shaped set K⊆Rn constraint on the mean, in an adversarially corrupted data setting with Gaussian noise. We assume an unknown fraction ϵ≤1/2−κ for some fixed κ∈(0,1/2] of N observations are arbitrarily corrupted. We obtain a minimax risk up to proportionality constants under the squared ℓ2 loss of max(η∗2,σ2ϵ2)∧d2 with η∗=sup{η≥0:Nη2 σ2≤logMKloc(η,c)}, where logMKloc(η,c) denotes the local entropy of the set K, d is the diameter of K, σ2 is the variance and c is some sufficiently large absolute constant. A variant of our algorithm achieves the same rate for settings with known or symmetric sub-Gaussian noise, with a smaller breakdown point, still of constant order. We further study the case of unknown sub-Gaussian noise and show that the rate is slightly slower: max(η∗2,σ2ϵ2log(1/ϵ))∧d2. We generalize our results to the case when K is star-shaped but unbounded.

AoS Other · 发表于 2026-02-01

Dualizing Le Cam’s method for functional estimation I: General theory

Yury Polyanskiy, Yihong Wu

摘要

Le Cam’s method (or the two-point method) is a commonly used tool for obtaining statistical lower bound and especially popular for functional estimation problems. This work aims to explain and give conditions for the tightness of Le Cam’s lower bound in functional estimation from the perspective of convex duality. Under a variety of settings, it is shown that the maximization problem that searches for the best two-point lower bound, upon dualizing, becomes a minimization problem minimizing an upper bound on the quadratic risk over a family of estimators. Since by the minimax theorem two problems have the same value, this value also characterizes (up to a universal factor) the optimal estimation rate. For estimating linear functionals of a distribution, our work strengthens prior results of Donoho–Liu (Ann. Statist. 19 (1991) 633–667) (for quadratic loss) by dropping the Hölderian assumption on the modulus of continuity. For exponential families, our results extend those of Juditsky–Nemirovski (Ann. Statist. 37 (2009) 2278–2300) by characterizing the minimax risk for the quadratic loss under weaker assumptions on the exponential family. We also provide an extension to the high-dimensional setting for estimating separable functionals. An application of our methodology to the area of “estimating the unseens” is provided in the companion paper (Polyanskiy and Wu (2023)), resolving the optimal rates (within logarithmic factors) of the distinct elements problem and Fisher’s species problem.

AoS Causal Inference Networks & Graphs · 发表于 2026-02-01

Confounder selection via iterative graph expansion

F. Richard Guo, Qingyuan Zhao

摘要

Confounder selection, namely choosing a set of covariates to control for confounding between a treatment and an outcome, is arguably the most important step in the design of an observational study. Previous methods, such as Pearl’s back-door criterion, typically require prespecifying a causal graph, which can often be difficult in practice. We propose an interactive procedure for confounder selection that does not require prespecifying the graph or the set of observed variables. This procedure iteratively expands the causal graph by finding what we call “primary adjustment sets” for a pair of possibly confounded variables. This can be viewed as inverting a sequence of marginalizations of the underlying causal graph. Structural information in the form of primary adjustment sets is elicited from the user, bit by bit, until either a set of covariates is found to control for confounding or it can be determined that no such set exists. Other information, such as the causal relations between confounders, is not required by the procedure. We show that if the user correctly specifies the primary adjustment sets in every step, our procedure is both sound and complete.

AoS High-Dimensional Meta-Analysis & Data Integration Nonparametric & Semiparametric · 发表于 2026-02-01

Communication-efficient and distributed-oracle estimation for high-dimensional quantile regression

Songshan Yang, Yifan Gu, Hanfang Yang, Xuming He

摘要

In this article, we present a novel communication-efficient estimator for distributed high-dimensional quantile regression with folded-concave penalties. An Iterative Multi-Step Algorithm (IMSA) is employed to tackle the nonconvex challenge of the objective function, taking into account both the statistical accuracy and the communication constraints. We demonstrate that the proposed IMSA estimators share similar properties with the global folded-concave penalized estimator. To establish the theoretical results, we introduce a new concept called the distributed-oracle estimator. We prove that the proposed estimator converges to the distributed-oracle estimator with high probability. Compared to the ℓ1-penalized method, the IMSA estimator possesses a faster rate of convergence and requires milder conditions to achieve support recovery. Furthermore, we extend our framework to facilitate distributed inference for the preconceived low-dimensional components within the high-dimensional model. We derive the limiting distribution of the corresponding test statistic under the null hypothesis and the local alternatives. In addition, a new feature-splitting algorithm is devised to accommodate the high-dimensional data within the distributed system. Extensive numerical studies demonstrate the effectiveness and validity of our proposed estimation and inference methods. A real example is also presented for illustration.

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

Change point estimation for a stochastic heat equation

Markus Reiß, Claudia Strauch, Lukas Trottner

摘要

We study a change point model based on a stochastic partial differential equation (SPDE) corresponding to the heat equation governed by the weighted Laplacian Δϑ=∇ϑ∇, where ϑ=ϑ(x) is a space dependent diffusivity. As a basic problem, the domain (0,1) is considered with a piecewise constant diffusivity with a jump at an unknown point τ. Based on local measurements of the solution in space with resolution δ over a finite time horizon, we construct a simultaneous M-estimator for the diffusivity values and the change point. The change point estimator converges with rate δ, while the diffusivity constants can be recovered with convergence rate δ3/2. Furthermore, when the diffusivity parameters are known and the jump height vanishes as the spatial resolution tends to zero, we derive a limit theorem for the change point estimator and identify the limiting distribution. For the mathematical analysis, a precise understanding of the SPDE with discontinuous ϑ, tight concentration bounds for quadratic functionals in the solution and a generalization of classical M-estimators are developed.

AoS Causal Inference · 发表于 2026-02-01

Berry–Esseen bounds for design-based causal inference with possibly diverging treatment levels and varying group sizes

Lei Shi, Peng Ding

摘要

Neyman (1923/1990) introduced the randomization model, which contains the notation of potential outcomes to define causal effects and a framework for large-sample inference based on the design of the experiment. However, the existing theory for this framework is far from complete, especially when the number of treatment levels diverges and the treatment group sizes vary. We provide a unified discussion of statistical inference under the randomization model with general treatment group sizes. We formulate the estimator in terms of a linear permutation statistic and use results based on Stein’s method to derive various Berry–Esseen bounds on the linear and quadratic functions of the estimator. These new Berry–Esseen bounds serve as the basis for design-based causal inference with possibly diverging treatment levels and a diverging number of causal parameters of interest. We also fill an important gap by proposing novel variance estimators for experiments with possibly many treatment levels without replications. Equipped with the newly developed results, design-based causal inference in general settings becomes more convenient with stronger theoretical guarantees.

AoS Machine Learning · 发表于 2026-02-01

Average partial effect estimation using double machine learning

Harvey Klyne, Rajen D. Shah

摘要

Single-parameter summaries of variable effects in regression settings are desirable for ease of interpretation. However, (partially) linear models, for example, which would deliver these, may fit poorly to the data. On the other hand, an interpretable summary of the contribution of a given predictor is provided by the so-called average partial effect—the average slope of the regression function with respect to the predictor of interest. Although one can construct a doubly robust procedure for estimating this quantity, it entails estimating the derivative of the conditional mean and also the conditional score of the predictor of interest given all others, tasks which can be very challenging in moderate dimensions: in particular, popular decision tree based regression methods cannot be used. In this work, we introduce an approach for estimating the average partial effect whose accuracy depends primarily on the estimation of certain regression functions, which may be performed by user-chosen machine learning methods that produce potentially nondifferentiable estimates. Our procedure involves resmoothing a given first-stage regression estimator to produce a differentiable version, and modelling the conditional distribution of the predictor of interest through a location–scale model. We show that with the latter assumption, surprisingly the overall error in estimating the conditional score is controlled by a sum of errors of estimating the conditional mean and conditional standard deviation, and the estimation error in a much more tractable univariate score estimation problem. Our theory makes use of a new result on the sub-Gaussianity of Lipschitz score functions that may be of independent interest. We demonstrate the attractive numerical performance of our approach in a variety of settings including ones with misspecification. An R package drape implementing the methodology is available on CRAN.

AoS Other · 发表于 2026-02-01

A computational transition for detecting correlated stochastic block models by low-degree polynomials

Guanyi Chen, Jian Ding, Shuyang Gong, Zhangsong Li

摘要

Detection of correlation in a pair of random graphs is a fundamental statistical and computational problem that has been extensively studied in recent years. In this work, we consider a pair of correlated (sparse) stochastic block models S(n,λn;k,ϵ;s) that are subsampled from a common parent stochastic block model S(n,λn;k,ϵ) with k=O(1) symmetric communities, average degree λ=O(1), divergence parameter ϵ, and subsampling probability s. For the detection problem of distinguishing this model from a pair of independent Erdős–Rényi graphs with the same edge density G(n,λsn), we focus on tests based on low-degree polynomials of the entries of the adjacency matrices, and we determine the threshold that separates the easy and hard regimes. More precisely, we show that this class of tests can distinguish these two models if and only if s>min{α,1λϵ2}, where α≈0.338 is the Otter’s constant and 1λϵ2 is the Kesten–Stigum threshold. Combining a reduction argument in (Li (2025)), our hardness result also implies low-degree hardness for partial recovery and detection (to independent block models) when s<min{α,1λϵ2}. Finally, our proof of low-degree hardness is based on a conditional variant of the low-degree likelihood calculation. *(abstract via OpenAlex)*

SiM Causal Inference · 发表于 2026-01-31,收录于 2026-10-20

Comparison of Methods for Sensitivity Analysis of Heterogeneous Treatment Effects in Observational Studies and Application to Alzheimer's Disease and Cognitive Decline

Jingqi Duan, Corinne D Engelman, Qiongshi Lu, Hyunseung Kang

摘要

In Alzheimer's disease (AD) research, many observational studies have shown that the effect of sleeping quality, a modifiable risk factor, on cognitive decline is heterogeneous, where some adults experience faster rates of cognitive decline compared to others. However, these effects are likely confounded by unmeasured confounders, and the sensitivity of these effects to unmeasured confounders may be heterogeneous, where one subgroup's treatment effect is more sensitive than that of another subgroup. Unfortunately, compared to the overall treatment effect, there are limited investigations about the sensitivity of heterogeneous treatment effects to unmeasured confounding. The paper presents and compares methods for sensitivity analysis of heterogeneous effects in observational studies based on Rosenbaum's model for sensitivity analysis. We show that, unlike the sensitivity analysis of the overall treatment effect, the sensitivity of heterogeneous treatment effects depends on the variation in the effect sizes across subgroups and the correction for multiple testing. The data analysis further supports our findings where the overall effect of sleep disturbances on cognitive decline is significant ( p $$ p $$ -value = 5 . 55 × 1 0 - 5 $$ 5.55\times 1{0}^{-5} $$ ). Also, the effect is more severe among males ( p $$ p $$ -value = 2 . 00 × 1 0 - 4 $$ 2.00\times 1{0}^{-4} $$ ) and insensitive to a moderate degree of unmeasured confounding. Finally, we offer an easy-to-use R software to carry out the sensitivity analyses for heterogeneous treatment effects.

SiM Bayesian Methods Survival Analysis Causal Inference · 发表于 2026-01-30,收录于 2026-10-20

Strategy to Control Biases in Prior Event Rate Ratio Method, With Application to Palliative Care in Patients With Advanced Cancer

Xiangmei Ma, Grace Meijuan Yang, Qingyuan Zhuang, Yin Bun Cheung

摘要

Prior event rate ratio (PERR) is a method shown to perform well in mitigating confounding and is gaining popularity in real-world evidence research. However, it depends on several model assumptions. We propose an analytic strategy to correct biases arising from violation of two model assumptions, namely, population homogeneity and event-independent treatment. We propose a reformulation of PERR estimation by embedding a treatment-by-period interaction term in the Andersen-Gill model for recurrent event data, which is robust to bias arising from unobserved heterogeneity. Based on this model, we propose a set of methods to examine the presence of event-dependent treatment and to correct the resultant bias. We evaluate the proposed methods by simulation and apply it to a de-identified dataset on palliative care and emergency department visits in patients with advanced cancer. Simulation results showed that the proposed method could mitigate the two sources of bias in PERR. In the palliative care study, analysis by the Cox model showed that patients who had started receiving palliative care had higher incidence of emergency department visits than their match controls (hazard ratio 3.31; 95% confidence interval 2.78-3.94). Using PERR without the proposed bias control strategy indicated a 19% reduction of the incidence (0.81; 0.64-1.02). However, there was evidence of event-dependent treatment. The proposed correction method showed no effect of palliative care on ED visits (1.00; 0.79-1.26). In conclusion, the proposed analytic strategy can control two sources of biases in the PERR approach. It enriches the armamentarium for real-world evidence research.

JRSSB Causal Inference 讨论 / 评论 · 发表于 2026-01-30,收录于 2026-07-24

Maozai Tian, Shuo Liu, and Tan Meng’s contribution to the Discussion of ‘Augmented balancing weights as linear regression’ by Bruns-Smith et al

Not available

摘要

Maozai Tian and others Supriya Tiwari and Pallavi Basu’s contribution to the Discussion of ‘Augmented balancing weights as linear regression’ by Bruns-Smith et al. Supriya Tiwari and Pallavi Basu Jiangfeng Wang, Rong Jiang, Keming Yu’s contribution to the Discussion of ‘Augmented balancing weights as linear regression’ by Bruns-Smith et al. Jiangfeng Wang and others Authors’ reply to the Discussion of ‘Augmented balancing weights as linear regression’ by Bruns-Smith et al.

SiM Causal Inference · 发表于 2026-01-30,收录于 2026-10-20

Causal Rule Ensemble Approach for Multi-Arm Data

Ke Wan, Kensuke Tanioka, Toshio Shimokawa

摘要

The estimation of the heterogeneous treatment effect (HTE) is critical in medical research. It provides insights into how treatment effects vary among individuals, which can provide statistical evidence for precision medicine. While most existing methods focus on binary treatment situations, real-world applications often involve multiple interventions. However, current HTE estimation methods are designed primarily for binary comparisons and often rely on black-box models, which limits their applicability and interpretability in multi-arm settings. To address these challenges, we propose an interpretable machine learning framework for HTE estimation in multi-arm trials. Our method employs a rule-based ensemble approach consisting of rule generation, rule ensembling, and HTE estimation, ensuring both predictive accuracy and interpretability. Through extensive simulation studies and real data applications, the performance of our method was evaluated against that of state-of-the-art multi-arm HTE estimation approaches. The results indicate that our approach achieves lower bias and higher estimation accuracy than existing methods. Furthermore, the interpretability of our framework allows clearer insights into how covariates influence treatment effects, facilitating clinical decision-making. By bridging the gap between accuracy and interpretability, our study contributes a valuable tool for multi-arm HTE estimation, supporting precision medicine.

SMMR Survival Analysis · 发表于 2026-01-30

A non-proportional hazards cure model with an application to gastric cancer data analysis

N Balakrishnan, M Mar Fenoy, M Carmen Pardo

摘要

In many practical situations, some subjects may never experience the event of interest in their lifetime. These subjects are referred to as the cured or non-susceptible subjects. In the context of chronic disease treatment, this is referred to as a cure fraction. In this work, we extend the generalized time-dependent logistic (GTDL) model proposed by MacKenzie (1996) to a flexible family of models which accommodates not only non-proportional hazards, but also long-term survivors. Inferential methods are then developed for the proposed model and a Monte Carlo simulation study is also carried out to evaluate the performance of the model as well as the inferential method developed here. A real data example on gastric cancer is then used to illustrate the usefulness of the proposed model.

SMMR Survival Analysis High-Dimensional Missing Data & Measurement Error · 发表于 2026-01-29

Statistical methods for clustered competing risk data when the event types are only available in a training dataset

Yujie Wu, Ce Yang, Molin Wang

摘要

We develop methods to analyze clustered competing risks data when the event types are only available in a training dataset and are missing in the main study. We propose to estimate the exposure effects through the cause-specific proportional hazards frailty model where random effects are introduced into the model to account for the within-cluster correlation. We propose a weighted penalized partial likelihood method where the weights represent the probabilities of the occurrence of events, and the weights can be obtained by fitting a classification model for the event types on the training dataset. Alternatively, we propose an imputation approach where the missing event types are imputed based on the predictions from the classification model. We derive the analytical variances, and evaluate the finite sample properties of our methods in an extensive simulation study. As an illustrative example, we apply our methods to estimate the associations between tinnitus and metabolic, sensory and metabolic+sensory hearing loss in the Conservation of Hearing Study Audiology Assessment Arm.

SMMR Causal Inference Nonparametric & Semiparametric · 发表于 2026-01-29

Parametric and nonparametric propensity score weighting analysis with subgroup covariate balance

Yan Li, Yong-Fang Kuo, Liang Li

摘要

Estimating the causal treatment effects by subgroups is important in observational studies when the treatment effect heterogeneity is present. Existing propensity score methods rely on a correctly specified propensity score model. Model misspecification results in biased treatment effect estimation and covariate imbalance. We proposed a method for the propensity score analysis with controlled subgroup balance (G-SBPS) to achieve covariate mean balance in all subgroups. We further incorporated nonparametric kernel regression for the propensity scores and developed a kernelized G-SBPS (kG-SBPS) to improve the subgroup mean balance of covariate transformations in a rich functional class. This extension increased robustness to propensity score model misspecification. Extensive numerical studies showed that G-SBPS and kG-SBPS improve both subgroup covariate balance and subgroup treatment effect estimation, compared to existing approaches. For illustration, we applied G-SBPS and kG-SBPS to a dataset on right heart catheterization to estimate the subgroup average treatment effects on the hospital length of stay and a dataset on diabetes self-management training to estimate the subgroup average treatment effects for the treated on the hospitalization rate.

SiM Econometrics & Economics Meta-Analysis & Data Integration Networks & Graphs · 发表于 2026-01-29,收录于 2026-10-20

Estimating Risk Differences Using Large Healthcare Data Networks for Medical Product Post-Market Safety Outcomes in a Distributed Data Setting and Allowing for Active Post-Market Surveillance

Andrea J Cook, Robert D Wellman, Tracey Marsh, Ram C Tiwari, Michael D Nguyen, Estelle Russek-Cohen, Yuexiang Peng, Jennifer C Nelson

摘要

Risk differences allow decision makers to easily estimate the excess safety risk associated with a medical product relative to the potential benefits. However, in post-market observational surveillance studies that actively monitor (e.g., sequentially over time) for safety risk of new medical products, available methods target a relative measure (e.g., odds ratio and relative risk), which can be especially unstable in the rare event setting. These studies are typically conducted within distributed healthcare networks (e.g., Food and Drug Administration [FDA] Sentinel and Centers for Disease Control [CDC] Vaccine Safety Datalink) with patient-level data protected behind firewalls, but sharing of aggregate, deidentified data for centralized analyses. We propose an inverse probability of treatment weighting (IPTW) method that uses site-specific propensity scores to estimate site-specific risk differences that are combined to create an overall stratified risk difference estimate. This method is tailored to the rare event setting and requires minimal data sharing. The stratified IPTW approach is then extended to the active post-market surveillance setting by incorporating group sequential monitoring boundaries using a novel permutation approach. A simulation study is conducted to evaluate the performance of the new methods relative to two centralized analysis approaches, and the methods are applied to a safety surveillance study comparing the risk of febrile seizure between two vaccines using FDA Sentinel Data from three healthcare organizations.

SMMR Survival Analysis · 发表于 2026-01-29

Discrimination performance in illness-death models with interval-censored disease data

Marta Spreafico, Anja J Rueten-Budde, Hein Putter, Marta Fiocco

摘要

In clinical studies, the illness-death model is often used to describe disease progression. A subject starts disease-free, may develop the disease and then die, or die directly. In clinical practice, disease can only be diagnosed at pre-specified follow-up visits, so the exact time of disease onset is often unknown, resulting in interval-censored data. This study examines the impact of ignoring this interval-censored nature of disease data on the discrimination performance of illness-death models, focusing on the time-specific area under the receiver operating characteristic curve in both incident/dynamic and cumulative/dynamic definitions. A simulation study with data simulated from Weibull transition hazards and disease state censored at regular intervals is conducted. Estimates are derived using different methods: the Cox model with a time-dependent binary disease marker, which ignores interval-censoring, and the illness-death model for interval-censored data estimated with three implementations—the piecewise-constant model from the msm package, the Weibull and M-spline models from the SmoothHazard package. These methods are also applied to a dataset of 2232 patients with high-grade soft tissue sarcoma, where the interval-censored disease state is the post-operative development of distant metastases. The results suggest that, in the presence of interval-censored disease times, it is important to account for interval-censoring not only when estimating the parameters of the model but also when evaluating the discrimination performance of the disease.

Biometrics Clinical Trials Bayesian Methods Causal Inference · 发表于 2026-01-29

Bayesian randomized basket trial design: a case study from the ultra-rare invasive mold infections

Yunhe Liu, Satrajit Roychoudhury, Wei Wei

摘要

Invasive mold infections (IMIs) are rare but life-threatening. Regulatory approval for new antifungal drugs requires a well-powered, randomized noninferiority trial, which is nearly infeasible due to the rarity of IMIs. Additionally, heterogeneity among mold types complicates study design and treatment effect interpretation when a study includes patients infected by different types of pathogens. Despite the success of single-arm oncology basket trials in evaluating treatment effect in multiple disease types, statistical methods for randomized basket trials in nononcologic settings remain underdeveloped. We propose a robust borrowing strategy to enhance the efficiency of randomized basket trials for IMIs by (i) borrowing treatment effects across mold types while accounting for heterogeneity and (ii) augmenting control arms using external data. The proposed approach increases the efficiency and precision of the treatment effect estimates for various molds. It also increases the ethical appeal by reducing the number of patients required for the control arm. Using simulation and real-life examples, we demonstrated the proposed approach can significantly increase statistical power and precision while maintaining the family-wise type I error rate at an acceptable level. Our approach offers a substantial improvement over the current practice of pooling different molds together for inference and is applicable to rare disease trials facing similar accrual and ethical challenges.

SMMR Longitudinal Data Bayesian Methods High-Dimensional · 发表于 2026-01-29

Bayesian feature selection in joint models with application to a cardiovascular disease cohort study

Mirajul Islam, Michael J Daniels, Zeynab Aghabazaz, Juned Siddique

摘要

Cardiovascular disease (CVD) cohorts collect data longitudinally to study the association between CVD risk factors and event times. An important area of scientific research is to better understand what features of CVD risk factor trajectories are associated with CVD. We develop methods for feature selection in joint models where feature selection is viewed as a bi-level variable selection problem with multiple features nested within multiple longitudinal risk factors. We modify a previously proposed Bayesian sparse group selection (BSGS) prior, which has not been implemented in joint models until now, to better represent prior beliefs when selecting features both at the group level (longitudinal risk factor) and within group (features of a longitudinal risk factor). One of the advantages of our method over the BSGS method is its ability to account for correlation among the features within a risk factor. As a result, it selects important features similarly, but excludes unimportant features within risk factors more efficiently than the BSGS prior. We evaluate our prior via simulations and apply our method to data from the Atherosclerosis Risk in Communities (ARIC) study, a population-based, prospective cohort study consisting of over 15,000 men and women aged 45–64 at baseline who were measured six additional times. We evaluate which CVD risk factors and which characteristics of their trajectories (features) are associated with death from CVD. We find that systolic and diastolic blood pressure, glucose, and total cholesterol are important risk factors with different important features associated with CVD death in both men and women.

SMMR Clinical Trials · 发表于 2026-01-28

A historical note: Rediscovering an unpublished response to Korn and Freidlin (2011)

Hongjian Zhu, William F Rosenberger, Feifang Hu, Sofia Villar

摘要

Despite extensive research, the use of response-adaptive randomization (RAR) in clinical trials has remained controversial. Korn and Freidlin’s 2011 article reignited this debate back then, prompting numerous responses, including one by Zhu, Rosenberger, and Hu that remained unpublished until now. This article features the original response by Zhu, Rosenberger, and Hu, providing a valuable opportunity to revisit the original arguments, examine subsequent developments in RAR methodology, and offer a more complete historical perspective on this enduring debate. The piece also includes a concluding section by one of the special issue’s co-editor that explores the nuances and complexities of RAR implementation in the context of contemporary clinical trial design.

SiM Causal Inference Clinical Trials Machine Learning · 发表于 2026-01-27,收录于 2026-09-03

Modern Causal Inference Approaches to Improve Power for Subgroup Analysis in Randomized Controlled Trials

D'Alessandro 等(完整作者名单未能确认)

摘要

Randomized controlled trials (RCTs) often include subgroup analyses to assess whether treatment effects vary across prespecified patient populations. However, these analyses frequently suffer from small sample sizes, which limit the power to detect heterogeneous effects. Power can be improved by leveraging predictors of the outcome-that is, through covariate adjustment-as well as by borrowing external data from similar RCTs or observational studies. The benefits of covariate adjustment may be limited when the trial sample is small. Borrowing external data can increase the effective sample size and improve power, but it introduces two key challenges: (i) integrating data across sources can lead to model misspecification, and (ii) practical violations of the positivity assumption-where the probability of receiving the target treatment is near zero for some covariate profiles in the external data-can lead to extreme inverse-probability weights and unstable inferences, ultimately negating potential power gains. To account for these shortcomings, we present an approach to improving power in preplanned subgroup analyses of small RCTs that leverages both baseline predictors and external data. We propose de-biased estimators that accommodate parametric, machine learning (ML), and nonparametric Bayesian methods. To address practical positivity violations (PPVs), we introduce three estimators: A covariate-balancing approach, an automated de-biased machine learning (DML) estimator, and a calibrated-DML estimator. We show improved power in various simulations and offer practical recommendations for the application of the proposed methods. Finally, we apply them to evaluate the effectiveness of citalopram for negative symptoms in first-episode schizophrenia (FES) patients across subgroups defined by duration of untreated psychosis (DUP), using data from two small RCTs.

Biometrika Other · 发表于 2026-01-27

Generalized Fréchet means with random minimizing domains and its strong consistency

Jaesung Park, Sungkyu Jung

摘要

Summary: This paper introduces a novel extension of Fréchet means, referred to as generalized Fréchet means, as a comprehensive framework for describing the characteristics of random elements. The generalized Fréchet mean is defined as the minimizer of a cost function, and the framework encompasses various extensions of Fréchet means that have appeared in the literature. The most distinctive feature of the proposed framework is that it allows the domain of minimization for the empirical generalized Fréchet means to be random and different from that of its population counterpart. This flexibility broadens the applicability of the Fréchet mean framework to various statistical scenarios, including sequential dimension reduction for non-Euclidean data. We establish a strong consistency theorem for generalized Fréchet means and demonstrate the utility of the proposed framework by verifying the consistency of principal geodesic analysis on the hypersphere.

Biometrika Causal Inference · 发表于 2026-01-27

Calibrated sensitivity models

A McClean, Z Branson, E H Kennedy

摘要

Summary: In causal inference, sensitivity models are used to assess how unmeasured confounders could alter causal analyses, but the sensitivity parameter (which quantifies the degree of unmeasured confounding) is often difficult to interpret. For this reason, researchers sometimes compare the sensitivity parameter to an estimate of measured confounding, a process known as calibration or benchmarking. However, calibrated estimates are not always interpreted correctly, and uncertainty in the estimate of measured confounding is rarely accounted for. To address these limitations, we propose calibrated sensitivity models which directly bound the degree of unmeasured confounding by a multiple of measured confounding. We develop a clear framework for interpreting calibrated sensitivity models and derive statistical methods for accounting for uncertainty due to estimating measured confounding. Incorporating this uncertainty shows that causal analyses can be less or more robust to unmeasured confounding than suggested by standard approaches. We develop efficient estimators and inferential methods for bounds on the average treatment effect with three calibrated sensitivity models, establishing parametric efficiency and asymptotic normality under doubly robust-style nonparametric conditions. We illustrate our methods with an analysis of the effect of mothers’ smoking on infant birthweight.

第 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 页