2020 年的期刊文章 · 第 26 页

共 1467 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2020-02-10 到 2020-02-01。

按期刊、按主题看 →

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

Biometrics Clinical Trials Bayesian Methods · 发表于 2020-02-10

PA‐CRM: A continuous reassessment method for pediatric phase I oncology trials with concurrent adult trials

Yimei Li, Ying Yuan

摘要

Pediatric phase I trials are usually carried out after the adult trial testing the same agent has started, but not completed yet. As the pediatric trial progresses, in light of the accrued interim data from the concurrent adult trial, the pediatric protocol often is amended to modify the original pediatric dose escalation design. In practice, this is done frequently in an ad hoc way, interrupting patient accrual and slowing down the trial. We developed a pediatric‐continuous reassessment method (PA‐CRM) to streamline this process, providing a more efficient and rigorous method to find the maximum tolerated dose for pediatric phase I oncology trials. We use a discounted joint likelihood of the adult and pediatric data, with a discount parameter controlling information borrowing between pediatric and adult trials. According to the interim adult and pediatric data, the discount parameter is adaptively updated using the Bayesian model averaging method. Numerical study shows that the PA‐CRM improves the efficiency and accuracy of the pediatric trial and is robust to various model assumptions.

Biometrika Testing & Uncertainty · 发表于 2020-02-10

Fast closed testing for exchangeable local tests

E Dobriban

摘要

Summary: Multiple hypothesis testing problems arise naturally in science. This note introduces a new fast closed testing method for multiple testing which controls the familywise error rate. Controlling the familywise error rate is state-of-the-art in many important application areas and is preferred over false discovery rate control for many reasons, including that it leads to stronger reproducibility. The closure principle rejects an individual hypothesis if all global nulls of subsets containing it are rejected using some test statistics. It takes exponential time in the worst case. When the tests are symmetric and monotone, the proposed method is an exact algorithm for computing the closure, is quadratic in the number of tests, and is linear in the number of discoveries. Our framework generalizes most examples of closed testing, such as Holm’s method and the Bonferroni method. As a special case of the method, we propose the Simes and higher criticism fusion test, which is powerful both for detecting a few strong signals and for detecting many moderate signals.

SiM Longitudinal Data · 发表于 2020-02-10

Assessing method agreement for paired repeated binary measurements administered by multiple raters

Wei Wang, Nan Lin, Jordan D. Oberhaus, Michael S. Avidan

摘要

Method comparison studies are essential for development in medical and clinical fields. These studies often compare a cheaper, faster, or less invasive measuring method with a widely used one to see if they have sufficient agreement for interchangeable use. Moreover, unlike simply reading measurements from devices, eg, reading body temperature from a thermometer, the response measurement in many clinical and medical assessments is impacted not only by the measuring device but also by the rater. For example, widespread inconsistencies are commonly observed among raters in psychological or cognitive assessment studies due to different characteristics such as rater training and experience, especially in large‐scale assessment studies when many raters are employed. This paper proposes a model‐based approach to assess agreement of two measuring methods for paired repeated binary measurements under the scenario where the agreement between two measuring methods and the agreement among raters are required to be studied simultaneously. Based upon the generalized linear mixed models (GLMMs), the decision on the adequacy of interchangeable use is made by testing the equality of fixed effects of methods. Approaches for assessing method agreement, such as the Bland‐Altman diagram and Cohen's kappa, are also developed for repeated binary measurements based upon the latent variables in GLMMs. We assess our novel model‐based approach by simulation studies and a real clinical application, in which patients are evaluated repeatedly for delirium with two validated screening methods. Both the simulation studies and the real data analyses demonstrate that our proposed approach can effectively assess method agreement.

Biometrika Other · 发表于 2020-02-10

A note on the accuracy of adaptive Gauss–Hermite quadrature

Shaobo Jin, Björn Andersson

摘要

Summary: Numerical quadrature methods are needed for many models in order to approximate integrals in the likelihood function. In this note, we correct the error rate given by Liu & Pierce (1994) for integrals approximated with adaptive Gauss–Hermite quadrature and show that the approximation is less accurate than previously thought. We discuss the relationship between the error rates of adaptive Gauss–Hermite quadrature and Laplace approximation, and provide a theoretical explanation of simulation results obtained in previous studies regarding the accuracy of adaptive Gauss–Hermite quadrature.

SiM Survival Analysis · 发表于 2020-02-08

Testing for change‐point in the covariate effects based on the Cox regression model

Chun Yin Lee, Xuerong Chen, Kwok Fai Lam

摘要

Models with change‐point in covariates have wide applications in cancer research with the response being the time to a certain event. A Cox model with change‐point in covariate is considered at which the pattern of the change‐point effects can be flexibly specified. To test for the existence of the change‐point effects, three statistical tests, namely, the maximal score, maximal normalized score, and maximal Wald tests are proposed. The asymptotic properties of the test statistics are established. Monte Carlo approaches to simulate the critical values are suggested. A large‐scale simulation study is carried out to study the finite sample performance of the proposed test statistics under the null hypothesis of no change‐points and various alternative hypothesis settings. Each of the proposed methods provides a natural estimate for the location of the change‐point, but it is found that the performance of the maximal score test can be sensitive to the true location of the change‐point in some cases, while the performance of the maximal Wald test is very satisfactory in general even in cases with moderate sample size. For illustration, the proposed methods are applied to two medical datasets concerning patients with primary biliary cirrhosis and breast cancer, respectively.

SiM Survival Analysis · 发表于 2020-02-07

Adjusted score functions for monotone likelihood in the Cox regression model

Euloge C. Kenne Pagui, Enrico A. Colosimo

摘要

Standard inference procedures for the Cox model involve maximizing the partial likelihood function. Monotone partial likelihood is an issue that frequently happens in the analysis of health science studies. Monotone likelihood mainly occurs in samples with substantial censoring of survival times and is associated with categorical covariates. In particular, and more frequently, it usually happens when one level of a categorical covariate has just experienced censoring times. In order to overcome this problem, Heinze and Schemper proposed an adjusted partial likelihood score function obtained by suitably adapting the general approach of Firth for mean bias reduction. The procedure is effective in preventing infinite estimates. As an alternative solution, we propose an approach based on the adjusted score function recently suggested by Kenne Pagui et al for median bias reduction. This procedure also solves the infinite estimate problem and has an additional advantage of being invariant under componentwise reparameterizations. This latter fact is fundamental under Cox model since hazards ratio interpretation is obtained by exponentiating parameter estimates. Numerical studies of the proposed method suggest better inference properties than those of the mean bias reduction. A real‐data application related to a melanoma skin dataset is used as illustration for a comparison basis of the methods.

Biometrics Survival Analysis Bayesian Methods · 发表于 2020-02-06

A Bayesian multi‐risks survival (MRS) model in the presence of double censorings

Mário de Castro, Ming‐Hui Chen, Yuanye Zhang, Anthony V. D'Amico

摘要

Semi‐competing risks data include the time to a nonterminating event and the time to a terminating event, while competing risks data include the time to more than one terminating event. Our work is motivated by a prostate cancer study, which has one nonterminating event and two terminating events with both semi‐competing risks and competing risks present as well as two censoring times. In this paper, we propose a new multi‐risks survival (MRS) model for this type of data. In addition, the proposed MRS model can accommodate noninformative right‐censoring times for nonterminating and terminating events. Properties of the proposed MRS model are examined in detail. Theoretical and empirical results show that the estimates of the cumulative incidence function for a nonterminating event may be biased if the information on a terminating event is ignored. A Markov chain Monte Carlo sampling algorithm is also developed. Our methodology is further assessed using simulations and also an analysis of the real data from a prostate cancer study. As a result, a prostate‐specific antigen velocity greater than 2.0 ng/mL per year and higher biopsy Gleason scores are positively associated with a shorter time to death due to prostate cancer.

SiM Survival Analysis · 发表于 2020-02-05

Survival model methods for analyses of cancer incidence trends in young adults

Wan Yang, Rebecca D. Kehm, Mary Beth Terry

摘要

Recent studies have reported increases in cancer incidence in adults under 50 years. However, there remains uncertainty about whether these are true increases or a result of incidental findings from increased medical imaging. To evaluate these trends, we propose an alternative method to age‐period‐cohort analyses based on survival modeling. Simulations show that our method is capable of quantifying cohort effects within various backgrounds including increasing medical imaging. We applied the method to analyze the changes in cancer incidence rates for 44 anatomic sites, stratified by sex, by birth cohort for individuals born from 1945 to 1969 in the US based on incidence data from the Surveillance, Epidemiology, and End Results (SEER) program, and tested the validity of our models using later birth cohorts (1970‐1974 and 1975‐1979). We found that cancer risks have increased significantly in 15 sites (9 in men and 11 in women) for 25‐49 year‐olds. These results were consistent with previous findings from age‐period‐cohort analyses. Furthermore, based on our simulations, these increases were independent of increased medical imaging and support substantial, increased extrinsic risks in the identified cancers. Although our approach has several limitations including the restriction to the younger age range and requirement of complete data for all ages of interest, we demonstrate many advantages of our approach including the ease in implementation and interpretation of cohort effects, robustness to various period backgrounds, and ability to make predictions. Our approach should help epidemiologists evaluate cohort effects using incidence data for cancer or other diseases.

SiM Other · 发表于 2020-02-05

Ordinal outcomes: A cumulative probability model with the log link and an assumption of proportionality

Gurbakhshash Singh, Gordon Hilton Fick

摘要

We present here a study of ordinal outcomes with a cumulative probability model. In particular, we consider the log link with the assumption of proportionality. The logit link is currently the most widely used link with ordinal outcomes in the health research literature. With the logit link, one obtains regression coefficients that are functions of odds. When the log link is used, one obtains regression coefficients that are functions of probabilities. While odds might be preferred with certain studies that are retrospective, many health researchers may prefer to have direct statements about probabilities. There are two classes of models with the log link analogous to those with the logit link. We will call these two classes the Proportional Probability Model (PPM) and the Log Cumulative Probability Model (LCPM). These models introduce a challenge not seen with the logit link models. The log link models have constraints on the parameter space. We must insist that the maximum likelihood estimate (MLE) satisfy these constraints. We present conditions for the uniqueness of the MLE and we present other features of the MLE. Several examples and several closed form expressions for the MLE are presented. While this paper is primarily about the PPM, our R packagelcpmcontains functions to fit both the PPM and the LCPM.

SiM Causal Inference · 发表于 2020-02-05

On the aggregation of published prognostic scores for causal inference in observational studies

Tri‐Long Nguyen, Gary S. Collins, Fabio Pellegrini, Karel G.M. Moons, Thomas P.A. Debray

摘要

As real world evidence on drug efficacy involves nonrandomized studies, statistical methods adjusting for confounding are needed. In this context, prognostic score (PGS) analysis has recently been proposed as a method for causal inference. It aims to restore balance across the different treatment groups by identifying subjects with a similar prognosis for a given reference exposure (“control”). This requires the development of a multivariable prognostic model in the control arm of the study sample, which is thenextrapolatedto the different treatment arms. Unfortunately, large cohorts for developing prognostic models are not always available. Prognostic models are therefore subject to a dilemma between overfitting and parsimony; the latter being prone to a violation of the assumption of no unmeasured confounders when important covariates are ignored. Although it is possible to limit overfitting by using penalization strategies, an alternative approach is to adopt evidence synthesis. Aggregating previously published prognostic models may improve the generalizability of PGS, while taking account of a large set of covariates—even when limited individual participant data are available. In this article, we extend a method for prediction model aggregation to PGS analysis in nonrandomized studies. We conduct extensive simulations to assess the validity of model aggregation, compared with other methods of PGS analysis for estimating marginal treatment effects. We show that aggregating existing PGS into a “meta‐score” is robust to misspecification, even when elementary scores wrongfully omit confounders or focus on different outcomes. We illustrate our methods in a setting of treatments for asthma.

JASA Nonparametric & Semiparametric · 发表于 2020-02-05

Nonparametric Estimation of Conditional Expectation with Auxiliary Information and Dimension Reduction

Bingying Xie, Jun Shao

SMMR Longitudinal Data · 发表于 2020-02-05

Modeling of cumulative effects of time-varying drug exposures on within-subject changes in a continuous outcome

Coraline Danieli, Therese Sheppard, Ruth Costello, William G Dixon, Michal Abrahamowicz

摘要

An accurate assessment of the safety or effectiveness of drugs in pharmaco-epidemiological studies requires defining an etiologically correct time-varying exposure model, which specifies how previous drug use affects the outcome of interest. To address this issue, we develop, and validate in simulations, a new approach for flexible modeling of the cumulative effects of time-varying exposures on repeated measures of a continuous response variable, such as a quantitative surrogate outcome, or a biomarker. Specifically, we extend the linear mixed effects modeling to estimate how past and recent drug exposure affects the way individual values of the outcome change throughout the follow-up. To account for the dosage, duration and timing of past exposures, we rely on a flexible weighted cumulative exposure methodology to model the cumulative effects of past drug use, as the weighted sum of past doses. Weights, modeled with unpenalized cubic regression B-splines, reflect the relative importance of doses taken at different times in the past. In simulations, we evaluate the performance of the model under different assumptions concerning (i) the shape of the weight function, (ii) the sample size, (iii) the number of the longitudinal observations and (iv) the intra-individual variance. Results demonstrate the accuracy of our estimates of the weight function and of the between- and within-patients variances, and good correlation between the observed and predicted longitudinal changes in the outcome. We then apply the proposed method to re-assess the association between time-varying glucocorticoid exposure and weight gain in people living with rheumatoid arthritis.

JRSSB Causal Inference · 发表于 2020-02-05

Causal Mediation Analysis for Stochastic Interventions

Iván Díaz, Nima S. Hejazi

摘要

Summary: Mediation analysis in causal inference has traditionally focused on binary exposures and deterministic interventions, and a decomposition of the average treatment effect in terms of direct and indirect effects. We present an analogous decomposition of the population intervention effect, defined through stochastic interventions on the exposure. Population intervention effects provide a generalized framework in which a variety of interesting causal contrasts can be defined, including effects for continuous and categorical exposures. We show that identification of direct and indirect effects for the population intervention effect requires weaker assumptions than its average treatment effect counterpart, under the assumption of no mediator–outcome confounders affected by exposure. In particular, identification of direct effects is guaranteed in experiments that randomize the exposure and the mediator. We propose various estimators of the direct and indirect effects, including substitution, reweighted and efficient estimators based on flexible regression techniques, allowing for multivariate mediators. Our efficient estimator is asymptotically linear under a condition requiring n1/4-consistency of certain regression functions. We perform a simulation study in which we assess the finite sample properties of our proposed estimators. We present the results of an illustrative study where we assess the effect of participation in a sports team on the body mass index among children, using mediators such as exercise habits, daily consumption of snacks and overweight status.

SMMR Other · 发表于 2020-02-05

Asymptotic versus exact methods in the analysis of contingency tables: Evidence-based practical recommendations

Miguel A García-Pérez, Vicente Núñez-Antón

摘要

Controversy over the validity of significance tests in the analysis of contingency tables is motivated by the disagreement between asymptotic and exact p values and its dependence on the magnitude of expected frequencies. Variants of Pearson’s X2 statistic and their asymptotic distributions were proposed to overcome the difficulties, but several approaches also exist to conduct exact tests. This paper shows that discrepant asymptotic and exact results may or may not occur whether expected frequencies are large or small: Eventual inaccuracy of asymptotic p values is instead caused by idiosyncrasies of the discrete distribution of X2. More importantly, discrepancies are also artificially created by the hypergeometric sampling model used to perform exact tests. Exact computations under the alternative full-multinomial or product-multinomial models require eliminating nuisance parameters and we propose a novel method that integrates them out. The resultant exact distributions are very accurately approximated by the asymptotic distribution, which eliminates concerns about the accuracy of the latter. We also discuss that the two-stage approach that tests for significance of residuals conditional on a significant X2 test is inadvisable and that an alternative single-stage test preserves Type-I error rates and further eliminates concerns about asymptotic accuracy.

SiM Other · 发表于 2020-02-04

Adding noise to Markov cohort state‐transition model in decision modeling and cost‐effectiveness analysis

Rowan Iskandar

摘要

Following its introduction over 30 years ago, the Markov cohort state‐transition model has been used extensively to model population trajectories over time in health decision modeling and cost‐effectiveness analysis studies. We recently showed that a cohort model represents the average of a continuous‐time stochastic process on a multidimensional integer lattice governed by a master equation, which represents the time‐evolution of the probability function of an integer‐valued random vector. By leveraging this theoretical connection, this study introduces an alternative modeling method using a stochastic differential equation (SDE) approach, which captures not only the mean behavior but also the variance of the population process. We show the derivation of an SDE model from first principles, describe an algorithm to construct an SDE and solve the SDE via simulation for use in practice, and demonstrate the two applications of an SDE in detail. The first example demonstrates that the population trajectories, and their mean and variance, from the SDE and other commonly used methods in decision modeling match. The second example shows that users can readily apply the SDE method in their existing works without the need for additional inputs beyond those required for constructing a conventional cohort model. In addition, the second example demonstrates that the SDE model is superior to a microsimulation model in terms of computational speed. In summary, an SDE model provides an alternative modeling framework which includes information on variance, can accommodate for time‐varying parameters, and is computationally less expensive than a microsimulation for a typical cohort modeling problem.

JASA Meta-Analysis & Data Integration · 发表于 2020-02-03

Trends in Extreme Value Indices

Laurens de Haan, Chen Zhou

摘要

We consider extreme value analysis for independent but nonidentically distributed observations.In particular, the observations do not share the same extreme value index.Assuming continuously changing extreme value indices, we provide a nonparametric estimate for the functional extreme value index.Besides estimating the extreme value index locally, we also provide a global estimator for the trend and its joint asymptotic theory.The asymptotic theory for the global estimator can be used for testing a prespecified parametric trend in the extreme value indices.In particular, it can be applied to test whether the extreme value index remains at a constant level across all observations. *(abstract via OpenAlex)*

SiM Diagnostics & Prediction Bayesian Methods Survey & Sampling · 发表于 2020-02-03

Small area estimation of receiver operating characteristic curves for ordinal data under stochastic ordering

Eun Jin Jang, Balgobin Nandram, Yousun Ko, Dal Ho Kim

摘要

There has been a recent increase in the diagnosis of diseases through radiographic images such as x‐rays, magnetic resonance imaging, and computed tomography. The outcome of a radiological diagnostic test is often in the form of discrete ordinal data, and we usually summarize the performance of the diagnostic test using the receiver operating characteristic (ROC) curve and the area under the curve (AUC). The ROC curve will be concave and called proper when the outcomes of the diagnostic test in the actually positive subjects are higher than in the actually negative subjects. The diagnostic test for disease detection is clinically useful when a ROC curve is proper. In this study, we develop a hierarchical Bayesian model to estimate the proper ROC curve and AUC using stochastic ordering in several domains when the outcome of the diagnostic test is discrete ordinal data and compare it with the model without stochastic ordering. The model without stochastic ordering can estimate the improper ROC curve with a nonconcave shape or a hook when the true ROC curve of the population is a proper ROC curve. Therefore, the model with stochastic ordering is preferable over the model without stochastic ordering to estimate the proper ROC curve with clinical usefulness for ordinal data.

JASA Spatial & Time Series · 发表于 2020-02-03

Predictive Inference for Locally Stationary Time Series With an Application to Climate Data

Srinjoy Das, Dimitris N. Politis

摘要

The model-free prediction principle of Politis has been successfully applied to general regression problems, as well as problems involving stationary time series. However, with long time series, for example, annual temperature measurements spanning over 100 years or daily financial returns spanning several years, it may be unrealistic to assume stationarity throughout the span of the dataset. In this article, we show how model-free prediction can be applied to handle time series that are only locally stationary, that is, they can be assumed to be stationary only over short time-windows. Surprisingly, there is little literature on point prediction for general locally stationary time series even in model-based setups, and there is no literature whatsoever on the construction of prediction intervals of locally stationary time series. We attempt to fill this gap here as well. Both one-step-ahead point predictors and prediction intervals are constructed, and the performance of model-free is compared to model-based prediction using models that incorporate a trend and/or heteroscedasticity. Both aspects of the article, model-free and model-based, are novel in the context of time-series that are locally (but not globally) stationary. We also demonstrate the application of our model-based and model-free prediction methods to speleothem climate data which exhibits local stationarity and show that our best model-free point prediction results outperform that obtained with the RAMPFIT algorithm previously used for analysis of this type of data. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

Biometrics Longitudinal Data Survival Analysis · 发表于 2020-02-03

Partial least squares for functional joint models with applications to the Alzheimer's disease neuroimaging initiative study

Yue Wang, Joseph G. Ibrahim, Hongtu Zhu

摘要

Many biomedical studies have identified important imaging biomarkers that are associated with both repeated clinical measures and a survival outcome. The functional joint model (FJM) framework, proposed by Li and Luo in 2017, investigates the association between repeated clinical measures and survival data, while adjusting for both high‐dimensional images and low‐dimensional covariates based on the functional principal component analysis (FPCA). In this paper, we propose a novel algorithm for the estimation of FJM based on the functional partial least squares (FPLS). Our numerical studies demonstrate that, compared to FPCA, the proposed FPLS algorithm can yield more accurate and robust estimation and prediction performance in many important scenarios. We apply the proposed FPLS algorithm to a neuroimaging study. Data used in preparation of this article were obtained from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database.

Biometrika Bayesian Methods · 发表于 2020-02-03

On the use of approximate Bayesian computation Markov chain Monte Carlo with inflated tolerance and post-correction

Matti Vihola, Jordan Franks

摘要

Summary: Approximate Bayesian computation enables inference for complicated probabilistic models with intractable likelihoods using model simulations. The Markov chain Monte Carlo implementation of approximate Bayesian computation is often sensitive to the tolerance parameter: low tolerance leads to poor mixing and large tolerance entails excess bias. We propose an approach that involves using a relatively large tolerance for the Markov chain Monte Carlo sampler to ensure sufficient mixing and post-processing the output, leading to estimators for a range of finer tolerances. We introduce an approximate confidence interval for the related post-corrected estimators and propose an adaptive approximate Bayesian computation Markov chain Monte Carlo algorithm, which finds a balanced tolerance level automatically based on acceptance rate optimization. Our experiments show that post-processing-based estimators can perform better than direct Markov chain Monte Carlo targeting a fine tolerance, that our confidence intervals are reliable, and that our adaptive algorithm leads to reliable inference with little user specification.

Biometrics Functional Data Optimization & Learning Theory · 发表于 2020-02-03

Nonnegative decomposition of functional count data

Daniel Backenroth, Russell T. Shinohara, Jennifer A. Schrack, Jeff Goldsmith

摘要

We present a novel decomposition of nonnegative functional count data that draws on concepts from nonnegative matrix factorization. Our decomposition, which we refer to as NARFD (nonnegative and regularized function decomposition), enables the study of patterns in variation across subjects in a highly interpretable manner. Prototypic modes of variation are estimated directly on the observed scale of the data, are local, and are transparently added together to reconstruct observed functions. This contrasts with generalized functional principal component analysis, an alternative approach that estimates functional principal components on a transformed scale, produces components that typically vary across the entire functional domain, and reconstructs observations using complex patterns of cancellation and multiplication of functional principal components. NARFD is implemented using an alternating minimization algorithm, and we evaluate our approach in simulations. We apply NARFD to an accelerometer dataset comprising observations of physical activity for healthy older Americans.

Biometrics Clinical Trials · 发表于 2020-02-03

Highly efficient stepped wedge designs for clusters of unequal size

John N. S. Matthews

摘要

The stepped wedge design (SWD) is a form of cluster randomized trial, usually comparing two treatments, which is divided into time periods and sequences, with clusters allocated to sequences. Typically all sequences start with the standard treatment and end with the new treatment, with the change happening at different times in the different sequences. The clusters will usually differ in size but this is overlooked in much of the existing literature. This paper considers the case when clusters have different sizes and determines how efficient designs can be found. The approach uses an approximation to the variance of the treatment effect, which is expressed in terms of the proportions of clusters and of individuals allocated to each sequence of the design. The roles of these sets of proportions in determining an efficient design are discussed and illustrated using two SWDs, one in the treatment of sexually transmitted diseases and one in renal replacement therapy. Cluster‐balanced designs, which allocate equal numbers of clusters to each sequence, are shown to have excellent statistical and practical properties; suggestions are made about the practical application of the results for these designs. The paper concentrates on the cross‐sectional case, where subjects are measured once, but it is briefly indicated how the methods can be extended to the closed‐cohort design.

Biometrika Other · 发表于 2020-02-03

A random-perturbation-based rank estimator of the number of factors

Xinbing Kong

摘要

Summary: We introduce a random-perturbation-based rank estimator of the number of factors of a large-dimensional approximate factor model. An expansion of the rank estimator demonstrates that the random perturbation reduces the biases due to the persistence of the factor series and the dependence between the factor and error series. A central limit theorem for the rank estimator with convergence rate higher than root $n$ gives a new hypothesis-testing procedure for both one-sided and two-sided alternatives. Simulation studies verify the performance of the test.

AoS Testing & Uncertainty · 发表于 2020-02-01

Uniformly valid confidence intervals post-model-selection

François Bachoc, David Preinerstorfer, Lukas Steinberger

摘要

We suggest general methods to construct asymptotically uniformly valid confidence intervals post-model-selection. The constructions are based on principles recently proposed by Berk et al. (Ann. Statist. 41 (2013) 802–837). In particular, the candidate models used can be misspecified, the target of inference is model-specific, and coverage is guaranteed for any data-driven model selection procedure. After developing a general theory, we apply our methods to practically important situations where the candidate set of models, from which a working model is selected, consists of fixed design homoskedastic or heteroskedastic linear models, or of binary regression models with general link functions. In an extensive simulation study, we find that the proposed confidence intervals perform remarkably well, even when compared to existing methods that are tailored only for specific model selection procedures.

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

Two-step semiparametric empirical likelihood inference

Francesco Bravo, Juan Carlos Escanciano, Ingrid Van Keilegom

摘要

In both parametric and certain nonparametric statistical models, the empirical likelihood ratio satisfies a nonparametric version of Wilks’ theorem. For many semiparametric models, however, the commonly used two-step (plug-in) empirical likelihood ratio is not asymptotically distribution-free, that is, its asymptotic distribution contains unknown quantities, and hence Wilks’ theorem breaks down. This article suggests a general approach to restore Wilks’ phenomenon in two-step semiparametric empirical likelihood inferences. The main insight consists in using as the moment function in the estimating equation the influence function of the plug-in sample moment. The proposed method is general; it leads to a chi-squared limiting distribution with known degrees of freedom; it is efficient; it does not require undersmoothing; and it is less sensitive to the first-step than alternative methods, which is particularly appealing for high-dimensional settings. Several examples and simulation studies illustrate the general applicability of the procedure and its excellent finite sample performance relative to competing methods.

AoS High-Dimensional · 发表于 2020-02-01

The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression

Emmanuel J. Candès, Pragya Sur

摘要

This paper rigorously establishes that the existence of the maximum likelihood estimate (MLE) in high-dimensional logistic regression models with Gaussian covariates undergoes a sharp “phase transition.” We introduce an explicit boundary curve $h_{\mathrm{MLE}}$, parameterized by two scalars measuring the overall magnitude of the unknown sequence of regression coefficients, with the following property: in the limit of large sample sizes $n$ and number of features $p$ proportioned in such a way that $p/n\rightarrow \kappa $, we show that if the problem is sufficiently high dimensional in the sense that $\kappa >h_{\mathrm{MLE}}$, then the MLE does not exist with probability one. Conversely, if $\kappa <h_{\mathrm{MLE}}$, the MLE asymptotically exists with probability one.

AoS Testing & Uncertainty · 发表于 2020-02-01

The numerical bootstrap

Han Hong, Jessie Li

摘要

This paper proposes a numerical bootstrap method that is consistent in many cases where the standard bootstrap is known to fail and where the $m$-out-of-$n$ bootstrap and subsampling have been the most commonly used inference approaches. We provide asymptotic analysis under both fixed and drifting parameter sequences, and we compare the approximation error of the numerical bootstrap with that of the $m$-out-of-$n$ bootstrap and subsampling. Finally, we discuss applications of the numerical bootstrap, such as constrained and unconstrained M-estimators converging at both regular and nonstandard rates, Laplace-type estimators, and test statistics for partially identified models.

AoS Optimization & Learning Theory Nonparametric & Semiparametric · 发表于 2020-02-01

The multi-armed bandit problem: An efficient nonparametric solution

Hock Peng Chan

摘要

Lai and Robbins (Adv. in Appl. Math. 6 (1985) 4–22) and Lai (Ann. Statist. 15 (1987) 1091–1114) provided efficient parametric solutions to the multi-armed bandit problem, showing that arm allocation via upper confidence bounds (UCB) achieves minimum regret. These bounds are constructed from the Kullback–Leibler information of the reward distributions, estimated from specified parametric families. In recent years, there has been renewed interest in the multi-armed bandit problem due to new applications in machine learning algorithms and data analytics. Nonparametric arm allocation procedures like $\epsilon $-greedy, Boltzmann exploration and BESA were studied, and modified versions of the UCB procedure were also analyzed under nonparametric settings. However, unlike UCB these nonparametric procedures are not efficient under general parametric settings. In this paper, we propose efficient nonparametric procedures.

AoS Other · 发表于 2020-02-01

Testing for principal component directions under weak identifiability

Davy Paindaveine, Julien Remy, Thomas Verdebout

摘要

We consider the problem of testing, on the basis of a $p$-variate Gaussian random sample, the null hypothesis $\mathcal{H}_{0}:\boldsymbol{\theta}_{1}=\boldsymbol{\theta}_{1}^{0}$ against the alternative $\mathcal{H}_{1}:\boldsymbol{\theta}_{1}\neq \boldsymbol{\theta}_{1}^{0}$, where $\boldsymbol{\theta}_{1}$ is the “first” eigenvector of the underlying covariance matrix and $\boldsymbol{\theta}_{1}^{0}$ is a fixed unit $p$-vector. In the classical setup where eigenvalues $\lambda_{1}>\lambda_{2}\geq \cdots \geq \lambda_{p}$ are fixed, the Anderson (Ann. Math. Stat. 34 (1963) 122–148) likelihood ratio test (LRT) and the Hallin, Paindaveine and Verdebout (Ann. Statist. 38 (2010) 3245–3299) Le Cam optimal test for this problem are asymptotically equivalent under the null hypothesis, hence also under sequences of contiguous alternatives. We show that this equivalence does not survive asymptotic scenarios where $\lambda_{n1}/\lambda_{n2}=1+O(r_{n})$ with $r_{n}=O(1/\sqrt{n})$. For such scenarios, the Le Cam optimal test still asymptotically meets the nominal level constraint, whereas the LRT severely overrejects the null hypothesis. Consequently, the former test should be favored over the latter one whenever the two largest sample eigenvalues are close to each other. By relying on the Le Cam’s asymptotic theory of statistical experiments, we study the non-null and optimality properties of the Le Cam optimal test in the aforementioned asymptotic scenarios and show that the null robustness of this test is not obtained at the expense of power. Our asymptotic investigation is extensive in the sense that it allows $r_{n}$ to converge to zero at an arbitrary rate. While we restrict to single-spiked spectra of the form $\lambda_{n1}>\lambda_{n2}=\cdots =\lambda_{np}$ to make our results as striking as possible, we extend our results to the more general elliptical case. Finally, we present an illustrative real data example.

AoS Optimization & Learning Theory Testing & Uncertainty · 发表于 2020-02-01

Statistical inference for model parameters in stochastic gradient descent

Xi Chen, Jason D. Lee, Xin T. Tong, Yichen Zhang

摘要

The stochastic gradient descent (SGD) algorithm has been widely used in statistical estimation for large-scale data due to its computational and memory efficiency. While most existing works focus on the convergence of the objective function or the error of the obtained solution, we investigate the problem of statistical inference of true model parameters based on SGD when the population loss function is strongly convex and satisfies certain smoothness conditions. Our main contributions are twofold. First, in the fixed dimension setup, we propose two consistent estimators of the asymptotic covariance of the average iterate from SGD: (1) a plug-in estimator, and (2) a batch-means estimator, which is computationally more efficient and only uses the iterates from SGD. Both proposed estimators allow us to construct asymptotically exact confidence intervals and hypothesis tests. Second, for high-dimensional linear regression, using a variant of the SGD algorithm, we construct a debiased estimator of each regression coefficient that is asymptotically normal. This gives a one-pass algorithm for computing both the sparse regression coefficients and confidence intervals, which is computationally attractive and applicable to online data.

AoS Networks & Graphs Optimization & Learning Theory Latent Variables & Mixtures · 发表于 2020-02-01

Spectral and matrix factorization methods for consistent community detection in multi-layer networks

Subhadeep Paul, Yuguo Chen

摘要

We consider the problem of estimating a consensus community structure by combining information from multiple layers of a multi-layer network using methods based on the spectral clustering or a low-rank matrix factorization. As a general theme, these “intermediate fusion” methods involve obtaining a low column rank matrix by optimizing an objective function and then using the columns of the matrix for clustering. However, the theoretical properties of these methods remain largely unexplored. In the absence of statistical guarantees on the objective functions, it is difficult to determine if the algorithms optimizing the objectives will return good community structures. We investigate the consistency properties of the global optimizer of some of these objective functions under the multi-layer stochastic blockmodel. For this purpose, we derive several new asymptotic results showing consistency of the intermediate fusion techniques along with the spectral clustering of mean adjacency matrix under a high dimensional setup, where the number of nodes, the number of layers and the number of communities of the multi-layer graph grow. Our numerical study shows that the intermediate fusion techniques outperform late fusion methods, namely spectral clustering on aggregate spectral kernel and module allegiance matrix in sparse networks, while they outperform the spectral clustering of mean adjacency matrix in multi-layer networks that contain layers with both homophilic and heterophilic communities.

AoS High-Dimensional · 发表于 2020-02-01

Sparse high-dimensional regression: Exact scalable algorithms and phase transitions

Dimitris Bertsimas, Bart Van Parys

摘要

We present a novel binary convex reformulation of the sparse regression problem that constitutes a new duality perspective. We devise a new cutting plane method and provide evidence that it can solve to provable optimality the sparse regression problem for sample sizes $n$ and number of regressors $p$ in the 100,000s, that is, two orders of magnitude better than the current state of the art, in seconds. The ability to solve the problem for very high dimensions allows us to observe new phase transition phenomena. Contrary to traditional complexity theory which suggests that the difficulty of a problem increases with problem size, the sparse regression problem has the property that as the number of samples $n$ increases the problem becomes easier in that the solution recovers 100% of the true signal, and our approach solves the problem extremely fast (in fact faster than Lasso), while for small number of samples $n$, our approach takes a larger amount of time to solve the problem, but importantly the optimal solution provides a statistically more relevant regressor. We argue that our exact sparse regression approach presents a superior alternative over heuristic methods available at present.

AoS High-Dimensional · 发表于 2020-02-01

Sparse SIR: Optimal rates and adaptive estimation

Kai Tan, Lei Shi, Zhou Yu

摘要

Sliced inverse regression (SIR) is an innovative and effective method for sufficient dimension reduction and data visualization. Recently, an impressive range of penalized SIR methods has been proposed to estimate the central subspace in a sparse fashion. Nonetheless, few of them considered the sparse sufficient dimension reduction from a decision-theoretic point of view. To address this issue, we in this paper establish the minimax rates of convergence for estimating the sparse SIR directions under various commonly used loss functions in the literature of sufficient dimension reduction. We also discover the possible trade-off between statistical guarantee and computational performance for sparse SIR. We finally propose an adaptive estimation scheme for sparse SIR which is computationally tractable and rate optimal. Numerical studies are carried out to confirm the theoretical properties of our proposed methods.

AoS High-Dimensional · 发表于 2020-02-01

Robust sparse covariance estimation by thresholding Tyler’s M-estimator

John Goes, Gilad Lerman, Boaz Nadler

摘要

Estimating a high-dimensional sparse covariance matrix from a limited number of samples is a fundamental task in contemporary data analysis. Most proposals to date, however, are not robust to outliers or heavy tails. Toward bridging this gap, in this work we consider estimating a sparse shape matrix from $n$ samples following a possibly heavy-tailed elliptical distribution. We propose estimators based on thresholding either Tyler’s M-estimator or its regularized variant. We prove that in the joint limit as the dimension $p$ and the sample size $n$ tend to infinity with $p/n\to\gamma>0$, our estimators are minimax rate optimal. Results on simulated data support our theoretical analysis.

AoS Other · 发表于 2020-02-01

Rerandomization in $2^{K}$ factorial experiments

Xinran Li, Peng Ding, Donald B. Rubin

摘要

With many pretreatment covariates and treatment factors, the classical factorial experiment often fails to balance covariates across multiple factorial effects simultaneously. Therefore, it is intuitive to restrict the randomization of the treatment factors to satisfy certain covariate balance criteria, possibly conforming to the tiers of factorial effects and covariates based on their relative importances. This is rerandomization in factorial experiments. We study the asymptotic properties of this experimental design under the randomization inference framework without imposing any distributional or modeling assumptions of the covariates and outcomes. We derive the joint asymptotic sampling distribution of the usual estimators of the factorial effects, and show that it is symmetric, unimodal and more “concentrated” at the true factorial effects under rerandomization than under the classical factorial experiment. We quantify this advantage of rerandomization using the notions of “central convex unimodality” and “peakedness” of the joint asymptotic sampling distribution. We also construct conservative large-sample confidence sets for the factorial effects.

AoS Survival Analysis High-Dimensional Nonparametric & Semiparametric · 发表于 2020-02-01

Penalized generalized empirical likelihood with a diverging number of general estimating equations for censored data

Niansheng Tang, Xiaodong Yan, Xingqiu Zhao

AoS Latent Variables & Mixtures · 发表于 2020-02-01

Optimal rates for community estimation in the weighted stochastic block model

Min Xu, Varun Jog, Po-Ling Loh

摘要

Community identification in a network is an important problem in fields such as social science, neuroscience and genetics. Over the past decade, stochastic block models (SBMs) have emerged as a popular statistical framework for this problem. However, SBMs have an important limitation in that they are suited only for networks with unweighted edges; in various scientific applications, disregarding the edge weights may result in a loss of valuable information. We study a weighted generalization of the SBM, in which observations are collected in the form of a weighted adjacency matrix and the weight of each edge is generated independently from an unknown probability density determined by the community membership of its endpoints. We characterize the optimal rate of misclustering error of the weighted SBM in terms of the Renyi divergence of order 1/2 between the weight distributions of within-community and between-community edges, substantially generalizing existing results for unweighted SBMs. Furthermore, we present a computationally tractable algorithm based on discretization that achieves the optimal error rate. Our method is adaptive in the sense that the algorithm, without assuming knowledge of the weight densities, performs as well as the best algorithm that knows the weight densities.

AoS Other · 发表于 2020-02-01

Optimal prediction in the linearly transformed spiked model

Edgar Dobriban, William Leeb, Amit Singer

摘要

We consider the linearly transformed spiked model, where the observations $Y_{i}$ are noisy linear transforms of unobserved signals of interest $X_{i}$: \begin{equation*}Y_{i}=A_{i}X_{i}+\varepsilon_{i},\end{equation*} for $i=1,\ldots ,n$. The transform matrices $A_{i}$ are also observed. We model the unobserved signals (or regression coefficients) $X_{i}$ as vectors lying on an unknown low-dimensional space. Given only $Y_{i}$ and $A_{i}$ how should we predict or recover their values? The naive approach of performing regression for each observation separately is inaccurate due to the large noise level. Instead, we develop optimal methods for predicting $X_{i}$ by “borrowing strength” across the different samples. Our linear empirical Bayes methods scale to large datasets and rely on weak moment assumptions. We show that this model has wide-ranging applications in signal processing, deconvolution, cryo-electron microscopy, and missing data with noise. For missing data, we show in simulations that our methods are more robust to noise and to unequal sampling than well-known matrix completion methods.

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

New $G$-formula for the sequential causal effect and blip effect of treatment in sequential causal inference

Xiaoqin Wang, Li Yin

摘要

In sequential causal inference, two types of causal effects are of practical interest, namely, the causal effect of the treatment regime (called the sequential causal effect) and the blip effect of treatment on the potential outcome after the last treatment. The well-known $G$-formula expresses these causal effects in terms of the standard parameters. In this article, we obtain a new $G$-formula that expresses these causal effects in terms of the point observable effects of treatments similar to treatment in the framework of single-point causal inference. Based on the new $G$-formula, we estimate these causal effects by maximum likelihood via point observable effects with methods extended from single-point causal inference. We are able to increase precision of the estimation without introducing biases by an unsaturated model imposing constraints on the point observable effects. We are also able to reduce the number of point observable effects in the estimation by treatment assignment conditions.

AoS Latent Variables & Mixtures · 发表于 2020-02-01

Model assisted variable clustering: Minimax-optimal recovery and algorithms

Florentina Bunea, Christophe Giraud, Xi Luo, Martin Royer, Nicolas Verzelen

摘要

The problem of variable clustering is that of estimating groups of similar components of a $p$-dimensional vector $X=(X_{1},\ldots ,X_{p})$ from $n$ independent copies of $X$. There exists a large number of algorithms that return data-dependent groups of variables, but their interpretation is limited to the algorithm that produced them. An alternative is model-based clustering, in which one begins by defining population level clusters relative to a model that embeds notions of similarity. Algorithms tailored to such models yield estimated clusters with a clear statistical interpretation. We take this view here and introduce the class of $G$-block covariance models as a background model for variable clustering. In such models, two variables in a cluster are deemed similar if they have similar associations will all other variables. This can arise, for instance, when groups of variables are noise corrupted versions of the same latent factor. We quantify the difficulty of clustering data generated from a $G$-block covariance model in terms of cluster proximity, measured with respect to two related, but different, cluster separation metrics. We derive minimax cluster separation thresholds, which are the metric values below which no algorithm can recover the model-defined clusters exactly, and show that they are different for the two metrics. We therefore develop two algorithms, COD and PECOK, tailored to $G$-block covariance models, and study their minimax-optimality with respect to each metric. Of independent interest is the fact that the analysis of the PECOK algorithm, which is based on a corrected convex relaxation of the popular $K$-means algorithm, provides the first statistical analysis of such algorithms for variable clustering. Additionally, we compare our methods with another popular clustering method, spectral clustering. Extensive simulation studies, as well as our data analyses, confirm the applicability of our approach.

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