研究园简易版 · 经典书籍 · 期刊文章 · 有原文 · 完整版(可多选筛选、搜索) · 首页
2024 年的期刊文章 · 第 15 页
共 1515 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2024-06-03 到 2024-05-28。
按期刊、按主题看 →
SiM Clinical Trials · 发表于 2024-06-03
Johannes Krisam, Yevgen Ryeznik, Kerstine Carter, Olga Kuznetsova, Oleksandr Sverdlov
摘要
In a multi‐center randomized controlled trial (RCT) with competitive recruitment, eligible patients are enrolled sequentially by different study centers and are randomized to treatment groups using the chosen randomization method. Given the stochastic nature of the recruitment process, some centers may enroll more patients than others, and in some instances, a center may enroll multiple patients in a row, for example, on a given day. If the study is open‐label, the investigators might be able to make intelligent guesses on upcoming treatment assignments in the randomization sequence, even if the trial is centrally randomized and not stratified by center. In this paper, we use enrollment data inspired by a real multi‐center RCT to quantify the susceptibility of two restricted randomization procedures, the permuted block design and the big stick design, to selection bias under the convergence strategy of Blackwell and Hodges (1957) applied at the center level. We provide simulation evidence that the expected proportion of correct guesses may be greater than 50% (i.e., an increased risk of selection bias) and depends on the chosen randomization method and the number of study patients recruited by a given center that takes consecutive positions on the central allocation schedule. We propose some strategies for ensuring stronger encryption of the randomization sequence to mitigate the risk of selection bias.
SiM Networks & Graphs Bayesian Methods Causal Inference · 发表于 2024-06-03
Xianzheng Huang, Hongmei Zhang
摘要
To study the roles that different nodes play in differentiating Bayesian networks under two states, such as control versus disease, we formulate two node‐specific scores to facilitate such assessment. The first score is motivated by the prediction invariance property of a causal model. The second score results from modifying an existing score constructed for differential analysis of undirected networks. We develop strategies based on these scores to identify nodes responsible for topological differences between two Bayesian networks. Synthetic data and real‐life data from designed experiments are used to demonstrate the efficacy of the proposed methods in detecting responsible nodes.
SiM Survival Analysis Longitudinal Data Bayesian Methods · 发表于 2024-06-03
Danilo Alvares, François Mercier
摘要
Many clinical trials generate both longitudinal biomarker and time‐to‐event data. We might be interested in their relationship, as in the case of tumor size and overall survival in oncology drug development. Many well‐established methods exist for analyzing such data either sequentially (two‐stage models) or simultaneously (joint models). Two‐stage modeling (2stgM) has been challenged (i) for not acknowledging that biomarkers are endogenous covariable to the survival submodel and (ii) for not propagating the uncertainty of the longitudinal biomarker submodel to the survival submodel. On the other hand, joint modeling (JM), which properly circumvents both problems, has been criticized for being time‐consuming, and difficult to use in practice. In this paper, we explore a third approach, referred to as a novel two‐stage modeling (N2stgM). This strategy reduces the model complexity without compromising the parameter estimate accuracy. The three approaches (2stgM, JM, and N2stgM) are formulated, and a Bayesian framework is considered for their implementation. Both real and simulated data were used to analyze the performance of such approaches. In all scenarios, our proposal estimated the parameters approximately as JM but without being computationally expensive, while 2stgM produced biased results.
AoS Nonparametric & Semiparametric · 发表于 2024-06-01
Omar Hagrass, Bharath Sriperumbudur, Bing Li
摘要
Over the last decade, an approach that has gained a lot of popularity to tackle nonparametric testing problems on general (i.e., non-Euclidean) domains is based on the notion of reproducing kernel Hilbert space (RKHS) embedding of probability distributions. The main goal of our work is to understand the optimality of two-sample tests constructed based on this approach. First, we show the popular MMD (maximum mean discrepancy) two-sample test to be not optimal in terms of the separation boundary measured in Hellinger distance. Second, we propose a modification to the MMD test based on spectral regularization by taking into account the covariance information (which is not captured by the MMD test) and prove the proposed test to be minimax optimal with a smaller separation boundary than that achieved by the MMD test. Third, we propose an adaptive version of the above test which involves a data-driven strategy to choose the regularization parameter and show the adaptive test to be almost minimax optimal up to a logarithmic factor. Moreover, our results hold for the permutation variant of the test where the test threshold is chosen elegantly through the permutation of the samples. Through numerical experiments on synthetic and real data, we demonstrate the superior performance of the proposed test in comparison to the MMD test and other popular tests in the literature.
AoS Other · 发表于 2024-06-01
Huiqin Li, Guangming Pan, Yanqing Yin, Wang Zhou
摘要
Motivated by the statistical inference using the Gram matrix in the context of missing at random observations, this paper investigates the spectral properties of the random matrices Sn=1nZZ∗, where Z=D∘(Σ1/2X) represents a Hadamard random matrix with entries determined by independent Bernoulli variables D. Operating within the high-dimensional framework, we establish the convergence of the empirical spectral distribution of Sn to a well-defined limiting distribution. In addition, we explore the impact of the missing mechanism on the second-order properties of the spectral distribution of the Gram matrix Sn. We establish the central limit theorem for the linear spectral statistics of Sn, shedding light on their fluctuations. Surprisingly, our analysis reveals that even in the ideal Gaussian distribution scenario, the fluctuations of statistics generated by eigenvalues are influenced by the eigenvectors of the population covariance matrix in the missing-at-random case. This discovery uncovers a remarkable phenomenon that starkly contrasts with the classical case. Subsequently, we demonstrate the practical application of our central limit theorem in hypothesis testing for the population covariance matrix.
AoS Other · 发表于 2024-06-01
Johannes Brutsche, Angelika Rohde
摘要
Within the nonparametric diffusion model, we develop a multiple test to infer about similarity of an unknown drift b to some reference drift b0: At prescribed significance, we simultaneously identify those regions where violation from similarity occurs, without a priori knowledge of their number, size and location. This test is shown to be minimax-optimal and adaptive. At the same time, the procedure is robust under small deviation from Brownian motion as the driving noise process. A detailed investigation for fractional driving noise, which is neither a semimartingale nor a Markov process, is provided for Hurst indices close to the Brownian motion case.
AoS Causal Inference · 发表于 2024-06-01
Ziang Niu, Abhinav Chakraborty, Oliver Dukes, Eugene Katsevich
摘要
Model-X approaches to testing conditional independence between a predictor and an outcome variable given a vector of covariates usually assume exact knowledge of the conditional distribution of the predictor given the covariates. Nevertheless, model-X methodologies are often deployed with this conditional distribution learned in sample. We investigate the consequences of this choice through the lens of the distilled conditional randomization test (dCRT). We find that Type-I error control is still possible, but only if the mean of the outcome variable given the covariates is estimated well enough. This demonstrates that the dCRT is doubly robust, and motivates a comparison to the generalized covariance measure (GCM) test, another doubly robust conditional independence test. We prove that these two tests are asymptotically equivalent, and show that the GCM test is optimal against (generalized) partially linear alternatives by leveraging semiparametric efficiency theory. In an extensive simulation study, we compare the dCRT to the GCM test. These two tests have broadly similar Type-I error and power, though dCRT can have somewhat better Type-I error control but somewhat worse power in small samples or when the response is discrete. We also find that post-lasso based test statistics (as compared to lasso based statistics) can dramatically improve Type-I error control for both methods.
AoS Optimization & Learning Theory · 发表于 2024-06-01
Tudor Manole, Sivaraman Balakrishnan, Jonathan Niles-Weed, Larry Wasserman
摘要
We analyze a number of natural estimators for the optimal transport map between two distributions and show that they are minimax optimal. We adopt the plugin approach: our estimators are simply optimal couplings between measures derived from our observations, appropriately extended so that they define functions on Rd. When the underlying map is assumed to be Lipschitz, we show that computing the optimal coupling between the empirical measures, and extending it using linear smoothers, already gives a minimax optimal estimator. When the underlying map enjoys higher regularity, we show that the optimal coupling between appropriate nonparametric density estimates yields faster rates. Our work also provides new bounds on the risk of corresponding plugin estimators for the quadratic Wasserstein distance, and we show how this problem relates to that of estimating optimal transport maps using stability arguments for smooth and strongly convex Brenier potentials. As an application of our results, we derive central limit theorems for plugin estimators of the squared Wasserstein distance, which are centered at their population counterpart when the underlying distributions have sufficiently smooth densities. In contrast to known central limit theorems for empirical estimators, this result easily lends itself to statistical inference for the quadratic Wasserstein distance.
AoS High-Dimensional Genetics & Omics Econometrics & Economics · 发表于 2024-06-01
Bingxin Zhao, Shurong Zheng, Hongtu Zhu
摘要
Genetic prediction holds immense promise for translating genetic discoveries into medical advances. As the high-dimensional covariance matrix (or the linkage disequilibrium (LD) pattern) of genetic variants often presents a block-diagonal structure, numerous methods account for the dependence among variants in predetermined local LD blocks. Moreover, due to privacy considerations and data protection concerns, genetic variant dependence in each LD block is typically estimated from external reference panels rather than the original training data set. This paper presents a unified analysis of blockwise and reference panel-based estimators in a high-dimensional prediction framework without sparsity restrictions. We find that, surprisingly, even when the covariance matrix has a block-diagonal structure with well-defined boundaries, blockwise estimation methods adjusting for local dependence can be substantially less accurate than methods controlling for the whole covariance matrix. Further, estimation methods built on the original training data set and external reference panels are likely to have varying performance in high dimensions, which may reflect the cost of having only access to summary level data from the training data set. This analysis is based on novel results in random matrix theory for block-diagonal covariance matrix. We numerically evaluate our results using extensive simulations and real data analysis in the UK Biobank.
AoS Nonparametric & Semiparametric Missing Data & Measurement Error · 发表于 2024-06-01
Torben Sell, Thomas B. Berrett, Timothy I. Cannings
摘要
We introduce a new nonparametric framework for classification problems in the presence of missing data. The key aspect of our framework is that the regression function decomposes into an anova-type sum of orthogonal functions, of which some (or even many) may be zero. Working under a general missingness setting, which allows features to be missing not at random, our main goal is to derive the minimax rate for the excess risk in this problem. In addition to the decomposition property, the rate depends on parameters that control the tail behaviour of the marginal feature distributions, the smoothness of the regression function and a margin condition. The ambient data dimension does not appear in the minimax rate, which can therefore be faster than in the classical nonparametric setting. We further propose a new method, called the Hard-thresholding Anova Missing data (HAM) classifier, based on a careful combination of a k-nearest neighbour algorithm and a thresholding step. The HAM classifier attains the minimax rate up to polylogarithmic factors and numerical experiments further illustrate its utility.
AoS Nonparametric & Semiparametric High-Dimensional · 发表于 2024-06-01
Dohyeong Ki, Billy Fang, Adityanand Guntuboyina
摘要
Multivariate adaptive regression splines (MARS) is a popular method for nonparametric regression introduced by Friedman in 1991. MARS fits simple nonlinear and non-additive functions to regression data. We propose and study a natural lasso variant of the MARS method. Our method is based on least squares estimation over a convex class of functions obtained by considering infinite-dimensional linear combinations of functions in the MARS basis and imposing a variation based complexity constraint. Our estimator can be computed via finite-dimensional convex optimization, although it is defined as a solution to an infinite-dimensional optimization problem. Under a few standard design assumptions, we prove that our estimator achieves a rate of convergence that depends only logarithmically on dimension and thus avoids the usual curse of dimensionality to some extent. We also show that our method is naturally connected to nonparametric estimation techniques based on smoothness constraints. We implement our method with a cross-validation scheme for the selection of the involved tuning parameter and compare it to the usual MARS method in various simulation and real data settings.
AoS Testing & Uncertainty · 发表于 2024-06-01
Tijana Zrnic, William Fithian
摘要
Selective inference is the problem of giving valid answers to statistical questions chosen in a data-driven manner. A standard solution to selective inference is simultaneous inference, which delivers valid answers to the set of all questions that could possibly have been asked. However, simultaneous inference can be unnecessarily conservative if this set includes many questions that were unlikely to be asked in the first place. We introduce a less conservative solution to selective inference that we call locally simultaneous inference, which only answers those questions that could plausibly have been asked in light of the observed data, all the while preserving rigorous type I error guarantees. For example, if the objective is to construct a confidence interval for the “winning” treatment effect in a clinical trial with multiple treatments, and it is obvious in hindsight that only one treatment had a chance to win, then our approach will return an interval that is nearly the same as the uncorrected, standard interval. Locally simultaneous inference is implemented by refining any method for simultaneous inference of interest. Under mild conditions satisfied by common confidence intervals, locally simultaneous inference strictly dominates its underlying simultaneous inference method, meaning it can never yield less statistical power but only more. Compared to conditional selective inference, which demands stronger guarantees, locally simultaneous inference is more easily applicable in nonparametric settings and is more numerically stable.
AoS High-Dimensional Spatial & Time Series · 发表于 2024-06-01
Yi Ding, Xinghua Zheng
摘要
We study the estimation of high-dimensional covariance matrices and their empirical spectral distributions under dynamic volatility models. Data under such models have nonlinear dependency both cross-sectionally and temporally. We establish the condition under which the limiting spectral distribution (LSD) of the sample covariance matrix under scalar BEKK models is different from the i.i.d. case. We then propose a time-variation adjusted (TV-adj) sample covariance matrix and prove that its LSD follows the Marčenko–Pastur law. Based on the asymptotics of the TV-adj sample covariance matrix, we develop a consistent population spectrum estimator and an asymptotically optimal nonlinear shrinkage estimator of the unconditional covariance matrix.
AoS Nonparametric & Semiparametric Meta-Analysis & Data Integration · 发表于 2024-06-01
Xi Chen, Wenbo Jing, Weidong Liu, Yichen Zhang
摘要
The development of modern technology has enabled data collection of unprecedented size, which poses new challenges to many statistical estimation and inference problems. This paper studies the maximum score estimator of a semiparametric binary choice model under a distributed computing environment without prespecifying the noise distribution. An intuitive divide-and-conquer estimator is computationally expensive and restricted by a nonregular constraint on the number of machines, due to the highly nonsmooth nature of the objective function. We propose (1) a one-shot divide-and-conquer estimator after smoothing the objective to relax the constraint, and (2) a multiround estimator to completely remove the constraint via iterative smoothing. We specify an adaptive choice of kernel smoother with a sequentially shrinking bandwidth to achieve the superlinear improvement of the optimization error over multiple iterations. The improved statistical accuracy per iteration is derived, and a quadratic convergence up to the optimal statistical error rate is established. We further provide two generalizations to handle the heterogeneity of data sets and high-dimensional problems where the parameter of interest is sparse.
AoS Bayesian Methods · 发表于 2024-06-01
Filippo Ascolani, Giacomo Zanella
摘要
Gibbs samplers are popular algorithms to approximate posterior distributions arising from Bayesian hierarchical models. Despite their popularity and good empirical performance, however, there are still relatively few quantitative results on their convergence properties, for example, much less than for gradient-based sampling methods. In this work, we analyse the behaviour of total variation mixing times of Gibbs samplers targeting hierarchical models using tools from Bayesian asymptotics. We obtain dimension-free convergence results under random data-generating assumptions for a broad class of two-level models with generic likelihood function. Specific examples with Gaussian, binomial and categorical likelihoods are discussed.
AoS Machine Learning Networks & Graphs · 发表于 2024-06-01
YinFeng Chen, YuLing Jiao, Rui Qiu, Zhou Yu
摘要
Linear sufficient dimension reduction, as exemplified by sliced inverse regression, has seen substantial development in the past thirty years. However, with the advent of more complex scenarios, nonlinear dimension reduction has gained considerable interest recently. This paper introduces a novel method for nonlinear sufficient dimension reduction, utilizing the generalized martingale difference divergence measure in conjunction with deep neural networks. The optimal solution of the proposed objective function is shown to be unbiased at the general level of σ-fields. And two optimization schemes, based on the fascinating deep neural networks, exhibit higher efficiency and flexibility compared to the classical eigendecomposition of linear operators. Moreover, we systematically investigate the slow rate and fast rate for the estimation error based on advanced U-process theory. Remarkably, the fast rate almost coincides with the minimax rate of nonparametric regression. The validity of our deep nonlinear sufficient dimension reduction methods is demonstrated through simulations and real data analysis.
AoS Spatial & Time Series High-Dimensional · 发表于 2024-06-01
Haotian Xu, Daren Wang, Zifeng Zhao, Yi Yu
摘要
This paper concerns the limiting distributions of change-point estimators, in a high-dimensional linear regression time-series context, where a regression object (yt,Xt)∈R×Rp is observed at every time point t∈{1,…,n}. At unknown time points, called change points, the regression coefficients change, with the jump sizes measured in ℓ2-norm. We provide limiting distributions of the change-point estimators in the regimes where the minimal jump size vanishes and where it remains a constant. We allow for both the covariate and noise sequences to be temporally dependent, in the functional dependence framework, which is the first time seen in the change-point inference literature. We show that a block-type long-run variance estimator is consistent under the functional dependence, which facilitates the practical implementation of our derived limiting distributions. We also present a few important byproducts of our analysis, which are of their own interest. These include a novel variant of the dynamic programming algorithm to boost the computational efficiency, consistent change-point localization rates under temporal dependence and a new Bernstein inequality for data possessing functional dependence. Extensive numerical results are provided to support our theoretical results. The proposed methods are implemented in the R package changepoints (Xu et al. (2022)).
AoS Spatial & Time Series · 发表于 2024-06-01
Yanglei Song, Georgios Fellouris
摘要
A novel sequential change detection problem is proposed, in which the goal is to not only detect but also accelerate the change. Specifically, it is assumed that the sequentially collected observations are responses to treatments selected in real time. The assigned treatments determine the pre-change and post-change distributions of the responses and also influence when the change happens. The goal is to find a treatment assignment rule and a stopping rule that minimize the expected total number of observations subject to a user-specified bound on the false alarm probability. The optimal solution is obtained under a general Markovian change-point model. Moreover, an alternative procedure is proposed, whose applicability is not restricted to Markovian change-point models and whose design requires minimal computation. For a large class of change-point models, the proposed procedure is shown to achieve the optimal performance in an asymptotic sense. Finally, its performance is found in simulation studies to be comparable to the optimal, uniformly with respect to the error probability.
AoS Spatial & Time Series Nonparametric & Semiparametric · 发表于 2024-06-01
Haihan Yu, Mark S. Kaiser, Daniel J. Nordman
摘要
Frequency domain analysis of time series is often difficult, as periodogram-based statistics involve non-linear averages with complicated variances. Due to the latter, nonparametric approximations from resampling or empirical likelihood (EL) are useful. However, current versions of periodogram-based EL for time series are highly restricted: these are valid only for linear processes and for special parameters (i.e., ratios). For general frequency domain inference with stationary, weakly dependent time series, we develop a spectral EL (SEL) method by combining two previously separate EL frameworks for time series: block-based EL and periodogram-based EL. This hybridization strategy is new and theoretically non-trivial, particularly as existing block-based EL relies on time domain averages that differ substantially from frequency domain counterparts. We formulate SEL statistics for parameters based on spectral estimating functions and periodogram subsamples. Under mild conditions, SEL log-ratio statistics are shown to be well-defined, admitting chi-square limits. Further, we formally establish an effective bootstrap procedure coupled with SEL. As a result, the SEL method can be used for nonparametric, asymptotically correct confidence regions and tests for frequency domain inference without explicit estimation of intricate variances of periodogram-based statistics. This broadly extends the applicability of EL for time series in three directions: (i) SEL can treat any spectral mean parameters; (ii) SEL is valid for both linear and non-linear processes; and (iii) SEL has a provable bootstrap development, which is rare for time series EL, and provides a novel alternative to other resampling approximations in the frequency domain. Simulation studies suggest the proposed method performs well compared to other non-EL approaches. A real data example demonstrates that SEL has application and extension to complicated scenarios.
Biometrics Other · 发表于 2024-05-31
Xiaoqing Ye, Feifang Hu, Wei Ma
摘要
Doubly adaptive biased coin design (DBCD), a response-adaptive randomization scheme, aims to skew subject assignment probabilities based on accrued responses for ethical considerations. Recent years have seen substantial advances in understanding DBCD’s theoretical properties, assuming correct model specification for the responses. However, concerns have been raised about the impact of model misspecification on its design and analysis. In this paper, we assess the robustness to both design model misspecification and analysis model misspecification under DBCD. On one hand, we confirm that the consistency and asymptotic normality of the allocation proportions can be preserved, even when the responses follow a distribution other than the one imposed by the design model during the implementation of DBCD. On the other hand, we extensively investigate three commonly used linear regression models for estimating and inferring the treatment effect, namely difference-in-means, analysis of covariance (ANCOVA) I, and ANCOVA II. By allowing these regression models to be arbitrarily misspecified, thereby not reflecting the true data generating process, we derive the consistency and asymptotic normality of the treatment effect estimators evaluated from the three models. The asymptotic properties show that the ANCOVA II model, which takes covariate-by-treatment interaction terms into account, yields the most efficient estimator. These results can provide theoretical support for using DBCD in scenarios involving model misspecification, thereby promoting the widespread application of this randomization procedure.
JASA Other · 发表于 2024-05-31
Kun Meng, Jinyu Wang, Lorin Crawford, Ani Eloyan
摘要
In this article, we establish the mathematical foundations for modeling the randomness of shapes and conducting statistical inference on shapes using the smooth Euler characteristic transform. Based on these foundations, we propose two chi-squared statistic-based algorithms for testing hypotheses on random shapes. Simulation studies are presented to validate our mathematical derivations and to compare our algorithms with state-of-the-art methods to demonstrate the utility of our proposed framework. As real applications, we analyze a data set of mandibular molars from four genera of primates and show that our algorithms have the power to detect significant shape differences that recapitulate known morphological variation across suborders. Altogether, our discussions bridge the following fields: algebraic and computational topology, probability theory and stochastic processes, Sobolev spaces and functional analysis, analysis of variance for functional data, and geometric morphometrics. *(abstract via OpenAlex)*
Biometrics Causal Inference Longitudinal Data · 发表于 2024-05-31
Hongxiang Qiu, Xu Shi, Wang Miao, Edgar Dobriban, Eric Tchetgen Tchetgen
摘要
To infer the treatment effect for a single treated unit using panel data, synthetic control (SC) methods construct a linear combination of control units’ outcomes that mimics the treated unit’s pre-treatment outcome trajectory. This linear combination is subsequently used to impute the counterfactual outcomes of the treated unit had it not been treated in the post-treatment period, and used to estimate the treatment effect. Existing SC methods rely on correctly modeling certain aspects of the counterfactual outcome generating mechanism and may require near-perfect matching of the pre-treatment trajectory. Inspired by proximal causal inference, we obtain two novel nonparametric identifying formulas for the average treatment effect for the treated unit: one is based on weighting, and the other combines models for the counterfactual outcome and the weighting function. We introduce the concept of covariate shift to SCs to obtain these identification results conditional on the treatment assignment. We also develop two treatment effect estimators based on these two formulas and generalized method of moments. One new estimator is doubly robust: it is consistent and asymptotically normal if at least one of the outcome and weighting models is correctly specified. We demonstrate the performance of the methods via simulations and apply them to evaluate the effectiveness of a pneumococcal conjugate vaccine on the risk of all-cause pneumonia in Brazil.
JASA Causal Inference · 发表于 2024-05-31
Ye Shen, Hengrui Cai, Rui Song
摘要
Evaluating the performance of an ongoing policy plays a vital role in many areas such as medicine and economics, to provide crucial instructions on the early-stop of the online experiment and timely feedback from the environment. Policy evaluation in online learning thus attracts increasing attention by inferring the mean outcome of the optimal policy (i.e., the value) in real-time. Yet, such a problem is particularly challenging due to the dependent data generated in the online environment, the unknown optimal policy, and the complex exploration and exploitation tradeoff in the adaptive experiment. In this article, we aim to overcome these difficulties in policy evaluation for online learning. We explicitly derive the probability of exploration that quantifies the probability of exploring nonoptimal actions under commonly used bandit algorithms. We use this probability to conduct valid inference on the online conditional mean estimator under each action and develop the doubly robust interval estimation (DREAM) method to infer the value under the estimated optimal policy in online learning. The proposed value estimator provides double protection for consistency and is asymptotically normal with a Wald-type confidence interval provided. Extensive simulation studies and real data applications are conducted to demonstrate the empirical validity of the proposed DREAM method. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work. *(abstract via OpenAlex)*
Biometrics Bayesian Methods Meta-Analysis & Data Integration · 发表于 2024-05-31
Thanthirige Lakshika M Ruberu, Danielle Braun, Giovanni Parmigiani, Swati Biswas
摘要
Multi-gene panel testing allows many cancer susceptibility genes to be tested quickly at a lower cost making such testing accessible to a broader population. Thus, more patients carrying pathogenic germline mutations in various cancer-susceptibility genes are being identified. This creates a great opportunity, as well as an urgent need, to counsel these patients about appropriate risk-reducing management strategies. Counseling hinges on accurate estimates of age-specific risks of developing various cancers associated with mutations in a specific gene, ie, penetrance estimation. We propose a meta-analysis approach based on a Bayesian hierarchical random-effects model to obtain penetrance estimates by integrating studies reporting different types of risk measures (eg, penetrance, relative risk, odds ratio) while accounting for the associated uncertainties. After estimating posterior distributions of the parameters via a Markov chain Monte Carlo algorithm, we estimate penetrance and credible intervals. We investigate the proposed method and compare with an existing approach via simulations based on studies reporting risks for two moderate-risk breast cancer susceptibility genes, ATM and PALB2. Our proposed method is far superior in terms of coverage probability of credible intervals and mean square error of estimates. Finally, we apply our method to estimate the penetrance of breast cancer among carriers of pathogenic mutations in the ATM gene.
SiM Other · 发表于 2024-05-30
James J. Yang, Megan E. Piper, Premananda Indic, Anne Buu
摘要
The prevalence of e‐cigarette use among young adults in the USA is high (14%). Although the majority of users plan to quit vaping, the motivation to make a quit attempt is low and available support during a quit attempt is limited. Using wearable sensors to collect physiological data (eg, heart rate) holds promise for capturing the right timing to deliver intervention messages. This study aims to fill the current knowledge gap by proposing statistical methods to (1) de‐noise beat‐to‐beat interval (BBI) data from smartwatches worn by 12 young adult regular e‐cigarette users for 7 days; and (2) summarize the de‐noised data by event and control segments. We also conducted a comprehensive review of conventional methods for summarizing heart rate variability (HRV) and compared their performance with the proposed method. The results show that the proposed singular spectrum analysis (SSA) can effectively de‐noise the highly variable BBI data, as well as quantify the proportion of total variation extracted. Compared to existing HRV methods, the proposed second order polynomial model yields the highest area under the curve (AUC) value of 0.76 and offers better interpretability. The findings also indicate that the average heart rate before vaping is higher and there is an increasing trend in the heart rate before the vaping event. Importantly, the development of increasing heart rate observed in this study implies that there may be time to intervene as this physiological signal emerges. This finding, if replicated in a larger scale study, may inform optimal timings for delivering messages in future intervention.
SMMR Clinical Trials Causal Inference · 发表于 2024-05-30
Jingxia Liu, Fan Li
摘要
Cluster randomized crossover and stepped wedge cluster randomized trials are two types of longitudinal cluster randomized trials that leverage both the within- and between-cluster comparisons to estimate the treatment effect and are increasingly used in healthcare delivery and implementation science research. While the variance expressions of estimated treatment effect have been previously developed from the method of generalized estimating equations for analyzing cluster randomized crossover trials and stepped wedge cluster randomized trials, little guidance has been provided for optimal designs to ensure maximum efficiency. Here, an optimal design refers to the combination of optimal cluster-period size and optimal number of clusters that provide the smallest variance of the treatment effect estimator or maximum efficiency under a fixed total budget. In this work, we develop optimal designs for multiple-period cluster randomized crossover trials and stepped wedge cluster randomized trials with continuous outcomes, including both closed-cohort and repeated cross-sectional sampling schemes. Local optimal design algorithms are proposed when the correlation parameters in the working correlation structure are known. MaxiMin optimal design algorithms are proposed when the exact values are unavailable, but investigators may specify a range of correlation values. The closed-form formulae of local optimal design and MaxiMin optimal design are derived for multiple-period cluster randomized crossover trials, where the cluster-period size and number of clusters are decimal. The decimal estimates from closed-form formulae can then be used to investigate the performances of integer estimates from local optimal design and MaxiMin optimal design algorithms. One unique contribution from this work, compared to the previous optimal design research, is that we adopt constrained optimization techniques to obtain integer estimates under the MaxiMin optimal design. To assist practical implementation, we also develop four SAS macros to find local optimal designs and MaxiMin optimal designs.
JASA Networks & Graphs Bayesian Methods Latent Variables & Mixtures · 发表于 2024-05-30
Giovanni Rebaudo, Peter Müller
摘要
Bayesian nonparametric mixtures and random partition models are powerful tools for probabilistic clustering. However, standard independent mixture models can be restrictive in some applications such as inference on cell lineage due to the biological relations of the clusters. The increasing availability of large genomic data requires new statistical tools to perform model-based clustering and infer the relationship between homogeneous subgroups of units. Motivated by single-cell RNA data we develop a novel dependent mixture model to jointly perform cluster analysis and align the clusters on a graph. Our flexible graph-aligned random partition model (GARP) exploits Gibbs-type priors as building blocks, allowing us to derive analytical results for the probability mass function (pmf) on the graph-aligned random partition. We derive a generalization of the Chinese restaurant process from the pmf and a related efficient and neat MCMC algorithm to implement Bayesian inference. We illustrate posterior inference under the GARP using single-cell RNA-seq data from mice stem cells. We further investigate the performance of the model in recovering the underlying clustering structure as well as the underlying graph by means of simulation studies. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work. *(abstract via OpenAlex)*
SiM Clinical Trials Diagnostics & Prediction · 发表于 2024-05-30
Jialu Fang, Guosheng Yin
摘要
The calibration‐free odds (CFO) design has been demonstrated to be robust, model‐free, and practically useful but faces challenges when dealing with late‐onset toxicity. The emergence of the time‐to‐event (TITE) method and fractional method leads to the development of TITE‐CFO and fractional CFO (fCFO) designs to accumulate delayed toxicity. Nevertheless, existing CFO‐type designs have untapped potential because they primarily consider dose information from the current position and its two neighboring positions. To incorporate information from all doses, we propose the accumulative CFO (aCFO) design by utilizing data at all dose levels similar to a tug‐of‐war game where players distant from the center also contribute their strength. This approach enhances full information utilization while still preserving the model‐free and calibration‐free characteristics. Extensive simulation studies demonstrate performance improvement over the original CFO design, emphasizing the advantages of incorporating information from a broader range of dose levels. Furthermore, we propose to incorporate late‐onset outcomes into the TITE‐aCFO and f‐aCFO designs, with f‐aCFO displaying superior performance over existing methods in both fixed and random simulation scenarios. In conclusion, the aCFO and f‐aCFO designs can be considered robust, efficient, and user‐friendly approaches for conducting phase I trials without or with late‐onsite toxicity.
SiM Other · 发表于 2024-05-30
Matthew Dodd, James Carpenter, Jennifer A. Thompson, Elizabeth Williamson, Katherine Fielding, Diana Elbourne
摘要
Background: Non‐inferiority trials comparing different active drugs are often subject to treatment non‐adherence. Intention‐to‐treat (ITT) and per‐protocol (PP) analyses have been advocated in such studies but are not guaranteed to be unbiased in the presence of differential non‐adherence. Methods: The REMoxTB trial evaluated two 4‐month experimental regimens compared with a 6‐month control regimen for newly diagnosed drug‐susceptible TB. The primary endpoint was a composite unfavorable outcome of treatment failure or recurrence within 18 months post‐randomization. We conducted a simulation study based on REMoxTB to assess the performance of statistical methods for handling non‐adherence in non‐inferiority trials, including: ITT and PP analyses, adjustment for observed adherence, multiple imputation (MI) of outcomes, inverse‐probability‐of‐treatment weighting (IPTW), and a doubly‐robust (DR) estimator. Results: When non‐adherence differed between trial arms, ITT, and PP analyses often resulted in non‐trivial bias in the estimated treatment effect, which consequently under‐ or over‐inflated the type I error rate. Adjustment for observed adherence led to similar issues, whereas the MI, IPTW and DR approaches were able to correct bias under most non‐adherence scenarios; they could not always eliminate bias entirely in the presence of unobserved confounding. The IPTW and DR methods were generally unbiased and maintained desired type I error rates and statistical power. Conclusions: When non‐adherence differs between trial arms, ITT and PP analyses can produce biased estimates of efficacy, potentially leading to the acceptance of inferior treatments or efficacious regimens being missed. IPTW and the DR estimator are relatively straightforward methods to supplement ITT and PP approaches.
SiM Causal Inference · 发表于 2024-05-30
Eli Ben‐Michael, Lindsay Page, Luke Keele
摘要
In a clustered observational study, a treatment is assigned to groups and all units within the group are exposed to the treatment. We develop a new method for statistical adjustment in clustered observational studies using approximate balancing weights, a generalization of inverse propensity score weights that solve a convex optimization problem to find a set of weights that directly minimize a measure of covariate imbalance, subject to an additional penalty on the variance of the weights. We tailor the approximate balancing weights optimization problem to the clustered observational study setting by deriving an upper bound on the mean square error and finding weights that minimize this upper bound, linking the level of covariate balance to a bound on the bias. We implement the procedure by specializing the bound to a random cluster‐level effects model, leading to a variance penalty that incorporates the signal‐to‐noise ratio and penalizes the weight on individuals and the total weight on groups differently according to the the intra‐class correlation.
SMMR Clinical Trials Longitudinal Data · 发表于 2024-05-29
Yongdong Ouyang, Monica Taljaard, Andrew B Forbes, Fan Li
摘要
Linear mixed models are commonly used in analyzing stepped-wedge cluster randomized trials. A key consideration for analyzing a stepped-wedge cluster randomized trial is accounting for the potentially complex correlation structure, which can be achieved by specifying random-effects. The simplest random effects structure is random intercept but more complex structures such as random cluster-by-period, discrete-time decay, and more recently, the random intervention structure, have been proposed. Specifying appropriate random effects in practice can be challenging: assuming more complex correlation structures may be reasonable but they are vulnerable to computational challenges. To circumvent these challenges, robust variance estimators may be applied to linear mixed models to provide consistent estimators of standard errors of fixed effect parameters in the presence of random-effects misspecification. However, there has been no empirical investigation of robust variance estimators for stepped-wedge cluster randomized trials. In this article, we review six robust variance estimators (both standard and small-sample bias-corrected robust variance estimators) that are available for linear mixed models in R, and then describe a comprehensive simulation study to examine the performance of these robust variance estimators for stepped-wedge cluster randomized trials with a continuous outcome under different data generators. For each data generator, we investigate whether the use of a robust variance estimator with either the random intercept model or the random cluster-by-period model is sufficient to provide valid statistical inference for fixed effect parameters, when these working models are subject to random-effect misspecification. Our results indicate that the random intercept and random cluster-by-period models with robust variance estimators performed adequately. The CR3 robust variance estimator (approximate jackknife) estimator, coupled with the number of clusters minus two degrees of freedom correction, consistently gave the best coverage results, but could be slightly conservative when the number of clusters was below 16. We summarize the implications of our results for the linear mixed model analysis of stepped-wedge cluster randomized trials and offer some practical recommendations on the choice of the analytic model.
SiM Survival Analysis Causal Inference Nonparametric & Semiparametric · 发表于 2024-05-29
Layla Parast, Lu Tian, Tianxi Cai
摘要
Determining whether a surrogate marker can be used to replace a primary outcome in a clinical study is complex. While many statistical methods have been developed to formally evaluate a surrogate marker, they generally do not provide a way to examine heterogeneity in the utility of a surrogate marker. Similar to treatment effect heterogeneity, where the effect of a treatment varies based on a patient characteristic, heterogeneity in surrogacy means that the strength or utility of the surrogate marker varies based on a patient characteristic. The few methods that have been recently developed to examine such heterogeneity cannot accommodate censored data. Studies with a censored outcome are typically the studies that could most benefit from a surrogate because the follow‐up time is often long. In this paper, we develop a robust nonparametric approach to assess heterogeneity in the utility of a surrogate marker with respect to a baseline variable in a censored time‐to‐event outcome setting. In addition, we propose and evaluate a testing procedure to formally test for heterogeneity at a single time point or across multiple time points simultaneously. Finite sample performance of our estimation and testing procedure are examined in a simulation study. We use our proposed method to investigate the complex relationship between change in fasting plasma glucose, diabetes, and sex hormones using data from the diabetes prevention program study.
SiM Survival Analysis High-Dimensional Networks & Graphs · 发表于 2024-05-28
Guanbo Wang, Yi Lian, Archer Y. Yang, Robert W. Platt, Rui Wang, Sylvie Perreault, Marc Dorais, Mireille E. Schnitzer
摘要
Cox models with time‐dependent coefficients and covariates are widely used in survival analysis. In high‐dimensional settings, sparse regularization techniques are employed for variable selection, but existing methods for time‐dependent Cox models lack flexibility in enforcing specific sparsity patterns (ie, covariate structures). We propose a flexible framework for variable selection in time‐dependent Cox models, accommodating complex selection rules. Our method can adapt to arbitrary grouping structures, including interaction selection, temporal, spatial, tree, and directed acyclic graph structures. It achieves accurate estimation with low false alarm rates. We develop the sox package, implementing a network flow algorithm for efficiently solving models with complex covariate structures. sox offers a user‐friendly interface for specifying grouping structures and delivers fast computation. Through examples, including a case study on identifying predictors of time to all‐cause death in atrial fibrillation patients, we demonstrate the practical application of our method with specific selection rules.