2021 年的期刊文章 · 第 29 页

共 1542 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2021-01-19 到 2021。

按期刊、按主题看 →

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

JASA Other · 发表于 2021-01-19

Functional Sequential Treatment Allocation

Anders Bredahl Kock, David Preinerstorfer, Bezirgen Veliyev

摘要

Consider a setting in which a policy maker assigns subjects to treatments, observing each outcome before the next subject arrives. Initially, it is unknown which treatment is best, but the sequential nature of the problem permits learning about the effectiveness of the treatments. While the multi-armed-bandit literature has shed much light on the situation when the policy maker compares the effectiveness of the treatments through their mean, much less is known about other targets. This is restrictive, because a cautious decision maker may prefer to target a robust location measure such as a quantile or a trimmed mean. Furthermore, socio-economic decision making often requires targeting purpose specific characteristics of the outcome distribution, such as its inherent degree of inequality, welfare or poverty. In the present article, we introduce and study sequential learning algorithms when the distributional characteristic of interest is a general functional of the outcome distribution. Minimax expected regret optimality results are obtained within the subclass of explore-then-commit policies, and for the unrestricted class of all policies. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

SiM Causal Inference · 发表于 2021-01-19

A powerful test for the maximum treatment effect in thorough QT/QTc studies

Yuhao Deng, Fangyi Chen, Yang Li, Kaihuan Qian, Rui Wang, Xiao‐Hua Zhou

摘要

Parallel‐group thorough QT/QTc studies focus on the change of QT/QTc values at several time‐matched points from a pretreatment day (baseline) to a posttreatment day for different groups of treatment. The International Council for Harmonisation E14 stresses that QTc prolongation beyond a threshold represents high cardiac risk and calls for a test on the largest time‐matched treatment effect (QTc prolongation). QT/QTc analysis usually assumes a jointly multivariate normal (MVN) distribution of pretreatment and posttreatment QT/QTc values, with a blocked compound symmetry covariance matrix. Existing methods use an analysis of covariance (ANCOVA) model including day‐averaged baseline as a covariate to deal with the MVN model. However, the ANCOVA model tends to underestimate the variation of the estimator for treatment effects, resulting in the inflation of empirical type I error rate when testing whether the largest QTc prolongation is beyond a threshold. In this article, we propose two new methods to estimate the time‐matched treatment effects under the MVN model, including maximum likelihood estimation and ordinary‐least‐square‐based two‐stage estimation. These two methods take advantage of the covariance structure and are asymptotically efficient. Based on these estimators, powerful tests for QT/QTc prolongation are constructed. Simulation shows that the proposed estimators have smaller mean square error, and the tests can control the type I error rate with high power. The proposed methods are applied on testing the carryover effect of diltiazem to inhibit dofetilide in a randomized phase 1 trial.

SiM Causal Inference · 发表于 2021-01-18

A comparison of parametric propensityscore‐basedmethods for causal inference with multiple treatments and a binary outcome

Youfei Yu, Min Zhang, Xu Shi, Megan E. V. Caram, Roderick J. A. Little, Bhramar Mukherjee

摘要

We consider comparative effectiveness research (CER) from observational data with two or more treatments. In observational studies, the estimation of causal effects is prone to bias due to confounders related to both treatment and outcome. Methods based on propensity scores are routinely used to correct for such confounding biases. A large fraction of propensity score methods in the current literature consider the case of either two treatments or continuous outcome. There has been extensive literature with multiple treatment and binary outcome, but interest often lies in the intersection, for which the literature is still evolving. The contribution of this article is to focus on this intersection and compare across methods, some of which are fairly recent. We describe propensity‐based methods when more than two treatments are being compared, and the outcome is binary. We assess the relative performance of these methods through a set of simulation studies. The methods are applied to assess the effect of four common therapies for castration‐resistant advanced‐stage prostate cancer. The data consist of medical and pharmacy claims from a large national private health insurance network, with the adverse outcome being admission to the emergency room within a short time window of treatment initiation.

SiM Clinical Trials Bayesian Methods Optimization & Learning Theory · 发表于 2021-01-18

A Bayesian‐bandit adaptive design for N‐of‐1 clinical trials

Sama Shrestha, Sonia Jain

摘要

N‐of‐1 trials, which are randomized, double‐blinded, controlled, multiperiod, crossover trials on a single subject, have been applied to determine the heterogeneity of the individual's treatment effect in precision medicine settings. An aggregated N‐of‐1 design, which can estimate the population effect from these individual trials, is a pragmatic alternative when a randomized controlled trial (RCT) is infeasible. We propose a Bayesian adaptive design for both the individual and aggregated N‐of‐1 trials using a multiarmed bandit framework that is estimated via efficient Markov chain Monte Carlo. A Bayesian hierarchical structure is used to jointly model the individual and population treatment effects. Our proposed adaptive trial design is based on Thompson sampling, which randomly allocates individuals to treatments based on the Bayesian posterior probability of each treatment being optimal. While we use a subject‐specific treatment effect and Bayesian posterior probability estimates to determine an individual's treatment allocation, our hierarchical model facilitates these individual estimates to borrow strength from the population estimates via shrinkage to the population mean. We present the design's operating characteristics and performance via a simulation study motivated by a recently completed N‐of‐1 clinical trial. We demonstrate that from a patient‐centered perspective, subjects are likely to benefit from our adaptive design, in particular, for those individuals that deviate from the overall population effect.

SMMR Clinical Trials Testing & Uncertainty · 发表于 2021-01-17

An automation-based adaptive seamless design for dose selection and confirmation with improved power and efficiency

Lu Cui, Tianyu Zhan, Lanju Zhang, Ziqian Geng, Yihua Gu, Ivan SF Chan

摘要

In a drug development program, the efficacy and safety of multiple doses can be evaluated in patients through a phase 2b dose ranging study. With a demonstrated dose response in the trial, promising doses are identified. Their effectiveness then is further investigated and confirmed in phase 3 studies. Although this two-step approach serves the purpose of the program, in general, it is inefficient because of its prolonged development duration and the exclusion of the phase 2b data in the final efficacy evaluation and confirmation which are only based on phase 3 data. To address the issue, we propose a new adaptive design, which seamlessly integrates the dose finding and confirmation steps under one pivotal study. Unlike existing adaptive seamless phase 2b/3 designs, the proposed design combines the response adaptive randomization, sample size modification, and multiple testing techniques to achieve better efficiency. The design can be easily implemented through an automated randomization process. At the end, a number of targeted doses are selected and their effectiveness is confirmed with guaranteed control of family-wise error rate.

JRSSB High-Dimensional Networks & Graphs · 发表于 2021-01-15

Iterative Alpha Expansion for Estimating Gradient-Sparse Signals from Linear Measurements

Sheng Xu, Zhou Fan

摘要

We consider estimating a piecewise-constant image, or a gradient-sparse signal on a general graph, from noisy linear measurements. We propose and study an iterative algorithm to minimize a penalized least-squares objective, with a penalty given by the “ℓ0-norm” of the signal’s discrete graph gradient. The method uses a non-convex variant of proximal gradient descent, applying the alpha-expansion procedure to approximate the proximal mapping in each iteration, and using a geometric decay of the penalty parameter across iterations to ensure convergence. Under a cut-restricted isometry property for the measurement design, we prove global recovery guarantees for the estimated signal. For standard Gaussian designs, the required number of measurements is independent of the graph structure, and improves upon worst-case guarantees for total-variation (TV) compressed sensing on the 1-D line and 2-D lattice graphs by polynomial and logarithmic factors respectively. The method empirically yields lower mean-squared recovery error compared with TV regularization in regimes of moderate undersampling and moderate to high signal-to-noise, for several examples of changepoint signals and gradient-sparse phantom images.

JASA High-Dimensional Bayesian Methods · 发表于 2021-01-14

Variational Bayes for High-Dimensional Linear Regression With Sparse Priors

Kolyan Ray, Botond Szabó

摘要

We study a mean-field spike and slab variational Bayes (VB) approximation to Bayesian model selection priors in sparse high-dimensional linear regression. Under compatibility conditions on the design matrix, oracle inequalities are derived for the mean-field VB approximation, implying that it converges to the sparse truth at the optimal rate and gives optimal prediction of the response vector. The empirical performance of our algorithm is studied, showing that it works comparably well as other state-of-the-art Bayesian variable selection methods. We also numerically demonstrate that the widely used coordinate-ascent variational inference algorithm can be highly sensitive to the parameter updating order, leading to potentially poor performance. To mitigate this, we propose a novel prioritized updating scheme that uses a data-driven updating order and performs better in simulations. The variational algorithm is implemented in the R package sparsevb. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Testing & Uncertainty · 发表于 2021-01-14

Smaller p -Values via Indirect Information

Peter Hoff

摘要

This article develops p-values for evaluating means of normal populations that make use of indirect or prior information. A p-value of this type is based on a biased frequentist hypothesis test that has optimal average power with respect to a probability distribution that encodes indirect information about the mean parameter, resulting in a smaller p-value if the indirect information is accurate. In a variety of multiparameter settings, we show how to adaptively estimate the indirect information for each mean parameter while still maintaining uniformity of the p-values under their null hypotheses. This is done using a linking model through which indirect information about the mean of one population may be obtained from the data of other populations. Importantly, the linking model does not need to be correct to maintain the uniformity of the p-values under their null hypotheses. This methodology is illustrated in several data analysis scenarios, including small area inference, spatially arranged populations, interactions in linear regression, and generalized linear models. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Other · 发表于 2021-01-14

Robust Post-Matching Inference

Alberto Abadie, Jann Spiess

摘要

Nearest-neighbor matching is a popular nonparametric tool to create balance between treatment and control groups in observational studies. As a preprocessing step before regression, matching reduces the dependence on parametric modeling assumptions. In current empirical practice, however, the matching step is often ignored in the calculation of standard errors and confidence intervals. In this article, we show that ignoring the matching step results in asymptotically valid standard errors if matching is done without replacement and the regression model is correctly specified relative to the population regression function of the outcome variable on the treatment variable and all the covariates used for matching. However, standard errors that ignore the matching step are not valid if matching is conducted with replacement or, more crucially, if the second step regression model is misspecified in the sense indicated above. Moreover, correct specification of the regression model is not required for consistent estimation of treatment effects with matched data. We show that two easily implementable alternatives produce approximations to the distribution of the post-matching estimator that are robust to misspecification. A simulation study and an empirical example demonstrate the empirical relevance of our results. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Survival Analysis · 发表于 2021-01-14

Predicting the Number of Future Events

Qinglong Tian, Fanqi Meng, Daniel J. Nordman, William Q. Meeker

摘要

This article describes prediction methods for the number of future events from a population of units associated with an on-going time-to-event process. Examples include the prediction of warranty returns and the prediction of the number of future product failures that could cause serious threats to property or life. Important decisions such as whether a product recall should be mandated are often based on such predictions. Data, generally right-censored (and sometimes left truncated and right-censored), are used to estimate the parameters of a time-to-event distribution. This distribution can then be used to predict the number of events over future periods of time. Such predictions are sometimes called within-sample predictions and differ from other prediction problems considered in most of the prediction literature. This article shows that the plug-in (also known as estimative or naive) prediction method is not asymptotically correct (i.e., for large amounts of data, the coverage probability always fails to converge to the nominal confidence level). However, a commonly used prediction calibration method is shown to be asymptotically correct for within-sample predictions, and two alternative predictive-distribution-based methods that perform better than the calibration method are presented and justified. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Other · 发表于 2021-01-14

Gaining Outlier Resistance With Progressive Quantiles: Fast Algorithms and Theoretical Studies

Yiyuan She, Zhifeng Wang, Jiahui Shen

摘要

Outliers widely occur in big-data applications and may severely affect statistical estimation and inference. In this article, a framework of outlier-resistant estimation is introduced to robustify an arbitrarily given loss function. It has a close connection to the method of trimming and includes explicit outlyingness parameters for all samples, which in turn facilitates computation, theory, and parameter tuning. To tackle the issues of nonconvexity and nonsmoothness, we develop scalable algorithms with implementation ease and guaranteed fast convergence. In particular, a new technique is proposed to alleviate the requirement on the starting point such that on regular datasets, the number of data resamplings can be substantially reduced. Based on combined statistical and computational treatments, we are able to perform nonasymptotic analysis beyond M-estimation. The obtained resistant estimators, though not necessarily globally or even locally optimal, enjoy minimax rate optimality in both low dimensions and high dimensions. Experiments in regression, classification, and neural networks show excellent performance of the proposed methodology at the occurrence of gross outliers. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

SiM Longitudinal Data Survey & Sampling · 发表于 2021-01-13

Two‐wave two‐phase outcome‐dependent sampling designs, with applications to longitudinal binary data

Ran Tao, Nathaniel D. Mercaldo, Sebastien Haneuse, Jacob M. Maronge, Paul J. Rathouz, Patrick J. Heagerty, Jonathan S. Schildcrout

摘要

Two‐phase outcome‐dependent sampling (ODS) designs are useful when resource constraints prohibit expensive exposure ascertainment on all study subjects. One class of ODS designs for longitudinal binary data stratifies subjects into three strata according to those who experience the event at none, some, or all follow‐up times. For time‐varying covariate effects, exclusively selecting subjects with response variation can yield highly efficient estimates. However, if interest lies in the association of a time‐invariant covariate, or the joint associations of time‐varying and time‐invariant covariates with the outcome, then the optimal design is unknown. Therefore, we propose a class of two‐wave two‐phase ODS designs for longitudinal binary data. We split the second‐phase sample selection into two waves, between which an interim design evaluation analysis is conducted. The interim design evaluation analysis uses first‐wave data to conduct a simulation‐based search for the optimal second‐wave design that will improve the likelihood of study success. Although we focus on longitudinal binary response data, the proposed design is general and can be applied to other response distributions. We believe that the proposed designs can be useful in settings where (1) the expected second‐phase sample size is fixed and one must tailor stratum‐specific sampling probabilities to maximize estimation efficiency, or (2) relative sampling probabilities are fixed across sampling strata and one must tailor sample size to achieve a desired precision. We describe the class of designs, examine finite sampling operating characteristics, and apply the designs to an exemplar longitudinal cohort study, the Lung Health Study.

Biometrics Causal Inference Genetics & Omics · 发表于 2021-01-13

Generalized multi‐SNP mediation intersection–union test

Wujuan Zhong, Toni Darville, Xiaojing Zheng, Jason Fine, Yun Li

摘要

To elucidate the molecular mechanisms underlying genetic variants identified from genome‐wide association studies (GWAS) for a variety of phenotypic traits encompassing binary, continuous, count, and survival outcomes, we propose a novel and flexible method to test for mediation that can simultaneously accommodate multiple genetic variants and different types of outcome variables. Specifically, we employ the intersection–union test approach combined with the likelihood ratio test to detect mediation effect of multiple genetic variants via some mediator (e.g., the expression of a neighboring gene) on outcome. We fit high‐dimensional generalized linear mixed models under the mediation framework, separately under the null and alternative hypothesis. We leverage Laplace approximation to compute the marginal likelihood of outcome and use coordinate descent algorithm to estimate corresponding parameters. Our extensive simulations demonstrate the validity of our proposed methods and substantial, up to 97%, power gains over alternative methods. Applications to real data for the study of Chlamydia trachomatis infection further showcase advantages of our methods. We believe our proposed methods will be of value and general interest in this post‐GWAS era to disentangle the potential causal mechanism from DNA to phenotype for new drug discovery and personalized medicine.

Biometrics Latent Variables & Mixtures Spatial & Time Series Bayesian Methods · 发表于 2021-01-13

A spatial Bayesian latent factor model for image‐on‐image regression

Cui Guo, Jian Kang, Timothy D. Johnson

摘要

Image‐on‐image regression analysis, using images to predict images, is a challenging task, due to (1) the high dimensionality and (2) the complex spatial dependence structures in image predictors and image outcomes. In this work, we propose a novel image‐on‐image regression model, by extending a spatial Bayesian latent factor model to image data, where low‐dimensional latent factors are adopted to make connections between high‐dimensional image outcomes and image predictors. We assign Gaussian process priors to the spatially varying regression coefficients in the model, which can well capture the complex spatial dependence among image outcomes as well as that among the image predictors. We perform simulation studies to evaluate the out‐of‐sample prediction performance of our method compared with linear regression and voxel‐wise regression methods for different scenarios. The proposed method achieves better prediction accuracy by effectively accounting for the spatial dependence and efficiently reduces image dimensions with latent factors. We apply the proposed method to analysis of multimodal image data in the Human Connectome Project where we predict task‐related contrast maps using subcortical volumetric seed maps.

Biometrics Testing & Uncertainty · 发表于 2021-01-12

Simultaneous confidence intervals for ranks with application to ranking institutions

Diaa Al Mohamad, Jelle J. Goeman, Erik W. van Zwet

摘要

When a ranking of institutions such as medical centers or universities is based on a numerical measure of performance provided with a standard error, confidence intervals (CIs) should be calculated to assess the uncertainty of these ranks. We present a novel method based on Tukey's honest significant difference test to construct simultaneous CIs for the true ranks. When all the true performances are equal, the probability of coverage of our method attains the nominal level. In case the true performance measures have no exact ties, our method is conservative. For this situation, we propose a rescaling method to the nominal level that results in shorter CIs while keeping control of the simultaneous coverage. We also show that a similar rescaling can be applied to correct a recently proposed Monte‐Carlo based method, which is anticonservative. After rescaling, the two methods perform very similarly. However, the rescaling of the Monte‐Carlo based method is computationally much more demanding and becomes infeasible when the number of institutions is larger than 30–50. We discuss another recently proposed method similar to ours based on simultaneous CIs for the true performance. We show that our method provides uniformly shorter CIs for the same confidence level. We illustrate the superiority of our new methods with a data analysis for travel time to work in the United States and on rankings of 64 hospitals in the Netherlands.

SiM Longitudinal Data Spatial & Time Series · 发表于 2021-01-12

Scale mixture of skew‐normal linear mixed models with within‐subject serial dependence

Fernanda L. Schumacher, Victor H. Lachos, Larissa A. Matos

摘要

In longitudinal studies, repeated measures are collected over time and hence they tend to be serially correlated. These studies are commonly analyzed using linear mixed models (LMMs), and in this article we consider an extension of the skew‐normal/independent LMM, where the error term has a dependence structure, such as damped exponential correlation or autoregressive correlation of orderp. The proposed model provides flexibility in capturing the effects of skewness and heavy tails simultaneously when continuous repeated measures are serially correlated. For this robust model, we present an efficient EM‐type algorithm for parameters estimation via maximum likelihood and the observed information matrix is derived analytically to account for standard errors. The methodology is illustrated through an application to schizophrenia data and some simulation studies. The proposed algorithm and methods are implemented in the newRpackageskewlmm.

SiM Clinical Trials Longitudinal Data · 发表于 2021-01-12

Information content of stepped wedge designs with unequal cluster‐period sizes in linear mixed models: Informing incomplete designs

Jessica Kasza, Rhys Bowden, Andrew B. Forbes

摘要

In practice, stepped wedge trials frequently include clusters of differing sizes. However, investigations into the theoretical aspects of stepped wedge designs have, until recently, typically assumed equal numbers of subjects in each cluster and in each period. The information content of the cluster‐period cells, clusters, and periods of stepped wedge designs has previously been investigated assuming equal cluster‐period sizes, and has shown that incomplete stepped wedge designs may be efficient alternatives to the full stepped wedge. How this changes when cluster‐period sizes are not equal is unknown, and we investigate this here. Working within the linear mixed model framework, we show that the information contributed by design components (clusters, sequences, and periods) does depend on the sizes of each cluster‐period. Using a particular trial that assessed the impact of an individual education intervention on log‐length of stay in rehabilitation units, we demonstrate how strongly the efficiency of incomplete designs depends on which cells are excluded: smaller incomplete designs may be more powerful than alternative incomplete designs that include a greater total number of participants. This also serves to demonstrate how the pattern of information content can be used to inform a set of incomplete designs to be considered as alternatives to the complete stepped wedge design. Our theoretical results for the information content can be extended to a broad class of longitudinal (ie, multiple period) cluster randomized trial designs.

SMMR Latent Variables & Mixtures Longitudinal Data · 发表于 2021-01-12

Improving convergence in growth mixture models without covariance structure constraints

Daniel McNeish, Jeffrey R. Harring

摘要

Growth mixture models are a popular method to uncover heterogeneity in growth trajectories. Harnessing the power of growth mixture models in applications is difficult given the prevalence of nonconvergence when fitting growth mixture models to empirical data. Growth mixture models are rooted in the random effect tradition, and nonconvergence often leads researchers to modify their intended model with constraints in the random effect covariance structure to facilitate estimation. While practical, doing so has been shown to adversely affect parameter estimates, class assignment, and class enumeration. Instead, we advocate specifying the models with a marginal approach to prevent the widespread practice of sacrificing class-specific covariance structures to appease nonconvergence. A simulation is provided to show the importance of modeling class-specific covariance structures and builds off existing literature showing that applying constraints to the covariance leads to poor performance. These results suggest that retaining class-specific covariance structures should be a top priority and that marginal models like covariance pattern growth mixture models that model the covariance structure without random effects are well-suited for such a purpose, particularly with modest sample sizes and attrition commonly found in applications. An application to PTSD data with such characteristics is provided to demonstrate (a) convergence difficulties with random effect models, (b) how covariance structure constraints improve convergence but to the detriment of performance, and (c) how covariance pattern growth mixture models may provide a path forward that improves convergence without forfeiting class-specific covariance structures.

SiM Genetics & Omics Bayesian Methods High-Dimensional · 发表于 2021-01-12

Detecting rare haplotype association with two correlated phenotypes of binary and continuous types

Xiaochen Yuan, Swati Biswas

摘要

Multiple correlated traits/phenotypes are often collected in genetic association studies and they may share a common genetic mechanism. Joint analysis of correlated phenotypes has well‐known advantages over one‐at‐a‐time analysis including gain in power and better understanding of genetic etiology. However, when the phenotypes are of discordant types such as binary and continuous, the joint modeling is more challenging. Another research area of current interest is discovery of rare genetic variants. Currently there is no method available for detecting association of rare (or common) haplotypes with multiple discordant phenotypes jointly. Our goal is to fill this gap specifically for two discordant phenotypes. We consider a rare haplotype association method for a binary phenotype, logistic Bayesian LASSO (univariate LBL) and its extension for two correlated binary phenotypes (bivariate LBL‐2B). Under this framework, we propose a haplotype association test with binary and continuous phenotypes jointly (bivariate LBL‐BC). Specifically, we use a latent variable to induce correlation between the two phenotypes. We carry out extensive simulations to investigate bivariate LBL‐BC and compare it with univariate LBL and bivariate LBL‐2B. In most settings, bivariate LBL‐BC performs the best. In only two situations, bivariate LBL‐BC has similar performance—when the two phenotypes are (1) weakly or not correlated and the target haplotype affects the binary phenotype only and (2) strongly positively correlated and the target haplotype affects both phenotypes in positive direction. Finally, we apply the method to a data set on lung cancer and nicotine dependence and detect several haplotypes including a rare one.

SiM Clinical Trials Diagnostics & Prediction Optimization & Learning Theory · 发表于 2021-01-11

The optimal design of clinical trials with potential biomarker effects: A novel computational approach

Yitao Lu, Julie Zhou, Li Xing, Xuekui Zhang

摘要

As a future trend of healthcare, personalized medicine tailors medical treatments to individual patients. It requires to identify a subset of patients with the best response to treatment. The subset can be defined by a biomarker (eg, expression of a gene) and its cutoff value. Topics on subset identification have received massive attention. There are over two million hits by keyword searches on Google Scholar. However, designing clinical trials that utilize the discovered uncertain subsets/biomarkers is not trivial and rarely discussed in the literature. This leads to a gap between research results and real‐world drug development. To fill in this gap, we formulate the problem of clinical trial design into an optimization problem involving high‐dimensional integration, and propose a novel computational solution based on Monte Carlo and smoothing methods. Our method utilizes the modern techniques of general purpose computing on graphics processing units for large‐scale parallel computing. Compared to a published method in three‐dimensional problems, our approach is more accurate and 133 times faster. This advantage increases when dimensionality increases. Our method is scalable to higher dimensional problems since the precision bound of our estimated study power is a finite number not affected by dimensionality. To design clinical trials incorporating the potential biomarkers, users can use our software "DesignCTPB". This software can be found on Github and will be available as an R package on CRAN. Although our research is motivated by the design of clinical trials, the method can be used widely to solve other optimization problems involving high‐dimensional integration.

SiM Longitudinal Data · 发表于 2021-01-10

Flexible multivariate joint model of longitudinal intensity and binary process for medical monitoring of frequently collected data

Resmi Gupta, Jane C. Khoury, Mekibib Altaye, Roman Jandarov, Rhonda D. Szczesniak

摘要

A frequent problem in longitudinal studies is that data may be assessed at subject‐selected, irregularly spaced time‐points, resulting in highly unbalanced outcome data, inducing bias, especially if availability of data is directly related to outcome. Our aim was to develop a multivariate joint model in a mixed outcomes framework to minimize irregular sampling bias. We demonstrate using blood glucose monitoring throughout pregnancy and risk of preterm birth among women with type 1 diabetes mellitus. Blood glucose measurements were unequally spaced and intensity of sampling varied between and within individuals over time. Multivariate linear mixed effects submodel for the longitudinal outcome (blood glucose), Poisson model for the intensity of glucose sampling, and logistic regression model for binary process (preterm birth) were specified. Association between models is captured through shared random effects. Markov chain Monte Carlo methods were used to fit the model. The multivariate joint model provided better prediction, compared with a joint model with a multivariate linear mixed effects submodel (ignoring intensity of glucose sampling) and a two‐stage model. Most association parameters were significant in the preterm birth outcome model, signifying improvement of predictive ability of the binary endpoint by sharing random effects between glucose monitoring and preterm birth. A simulation study is presented to illustrate the effectiveness of the multivariate joint modeling approach.

SiM Survival Analysis · 发表于 2021-01-10

An alternative formulation of Coxian phase‐type distributions with covariates: Application to emergency department length of stay

Jean Rizk, Cathal Walsh, Kevin Burke

摘要

In this article, we present a new methodology to model patient transitions and length of stay in the emergency department using a series of conditional Coxian phase‐type distributions, with covariates. We reformulate the Coxian models (standard Coxian, Coxian with multiple absorbing states, joint Coxian, and conditional Coxian) to take into account heterogeneity in patient characteristics such as arrival mode, time of admission, and age. The approach differs from previous research in that it reduces the computational time, and it allows the inclusion of patient covariate information directly into the model. The model is applied to emergency department data from University Hospital Limerick in Ireland, where we find broad agreement with a number of commonly used survival models (parametric Weibull and log‐normal regression models and the semiparametric Cox proportional hazards model).

Biometrika Nonparametric & Semiparametric Survival Analysis · 发表于 2021-01-08

Estimation of the cure rate for distributions in the Gumbel maximum domain of attraction under insufficient follow-up

Mikael Escobar-Bach, Ross Maller, Ingrid Van Keilegom, Muzhi Zhao

摘要

Summary: Estimators of the cured proportion from survival data which may include observations on cured subjects can only be expected to perform well when the follow-up period is sufficient. When follow-up is not sufficient, and the survival distribution of those susceptible to the event belongs to the Fréchet maximum domain of attraction, a nonparametric estimator for the cure proportion proposed by Escobar-Bach & Van Keilegom (2019) incorporates an adjustment that reduces the bias in the usual estimator. Besides the Fréchet, an important class of limiting distributions for maxima is the Gumbel class. We show that a very wide class of commonly used survival distributions, the generalized Gamma distributions, are in the Gumbel domain of attraction. Extrapolation techniques from extreme value theory are then used to derive, for distributions in this class, a nonparametric estimator of the cure proportion that is consistent and asymptotically normally distributed under reasonable assumptions, and performs well in simulation studies with data where follow-up is insufficient. We illustrate its use with an application to survival data where patients with differing stages of breast cancer have varying degrees of follow-up.

SMMR Testing & Uncertainty · 发表于 2021-01-07

Online control of the familywise error rate

Jinjin Tian, Aaditya Ramdas

摘要

Biological research often involves testing a growing number of null hypotheses as new data are accumulated over time. We study the problem of online control of the familywise error rate, that is testing an a priori unbounded sequence of hypotheses ( p-values) one by one over time without knowing the future, such that with high probability there are no false discoveries in the entire sequence. This paper unifies algorithmic concepts developed for offline (single batch) familywise error rate control and online false discovery rate control to develop novel online familywise error rate control methods. Though many offline familywise error rate methods (e.g., Bonferroni, fallback procedures and Sidak’s method) can trivially be extended to the online setting, our main contribution is the design of new, powerful, adaptive online algorithms that control the familywise error rate when the p-values are independent or locally dependent in time. Our numerical experiments demonstrate substantial gains in power, that are also formally proved in an idealized Gaussian sequence model. A promising application to the International Mouse Phenotyping Consortium is described.

SiM Survival Analysis Causal Inference · 发表于 2021-01-06

Estimating the marginal hazard ratio by simultaneously using a set of propensity score models: A multiply robust approach

Di Shu, Peisong Han, Rui Wang, Sengwee Toh

摘要

The inverse probability weighted Cox model is frequently used to estimate the marginal hazard ratio. Its validity requires a crucial condition that the propensity score model be correctly specified. To provide protection against misspecification of the propensity score model, we propose a weighted estimation method rooted in the empirical likelihood theory. The proposed estimator is multiply robust in that it is guaranteed to be consistent when a set of postulated propensity score models contains a correctly specified model. Our simulation studies demonstrate satisfactory finite sample performance of the proposed method in terms of consistency and efficiency. We apply the proposed method to compare the risk of postoperative hospitalization between sleeve gastrectomy and Roux‐en‐Y gastric bypass using data from a large medical claims and billing database. We further extend the development to multisite studies to enable each site to postulate multiple site‐specific propensity score models.

SMMR Networks & Graphs Latent Variables & Mixtures Meta-Analysis & Data Integration · 发表于 2021-01-06

Continuous(ly) missing outcome data in network meta-analysis: A one-stage pattern-mixture model approach

Loukia M Spineli, Chrysostomos Kalyvas, Katerina Papadimitropoulou

摘要

Appropriate handling of aggregate missing outcome data is necessary to minimise bias in the conclusions of systematic reviews. The two-stage pattern-mixture model has been already proposed to address aggregate missing continuous outcome data. While this approach is more proper compared with the exclusion of missing continuous outcome data and simple imputation methods, it does not offer flexible modelling of missing continuous outcome data to investigate their implications on the conclusions thoroughly. Therefore, we propose a one-stage pattern-mixture model approach under the Bayesian framework to address missing continuous outcome data in a network of interventions and gain knowledge about the missingness process in different trials and interventions. We extend the hierarchical network meta-analysis model for one aggregate continuous outcome to incorporate a missingness parameter that measures the departure from the missing at random assumption. We consider various effect size estimates for continuous data, and two informative missingness parameters, the informative missingness difference of means and the informative missingness ratio of means. We incorporate our prior belief about the missingness parameters while allowing for several possibilities of prior structures to account for the fact that the missingness process may differ in the network. The method is exemplified in two networks from published reviews comprising a different amount of missing continuous outcome data.

SiM Survival Analysis Nonparametric & Semiparametric · 发表于 2021-01-06

Cause‐specific quantile regression on inactivity time

Yichen Jia, Jong‐Hyeon Jeong

摘要

In time‐to‐event analysis, the traditional summary measures have been based on the hazard function, survival function, quantile event time, restricted mean event time, and residual lifetime. Under competing risks, furthermore, typical summary measures have been the cause‐specific hazard function and cumulative incidence function. Recently inactivity time has recaptured attention in the literature, being interpreted as life lost. In this paper, we further interpret it as quality of life reduced and time period after transition to a drug, and propose a quantile regression model to associate the inactivity time with potential predictors under competing risks. We define the proper cumulative distribution function of the inactivity time distribution for each specific event type among those subjects who experience the same type of events during a follow‐up period. A score function‐type estimating equation is developed and asymptotic properties of the regression coefficient estimators are derived by assuming that competing events are censored at their occurrence times as in the cause‐specific hazard analysis. The proposed approach reduces to a regular quantile regression on the inactivity time without competing risks when all types of competing events are collapsed into the same type. Due to difficulty in estimating the improper probability density function of the cause‐specific inactivity distribution to evaluate the variance of the quantiles, a computationally efficient perturbation method is adopted to infer the regression coefficients. Simulation results show that our proposed method works well under the assumed finite sample settings. The proposed method is illustrated with a real dataset from a breast cancer study.

Biometrics Spatial & Time Series Latent Variables & Mixtures · 发表于 2021-01-06

Assuming independence in spatial latent variable models: Consequences and implications of misspecification

Francis K.C. Hui, Nicole A. Hill, A.H. Welsh

摘要

Multivariate spatial data, where multiple responses are simultaneously recorded across spatially indexed observational units, are routinely collected in a wide variety of disciplines. For example, the Southern Ocean Continuous Plankton Recorder survey collects records of zooplankton communities in the Indian sector of the Southern Ocean, with the aim of identifying and quantifying spatial patterns in biodiversity in response to environmental change. One increasingly popular method for modeling such data is spatial generalized linear latent variable models (GLLVMs), where the correlation across sites is captured by a spatial covariance function in the latent variables. However, little is known about the impact of misspecifying the latent variable correlation structure on inference of various parameters in such models. To address this gap in the literature, we investigate how misspecifying and assuming independence for the latent variables' correlation structure impacts estimation and inference in spatial GLLVMs. Through both theory and numerical studies, we show that performance of maximum likelihood estimation and inference on regression coefficients under misspecification depends on a combination of the response type, the magnitude of true regression coefficient, and the corresponding loadings, and, most importantly, whether the corresponding covariate is (also) spatially correlated. On the other hand, estimation and inference of truly nonzero loadings and prediction of latent variables is consistently not robust to misspecification of the latent variable correlation structure.

SiM Functional Data · 发表于 2021-01-06

A depth‐based global envelope test for comparing two groups of functions with applications to biomedical data

Sara Lopez‐Pintado, Kun Qian

摘要

Functional data are commonly observed in many emerging biomedical fields and their analysis is an exciting developing area in statistics. Numerous statistical methods, such as principal components, analysis of variance, and linear regression, have been extended to functional data. The statistical analysis of functions can be significantly improved using nonparametric and robust estimators. New ideas of depth for functional data have been proposed in recent years and can be extended to image data. They provide a way of ordering curves or images from center‐outward, and of defining robust order statistics in a functional context. In this paper we develop depth‐based global envelope tests for comparing two groups of functions or images. In addition to providing globalP‐values, the proposed envelope test can be displayed graphically and indicates the specific portion(s) of the functional data (eg, in pixels or in time) that may have led to rejection of the null hypothesis. We show in a simulation study the performance of the envelope test in terms of empirical power and size in different scenarios. The proposed depth‐based global approach has good power even for small differences and is robust to outliers. The methodology introduced is applied to test whether children with normal and low birth weight have similar growth pattern. We also analyzed a brain image dataset consisting of positron emission tomography scans of severe depressed patients and healthy controls. The global envelope test was used to find and visualize differences between the two groups.

JASA Bayesian Methods Optimization & Learning Theory · 发表于 2021-01-04

Stochastic Gradient Markov Chain Monte Carlo

Christopher Nemeth, Paul Fearnhead

摘要

Markov chain Monte Carlo (MCMC) algorithms are generally regarded as the gold standard technique for Bayesian inference. They are theoretically well-understood and conceptually simple to apply in practice. The drawback of MCMC is that performing exact inference generally requires all of the data to be processed at each iteration of the algorithm. For large datasets, the computational cost of MCMC can be prohibitive, which has led to recent developments in scalable Monte Carlo algorithms that have a significantly lower computational cost than standard MCMC. In this article, we focus on a particular class of scalable Monte Carlo algorithms, stochastic gradient Markov chain Monte Carlo (SGMCMC) which utilizes data subsampling techniques to reduce the per-iteration cost of MCMC. We provide an introduction to some popular SGMCMC algorithms and review the supporting theoretical results, as well as comparing the efficiency of SGMCMC algorithms against MCMC on benchmark examples. The supporting R code is available online athttps://github.com/chris-nemeth/sgmcmc-review-paper. *(abstract via OpenAlex)*

JASA Spatial & Time Series · 发表于 2021-01-04

Nonlinear Spectral Analysis: A Local Gaussian Approach

Lars Arne Jordanger, Dag Tjøstheim

摘要

The spectral distribution f(ω) of a stationary time series {Yt}t∈Z can be used to investigate whether or not periodic structures are present in {Yt}t∈Z, but f(ω) has some limitations due to its dependence on the autocovariances γ(h). For example, f(ω) can not distinguish white iid noise from GARCH-type models (whose terms are dependent, but uncorrelated), which implies that f(ω) can be an inadequate tool when {Yt}t∈Z contains asymmetries and nonlinear dependencies. Asymmetries between the upper and lower tails of a time series can be investigated by means of the local Gaussian autocorrelations, and these local measures of dependence can be used to construct the local Gaussian spectral density presented in this paper. A key feature of the new local spectral density is that it coincides with f(ω) for Gaussian time series, which implies that it can be used to detect non-Gaussian traits in the time series under investigation. In particular, if f(ω) is flat, then peaks and troughs of the new local spectral density can indicate nonlinear traits, which potentially might discover local periodic phenomena that remain undetected in an ordinary spectral analysis. *(abstract via OpenAlex)*

SiM Survey & Sampling · 发表于 2021-01-04

Extending the Mann‐Whitney‐Wilcoxon rank sum test to survey data for comparing mean ranks

Tuo Lin, Tian Chen, Jinyuan Liu, Xin M. Tu

摘要

Statistical methods for analysis of survey data have been developed to facilitate research. More recently, Lumley and Scott (2013) developed an approach to extend the Mann‐Whitney‐Wilcoxon (MWW) rank sum test to survey data. Their approach focuses on the null of equal distribution. In many studies, the MWW test is called for when two‐sample t‐tests (with or without equal variance assumed) fail to provide meaningful results, as they are highly sensitive to outliers. In such situations, the null of equal distribution is too restrictive, as interest lies in comparing centers of groups. In this article, we develop an approach to extend the MWW test to survey data to test the null of equal mean rank. Although not as popular as the mean and median, the mean rank is also a meaningful measure of the center of a distribution and is the same as the median for a symmetric distribution. We illustrate the proposed approach and show major differences with Lumley and Scott's alternative using both real and simulated data.

JASA Other · 发表于 2021-01-04

Coupled Generation

Ben Dai, Xiaotong Shen, Wing Wong

摘要

Instance generation creates representative examples to interpret a learning model, as in regression and classification. For example, representative sentences of a topic of interest describe the topic specifically for sentence categorization. In such a situation, a large number of unlabeled observations may be available in addition to labeled data, for example, many unclassified text corpora (unlabeled instances) are available with only a few classified sentences (labeled instances). In this article, we introduce a novel generative method, called a coupled generator, producing instances given a specific learning outcome, based on indirect and direct generators. The indirect generator uses the inverse principle to yield the corresponding inverse probability, enabling to generate instances by leveraging an unlabeled data. The direct generator learns the distribution of an instance given its learning outcome. Then, the coupled generator seeks the best one from the indirect and direct generators, which is designed to enjoy the benefits of both and deliver higher generation accuracy. For sentence generation given a topic, we develop an embedding-based regression/classification in conjuncture with an unconditional recurrent neural network for the indirect generator, whereas a conditional recurrent neural network is natural for the corresponding direct generator. Moreover, we derive finite-sample generation error bounds for the indirect and direct generators to reveal the generative aspects of both methods thus explaining the benefits of the coupled generator. Finally, we apply the proposed methods to a real benchmark of abstract classification and demonstrate that the coupled generator composes reasonably good sentences from a dictionary to describe a specific topic of interest. *(abstract via PubMed)*

Biometrika Networks & Graphs Causal Inference · 发表于 2021-01-04

Consistency guarantees for greedy permutation-based causal inference algorithms

L Solus, Y Wang, C Uhler

摘要

Summary: Directed acyclic graphical models are widely used to represent complex causal systems. Since the basic task of learning such a model from data is NP-hard, a standard approach is greedy search over the space of directed acyclic graphs or Markov equivalence classes of directed acyclic graphs. As the space of directed acyclic graphs on $p$ nodes and the associated space of Markov equivalence classes are both much larger than the space of permutations, it is desirable to consider permutation-based greedy searches. Here, we provide the first consistency guarantees, both uniform and high dimensional, of a greedy permutation-based search. This search corresponds to a simplex-like algorithm operating over the edge-graph of a subpolytope of the permutohedron, called a directed acyclic graph associahedron. Every vertex in this polytope is associated with a directed acyclic graph, and hence with a collection of permutations that are consistent with the directed acyclic graph ordering. A walk is performed on the edges of the polytope maximizing the sparsity of the associated directed acyclic graphs. We show via simulated and real data that this permutation search is competitive with current approaches.

JASA Other · 发表于 2021-01-04

A Multi-resolution Theory for Approximating Infinite-p-Zero-n: Transitional Inference, Individualized Predictions, and a World Without Bias-Variance Tradeoff

Xinran Li, Xiao-Li Meng

摘要

Transitional inference is an empiricism concept, rooted and practiced in clinical medicine since ancient Greece. Knowledge and experiences gained from treating one entity (e.g., a disease or a group of patients) are applied to treat a related but distinctively different one (e.g., a similar disease or a new patient). This notion of “transition to the similar” renders individualized treatments an operational meaning, yet its theoretical foundation defies the familiar inductive inference framework. The uniqueness of entities is the result of potentially an infinite number of attributes (hence p=∞), which entails zero direct training sample size (i.e., n = 0) because genuine guinea pigs do not exist. However, the literature on wavelets and on sieve methods for nonparametric estimation suggests a principled approximation theory for transitional inference via a multi-resolution (MR) perspective, where we use the resolution level to index the degree of approximation to ultimate individuality. MR inference seeks a primary resolution indexing an indirect training sample, which provides enough matched attributes to increase the relevance of the results to the target individuals and yet still accumulate sufficient indirect sample sizes for robust estimation. Theoretically, MR inference relies on an infinite-term ANOVA-type decomposition, providing an alternative way to model sparsity via the decay rate of the resolution bias as a function of the primary resolution level. Unexpectedly, this decomposition reveals a world without variance when the outcome is a deterministic function of potentially infinitely many predictors. In this deterministic world, the optimal resolution prefers over-fitting in the traditional sense when the resolution bias decays sufficiently rapidly. Furthermore, there can be many “descents” in the prediction error curve, when the contributions of predictors are inhomogeneous and the ordering of their importance does not align with the order of their inclusion in prediction. These findings may hint at a deterministic approximation theory for understanding the apparently over-fitting resistant phenomenon of some over-saturated models in machine learning. *(abstract via OpenAlex)*

JMLR Other · 发表于 2021

sklvq: Scikit Learning Vector Quantization

Rick van Veen, Michael Biehl, Gert-Jan de Vries

摘要

The sklvq package is an open-source Python implementation of a set of learning vector quantization (LVQ) algorithms. In addition to providing the core functionality for the GLVQ, GMLVQ, and LGMLVQ algorithms, sklvq is distinctive by putting emphasis on its modular and customizable design. Not only resulting in a feature-rich implementation for users but enabling easy extensions of the algorithms for researchers. The theory behind this design is described in this paper. To facilitate adoptions and inspire future contributions, sklvq is publicly available on Github (under the BSD license) and can be installed through the Python package index (PyPI). Next to being well-covered by automated testing to ensure code quality, it is accompanied by detailed online documentation. The documentation covers usage examples and provides an in-depth API including theory and scientific references.

JMLR Machine Learning · 发表于 2021

mvlearn: Multiview Machine Learning in Python

Ronan Perry, Gavin Mischler, Richard Guo, Theodore Lee, Alexander Chang, Arman Koul, Cameron Franz, Hugo Richard, Iain Carmichael, Pierre Ablin, Alexandre Gramfort, Joshua T. Vogelstein

摘要

As data are generated more and more from multiple disparate sources, multiview data sets, where each sample has features in distinct views, have grown in recent years. However, no comprehensive package exists that enables non-specialists to use these methods easily. mvlearn is a Python library which implements the leading multiview machine learning methods. Its simple API closely follows that of scikit-learn for increased ease-of-use. The package can be installed from Python Package Index (PyPI) and the conda package manager and is released under the MIT open-source license. The documentation, detailed examples, and all releases are available at https://mvlearn.github.io/.

JMLR Machine Learning · 发表于 2021

mlr3pipelines - Flexible Machine Learning Pipelines in R

Martin Binder, Florian Pfisterer, Michel Lang, Lennart Schneider, Lars Kotthoff, Bernd Bischl

摘要

Recent years have seen a proliferation of ML frameworks. Such systems make ML accessible to non-experts, especially when combined with powerful parameter tuning and AutoML techniques. Modern, applied ML extends beyond direct learning on clean data, however, and needs an expressive language for the construction of complex ML workflows beyond simple pre- and post-processing. We present mlr3pipelines, an R framework which can be used to define linear and complex non-linear ML workflows as directed acyclic graphs. The framework is part of the mlr3 ecosystem, leveraging convenient resampling, benchmarking, and tuning components.

JMLR Machine Learning · 发表于 2021

giotto-tda: : A Topological Data Analysis Toolkit for Machine Learning and Data Exploration

Guillaume Tauzin, Umberto Lupo, Lewis Tunstall, Julian Burella Pérez, Matteo Caorsi, Anibal M. Medina-Mardones, Alberto Dassatti, Kathryn Hess

摘要

We introduce giotto-tda, a Python library that integrates high-performance topological data analysis with machine learning via a scikit-learn-compatible API and state-of-the-art C++ implementations. The library's ability to handle various types of data is rooted in a wide range of preprocessing techniques, and its strong focus on data exploration and interpretability is aided by an intuitive plotting API. Source code, binaries, examples, and documentation can be found at https://github.com/giotto-ai/giotto-tda.

JMLR Machine Learning · 发表于 2021

dalex: Responsible Machine Learning with Interactive Explainability and Fairness in Python

Hubert Baniecki, Wojciech Kretowicz, Piotr Piątyszek, Jakub Wiśniewski, Przemysław Biecek

摘要

In modern machine learning, we observe the phenomenon of opaqueness debt, which manifests itself by an increased risk of discrimination, lack of reproducibility, and deflated performance due to data drift. An increasing amount of available data and computing power results in the growing complexity of black-box predictive models. To manage these issues, good MLOps practice asks for better validation of model performance and fairness, higher explainability, and continuous monitoring. The necessity for deeper model transparency comes from both scientific and social domains and is also caused by emerging laws and regulations on artificial intelligence. To facilitate the responsible development of machine learning models, we introduce dalex, a Python package which implements a model-agnostic interface for interactive explainability and fairness. It adopts the design crafted through the development of various tools for explainable machine learning; thus, it aims at the unification of existing solutions. This library's source code and documentation are available under open license at https://python.drwhy.ai.

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