研究园简易版 · 经典书籍 · 期刊文章 · 有原文 · 完整版(可多选筛选、搜索) · 首页
2024 年的期刊文章 · 第 19 页
共 1515 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2024-04-03 到 2024-03-27。
按期刊、按主题看 →
SMMR Causal Inference Missing Data & Measurement Error Bayesian Methods · 发表于 2024-04-03
Bryan S Blette, Scott D Halpern, Fan Li, Michael O Harhay
摘要
Understanding whether and how treatment effects vary across subgroups is crucial to inform clinical practice and recommendations. Accordingly, the assessment of heterogeneous treatment effects based on pre-specified potential effect modifiers has become a common goal in modern randomized trials. However, when one or more potential effect modifiers are missing, complete-case analysis may lead to bias and under-coverage. While statistical methods for handling missing data have been proposed and compared for individually randomized trials with missing effect modifier data, few guidelines exist for the cluster-randomized setting, where intracluster correlations in the effect modifiers, outcomes, or even missingness mechanisms may introduce further threats to accurate assessment of heterogeneous treatment effect. In this article, the performance of several missing data methods are compared through a simulation study of cluster-randomized trials with continuous outcome and missing binary effect modifier data, and further illustrated using real data from the Work, Family, and Health Study. Our results suggest that multilevel multiple imputation and Bayesian multilevel multiple imputation have better performance than other available methods, and that Bayesian multilevel multiple imputation has lower bias and closer to nominal coverage than standard multilevel multiple imputation when there are model specification or compatibility issues.
JASA Other · 发表于 2024-04-02
Bodhisattva Sen
摘要
This book provides a comprehensive account of the mathematical foundations of nonparametric models, for example, density estimation and regression, and develops a general framework for studying est... *(abstract via OpenAlex)*
Biometrics Longitudinal Data · 发表于 2024-04-02
Charles E McCulloch, John M Neuhaus, Ross D Boylan
摘要
Statistical models incorporating cluster-specific intercepts are commonly used in hierarchical settings, for example, observations clustered within patients or patients clustered within hospitals. Predicted values of these intercepts are often used to identify or “flag” extreme or outlying clusters, such as poorly performing hospitals or patients with rapid declines in their health. We consider a variety of flagging rules, assessing different predictors, and using different accuracy measures. Using theoretical calculations and comprehensive numerical evaluation, we show that previously proposed rules based on the 2 most commonly used predictors, the usual best linear unbiased predictor and fixed effects predictor, perform extremely poorly: the incorrect flagging rates are either unacceptably high (approaching 0.5 in the limit) or overly conservative (eg, much <0.05 for reasonable parameter values, leading to very low correct flagging rates). We develop novel methods for flagging extreme clusters that can control the incorrect flagging rates, including very simple-to-use versions that we call “self-calibrated.” The new methods have substantially higher correct flagging rates than previously proposed methods for flagging extreme values, while controlling the incorrect flagging rates. We illustrate their application using data on length of stay in pediatric hospitals for children admitted for asthma diagnoses.
Biometrics Survival Analysis Nonparametric & Semiparametric Machine Learning · 发表于 2024-04-02
Qiang Wu, Xingwei Tong, Xingqiu Zhao
摘要
Deep learning has continuously attained huge success in diverse fields, while its application to survival data analysis remains limited and deserves further exploration. For the analysis of current status data, a deep partially linear Cox model is proposed to circumvent the curse of dimensionality. Modeling flexibility is attained by using deep neural networks (DNNs) to accommodate nonlinear covariate effects and monotone splines to approximate the baseline cumulative hazard function. We establish the convergence rate of the proposed maximum likelihood estimators. Moreover, we derive that the finite-dimensional estimator for treatment covariate effects is $\sqrt{n}$-consistent, asymptotically normal, and attains semiparametric efficiency. Finally, we demonstrate the performance of our procedures through extensive simulation studies and application to real-world data on news popularity.
SiM Testing & Uncertainty Clinical Trials · 发表于 2024-04-02
Shiwei Cao, Sin‐Ho Jung
摘要
A multi‐stage randomized trial design can significantly improve efficiency by allowing early termination of the trial when the experimental arm exhibits either low or high efficacy compared to the control arm during the study. However, proper inference methods are necessary because the underlying distribution of the target statistic changes due to the multi‐stage structure. This article focuses on multi‐stage randomized phase II trials with a dichotomous outcome, such as treatment response, and proposes exact conditional confidence intervals for the odds ratio. The usual single‐stage confidence intervals are invalid when used in multi‐stage trials. To address this issue, we propose a linear ordering of all possible outcomes. This ordering is conditioned on the total number of responders in each stage and utilizes the exact conditional distribution function of the outcomes. This approach enables the estimation of an exact confidence interval accounting for the multi‐stage designs.
Biometrics Causal Inference · 发表于 2024-04-02
Danni Shi, Ting Ye
摘要
A crossover trial is an efficient trial design when there is no carry-over effect. To reduce the impact of the biological carry-over effect, a washout period is often designed. However, the carry-over effect remains an outstanding concern when a washout period is unethical or cannot sufficiently diminish the impact of the carry-over effect. The latter can occur in comparative effectiveness research, where the carry-over effect is often non-biological but behavioral. In this paper, we investigate the crossover design under a potential outcomes framework with and without the carry-over effect. We find that when the carry-over effect exists and satisfies a sign condition, the basic estimator underestimates the treatment effect, which does not inflate the type I error of one-sided tests but negatively impacts the power. This leads to a power trade-off between the crossover design and the parallel-group design, and we derive the condition under which the crossover design does not lead to type I error inflation and is still more powerful than the parallel-group design. We also develop covariate adjustment methods for crossover trials. We evaluate the performance of cross-over design and covariate adjustment using data from the MTN-034/REACH study.
JASA Bayesian Methods · 发表于 2024-04-02
Cong Zhang, Tejasv Bedi, Chul Moon, Yang Xie, Min Chen, Qiwei Li
摘要
Medical imaging is a form of technology that has revolutionized the medical field over the past decades. Digital pathology imaging, which captures histological details at the cellular level, is rapidly becoming a routine clinical procedure for cancer diagnosis support and treatment planning. Recent developments in deep-learning methods have facilitated tumor region segmentation from pathology images. The traditional shape descriptors that characterize tumor boundary roughness at the anatomical level are no longer suitable. New statistical approaches to model tumor shapes are in urgent need. In this paper, we consider the problem of modeling a tumor boundary as a closed polygonal chain. A Bayesian landmark-based shape analysis model is proposed. The model partitions the polygonal chain into mutually exclusive segments, accounting for boundary roughness. Our Bayesian inference framework provides uncertainty estimations on both the number and locations of landmarks, while outputting metrics that can be used to quantify boundary roughness. The performance of our model is comparable with that of a recently developed landmark detection model for planar elastic curves. In a case study of 143 consecutive patients with stage I to IV lung cancer, we demonstrated the heterogeneity of tumor boundary roughness derived from our model effectively predicted patient prognosis (p-value < 0.001). *(abstract via PubMed)*
JASA Nonparametric & Semiparametric · 发表于 2024-04-02
Yuqi Tian, Chun Li, Shengxin Tu, Nathan T. James, FrankE. Harrell, BryanE. Shepherd
摘要
Detection limits (DLs), where a variable cannot be measured outside of a certain range, are common in research. DLs may vary across study sites or over time. Most approaches to handling DLs in response variables implicitly make strong parametric assumptions on the distribution of data outside DLs. We propose a new approach to deal with multiple DLs based on a widely used ordinal regression model, the cumulative probability model (CPM). The CPM is a rank-based, semiparametric linear transformation model that can handle mixed distributions of continuous and discrete outcome variables. These features are key for analyzing data with DLs because while observations inside DLs are continuous, those outside DLs are censored and generally put into discrete categories. With a single lower DL, CPMs assign values below the DL as having the lowest rank. With multiple DLs, the CPM likelihood can be modified to appropriately distribute probability mass. We demonstrate the use of CPMs with DLs via simulations and a data example. This work is motivated by a study investigating factors associated with HIV viral load 6 months after starting antiretroviral therapy in Latin America; 56% of observations are below lower DLs that vary across study sites and over time. *(abstract via PubMed)*
SiM Clinical Trials · 发表于 2024-04-02
Stephen Schüürhuis, Frank Konietschke, Cornelia Ursula Kunz
摘要
Common statistical theory applicable to confirmatory phase III trial designs usually assumes that patients are enrolled simultaneously and there is no time gap between enrollment and outcome observation. However, in practice, patients are enrolled successively and there is a lag between the enrollment of a patient and the measurement of the primary outcome. For single‐stage designs, the difference between theory and practice only impacts on the trial duration but not on the statistical analysis and its interpretation. For designs with interim analyses, however, the number of patients already enrolled into the trial and the number of patients with available outcome measurements differ, which can cause issues regarding the statistical analyses of the data. The main issue is that current methodologies either imply that at the time of the interim analysis there are so‐called pipeline patients whose data are not used to make a statistical decision (like stopping early for efficacy) or the enrollment into the trial needs to be at least paused for interim analysis to avoid pipeline patients. There are methods for delayed responses available that introduced error‐spending stopping boundaries for the enrollment of patients followed by critical values to reject the null hypothesis in case the stopping boundaries have been crossed beforehand. Here, we will discuss other solutions, considering different boundary determination algorithms using conditional power and introducing a design allowing for recruitment restart while keeping the type I error rate controlled.
SiM Survival Analysis Longitudinal Data · 发表于 2024-04-02
Lacey H. Etzkorn, Quentin Le Coënt, Mark van den Boogaard, Virginie Rondeau, Elizabeth Colantuoni
摘要
Joint models linking longitudinal biomarkers or recurrent event processes with a terminal event, for example, mortality, have been studied extensively. Motivated by studies of recurrent delirium events in patients receiving care in an intensive care unit (ICU), we devise a joint model for a recurrent event process and multiple terminal events. Being discharged alive from the ICU or experiencing mortality may be associated with a patient's hazard of delirium, violating the assumption of independent censoring. Moreover, the direction of the association between the hazards of delirium and mortality may be opposite of the direction of association between the hazards of delirium and ICU discharge. Hence treating either terminal event as independent censoring may bias inferences. We propose a competing joint model that uses a latent frailty to link a patient's recurrent and competing terminal event processes. We fit our model to data from a completed placebo‐controlled clinical trial, which studied whether Haloperidol could prevent death and delirium among ICU patients. The clinical trial served as a foundation for a simulation study, in which we evaluate the properties, for example, bias and confidence interval coverage, of the competing joint model. As part of the simulation study, we demonstrate the shortcomings of using a joint model with a recurrent delirium process and a single terminal event to study delirium in the ICU. Lastly, we discuss limitations and possible extensions for the competing joint model. The competing joint model has been added to frailtypack, an R package for fitting an assortment of joint models.
AoS Spatial & Time Series High-Dimensional · 发表于 2024-04-01
Jiaqi Li, Likai Chen, Weining Wang, Wei Biao Wu
摘要
We propose an inference method for detecting multiple change points in high-dimensional time series, targeting dense or spatially clustered signals. Our method aggregates moving sum (MOSUM) statistics cross-sectionally by an ℓ2-norm and maximizes them over time. We further introduce a novel Two-Way MOSUM, which utilizes spatial-temporal moving regions to search for breaks, with the added advantage of enhancing testing power when breaks occur in only a few groups. The limiting distribution of an ℓ2-aggregated statistic is established for testing break existence by extending a high-dimensional Gaussian approximation theorem to spatial-temporal nonstationary processes. Simulation studies exhibit promising performance of our test in detecting nonsparse weak signals. Two applications on equity returns and COVID-19 cases in the United States show the real-world relevance of our algorithms. The R package “L2hdchange” is available on CRAN.
AoS Meta-Analysis & Data Integration · 发表于 2024-04-01
T. Tony Cai, Dongwoo Kim, Hongming Pu
摘要
This paper studies transfer learning for estimating the mean of random functions based on discretely sampled data, where in addition to observations from the target distribution, auxiliary samples from similar but distinct source distributions are available. The paper considers both common and independent designs and establishes the minimax rates of convergence for both designs. The results reveal an interesting phase transition phenomenon under the two designs and demonstrate the benefits of utilizing the source samples in the low sampling frequency regime. For practical applications, this paper proposes novel data-driven adaptive algorithms that attain the optimal rates of convergence within a logarithmic factor simultaneously over a large collection of parameter spaces. The theoretical findings are complemented by a simulation study that further supports the effectiveness of the proposed algorithms.
AoS Testing & Uncertainty · 发表于 2024-04-01
Lasse Fischer, Marta Bofill Roig, Werner Brannath
摘要
The closure principle is fundamental in multiple testing and has been used to derive many efficient procedures with familywise error rate control. However, it is often unsuitable for modern research, which involves flexible multiple testing settings where not all hypotheses are known at the beginning of the evaluation. In this paper, we focus on online multiple testing where a possibly infinite sequence of hypotheses is tested over time. At each step, it must be decided on the current hypothesis without having any information about the hypotheses that have not been tested yet. Our main contribution is a general and stringent mathematical definition of online multiple testing and a new online closure principle, which ensures that the resulting closed procedure can be applied in the online setting. We prove that any familywise error rate controlling online procedure can be derived by this online closure principle and provide admissibility results. In addition, we demonstrate how shortcuts of these online closed procedures can be obtained under a suitable consonance property.
AoS Testing & Uncertainty Bayesian Methods · 发表于 2024-04-01
Jake A. Soloff, Daniel Xiang, William Fithian
摘要
Despite the popularity of the false discovery rate (FDR) as an error control metric for large-scale multiple testing, its close Bayesian counterpart the local false discovery rate (lfdr), defined as the posterior probability that a particular null hypothesis is false, is a more directly relevant standard for justifying and interpreting individual rejections. However, the lfdr is difficult to work with in small samples, as the prior distribution is typically unknown. We propose a simple multiple testing procedure and prove that it controls the expectation of the maximum lfdr across all rejections; equivalently, it controls the probability that the rejection with the largest p-value is a false discovery. Our method operates without knowledge of the prior, assuming only that the p-value density is uniform under the null and decreasing under the alternative. We also show that our method asymptotically implements the oracle Bayes procedure for a weighted classification risk, optimally trading off between false positives and false negatives. We derive the limiting distribution of the attained maximum lfdr over the rejections, and the limiting empirical Bayes regret relative to the oracle procedure.
AoS Machine Learning · 发表于 2024-04-01
Hamed Hassani, Adel Javanmard
摘要
Successful deep learning models often involve training neural network architectures that contain more parameters than the number of training samples. Such overparametrized models have recently been extensively studied, and the virtues of overparametrization have been established from both the statistical perspective, via the double-descent phenomenon, and the computational perspective via the structural properties of the optimization landscape. Despite this success, it is also well known that these models are highly vulnerable to small adversarial perturbations in their inputs. Even when adversarially trained, their performance on perturbed inputs (robust generalization) is considerably worse than their best attainable performance on benign inputs (standard generalization). It is thus imperative to understand how overparametrization fundamentally affects robustness. In this paper, we will provide a precise characterization of the role of overparametrization on robustness by focusing on random features regression models (two-layer neural networks with random first layer weights). We consider a regime where the sample size, the input dimension and the number of parameters grow proportionally, and derive an asymptotically exact formula for the robust generalization error when the model is adversarially trained. Our developed theory reveals the nontrivial effect of overparametrization on robustness and indicates that high overparametrization can hurt robust generalization.
AoS High-Dimensional Testing & Uncertainty · 发表于 2024-04-01
Patrick Bastian, Holger Dette, Johannes Heiny
摘要
This paper takes a different look on the problem of testing the mutual independence of the components of a high-dimensional vector. Instead of testing if all pairwise associations (e.g., all pairwise Kendall’s τ) between the components vanish, we are interested in the (null) hypothesis that all pairwise associations do not exceed a certain threshold in absolute value. The consideration of these hypotheses is motivated by the observation that in the high-dimensional regime, it is rare, and perhaps impossible, to have a null hypothesis that can be exactly modeled by assuming that all pairwise associations are precisely equal to zero. The formulation of the null hypothesis as a composite hypothesis makes the problem of constructing tests nonstandard and in this paper we provide a solution for a broad class of dependence measures, which can be estimated by U-statistics. In particular, we develop an asymptotic and a bootstrap level α-test for the new hypotheses in the high-dimensional regime. We also prove that the new tests are minimax-optimal and investigate their finite sample properties by means of a small simulation study and a data example.
AoS Other · 发表于 2024-04-01
Predrag Pilipovic, Adeline Samson, Susanne Ditlevsen
AoS Causal Inference Nonparametric & Semiparametric · 发表于 2024-04-01
Edward H. Kennedy, Sivaraman Balakrishnan, James M. Robins, Larry Wasserman
摘要
Estimation of heterogeneous causal effects—that is, how effects of policies and treatments vary across subjects—is a fundamental task in causal inference. Many methods for estimating conditional average treatment effects (CATEs) have been proposed in recent years, but questions surrounding optimality have remained largely unanswered. In particular, a minimax theory of optimality has yet to be developed, with the minimax rate of convergence and construction of rate-optimal estimators remaining open problems. In this paper, we derive the minimax rate for CATE estimation, in a Hölder-smooth nonparametric model, and present a new local polynomial estimator, giving high-level conditions under which it is minimax optimal. Our minimax lower bound is derived via a localized version of the method of fuzzy hypotheses, combining lower bound constructions for nonparametric regression and functional estimation. Our proposed estimator can be viewed as a local polynomial R-Learner, based on a localized modification of higher-order influence function methods. The minimax rate we find exhibits several interesting features, including a nonstandard elbow phenomenon and an unusual interpolation between nonparametric regression and functional estimation rates. The latter quantifies how the CATE, as an estimand, can be viewed as a regression/functional hybrid.
AoS Other · 发表于 2024-04-01
Paromita Dubey, Yaqing Chen, Hans-Georg Müller
摘要
This article provides an overview on the statistical modeling of complex data as increasingly encountered in modern data analysis. It is argued that such data can often be described as elements of a metric space that satisfies certain structural conditions and features a probability measure. We refer to the random elements of such spaces as random objects and to the emerging field that deals with their statistical analysis as metric statistics. Metric statistics provides methodology, theory and visualization tools for the statistical description, quantification of variation, centrality and quantiles, regression and inference for populations of random objects, inferring these quantities from available data and samples. In addition to a brief review of current concepts, we focus on distance profiles as a major tool for object data in conjunction with the pairwise Wasserstein transports of the underlying one-dimensional distance distributions. These pairwise transports lead to the definition of intuitive and interpretable notions of transport ranks and transport quantiles as well as two-sample inference. An associated profile metric complements the original metric of the object space and may reveal important features of the object data in data analysis. We demonstrate these tools for the analysis of complex data through various examples and visualizations.
AoS Missing Data & Measurement Error · 发表于 2024-04-01
Yuling Yan, Yuxin Chen, Jianqing Fan
摘要
This paper studies how to construct confidence regions for principal component analysis (PCA) in high dimension, a problem that has been vastly underexplored. While computing measures of uncertainty for nonlinear/nonconvex estimators is in general difficult in high dimension, the challenge is further compounded by the prevalent presence of missing data and heteroskedastic noise. We propose a novel approach to performing valid inference on the principal subspace, on the basis of an estimator called HeteroPCA (Ann. Statist. 50 (2022b) 53–80). We develop nonasymptotic distributional guarantees for HeteroPCA, and demonstrate how these can be invoked to compute both confidence regions for the principal subspace and entrywise confidence intervals for the spiked covariance matrix. Our inference procedures are fully data-driven and adaptive to heteroskedastic random noise, without requiring prior knowledge about the noise levels.
AoS Causal Inference High-Dimensional · 发表于 2024-04-01
Jelena Bradic, Weijie Ji, Yuqian Zhang
摘要
Estimating dynamic treatment effects is a crucial endeavor in causal inference, particularly when confronted with high-dimensional confounders. Doubly robust (DR) approaches have emerged as promising tools for estimating treatment effects due to their flexibility. However, we showcase that the traditional DR approaches that only focus on the DR representation of the expected outcomes may fall short of delivering optimal results. In this paper, we propose a novel DR representation for intermediate conditional outcome models that leads to superior robustness guarantees. The proposed method achieves consistency even with high-dimensional confounders, as long as at least one nuisance function is appropriately parametrized for each exposure time and treatment path. Our results represent a significant step forward as they provide faster convergence rates and new robustness guarantees. The key to achieving these results lies in utilizing DR representations for intermediate conditional outcome models, which offer superior inferential performance while requiring weaker assumptions. Lastly, we examine finite sample behavior through simulations and a real data application.
AoS Causal Inference Optimization & Learning Theory · 发表于 2024-04-01
Nilanjana Laha, Aaron Sonabend-W, Rajarshi Mukherjee, Tianxi Cai
摘要
Large health care data repositories such as electronic health records (EHR) open new opportunities to derive individualized treatment strategies for complicated diseases such as sepsis. In this paper, we consider the problem of estimating sequential treatment rules tailored to a patient’s individual characteristics, often referred to as dynamic treatment regimes (DTRs). Our main objective is to find the optimal DTR that maximizes a discontinuous value function through direct maximization of Fisher consistent surrogate loss functions. In this regard, we demonstrate that a large class of concave surrogates fails to be Fisher consistent—a behavior that differs from the classical binary classification problems. We further characterize a nonconcave family of Fisher consistent smooth surrogate functions, which is amenable to gradient-descent type optimization algorithms. Compared to the existing direct search approach under the support vector machine framework (J. Amer. Statist. Assoc. 110 (2015) 583–598), our proposed DTR estimation via surrogate loss optimization (DTRESLO) method is more computationally scalable to large sample sizes and allows for broader functional classes for treatment policies. We establish theoretical properties for our proposed DTR estimator and obtain a sharp upper bound on the regret corresponding to our DTRESLO method. The finite sample performance of our proposed estimator is evaluated through extensive simulations. We also illustrate the working principles and benefits of our method for estimating an optimal DTR for treating sepsis using EHR data from sepsis patients admitted to intensive care units.
AoS Other · 发表于 2024-04-01
Jinyuan Chang, Qiao Hu, Eric D. Kolaczyk, Qiwei Yao, Fengting Yi
摘要
A standing challenge in data privacy is the trade-off between the level of privacy and the efficiency of statistical inference. Here, we conduct an in-depth study of this trade-off for parameter estimation in the β-model (Ann. Appl. Probab. 21 (2011) 1400–1435) for edge differentially private network data released via jittering (J. R. Stat. Soc. Ser. C. Appl. Stat. 66 (2017) 481–500). Unlike most previous approaches based on maximum likelihood estimation for this network model, we proceed via the method of moments. This choice facilitates our exploration of a substantially broader range of privacy levels—corresponding to stricter privacy—than has been to date. Over this new range, we discover our proposed estimator for the parameters exhibits an interesting phase transition, with both its convergence rate and asymptotic variance following one of three different regimes of behavior depending on the level of privacy. Because identification of the operable regime is difficult, if not impossible in practice, we devise a novel adaptive bootstrap procedure to construct uniform inference across different phases. In fact, leveraging this bootstrap we are able to provide for simultaneous inference of all parameters in the β-model (i.e., equal to the number of nodes), which, to our best knowledge, is the first result of its kind. Numerical experiments confirm the competitive and reliable finite sample performance of the proposed inference methods, next to a comparable maximum likelihood method, as well as significant advantages in terms of computational speed and memory.
AoS High-Dimensional Machine Learning · 发表于 2024-04-01
Bernhard Stankewitz
摘要
Increasingly high-dimensional data sets require that estimation methods do not only satisfy statistical guarantees but also remain computationally feasible. In this context, we consider L2-boosting via orthogonal matching pursuit in a high-dimensional linear model and analyze a data-driven early stopping time τ of the algorithm, which is sequential in the sense that its computation is based on the first τ iterations only. This approach is much less costly than established model selection criteria, that require the computation of the full boosting path, which may even be computationally infeasible in truly high-dimensional applications. We prove that sequential early stopping preserves statistical optimality in this setting in terms of a fully general oracle inequality for the empirical risk and recently established optimal convergence rates for the population risk. Finally, an extensive simulation study shows that at a significantly reduced computational cost, the performance of early stopping methods is on par with other state of the art algorithms such as the cross-validated Lasso or model selection via a high-dimensional Akaike criterion based on the full boosting path.
AoS Machine Learning Networks & Graphs · 发表于 2024-04-01
Matias D. Cattaneo, Rajita Chandak, Jason M. Klusowski
摘要
We develop a theoretical framework for the analysis of oblique decision trees, where the splits at each decision node occur at linear combinations of the covariates (as opposed to conventional tree constructions that force axis-aligned splits involving only a single covariate). While this methodology has garnered significant attention from the computer science and optimization communities since the mid-80s, the advantages they offer over their axis-aligned counterparts remain only empirically justified, and explanations for their success are largely based on heuristics. Filling this long-standing gap between theory and practice, we show that oblique regression trees (constructed by recursively minimizing squared error) satisfy a type of oracle inequality and can adapt to a rich library of regression models consisting of linear combinations of ridge functions and their limit points. This provides a quantitative baseline to compare and contrast decision trees with other less interpretable methods, such as projection pursuit regression and neural networks, which target similar model forms. Contrary to popular belief, one needs not always trade-off interpretability with accuracy. Specifically, we show that, under suitable conditions, oblique decision trees achieve similar predictive accuracy as neural networks for the same library of regression models. To address the combinatorial complexity of finding the optimal splitting hyperplane at each decision node, our proposed theoretical framework can accommodate many existing computational tools in the literature. Our results rely on (arguably surprising) connections between recursive adaptive partitioning and sequential greedy approximation algorithms for convex optimization problems (e.g., orthogonal greedy algorithms), which may be of independent theoretical interest. Using our theory and methods, we also study oblique random forests.
AoS Other · 发表于 2024-04-01
Richard Nickl
摘要
Let (Xt) be a reflected diffusion process in a bounded convex domain in Rd, solving the stochastic differential equation dXt=∇f(Xt)dt+ 2f(Xt)dWt,t≥0, with Wt a d-dimensional Brownian motion. The data X0,XD,…,XND consist of discrete measurements and the time interval D between consecutive observations is fixed so that one cannot ‘zoom’ into the observed path of the process. The goal is to infer the diffusivity f and the associated transition operator Pt,f. We prove injectivity theorems and stability inequalities for the maps f↦Pt,f↦PD,f, t<D. Using these estimates, we establish the statistical consistency of a class of Bayesian algorithms based on Gaussian process priors for the infinite-dimensional parameter f, and show optimality of some of the convergence rates obtained. We discuss an underlying relationship between the degree of ill-posedness of this inverse problem and the ‘hot spots’ conjecture from spectral geometry.
AoS Other · 发表于 2024-04-01
Anne van Delft, Holger Dette
摘要
We present a general theory to quantify the uncertainty from imposing structural assumptions on the second-order structure of nonstationary Hilbert space-valued processes, which can be measured via functionals of time-dependent spectral density operators. The second-order dynamics are well known to be elements of the space of trace class operators, the latter is a Banach space of type 1 and of cotype 2, which makes the development of statistical inference tools more challenging. A part of our contribution is to obtain a weak invariance principle as well as concentration inequalities for (functionals of) the sequential time-varying spectral density operator. In addition, we introduce deviation measures in the nonstationary context, and derive corresponding estimators that are asymptotically pivotal. We then apply this framework and propose statistical methodology to investigate the validity of structural assumptions for nonstationary functional data, such as low-rank assumptions in the context of time-varying dynamic fPCA and principle separable component analysis, deviations from stationarity with respect to the square root distance, and deviations from zero functional canonical coherency.
SiM Causal Inference · 发表于 2024-03-31
Ariel Chernofsky, Ronald J. Bosch, Judith J. Lok
摘要
Causal indirect and direct effects provide an interpretable method for decomposing the total effect of an exposure on an outcome into the indirect effect through a mediator and the direct effect through all other pathways. A natural choice for a mediator in a randomized clinical trial is the treatment's targeted biomarker. However, when the mediator is a biomarker, values can be subject to an assay lower limit. The mediator is affected by the treatment and is a putative cause of the outcome, so the assay lower limit presents a compounded problem in mediation analysis. We propose two approaches to estimate indirect and direct effects with a mediator subject to an assay limit: (1) extrapolation and (2) numerical optimization and integration of the observed likelihood. Since these estimation methods solely rely on the so‐called Mediation Formula, they apply to most approaches to causal mediation analysis: natural, separable, and organic indirect, and direct effects. A simulation study compares the two estimation approaches to imputing with half the assay limit. Using HIV interruption study data from the AIDS Clinical Trials Group described in Li et al 2016, AIDS; Lok and Bosch 2021, Epidemiology, we illustrate our methods by estimating the organic/pure indirect effect of a hypothetical HIV curative treatment on viral suppression mediated by two HIV persistence measures: cell‐associated HIV‐RNA and single‐copy plasma HIV‐RNA.
Biometrika Networks & Graphs · 发表于 2024-03-30
X Yu, J Zhu
摘要
Summary: In many real-world networks, it is often observed that subgraphs or higher-order structures of certain configurations, e.g., triangles and by-fans, are overly abundant compared to standard randomly generated networks (Milo et al., 2002). However, statistical models accounting for this phenomenon are limited, especially when community structure is of interest. This limitation is coupled with a lack of community detection methods that leverage subgraphs or higher-order structures. In this paper, we propose a new community detection method that effectively uses higher-order structures in a network. Furthermore, for the community detection accuracy, under an edge-dependent network model that consists of both community and triangle structures, we develop a finite-sample error bound characterized by the expected triangle degree, which leads to the consistency of the proposed method. To the best of our knowledge, this is the first statistical error bound and consistency result for community detection of a single network considering a network model with dependent edges. We also show, in both simulation studies and a real-world data example, that our method unveils network communities that are otherwise invisible to methods that ignore higher-order structures.
SiM High-Dimensional Bayesian Methods · 发表于 2024-03-30
Wei Han, Sanguo Zhang, Shuangge Ma, Mingyang Ren
摘要
Cancer heterogeneity analysis is essential for precision medicine. Most of the existing heterogeneity analyses only consider a single type of data and ignore the possible sparsity of important features. In cancer clinical practice, it has been suggested that two types of data, pathological imaging and omics data, are commonly collected and can produce hierarchical heterogeneous structures, in which the refined sub‐subgroup structure determined by omics features can be nested in the rough subgroup structure determined by the imaging features. Moreover, sparsity pursuit has extraordinary significance and is more challenging for heterogeneity analysis, because the important features may not be the same in different subgroups, which is ignored by the existing heterogeneity analyses. Fortunately, rich information from previous literature (for example, those deposited in PubMed) can be used to assist feature selection in the present study. Advancing from the existing analyses, in this study, we propose a novel sparse hierarchical heterogeneity analysis framework, which can integrate two types of features and incorporate prior knowledge to improve feature selection. The proposed approach has satisfactory statistical properties and competitive numerical performance. A TCGA real data analysis demonstrates the practical value of our approach in analyzing data heterogeneity and sparsity.
SMMR Survival Analysis Clinical Trials · 发表于 2024-03-29
Senmiao Ni, Zihang Zhong, Yang Zhao, Feng Chen, Jingwei Wu, Hao Yu, Jianling Bai
摘要
Cluster randomization trials with survival endpoint are predominantly used in drug development and clinical care research when drug treatments or interventions are delivered at a group level. Unlike conventional cluster randomization design, stratified cluster randomization design is generally considered more effective in reducing the impacts of imbalanced baseline prognostic factors and varying cluster sizes between groups when these stratification factors are adopted in the design. Failure to account for stratification and cluster size variability may lead to underpowered analysis and inaccurate sample size estimation. Apart from the sample size estimation in unstratified cluster randomization trials, there are no development of an explicit sample size formula for survival endpoint when a stratified cluster randomization design is employed. In this article, we present a closed-form sample size formula based on the stratified cluster log-rank statistics for stratified cluster randomization trials with survival endpoint. It provides an integrated solution for sample size estimation that account for cluster size variation, baseline hazard heterogeneity, and the estimated intracluster correlation coefficient based on the preliminary data. Simulation studies show that the proposed formula provides the appropriate sample size for achieving the desired statistical power under various parameter configurations. A real example of a stratified cluster randomization trial in the population with stable coronary heart disease is presented to illustrate our method.
SiM Meta-Analysis & Data Integration Causal Inference Econometrics & Economics · 发表于 2024-03-29
Mengtong Hu, Xu Shi, Peter X.‐K. Song
摘要
Data sharing barriers present paramount challenges arising from multicenter clinical studies where multiple data sources are stored and managed in a distributed fashion at different local study sites. Merging such data sources into a common data storage for a centralized statistical analysis requires a data use agreement, which is often time‐consuming. Data merging may become more burdensome when propensity score modeling is involved in the analysis because combining many confounding variables, and systematic incorporation of this additional modeling in a meta‐analysis has not been thoroughly investigated in the literature. Motivated from a multicenter clinical trial of basal insulin treatment for reducing the risk of post‐transplantation diabetes mellitus, we propose a new inference framework that avoids the merging of subject‐level raw data from multiple sites at a centralized facility but needs only the sharing of summary statistics. Unlike the architecture of federated learning, the proposed collaborative inference does not need a center site to combine local results and thus enjoys maximal protection of data privacy and minimal sensitivity to unbalanced data distributions across data sources. We show theoretically and numerically that the new distributed inference approach has little loss of statistical power compared to the centralized method that requires merging the entire data. We present large‐sample properties and algorithms for the proposed method. We illustrate its performance by simulation experiments and the motivating example on the differential average treatment effect of basal insulin to lower risk of diabetes among kidney‐transplant patients compared to the standard‐of‐care.
SiM Clinical Trials · 发表于 2024-03-28
Lu Cui
摘要
This study is to give a systematic account of sample size adaptation designs (SSADs) and to provide direct proof of the efficiency advantage of general SSADs over group sequential designs (GSDs) from a different perspective. For this purpose, a class of sample size mapping functions to define SSADs is introduced. Under the two‐stage adaptive clinical trial setting, theorems are developed to describe the properties of SSADs. Sufficient conditions are derived and used to prove analytically that SSADs based on the weighted combination test can be uniformly more efficient than GSDs in a range of likely values of the true treatment difference . As shown in various scenarios, given a GSD, a fully adaptive SSAD can be obtained that has sufficient statistical power similar to that of the GSD but has a smaller average sample size for all in the range. The associated sample size savings can be substantial. A practical design example and suggestions on the steps to find efficient SSADs are also provided.
SiM Other · 发表于 2024-03-28
Bethany Heath, Sofía S. Villar, David S. Robertson
摘要
A coordinated testing policy is an essential tool for responding to emerging epidemics, as was seen with COVID‐19. However, it is very difficult to agree on the best policy when there are multiple conflicting objectives. A key objective is minimizing cost, which is why pooled testing (a method that involves pooling samples taken from multiple individuals and analyzing this with a single diagnostic test) has been suggested. In this article, we present results from an extensive and realistic simulation study comparing testing policies based on individually testing subjects with symptoms (a policy resembling the UK strategy at the start of the COVID‐19 pandemic), individually testing subjects at random or pools of subjects randomly combined and tested. To compare these testing methods, a dynamic model compromised of a relationship network and an extended SEIR model is used. In contrast to most existing literature, testing capacity is considered as fixed and limited rather than unbounded. This article then explores the impact of the proportion of symptomatic infections on the expected performance of testing policies. Symptomatic testing performs better than pooled testing unless a low proportion of infections are symptomatic. Additionally, we include the novel feature for testing of non‐compliance and perform a sensitivity analysis for different compliance assumptions. Our results suggest for the pooled testing scheme to be superior to testing symptomatic people individually, only a small proportion of the population () needs to not comply with the testing procedure.
SiM Survival Analysis Clinical Trials Nonparametric & Semiparametric · 发表于 2024-03-28
Dennis Dobler, Kathrin Möllenhoff
摘要
A frequently addressed issue in clinical trials is the comparison of censored paired survival outcomes, for example, when individuals were matched based on their characteristics prior to the analysis. In this regard, a proper incorporation of the dependence structure of the paired censored outcomes is required and, up to now, appropriate methods are only rarely available in the literature. Moreover, existing methods are not motivated by the strive for insights by means of an easy‐to‐interpret parameter. Hence, we seek to develop a new estimand‐driven method to compare the effectiveness of two treatments in the context of right‐censored survival data with matched pairs. With the help of competing risks techniques, the so‐called relative treatment effect is estimated. This estimand describes the probability that individuals under Treatment 1 have a longer lifetime than comparable individuals under Treatment 2. We derive hypothesis tests and confidence intervals based on a studentized version of the estimator, where resampling‐based inference is established by means of a randomization method. In a simulation study, we demonstrate for numerous sample sizes and different amounts of censoring that the developed test exhibits a good power. Finally, we apply the methodology to a well‐known benchmark data set from a trial with patients suffering from diabetic retinopathy.
Biometrics Latent Variables & Mixtures Testing & Uncertainty Nonparametric & Semiparametric · 发表于 2024-03-27
Francesco Bartolucci, Antonio Forcina
摘要
The paper extends the empirical likelihood (EL) approach of Liu et al. to a new and very flexible family of latent class models for capture-recapture data also allowing for serial dependence on previous capture history, conditionally on latent type and covariates. The EL approach allows to estimate the overall population size directly rather than by adding estimates conditional to covariate configurations. A Fisher-scoring algorithm for maximum likelihood estimation is proposed and a more efficient alternative to the traditional EL approach for estimating the non-parametric component is introduced; this allows us to show that the mapping between the non-parametric distribution of the covariates and the probabilities of being never captured is one-to-one and strictly increasing. Asymptotic results are outlined, and a procedure for constructing profile likelihood confidence intervals for the population size is presented. Two examples based on real data are used to illustrate the proposed approach and a simulation study indicates that, when estimating the overall undercount, the method proposed here is substantially more efficient than the one based on conditional maximum likelihood estimation, especially when the sample size is not sufficiently large.
Biometrics Bayesian Methods Survival Analysis · 发表于 2024-03-27
Evan Kwiatkowski, Jiawen Zhu, Xiao Li, Herbert Pang, Grazyna Lieberman, Matthew A Psioda
摘要
We develop a method for hybrid analyses that uses external controls to augment internal control arms in randomized controlled trials (RCTs) where the degree of borrowing is determined based on similarity between RCT and external control patients to account for systematic differences (e.g., unmeasured confounders). The method represents a novel extension of the power prior where discounting weights are computed separately for each external control based on compatibility with the randomized control data. The discounting weights are determined using the predictive distribution for the external controls derived via the posterior distribution for time-to-event parameters estimated from the RCT. This method is applied using a proportional hazards regression model with piecewise constant baseline hazard. A simulation study and a real-data example are presented based on a completed trial in non-small cell lung cancer. It is shown that the case weighted power prior provides robust inference under various forms of incompatibility between the external controls and RCT population.