研究园简易版 · 经典书籍 · 期刊文章 · 有原文 · 完整版(可多选筛选、搜索) · 首页
2025 年的期刊文章 · 第 12 页
共 1491 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2025-08-05 到 2025-07-24。
按期刊、按主题看 →
JASA Testing & Uncertainty Nonparametric & Semiparametric · 发表于 2025-08-05
Haihan Yu, Mark S. Kaiser, Daniel J. Nordman
摘要
The spectral density function can play a key role in time series analysis, where nonparametric interval estimation of the spectral density is a fundamental issue. However, the prevailing pointwise interval methods for spectral densities, including chi-square approximation and frequency domain bootstrap (FDB), can be misleading in practice, perhaps more so than appreciated, as confidence intervals often exhibit low coverage accuracy as well as high sensitivity to tuning parameters. To provide a practical alternative, we propose a new hybrid method that combines the strengths of empirical likelihood (EL) and FDB. The method involves developing an EL statistic for spectral density inference along with a corresponding bootstrap approximation under time dependence, where we allow for general time processes as well as for two different types of kernel smoothing found in application (so-called A- or K-windows). Such windows require differing theories and implementations in practice. As an advantage, the FDB-EL procedure is formally valid under mild conditions for application to a broad range of processes, including both linear and nonlinear time series. Simulation studies demonstrate that FDB-EL-based confidence intervals are effective compared to other methods, as intervals maintain good coverage accuracy while being less sensitive to bandwidth parameters. The confidence interval procedure is illustrated with an application to studying the wind spectrum. Extension to simultaneous confidence intervals has also been discussed. *(abstract via OpenAlex)*
JASA Bayesian Methods Causal Inference · 发表于 2025-08-05
Zhaoyang Liu, Tingxuan Han, Donald B. Rubin, Ke Deng
摘要
Rerandomization is a powerful tool for experiment-based causal inference because it can better balance covariates than classic randomized designs, thereby leading to more accurate causal effect estimation. However, basic rerandomization and some of its extensions do not prioritize covariates that believed to be strongly associated with potential outcomes. To address this limitation, and thereby create more efficient rerandomization procedures, the quantification of covariate heterogeneity is appealing. We propose a Bayesian criterion for rerandomization that addresses this issue. Both theoretical analyses and numerical studies suggest that rerandomization procedures using Bayesian criterion can outperform existing procedures for balancing covariates. *(abstract via OpenAlex)*
Biometrics Longitudinal Data Nonparametric & Semiparametric Causal Inference · 发表于 2025-08-04
Xuan Wang, Jie Zhou, Layla Parast, Tom Greene
摘要
In clinical trials where long follow-up is required to measure the primary outcome of interest, there is substantial interest in using an accepted surrogate outcome that can be measured earlier in time or with less cost to estimate a treatment effect. For example, in clinical trials of chronic kidney disease, the effect of a treatment is often demonstrated on a longitudinal surrogate, the change of the longitudinal outcome (glomerular filtration rate, GFR) per year or GFR slope. However, estimating the effect of a treatment on the GFR slope is complicated by the fact that GFR measurement can be terminated by the occurrence of a terminal event, such as death or kidney failure. Thus, to estimate this effect, one must consider both the longitudinal GFR trajectory and the terminal event process. In this paper, we build a semiparametric framework to jointly model the longitudinal outcome and the terminal event, where the model for the longitudinal outcome is semiparametric, the relationship between the longitudinal outcome and the terminal event is nonparametric, and the terminal event is modeled via a semiparametric Cox model. The proposed semiparametric joint model is flexible and can be easily extended to include a nonlinear trajectory of the longitudinal outcome. An estimating equation based method is proposed to estimate the treatment effect on the longitudinal surrogate outcome (eg, GFR slope). Theoretical properties of the proposed estimators are derived, and finite sample performance is evaluated through simulation studies. We illustrate the proposed method using data from the Reduction of Endpoints in NIDDM with the Angiotensin II Antagonist Losartan (RENAAL) trial to examine the effect of Losartan on GFR slope.
Biometrics Other · 发表于 2025-08-04
Malka Gorfine, David M Zucker, Shoval Shoham
摘要
Many countries have established population-based biobanks, which are being used increasingly in epidemiological and clinical research. These biobanks offer opportunities for large-scale studies addressing questions beyond the scope of traditional clinical trials or cohort studies. However, using biobank data poses new challenges. Typically, biobank data are collected from a study cohort recruited over a defined calendar period, with subjects entering the study at various ages falling between $c_L$ and $c_U$. This work focuses on biobank data with individuals reporting disease-onset age upon recruitment, termed prevalent data, along with individuals initially recruited as healthy, and their disease onset observed during the follow-up period. We propose a novel cumulative incidence function (CIF) estimator that efficiently incorporates prevalent cases, in contrast to existing methods, providing two advantages: (1) increased efficiency and (2) CIF estimation for ages before the lower limit, $c_L$.
AoS High-Dimensional · 发表于 2025-08-01
Alden Green, Elad Romanov
摘要
We study principal components regression (PCR) in an asymptotic high-dimensional regression setting, where the number of data points is proportional to the dimension. We derive exact limiting formulas for the estimation and prediction risks, which depend in a complicated manner on the eigenvalues of the population covariance, the alignment between the population PCs and the true signal and the number of selected PCs. A key challenge in the high-dimensional setting stems from the fact that the sample covariance is an inconsistent estimate of its population counterpart, so that sample PCs may fail to fully capture potential latent low-dimensional structure in the data. We demonstrate this point through several case studies, including that of a spiked covariance model. To calculate the asymptotic prediction risk, we leverage tools from random matrix theory, which to our knowledge have not seen much use to date in the statistics literature: multiresolvent traces and their associated eigenvector overlap measures.
AoS Bayesian Methods · 发表于 2025-08-01
Qian Qin, Nianqiao Ju, Guanyang Wang
摘要
Hybrid Gibbs samplers represent a prominent class of approximated Gibbs algorithms that utilize Markov chains to approximate conditional distributions, with the Metropolis-within-Gibbs algorithm standing out as a well-known example. Despite their widespread use in both statistical and non-statistical applications, little is known about their convergence properties. This article introduces novel methods for establishing bounds on the convergence rates of certain reversible hybrid Gibbs samplers. In particular, we examine the convergence characteristics of hybrid random-scan Gibbs algorithms. Our analysis reveals that the absolute spectral gap of a hybrid Gibbs chain can be bounded based on the absolute spectral gap of the exact Gibbs chain and the absolute spectral gaps of the Markov chains employed for conditional distribution approximations. We also provide a convergence bound of similar flavors for hybrid data augmentation algorithms, extending existing works on the topic. The general bounds are applied to three examples: a random-scan Metropolis-within-Gibbs sampler, random-scan Gibbs samplers with block updates and a hybrid slice sampler.
AoS Nonparametric & Semiparametric Longitudinal Data Networks & Graphs · 发表于 2025-08-01
Yinqiu He, Jiajin Sun, Yuang Tian, Zhiliang Ying, Yang Feng
摘要
We introduce a semiparametric latent space model for analyzing longitudinal network data. The model consists of a static latent space component and a time-varying node-specific baseline component. We develop a semiparametric efficient score equation for the latent space parameter by adjusting for the baseline nuisance component. Estimation is accomplished through a one-step update estimator and an appropriately penalized maximum likelihood estimator. We derive oracle error bounds for the two estimators and address identifiability concerns from a quotient manifold perspective. Our approach is demonstrated using the New York Citi Bike Dataset.
AoS Meta-Analysis & Data Integration · 发表于 2025-08-01
Jianqing Fan, Cheng Gao, Jason M. Klusowski
摘要
This paper addresses challenges in robust transfer learning stemming from ambiguity in Bayes classifiers and weak transferable signals between the target and source distributions. We introduce a novel quantity called the “ambiguity level” that measures the discrepancy between the target and source regression functions, propose a simple transfer learning procedure, and establish a general theorem that shows how this new quantity is related to the transferability of learning in terms of risk improvements. Our proposed “Transfer Around Boundary” (TAB) method, with a threshold that balances the performance contributions of the target and source data, is shown to be both efficient and robust, improving classification while avoiding negative transfer. Moreover, we demonstrate the effectiveness of the TAB model on nonparametric classification and logistic regression tasks, achieving upper bounds which are optimal up to logarithmic factors. Simulation studies lend further support to the effectiveness of TAB. We also provide simple approaches to bound the excess misclassification error without the need for specialized knowledge in transfer learning.
AoS Optimization & Learning Theory Machine Learning Causal Inference · 发表于 2025-08-01
Rui Miao, Babak Shahbaba, Annie Qu
摘要
Offline reinforcement learning (RL) aims to find optimal policies in dynamic environments in order to maximize the expected total rewards by leveraging pre-collected data. Learning from heterogeneous data is one of the fundamental challenges in offline RL. Traditional methods focus on learning an optimal policy for all individuals with pre-collected data from a single episode or homogeneous batch episodes, and thus may result in a suboptimal policy for a heterogeneous population. In this paper, we propose an individualized offline policy optimization framework for heterogeneous time-stationary Markov decision processes (MDPs). The proposed heterogeneous model with individual latent variables enables us to efficiently estimate the individual Q-functions, and our Penalized Pessimistic Personalized Policy Learning (P4L) algorithm guarantees a fast rate on the average regret under a weak partial coverage assumption on behavior policies. In addition, our simulation studies and a real data application demonstrate the superior numerical performance of the proposed method compared with existing methods.
AoS Causal Inference · 发表于 2025-08-01
Ying Jin, Zhimei Ren, Zhuoran Yang, Zhaoran Wang
摘要
This paper studies offline policy learning, which aims at utilizing observations collected a priori (from either fixed or adaptively evolving behavior policies) to learn an optimal individualized decision rule that achieves the best overall outcomes for a given population. Existing policy learning methods rely on a uniform overlap assumption, that is, the propensities of exploring all actions for all individual characteristics must be lower bounded; the performance of the existing methods thus depends on the worst-case propensity in the offline data set. As one has no control over the data collection process, this assumption can be unrealistic in many situations, especially when the behavior policies are allowed to evolve over time with diminishing propensities. In this paper, we propose Pessimistic Policy Learning (PPL), a new algorithm that optimizes lower confidence bounds (LCBs)—instead of point estimates—of the policy values. The LCBs are constructed using knowledge of the behavior policies for collecting the offline data. Without assuming any uniform overlap condition, we establish a data-dependent upper bound for the suboptimality of our algorithm, which only depends on (i) the overlap for the optimal policy, and (ii) the complexity of the policy class we optimize over. As an implication, for adaptively collected data, we ensure efficient policy learning as long as the propensities for optimal actions are lower bounded over time, while those for suboptimal ones are allowed to diminish arbitrarily fast. In our theoretical analysis, we develop a new self-normalized type concentration inequality for inverse-propensity-weighting estimators, generalizing the well-known empirical Bernstein’s inequality to unbounded and non-i.i.d. data. We complement our theory with an efficient optimization algorithm via Majorization–Minimization and policy tree search, as well as extensive simulation studies and real-world applications that demonstrate the efficacy of PPL.
AoS Latent Variables & Mixtures · 发表于 2025-08-01
Xin Bing, Xin He, Dian Jin, Yuqian Zhang
摘要
Vintage factor analysis is one important type of factor analysis that aims to first find a low-dimensional representation of the original data, and then to seek a rotation such that the rotated low-dimensional representation is scientifically meaningful. The most widely used vintage factor analysis is the Principal Component Analysis (PCA) followed by the varimax rotation. Despite its popularity, little theoretical guarantee can be provided to date mainly because varimax rotation requires to solve a nonconvex optimization over the set of orthogonal matrices. In this paper, we propose a deflation varimax procedure that solves each row of an orthogonal matrix sequentially. In addition to its net computational gain and flexibility, we are able to fully establish theoretical guarantees for the proposed procedure in a broader context. Adopting this new deflation varimax as the second step after PCA, we further analyze this two-step procedure under a general class of factor models. Our results show that it estimates the factor loading matrix in the minimax optimal rate when the signal-to-noise-ratio (SNR) is moderate or large. In the low SNR regime, we offer possible improvement over using PCA and the deflation varimax when the additive noise under the factor model is structured. The modified procedure is shown to be minimax optimal in all SNR regimes. Our theory is valid for finite sample and allows the number of the latent factors to grow with the sample size as well as the ambient dimension to grow with, or even exceed, the sample size. Extensive simulation and real data analysis further corroborate our theoretical findings.
AoS Other · 发表于 2025-08-01
Jialin Ouyang, Ming Yuan
摘要
Multiway data are becoming more and more common. While there are many approaches to extending principal component analysis (PCA) from usual data matrices to these types of data, the conceptual differences from the usual PCA, and their methodological implications remain largely unknown. This work aims to specifically address these questions. Through a careful and rigorous treatment, we provide a better understanding of the operating characteristics of multiway PCA, develop improved statistical methods, and reveal new opportunities and challenges when moving from vector data to multiway data. In particular, we clarify the subtle difference between PCA and singular value decomposition (SVD) for multiway data, and show that multiway principal components (PCs) can be estimated reliably in absence of the eigengaps required by the usual PCA, and with a much smaller sample size requirement than the usual PCs. Furthermore, the sample multiway PCs are asymptotically independent and the asymptotic distribution of each sample PC does not depend any other PCs, hence allow for separate and more accurate inferences about the population PCs. The practical merits of multiway PCA are further demonstrated through numerical, both simulated and real data, examples.
AoS Nonparametric & Semiparametric · 发表于 2025-08-01
François Bachoc, Louis Béthune, Alberto González-Sanz, Jean-Michel Loubes
摘要
The distribution regression problem encompasses many important statistics and machine learning tasks, and arises in a large range of applications. Among various existing approaches to tackle this problem, kernel methods have become a method of choice. Indeed, kernel distribution regression is both computationally favorable, and supported by a recent learning theory. This theory also tackles the two-stage sampling setting, where only samples from the input distributions are available. In this paper, we improve the learning theory of kernel distribution regression. We address kernels based on Hilbertian embeddings that encompass most, if not all, of the existing approaches. We introduce the novel near-unbiased condition on the Hilbertian embeddings that enables us to provide new error bounds on the effect of the two-stage sampling, thanks to a new analysis. We show that this near-unbiased condition holds for three important classes of kernels, based on optimal transport and mean embedding. As a consequence, we strictly improve the existing convergence rates for these kernels. Our setting and results are illustrated by numerical experiments.
AoS Testing & Uncertainty · 发表于 2025-08-01
Fangzheng Xie, Yichi Zhang
摘要
Understanding the distributions of spectral estimators in low-rank random matrix models, also known as signal-plus-noise matrix models, is fundamentally important in various statistical learning problems, including network analysis, matrix denoising and matrix completion. This paper investigates the entrywise eigenvector distributions in a broad range of low-rank signal-plus-noise matrix models by establishing their higher-order accurate stochastic expansions. At a high level, the stochastic expansion states that the eigenvector perturbation approximately decomposes into the sum of a first-order term and a second-order term, where the first-order term in the expansion is a linear function of the noise matrix, and the second-order term is a linear function of the squared noise matrix. Our theoretical finding is used to derive the bias correction procedure for the eigenvectors. We further establish the Edgeworth expansion formula for the Studentized entrywise eigenvector statistics. In particular, under mild conditions, we show that Cramér’s condition on the smoothness of noise distribution is not required, thanks to the self-smoothing effect of the second-order term in the eigenvector stochastic expansion. The Edgeworth expansion result is then applied to justify the higher-order correctness of the residual bootstrap procedure for approximating the distributions of the Studentized entrywise eigenvector statistics.
AoS Other · 发表于 2025-08-01
Tao Zou, Wei Lan, Runze Li, Chih-Ling Tsai
摘要
Covariance regression analysis is an approach to linking the covariance of responses to a set of explanatory variables X, where X can be a vector, matrix, or tensor. Most of the literature on this topic focuses on the “Fixed-X” setting and treats X as nonrandom. By contrast, treating explanatory variables X as random, namely the “Random-X” setting, is often more realistic in practice. This article aims to fill this gap in the literature on the estimation and model assessment theory for Random-X covariance regression models. Specifically, we construct a new theoretical framework for studying the covariance estimators under the Random-X setting, and we demonstrate that the quasi-maximum likelihood estimator and the weighted least squares estimator are both consistent and asymptotically normal. In addition, we develop pioneering work on the model assessment theory of covariance regression. In particular, we obtain the bias-variance decompositions for the expected test errors under both the Fixed-X and Random-X settings. We show that moving from a Fixed-X to a Random-X setting can increase both the bias and the variance in expected test errors. Subsequently, we propose the estimators of the expected test errors under the Fixed-X and Random-X settings, which can be used to assess the performance of the competing covariance regression models. The proposed estimation and model assessment approaches are illustrated via extensive simulation experiments and an empirical study of stock returns in the US market.
AoS Optimization & Learning Theory · 发表于 2025-08-01
Qiyang Han
摘要
General first-order methods (GFOMs), including many variants of gradient descent and approximate message passing algorithms, constitute a broad class of iterative algorithms widely applied in modern statistical learning problems. Some GFOMs also serve as constructive proof devices, iteratively characterizing the empirical distributions of statistical estimators in the asymptotic regime of large system limits for any fixed number of iterations. This paper develops a nonasymptotic, entrywise characterization of the dynamics for a general class of GFOMs. Our characterizations capture the precise stochastic behavior of each coordinate of the GFOM iterates, and more importantly, hold universally across a broad class of heterogeneous random matrix models. As a corollary, we provide the first nonasymptotic description of the empirical distributions of the GFOM iterates beyond Gaussian ensembles. We demonstrate the utility of our general GFOM theory through two sets of applications. In the first application, we develop a new algorithmic approach to prove universality for general empirical risk minimizers. Specifically, we establish new entrywise universality for a broad class of regularized least squares estimators in the linear model, by controlling the entrywise error relative to a suitably constructed GFOM iterate. This algorithmic proof method also systematically improves averaged universality results for general regularized regression estimators in the linear model, and resolves the universality conjecture for (regularized) maximum likelihood estimators in the logistic regression model. In the second application, we obtain entrywise Gaussian approximations for a general class of gradient descent algorithms. Our approach provides nonasymptotic state evolution for the bias and variance of the algorithm along the iteration path, applicable even to nonconvex loss functions. The proof relies on a new recursive leave-k-out method that provides “almost” delocalization for the GFOM iterates, and their higher-order derivatives with respect to the underlying random matrix ensembles. Crucially, our method ensures the validity of entrywise universality for up to poly-logarithmic many iterations, which facilitates effective ℓ2/ℓ∞ control between certain GFOM iterates and statistical estimators in applications.
AoS Other · 发表于 2025-08-01
Piotr Zwiernik
摘要
In covariance matrix estimation, one of the challenges lies in finding a suitable model and an efficient estimation method. Two commonly used modelling approaches in the literature involve imposing linear restrictions on the covariance matrix or its inverse. Another approach considers linear restrictions on the matrix logarithm of the covariance matrix. In this paper, we present a general framework for linear restrictions on different transformations of the covariance matrix, including the mentioned examples. Our proposed estimation method solves a convex problem and yields an M-estimator, allowing for relatively straightforward asymptotic (in general) and finite sample analysis (in the Gaussian case). In particular, we recover standard n/d rates, where d is the dimension of the underlying model. Our geometric insights allow to extend various recent results in covariance matrix modelling. This includes providing unrestricted parametrizations of the space of correlation matrices, which is alternative to a recent result utilizing the matrix logarithm.
AoS Networks & Graphs Latent Variables & Mixtures · 发表于 2025-08-01
Jian Ding, Yumou Fei, Yuanzheng Wang
摘要
In this paper, we study the problem of recovering the latent vertex correspondence between two correlated random graphs with vastly inhomogeneous and unknown edge probabilities between different pairs of vertices. Inspired by and extending the matching algorithm via degree profiles by Ding, Ma, Wu and Xu (2021), we obtain an efficient matching algorithm as long as the minimal average degree is at least Ω(log2n) and the minimal correlation is at least 1−O(log−2n).
AoS High-Dimensional Causal Inference · 发表于 2025-08-01
Xin Lu, Fan Yang, Yuhao Wang
摘要
Completely randomized experiment is the gold standard for causal inference. When the covariate information for each experimental candidate is available, one typical way is to include them in covariate adjustments for more accurate treatment effect estimation. In this paper, we investigate this problem under the randomization-based framework, that is, that the covariates and potential outcomes of all experimental candidates are assumed as deterministic quantities and the randomness comes solely from the treatment assignment mechanism. Under this framework, to achieve asymptotically valid inference, existing estimators usually require either (i) that the dimension of covariates p is much smaller than the sample size n; or (ii) certain sparsity constraints on the linear representations of potential outcomes constructed via possibly high-dimensional covariates. In this paper, we consider the moderately high-dimensional regime where p is allowed to be in the same order of magnitude as n. We develop a novel debiased estimator with a corresponding inference procedure and establish its asymptotic normality under mild assumptions. Our estimator is model-free and does not require any sparsity constraint on potential outcome’s linear representations. We also discuss its asymptotic efficiency improvements over the unadjusted treatment effect estimator under different dimensionality constraints. Numerical analysis confirms that compared to other regression adjustment based treatment effect estimators, our debiased estimator performs well in moderately high dimensions.
AoS Latent Variables & Mixtures · 发表于 2025-08-01
Adam Quinn Jaffe
摘要
We revisit Pollard’s classical result on consistency for k-means clustering in Euclidean space, with a focus on extensions in two directions: first, to problems where the data may come from interesting geometric settings (e.g., Riemannian manifolds, reflexive Banach spaces or the Wasserstein space); second, to problems where some parameters are chosen adaptively from the data (e.g., k-medoids or elbow-method k-means). Toward this end, we provide a general theory, which shows that all clustering procedures described above are strongly consistent. In fact, our method of proof allows us to derive many asymptotic limit theorems beyond strong consistency. We also remove all assumptions about uniqueness of the set of optimal cluster centers.
AoS Testing & Uncertainty · 发表于 2025-08-01
Ruiting Liang, Rina Foygel Barber
摘要
In a supervised learning problem, given a predicted value that is the output of some trained model, how can we quantify our uncertainty around this prediction? Distribution-free predictive inference aims to construct prediction intervals around this output, with valid coverage that does not rely on assumptions on the distribution of the data or the nature of the model training algorithm. Existing methods in this area, including conformal prediction and jackknife+, offer theoretical guarantees that hold marginally (i.e., on average over a draw of training and test data). In contrast, training-conditional coverage is a stronger notion of validity that ensures predictive coverage of the test point for most draws of the training data, and is thus a more desirable property in practice. Training-conditional coverage was shown by Vovk (Mach. Learn. 92 (2013) 349–376) to hold for the split conformal method, but recent work by Bian and Barber (Electron. J. Stat. 17 (2023) 2044–2066) proves that such validity guarantees are not possible for the full conformal and jackknife+ methods without further assumptions. In this paper, we show that an assumption of algorithmic stability ensures that the training-conditional coverage property holds for the full conformal and jackknife+ methods.
Biometrics Nonparametric & Semiparametric · 发表于 2025-07-31
Guorong Dai, Raymond J Carroll, Jinbo Chen
摘要
We consider a common nonparametric regression setting, where the data consist of a response variable Y, some easily obtainable covariates $\mathbf {X}$, and a set of costly covariates $\mathbf {Z}$. Before establishing predictive models for Y, a natural question arises: Is it worthwhile to include $\mathbf {Z}$ as predictors, given the additional cost of collecting data on $\mathbf {Z}$ for both training the models and predicting Y for future individuals? Therefore, we aim to conduct preliminary investigations to infer importance of $\mathbf {Z}$ in predicting Y in the presence of $\mathbf {X}$. To achieve this goal, we propose a nonparametric variable importance measure for $\mathbf {Z}$. It is defined as a parameter that aggregates maximum potential contributions of $\mathbf {Z}$ in single or multiple predictive models, with contributions quantified by general loss functions. Considering two-phase data that provide a large number of observations for $(Y,\mathbf {X})$ with the expensive $\mathbf {Z}$ measured only in a small subsample, we develop a novel approach to infer the proposed importance measure, accommodating missingness of $\mathbf {Z}$ in the sample by substituting functions of $(Y,\mathbf {X})$ for each individual’s contribution to the predictive loss of models involving $\mathbf {Z}$. Our approach attains unified and efficient inference regardless of whether $\mathbf {Z}$ makes zero or positive contribution to predicting Y, a desirable yet surprising property owing to data incompleteness. As intermediate steps of our theoretical development, we establish novel results in two relevant research areas, semi-supervised inference and two-phase nonparametric estimation. Numerical results from both simulated and real data demonstrate superior performance of our approach.
Biometrics Longitudinal Data · 发表于 2025-07-31
Qianheng Ma, Genevieve F Dunton, Donald Hedeker
摘要
In recent years, the use of wearable devices, for example, accelerometers, have become increasingly prevalent. Wearable devices enable more accurate real-time tracking of a subject’s physical activity (PA) level, such as steps, number of activity bouts, or time in moderate-to-vigorous intensity PA (MVPA), which are important general health markers and can often be represented as counts. These intensive within-subject count data provided by wearable devices, for example, minutes in MVPA summarized per hour across days and even months, allow the possibility for modeling not only the mean PA level, but also the dispersion level for each subject. Especially in the context of daily PA, subjects’ dispersion levels are potentially informative in reflecting their exercise patterns: some subjects might exhibit consistent PA across time and can be considered “less dispersed” subjects; while others might have a large amount of PA at a particular time point, while being sedentary for most of the day, and can be considered “more dispersed” subjects. Thus, we propose a negative binomial mixed effects location-scale model to model these intensive longitudinal PA counts and to account for the heterogeneity in both the mean and dispersion level across subjects. Further, to handle the issue of inflated numbers of zeros in the PA data, we also propose a hurdle/zero-inflated version which additionally includes the modeling of the probability of having $>$0 PA levels.
Biometrics Networks & Graphs · 发表于 2025-07-31
Yi Zhao, Yize Zhao
摘要
A covariance-on-covariance regression model is introduced in this manuscript. It is assumed that there exists (at least) a pair of linear projections on outcome covariance matrices and predictor covariance matrices such that a log-linear model links the variances in the projection spaces, as well as additional covariates of interest. An ordinary least square type of estimator is proposed to simultaneously identify the projections and estimate model coefficients. Under regularity conditions, the proposed estimator is asymptotically consistent. The superior performance of the proposed approach over existing methods is demonstrated via simulation studies. Applying to data collected in the Human Connectome Project Aging study, the proposed approach identifies 3 pairs of brain networks, where functional connectivity within the resting-state network predicts functional connectivity within the corresponding task-state network. The 3 networks correspond to a global signal network, a task-related network, and a task-unrelated network. The findings are consistent with existing knowledge about brain function.
Biometrics Causal Inference Machine Learning · 发表于 2025-07-31
Matthew Pryce, Karla Diaz-Ordaz, Ruth H Keogh, Stijn Vansteelandt
摘要
When estimating heterogeneous treatment effects, missing outcome data can complicate treatment effect estimation, causing certain subgroups of the population to be poorly represented. In this work, we discuss this commonly overlooked problem and consider the impact that missing at random outcome data has on causal machine learning estimators for the conditional average treatment effect (CATE). We propose 2 de-biased machine learning estimators for the CATE, the mDR-learner, and mEP-learner, which address the issue of under-representation by integrating inverse probability of censoring weights into the DR-learner and EP-learner, respectively. We show that under reasonable conditions, these estimators are oracle efficient and illustrate their favorable performance through simulated data settings, comparing them to existing CATE estimators, including comparison to estimators that use common missing data techniques. We present an example of their application using the GBSG2 trial, exploring treatment effect heterogeneity when comparing hormonal therapies to non-hormonal therapies among breast cancer patients post surgery, and offer guidance on the decisions a practitioner must make when implementing these estimators.
Biometrika Missing Data & Measurement Error Testing & Uncertainty · 发表于 2025-07-30
Michael W Robbins, Lane Burgette
摘要
Resampling techniques have become increasingly popular for estimation of uncertainty. However, data are often fraught with missing values that are commonly imputed to facilitate analysis. This article addresses the issue of using resampling methods such as a jackknife or bootstrap in conjunction with imputations that have been sampled stochastically, in the vein of multiple imputation. We derive the theory needed to illustrate two key points regarding the use of resampling methods in lieu of traditional combining rules. First, imputations should be independently generated multiple times within each replicate group of a jackknife or bootstrap. Second, the number of multiply imputed datasets per replicate group must dramatically exceed the number of replicate groups for a jackknife; however, this is not the case in a bootstrap approach. We also discuss bias-adjusted analogues of the jackknife and bootstrap that are argued to require fewer imputed datasets. A simulation study is provided to support these theoretical conclusions.
SMMR Clinical Trials · 发表于 2025-07-30
Norah Alkhnefr, Feifang Hu, Guannan Zhai
摘要
In clinical trials, response-adaptive randomization (RAR) has gained increasing attention due to its ability to assign more patients to better-performing treatments. Consequently, several RAR methods have been proposed in recent years. Among them, the efficient response adaptive randomization design (ERADE), proposed by Hu et al. (2009), stands out as an optimal approach, with the asymptotic variance of the allocation proportion achieving the Cramér–Rao lower bound, demonstrating its statistical efficiency. However, the original ERADE is limited to trials with only two treatment arms. Given the growing prevalence of multi-arm trials in modern clinical development, the original ERADE design no longer meets all practical needs. In this paper, we extend ERADE for use in multi-arm clinical trials, proposing the multi-arm ERADE algorithm. We establish the asymptotic properties of this generalized design and demonstrate its effectiveness in finite sample settings through simulations and a real-world trial redesign.
JASA Latent Variables & Mixtures Networks & Graphs · 发表于 2025-07-28
Joshua Agterberg, Zachary Lubberts, Jesús Arroyo
摘要
Modern network datasets are often composed of multiple layers, resulting in collections of networks over the same set of vertices but with potentially different connectivity patterns on each network. These data require models and methods that are flexible enough to capture local and global differences across the networks while at the same time being parsimonious and tractable to yield computationally efficient and theoretically sound solutions that are capable of aggregating information across the networks. This paper considers the multilayer degree-corrected stochastic blockmodel, where a collection of networks shares the same community structure, but degree corrections and block connection probability matrices are permitted to be different. We establish the identifiability of this model and propose a spectral clustering algorithm. Our theoretical results demonstrate that the misclustering error rate of the algorithm improves exponentially with multiple network realizations, even in the presence of significant layer heterogeneity. Simulation studies show that this approach improves on existing multilayer community detection methods in this challenging regime. Furthermore, in a case study of US airport data through January 2016 – September 2021, we find that this methodology identifies meaningful community structure and trends in airport popularity influenced by pandemic impacts on travel. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work. *(abstract via OpenAlex)*
Biometrics Other · 发表于 2025-07-26
John Neuhaus, Charles McCulloch, Ross Boylan
Biometrics Other · 发表于 2025-07-25
Simon N Wood
摘要
Daily deaths from an infectious disease provide a means for retrospectively inferring daily incidence, given knowledge of the infection-to-death interval distribution. Existing methods for doing so rely either on fitting simplified non-linear epidemic models to the deaths data or on spline based deconvolution approaches. The former runs the risk of introducing unintended artefacts via the model formulation, while the latter may be viewed as technically obscure, impeding uptake by practitioners. This note proposes a simple simulation based approach to inferring fatal incidence from deaths that requires minimal assumptions, is easy to understand, and allows testing of alternative hypothesized incidence trajectories. The aim is that in any future situation similar to the COVID pandemic, the method can be easily, rapidly, transparently, and uncontroversially deployed as an input to management.
Biometrics Spatial & Time Series · 发表于 2025-07-25
Raanju R Sundararajan, Scott A Bruce
摘要
Information from frequency bands in biomedical time series provides useful summaries of the observed signal. Many existing methods consider summaries of the time series obtained over a few well-known, pre-defined frequency bands of interest. However, there is a dearth of data-driven methods for identifying frequency bands that optimally summarize frequency-domain information in the time series. A new method to identify partition points in the frequency space of a multivariate locally stationary time series is proposed. These partition points signify changes across frequencies in the time-varying behavior of the signal and provide frequency band summary measures that best preserve nonstationary dynamics of the observed series. An $L_2$-norm based discrepancy measure that finds differences in the time-varying spectral density matrix is constructed, and its asymptotic properties are derived. New nonparametric bootstrap tests are also provided to identify significant frequency partition points and to identify components and cross-components of the spectral matrix exhibiting changes over frequencies. Finite-sample performance of the proposed method is illustrated via simulations. The proposed method is used to develop optimal frequency band summary measures for characterizing time-varying behavior in resting-state electroencephalography time series, as well as identifying components and cross-components associated with each frequency partition point.
Biometrics Survey & Sampling Diagnostics & Prediction · 发表于 2025-07-24
Lingxiao Wang
摘要
Two-phase sampling designs are frequently applied in epidemiological studies and large-scale health surveys. In such designs, certain variables are collected exclusively within a second-phase random subsample of the initial first-phase sample, often due to factors such as high costs, response burden, or constraints on data collection or assessment. Consequently, second-phase sample estimators can be inefficient due to the diminished sample size. Model-assisted calibration methods have been used to improve the efficiency of second-phase estimators in regression analysis. However, limited literature provides valid finite population inferences of the calibration estimators that use appropriate calibration auxiliary variables while simultaneously accounting for the complex sample designs in the first- and second-phase samples. Moreover, no literature considers the “pooled design” where some covariates are measured exclusively in certain repeated survey cycles. This paper proposes calibrating the sample weights for the second-phase sample to the weighted first-phase sample based on score functions of the regression model that uses predictions of the second-phase variable for the first-phase sample. We establish the consistency of estimation using calibrated weights and provide variance estimation for the regression coefficients under the two-phase design or the pooled design nested within complex survey designs. Empirical evidence highlights the efficiency and robustness of the proposed calibration compared to existing calibration and imputation methods. Data examples from the National Health and Nutrition Examination Survey are provided.
Biometrics Spatial & Time Series Nonparametric & Semiparametric Causal Inference · 发表于 2025-07-24
Nate Wiecha, Jane A Hoppin, Brian J Reich
摘要
Public health data are often spatially dependent, but standard spatial regression methods can suffer from bias and invalid inference when the independent variable is associated with spatially correlated residuals. This could occur if, for example, there is an unmeasured environmental contaminant associated with the independent and outcome variables in a spatial regression analysis. Geoadditive structural equation modeling (gSEM), in which an estimated spatial trend is removed from both the explanatory and response variables before estimating the parameters of interest, has previously been proposed as a solution but there has been little investigation of gSEM’s properties with point-referenced data. We link gSEM to results on double machine learning and semiparametric regression based on two-stage procedures. We propose using these semiparametric estimators for spatial regression using Gaussian processes with Matèrn covariance to estimate the spatial trends and term this class of estimators double spatial regression (DSR). We derive regularity conditions for root-n asymptotic normality and consistency and closed-form variance estimation, and show that in simulations where standard spatial regression estimators are highly biased and have poor coverage, DSR can mitigate bias more effectively than competitors and obtain nominal coverage.
Biometrics Causal Inference Networks & Graphs · 发表于 2025-07-24
Fangting Zhou, Kejun He, Yang Ni
摘要
Directed acyclic graphical models with additive noises are essential in nonlinear causal discovery and have numerous applications in various domains, such as social science and systems biology. Most such models further assume that structural causal functions are additive to ensure causal identifiability and computational feasibility, which may be too restrictive in the presence of causal interactions. Some methods consider general nonlinear causal functions represented by, for example, Gaussian processes and neural networks, to accommodate interactions. However, they are either computationally intensive or lack interpretability. We propose a highly interpretable and computationally feasible approach using trees to incorporate interactions in nonlinear causal discovery, termed tree-based additive noise models. The nature of the tree construction leads to piecewise constant causal functions, making existing causal identifiability results of additive noise models with continuous and smooth causal functions inapplicable. Therefore, we provide new conditions under which the proposed model is identifiable. We develop a recursive algorithm for source node identification and a score-based ordering search algorithm. Through extensive simulations, we demonstrate the utility of the proposed model and algorithms benchmarking against existing additive noise models, especially when there are strong causal interactions. Our method is applied to infer a protein–protein interaction network for breast cancer, where proteins may form protein complexes to perform their functions.
SMMR Clinical Trials · 发表于 2025-07-24
Oleksandr Sverdlov, Jone Renteria, Kerstine Carter, Annika L Scheffold, Johannes Krisam, Pietro Mascheroni, Jan Seidel
摘要
Background: There is emerging evidence of the increasing uptake of response-adaptive randomization (RAR) in clinical trials. However, a systematic review of RAR trials, their context of use, characteristics, and stakeholder acceptance has been lacking. Methods: We performed a systematic review of clinical trials that utilized elements of RAR, identified via the Cortellis Regulatory Intelligence database following a pre-specified selection process. We report a summary of relevant characteristics of the identified trials. Results: Out of 170 records, 39 RAR trials were identified (22 completed, 17 ongoing as of October 2024). The majority were Phase 2-focused studies (phases 1/2, 2, 2b, and 2/3), academically sponsored, and concentrated in oncology, neurology, and infectious diseases. Small molecules and biologics were the most common investigational products. Among the 22 completed trials, seven reported positive outcomes. Notably, two of these trials provided pivotal data that informed the further development and subsequent regulatory approval of the investigational compounds. Conclusion: Over the past two decades, RAR has been increasingly utilized in complex adaptive trials across diverse therapeutic areas and clinical research phases. This systematic review provides a critical “baseline” for tracing the dynamics of RAR applications and should help the clinical research community recognize RAR as a valuable methodology for optimizing future trial designs.
Biometrics Causal Inference Bayesian Methods Meta-Analysis & Data Integration · 发表于 2025-07-24
Junwei Shen, Erica E M Moodie, Shirin Golchi
摘要
Individualized treatment rules tailor treatments to patients based on clinical, demographic, and other characteristics. Estimation of individualized treatment rules requires the identification of individuals who benefit most from the particular treatments and thus the detection of variability in treatment effects. To develop an effective individualized treatment rule, data from multisite studies may be required due to the low power provided by smaller datasets for detecting the often small treatment-covariate interactions. However, sharing of individual-level data is sometimes constrained. Furthermore, sparsity may arise in 2 senses: different data sites may recruit from different populations, making it infeasible to estimate identical models or all parameters of interest at all sites, and the number of non-zero parameters in the model for the treatment rule may be small. To address these issues, we adopt a 2-stage Bayesian meta-analysis approach to estimate individualized treatment rules which optimize expected patient outcomes using multisite data without disclosing individual-level data beyond the sites. Simulation results demonstrate that our approach can provide consistent estimates of the parameters which fully characterize the optimal individualized treatment rule. We estimate the optimal Warfarin dose strategy using data from the International Warfarin Pharmacogenetics Consortium, where data sparsity and small treatment-covariate interaction effects pose additional statistical challenges.
Biometrics Clinical Trials Bayesian Methods Optimization & Learning Theory · 发表于 2025-07-24
Saijun Zhao, Peter F Thall, Ying Yuan, Juhee Lee, Pavlos Msaouel, Yong Zang
摘要
A new family of precision Bayesian dose optimization designs, PGen I-II, based on early efficacy, early toxicity, and long-term time to treatment failure is proposed. A PGen I-II design refines a Gen I-II design by accounting for patient heterogeneity characterized by subgroups that may be defined by prognostic levels, disease subtypes, or biomarker categories. The design makes subgroup-specific decisions, which may be to drop an unacceptably toxic or inefficacious dose, randomize patients among acceptable doses, or identify a best dose in terms of treatment success defined in terms of time to failure over long-term follow-up. A piecewise exponential distribution for failure time is assumed, including subgroup-specific effects of dose, response, and toxicity. Latent variables are used to adaptively cluster subgroups found to have similar dose-outcome distributions, with the model simplified to borrow strength between subgroups in the same cluster. Guidelines and user-friendly computer software for implementing the design are provided. A simulation study is reported that shows the PGen I-II design is superior to similarly structured designs that either assume patient homogeneity or conduct separate trials within subgroups.