2019 年的期刊文章 · 第 20 页

共 1232 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2019-04-07 到 2019-03-31。

按期刊、按主题看 →

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

SiM Survival Analysis · 发表于 2019-04-07

Prioritized concordance index for hierarchical survival outcomes

Li C. Cheung, Qing Pan, Noorie Hyun, Hormuzd A. Katki

摘要

We propose an extension of Harrell's concordance (C) index to evaluate the prognostic utility of biomarkers for diseases with multiple measurable outcomes that can be prioritized. Our prioritized concordance index measures the probability that, given a random subject pair, the subject with the worst disease status as of a time τ has the higher predicted risk. Our prioritized concordance index uses the same approach as the win ratio, by basing generalized pairwise comparisons on the most severe or clinically important comparable outcome. We use an inverse probability weighting technique to correct for study‐specific censoring. Asymptotic properties are derived using U‐statistic properties. We apply the prioritized concordance index to two types of disease processes with a rare primary outcome and a more common secondary outcome. Our simulation studies show that when a predictor is predictive of both outcomes, the new concordance index can gain efficiency and power in identifying true prognostic variables compared to using the primary outcome alone. Using the prioritized concordance index, we examine whether novel clinical measures can be useful in predicting risk of type II diabetes in patients with impaired glucose resistance whose disease status can also regress to normal glucose resistance. We also examine the discrimination ability of four published risk models among ever smokers at risk of lung cancer incidence and subsequent death.

SiM Causal Inference Survival Analysis · 发表于 2019-04-04

Statistical inference for data‐adaptive doubly robust estimators with survival outcomes

Iván Díaz

摘要

The consistency of doubly robust estimators relies on the consistent estimation of at least one of two nuisance regression parameters. In moderate‐to‐large dimensions, the use of flexible data‐adaptive regression estimators may aid in achieving this consistency. However, n1/2‐consistency of doubly robust estimators is not guaranteed if one of the nuisance estimators is inconsistent. In this paper, we present a doubly robust estimator for survival analysis with the novel property that it converges to a Gaussian variable at an n1/2‐rate for a large class of data‐adaptive estimators of the nuisance parameters, under the only assumption that at least one of them is consistently estimated at an n1/4‐rate. This result is achieved through the adaptation of recent ideas in semiparametric inference, which amount to (i) Gaussianizing (ie, making asymptotically linear) a drift term that arises in the asymptotic analysis of the doubly robust estimator and (ii) using cross‐fitting to avoid entropy conditions on the nuisance estimators. We present the formula of the asymptotic variance of the estimator, which allows for the computation of doubly robust confidence intervals and p values. We illustrate the finite‐sample properties of the estimator in simulation studies and demonstrate its use in a phase III clinical trial for estimating the effect of a novel therapy for the treatment of human epidermal growth factor receptor 2 (HER2)–positive breast cancer.

SMMR Nonparametric & Semiparametric Longitudinal Data Testing & Uncertainty · 发表于 2019-04-04

Nonparametric estimation of risk tracking indices for longitudinal studies

Colin O Wu, Xin Tian, Lu Tian, Jared P Reis, Lihui Zhao, Norrina B Allen, Sejong Bae, Kiang Liu

摘要

Tracking a subject's risk factors or health status over time is an important objective in long-term epidemiological studies with repeated measurements. An important issue of time-trend tracking is to define appropriate statistical indices to quantitatively measure the tracking abilities of the targeted risk factors or health status over time. We present a number of local and global statistical tracking indices based on the rank-tracking probabilities, which are derived from the conditional distribution functions, and propose a class of kernel-based nonparametric estimation methods. Confidence intervals for the estimators of the tracking indices are constructed through a resampling subject bootstrap procedure. We demonstrate the application of the tracking indices using the body mass index and systolic blood pressure data from the Coronary Artery Risk Development in Young Adults (CARDIA) study. Statistical properties of the estimation methods and bootstrap inference are investigated through a simulation study and an asymptotic development.

SMMR Other · 发表于 2019-04-04

Integrating subgroups with mixed-type endpoints in early phase oncology trials

Lili Zhao, Carl Koschmann

摘要

Testing anti-cancer agents with multiple disease subtypes is challenging and it becomes more complicated when the subgroups have different types of endpoints (such as binary endpoints of tumor response and progression-free survival endpoints). When this occurs, one common approach in oncology is to conduct a series of small screening trials in specific patient subgroups, and these trials are typically run in parallel, independent of each other. However, this approach does not consider the possibility that some of the patient subpopulations respond similarly to therapy. In this article, we developed a simple approach to jointly model subgroups with mixed-type endpoints, which allows borrowing strength across subgroups for efficient estimation of treatment effects.

SMMR Testing & Uncertainty Survey & Sampling · 发表于 2019-04-04

Extreme-value sampling design is cost-beneficial only with a valid statistical approach for exposure–secondary outcome association analyses

Hang Zhang, Wenjian Bi, Yuehua Cui, Honglei Chen, Jinbo Chen, Yanlong Zhao, Guolian Kang

摘要

In epidemiology cohort studies, exposure data are collected in sub-studies based on a primary outcome (PO) of interest, as with the extreme-value sampling design (EVSD), to investigate their correlation. Secondary outcomes (SOs) data are also readily available, enabling researchers to assess the correlations between the exposure and the SOs. However, when the EVSD is used, the data for SOs are not representative samples of a general population; thus, many commonly used statistical methods, such as the generalized linear model (GLM), are not valid. A prospective likelihood method has been developed to associate SOs with single-nucleotide polymorphisms under an extreme phenotype sequencing design. In this paper, we describe the application of the prospective likelihood method (STEVSD) to exposure–SO association analysis under an EVSD. We undertook extensive simulations to assess the performance of the STEVSD method in associating binary and continuous exposures with SOs, comparing it to the simple GLM method that ignores the EVSD. To demonstrate the cost-benefit of the STEVSD method, we also mimicked the design of two new retrospective studies, as would be done in actual practice, based on the PO of interest, which was the same as the SO in the EVSD study. We then analyzed these data by using the GLM method and compared its power to that of the STEVSD method. We demonstrated the usefulness of the STEVSD method by applying it to a benign ethnic neutropenia dataset. Our results indicate that the STEVSD method can control type I error well, whereas the GLM method cannot do so owing to its ignorance of EVSD, and that the STEVSD method is cost-effective because it has statistical power similar to that of two new retrospective studies that require collecting new exposure data for selected individuals.

SMMR Diagnostics & Prediction Missing Data & Measurement Error · 发表于 2019-04-04

Combining biomarker and self-reported dietary intake data: A review of the state of the art and an exposition of concepts

Isobel Claire Gormley, Yuxin Bai, Lorraine Brennan

摘要

Classical approaches to assessing dietary intake are associated with measurement error. In an effort to address inherent measurement error in dietary self-reported data there is increased interest in the use of dietary biomarkers as objective measures of intake. Furthermore, there is a growing consensus of the need to combine dietary biomarker data with self-reported data. A review of state of the art techniques employed when combining biomarker and self-reported data is conducted. Two predominant methods, the calibration method and the method of triads, emerge as relevant techniques used when combining biomarker and self-reported data to account for measurement errors in dietary intake assessment. Both methods crucially assume measurement error independence. To expose and understand the performance of these methods in a range of realistic settings, their underpinning statistical concepts are unified and delineated, and thorough simulation studies are conducted. Results show that violation of the methods' assumptions negatively impacts resulting inference but that this impact is mitigated when the variation of the biomarker around the true intake is small. Thus there is much scope for the further development of biomarkers and models in tandem to achieve the ultimate goal of accurately assessing dietary intake.

SMMR Clinical Trials Longitudinal Data Diagnostics & Prediction · 发表于 2019-04-04

An adaptive design for the identification of the optimal dose using joint modeling of continuous repeated biomarker measurements and time-to-toxicity in phase I/II clinical trials in oncology

Maria-Athina Altzerinakou, Xavier Paoletti

摘要

We present a new adaptive dose-finding method, based on a joint modeling of longitudinal continuous biomarker activity measurements and time to first dose limiting toxicity, with a shared random effect. Estimation relies on likelihood that does not require approximation, an important property in the context of small sample sizes, typical of phase I/II trials. We address the important case of missing at random data that stem from unacceptable toxicity, lack of activity and rapid deterioration of phase I patients. The objective is to determine the lowest dose within a range of highly active doses, under the constraint of not exceeding the maximum tolerated dose. The maximum tolerated dose is associated to some cumulative risk of dose limiting toxicity over a predefined number of treatment cycles. Operating characteristics are explored via simulations in various scenarios.

Biometrika Optimization & Learning Theory · 发表于 2019-04-03

Wasserstein covariance for multiple random densities

Alexander Petersen, Hans-Georg Müller

摘要

A common feature of methods for analysing samples of probability density functions is that they respect the geometry inherent to the space of densities. Once a metric is specified for this space, the Fréchet mean is typically used to quantify and visualize the average density of the sample. For one-dimensional densities, the Wasserstein metric is popular due to its theoretical appeal and interpretive value as an optimal transport metric, leading to the Wasserstein–Fréchet mean or barycentre as the mean density. We extend the existing methodology for samples of densities in two key directions. First, motivated by applications in neuroimaging, we consider dependent density data, where a |$p$|-vector of univariate random densities is observed for each sampling unit. Second, we introduce a Wasserstein covariance measure and propose intuitively appealing estimators for both fixed and diverging |$p$|⁠, where the latter corresponds to continuously indexed densities. We also give theory demonstrating consistency and asymptotic normality, while accounting for errors introduced in the unavoidable preparatory density estimation step. The utility of the Wasserstein covariance matrix is demonstrated through applications to functional connectivity in the brain using functional magnetic resonance imaging data and to the secular evolution of mortality for various countries. *(abstract via OpenAlex)*

Biometrika Nonparametric & Semiparametric Missing Data & Measurement Error · 发表于 2019-04-03

Spectral density estimation for random fields via periodic embeddings

Joseph Guinness

摘要

We introduce methods for estimating the spectral density of a random field on a [Formula: see text]-dimensional lattice from incomplete gridded data. Data are iteratively imputed onto an expanded lattice according to a model with a periodic covariance function. The imputations are convenient computationally, in that circulant embedding and preconditioned conjugate gradient methods can produce imputations in [Formula: see text] time and [Formula: see text] memory. However, these so-called periodic imputations are motivated mainly by their ability to produce accurate spectral density estimates. In addition, we introduce a parametric filtering method that is designed to reduce periodogram smoothing bias. The paper contains theoretical results on properties of the imputed-data periodogram and numerical and simulation studies comparing the performance of the proposed methods to existing approaches in a number of scenarios. We present an application to a gridded satellite surface temperature dataset with missing values. *(abstract via PubMed)*

SMMR Diagnostics & Prediction · 发表于 2019-04-03

Semi-supervised estimation of covariance with application to phenome-wide association studies with electronic medical records data

Stephanie F Chan, Boris P Hejblum, Abhishek Chakrabortty, Tianxi Cai

摘要

Electronic medical records data are valuable resources for discovery research. They contain detailed phenotypic information on individual patients, opening opportunities for simultaneously studying multiple phenotypes. A useful tool for such simultaneous assessment is the phenome-wide association study, which relates a genomic or biological marker of interest to a wide spectrum of disease phenotypes, typically defined by the diagnostic billing codes. One challenge arises when the biomarker of interest is expensive to measure on the entire electronic medical record cohort. Performing phenome-wide association study based on supervised estimation using only subjects who have marker measurements may yield limited power. In this paper, we focus on the setting where the marker is measured on a small fraction of the patients while a few surrogate markers such as historical measurements of the biomarker are available on a large number of patients. We propose an efficient semi-supervised estimation procedure to estimate the covariance between the biomarker and the billing code, leveraging the surrogate marker information. We employ surrogate marker values to impute the missing outcome via a two-step semi-non-parametric approach and demonstrate that our proposed estimator is always more efficient than the supervised counterpart without requiring the imputation model to be correct. We illustrate the proposed procedure by assessing the association between the C-reactive protein and some inflammatory diseases with an electronic medical record study of inflammatory bowel disease performed with the Partners HealthCare electronic medical record database where C-reactive protein was only measured for a small fraction of the patients due to budget constraints.

Biometrika Testing & Uncertainty Survey & Sampling · 发表于 2019-04-03

Pseudo-population bootstrap methods for imputed survey data

S Chen, D Haziza, C Léger, Z Mashreghi

摘要

The most common way to treat item nonresponse in surveys is to replace a missing value by a plausible value constructed on the basis of fully observed variables. Treating the imputed values as if they were observed may lead to invalid inferences. Bootstrap variance estimators for various finite population parameters are obtained using two pseudo-population bootstrap schemes. We establish the asymptotic properties of the resulting bootstrap variance estimators for population totals and population quantiles. A simulation study suggests that the methods perform well in terms of relative bias and coverage probability. *(abstract via PubMed)*

Biometrika Bayesian Methods · 发表于 2019-04-03

Multivariate output analysis for Markov chain Monte Carlo

Dootika Vats, James M Flegal, Galin L Jones

摘要

Markov chain Monte Carlo produces a correlated sample which may be used for estimating expectations with respect to a target distribution. A fundamental question is: when should sampling stop so that we have good estimates of the desired quantities? The key to answering this question lies in assessing the Monte Carlo error through a multivariate Markov chain central limit theorem. The multivariate nature of this Monte Carlo error has been largely ignored in the literature. We present a multivariate framework for terminating a simulation in Markov chain Monte Carlo. We define a multivariate effective sample size, the estimation of which requires strongly consistent estimators of the covariance matrix in the Markov chain central limit theorem, a property we show for the multivariate batch means estimator. We then provide a lower bound on the number of minimum effective samples required for a desired level of precision. This lower bound does not depend on the underlying stochastic process and can be calculated a priori. This result is obtained by drawing a connection between terminating simulation via effective sample size and terminating simulation using a relative standard deviation fixed-volume sequential stopping rule, which we demonstrate is an asymptotically valid procedure. The finite-sample properties of the proposed method are demonstrated in a variety of examples. *(abstract via OpenAlex)*

Biometrika Causal Inference · 发表于 2019-04-03

Integrating the evidence from evidence factors in observational studies

B Karmakar, B French, D S Small

摘要

Summary: A sensitivity analysis for an observational study assesses how much bias, due to nonrandom assignment of treatment, would be necessary to change the conclusions of an analysis that assumes treatment assignment was effectively random. The evidence for a treatment effect can be strengthened if two different analyses, which could be affected by different types of biases, are both somewhat insensitive to bias. The finding from the observational study is then said to be replicated. Evidence factors allow for two independent analyses to be constructed from the same dataset. When combining the evidence factors, the Type I error rate must be controlled to obtain valid inference. A powerful method is developed for controlling the familywise error rate for sensitivity analyses with evidence factors. It is shown that the Bahadur efficiency of sensitivity analysis for the combined evidence is greater than for either evidence factor alone. The proposed methods are illustrated through a study of the effect of radiation exposure on the risk of cancer. An R package, evidenceFactors, is available from CRAN to implement the methods of the paper.

SMMR Causal Inference · 发表于 2019-04-03

Handling ties in continuous outcomes for confounder adjustment with rank-ordered logit and its application to ordinal outcomes

Yilin Ning, Chuen Seng Tan, Angeliki Maraki, Peh Joo Ho, Sheilagh Hodgins, Erika Comasco, Kent W Nilsson, Philippe Wagner, Eric YH Khoo, E-Shyong Tai, Shih Ling Kao, Mikael Hartman, Marie Reilly, Nathalie C Støer

摘要

The rank-ordered logit (rologit) model was recently introduced as a robust approach for analysing continuous outcomes, with the linear exposure effect estimated by scaling the rank-based log-odds estimate. Here we extend the application of the rologit model to continuous outcomes with ties and ordinal outcomes treated as imperfectly-observed continuous outcomes. By identifying the functional relationship between survival times and continuous outcomes, we explicitly establish the equivalence between the rologit and Cox models to justify the use of the Breslow, Efron and perturbation methods in the analysis of continuous outcomes with ties. Using simulation, we found all three methods perform well with few ties. Although an increasing extent of ties increased the bias of the log-odds and linear effect estimates and resulted in reduced power, which was somewhat worse when the model was mis-specified, the perturbation method maintained a type I error around 5%, while the Efron method became conservative with heavy ties but outperformed Breslow. In general, the perturbation method had the highest power, followed by the Efron and then the Breslow method. We applied our approach to three real-life datasets, demonstrating a seamless analytical workflow that uses stratification for confounder adjustment in studies of continuous and ordinal outcomes.

JASA Survival Analysis Machine Learning · 发表于 2019-04-03

Estimating and Testing Vaccine Sieve Effects Using Machine Learning

David Benkeser, Peter B. Gilbert, Marco Carone

摘要

When available, vaccines are an effective means of disease prevention. Unfortunately, efficacious vaccines have not yet been developed for several major infectious diseases, including HIV and malaria. Vaccine sieve analysis studies whether and how the efficacy of a vaccine varies with the genetics of the pathogen of interest, which can guide subsequent vaccine development and deployment. In sieve analyses, the effect of the vaccine on the cumulative incidence corresponding to each of several possible genotypes is often assessed within a competing risks framework. In the context of clinical trials, the estimators employed in these analyses generally do not account for covariates, even though the latter may be predictive of the study endpoint or censoring. Motivated by two recent preventive vaccine efficacy trials for HIV and malaria, we develop new methodology for vaccine sieve analysis. Our approach offers improved validity and efficiency relative to existing approaches by allowing covariate adjustment through ensemble machine learning. We derive results that indicate how to perform statistical inference using our estimators. Our analysis of the HIV and malaria trials shows markedly increased precision -- up to doubled efficiency in both trials -- under more plausible assumptions compared with standard methodology. Our findings provide greater evidence for vaccine sieve effects in both trials. *(abstract via PubMed)*

SiM Econometrics & Economics Spatial & Time Series · 发表于 2019-04-02

Modeling lottery incentives for daily adherence

Colman H. Humphrey, Dylan S. Small, Shane T. Jensen, Kevin G. Volpp, David A. Asch, Jingsan Zhu, Andrea B. Troxel

摘要

Many health issues require adherence to recommended daily activities, such as taking medication to manage a chronic condition, walking a certain distance to promote weight loss, or measuring weights to assess fluid balance in heart failure. The cost of nonadherence can be high, with respect to both individual health outcomes and the healthcare system. Incentivizing adherence to daily activities can promote better health in patients and populations and potentially provide long‐term cost savings. Multiple incentive structures are possible. We focus here on a daily lottery incentive in which payment occurs when both the participant's lottery number matches the number drawn and the participant adheres to the targeted daily behavior. Our objective is to model the lottery's effect on participants' probability to complete the targeted task, particularly over the short term. We combine two procedures for analyzing such binary time series: a parameter‐driven regression model with an autocorrelated latent process and a comparative interrupted time series. We use the output of the regression model as the control generator for the comparative time series in order to create a quasi‐experimental design.

JASA Other · 发表于 2019-04-02

Limits to Human Life Span Through Extreme Value Theory

Jesson J. Einmahl, John H. J. Einmahl, Laurens de Haan

摘要

There is no scientific consensus on the fundamental question whether the probability distribution of the human life span has a finite endpoint or not and, if so, whether this upper limit changes over time. Our study uses a unique dataset of the ages at death—in days—of all (about 285,000) Dutch residents, born in the Netherlands, who died in the years 1986–2015 at a minimum age of 92 years and is based on extreme value theory, the coherent approach to research problems of this type. Unlike some other studies, we base our analysis on the configuration of thousands of mortality data of old people, not just the few oldest old. We find compelling statistical evidence that there is indeed an upper limit to the life span of men and to that of women for all the 30 years we consider and, moreover, that there are no indications of trends in these upper limits over the last 30 years, despite the fact that the number of people reaching high age (say 95 years) was almost tripling. We also present estimates for the endpoints, for the force of mortality at very high age, and for the so-called perseverance parameter. Supplementary materials for this article, including a standardized description of the materials available for reproducing the work, are available as an online supplement. *(abstract via OpenAlex)*

SiM Causal Inference · 发表于 2019-04-02

Estimation of average treatment effects among multiple treatment groups by using an ensemble approach

Xiaofang Yan, Younathan Abdia, Somnath Datta, K. B. Kulasekera, Beatrice Ugiliweneza, Maxwell Boakye, Maiying Kong

摘要

In observational studies, generalized propensity score (GPS)–based statistical methods, such as inverse probability weighting (IPW) and doubly robust (DR) method, have been proposed to estimate the average treatment effect (ATE) among multiple treatment groups. In this article, we investigate the GPS‐based statistical methods to estimate treatment effects from two aspects. The first aspect of our investigation is to obtain an optimal GPS estimation method among four competing GPS estimation methods by using a rank aggregation approach. We further examine whether the optimal GPS‐based IPW and DR methods would improve the performance for estimating ATE. It is well known that the DR method is consistent if either the GPS or the outcome models are correctly specified. The second aspect of our investigation is to examine whether the DR method could be improved if we ensemble outcome models. To that end, bootstrap method and rank aggregation method are used to obtain the ensemble optimal outcome model from several competing outcome models, and the resulting outcome model is incorporated into the DR method, resulting in an ensemble DR (enDR) method. Extensive simulation results indicate that the enDR method provides the best performance in estimating the ATE regardless of the method used for estimating GPS. We illustrate our methods using the MarketScan healthcare insurance claims database to examine the treatment effects among three different bones and substitutes used for spinal fusion surgeries. We draw conclusions based on the estimates from the enDR method coupled with the optimal GPS estimation method.

AoS Testing & Uncertainty · 发表于 2019-04-01

The geometry of hypothesis testing over convex cones: Generalized likelihood ratio tests and minimax radii

Yuting Wei, Martin J. Wainwright, Adityanand Guntuboyina

摘要

We consider a compound testing problem within the Gaussian sequence model in which the null and alternative are specified by a pair of closed, convex cones. Such cone testing problem arises in various applications, including detection of treatment effects, trend detection in econometrics, signal detection in radar processing and shape-constrained inference in nonparametric statistics. We provide a sharp characterization of the GLRT testing radius up to a universal multiplicative constant in terms of the geometric structure of the underlying convex cones. When applied to concrete examples, this result reveals some interesting phenomena that do not arise in the analogous problems of estimation under convex constraints. In particular, in contrast to estimation error, the testing error no longer depends purely on the problem complexity via a volume-based measure (such as metric entropy or Gaussian complexity); other geometric properties of the cones also play an important role. In order to address the issue of optimality, we prove information-theoretic lower bounds for the minimax testing radius again in terms of geometric quantities. Our general theorems are illustrated by examples including the cases of monotone and orthant cones, and involve some results of independent interest.

AoS Other · 发表于 2019-04-01

Sub-Gaussian estimators of the mean of a random vector

Gábor Lugosi, Shahar Mendelson

摘要

We study the problem of estimating the mean of a random vector $X$ given a sample of $N$ independent, identically distributed points. We introduce a new estimator that achieves a purely sub-Gaussian performance under the only condition that the second moment of $X$ exists. The estimator is based on a novel concept of a multivariate median.

AoS Other · 发表于 2019-04-01

Signal aliasing in Gaussian random fields for experiments with qualitative factors

Ming-Chung Chang, Shao-Wei Cheng, Ching-Shui Cheng

摘要

Signal aliasing is an inevitable consequence of using fractional factorial designs. Unlike linear models with fixed factorial effects, for Gaussian random field models advocated in some Bayesian design and computer experiment literature, the issue of signal aliasing has not received comparable attention. In the present article, this issue is tackled for experiments with qualitative factors. The signals in a Gaussian random field can be characterized by the random effects identified from the covariance function. The aliasing severity of the signals is determined by two key elements: (i) the aliasing pattern, which depends only on the chosen design, and (ii) the effect priority, which is related to the variances of the random effects and depends on the model parameters. We first apply this framework to study the signal-aliasing problem for regular fractional factorial designs. For general factorial designs including nonregular ones, we propose an aliasing severity index to quantify the severity of signal aliasing. We also observe that the aliasing severity index is highly correlated with the prediction variance.

AoS Other · 发表于 2019-04-01

Rank verification for exponential families

Kenneth Hung, William Fithian

摘要

Many statistical experiments involve comparing multiple population groups. For example, a public opinion poll may ask which of several political candidates commands the most support; a social scientific survey may report the most common of several responses to a question; or, a clinical trial may compare binary patient outcomes under several treatment conditions to determine the most effective treatment. Having observed the “winner” (largest observed response) in a noisy experiment, it is natural to ask whether that candidate, survey response or treatment is actually the “best” (stochastically largest response). This article concerns the problem of rank verification—post hoc significance tests of whether the orderings discovered in the data reflect the population ranks. For exponential family models, we show under mild conditions that an unadjusted two-tailed pairwise test comparing the first two-order statistics (i.e., comparing the “winner” to the “runner-up”) is a valid test of whether the winner is truly the best. We extend our analysis to provide equally simple procedures to obtain lower confidence bounds on the gap between the winning population and the others, and to verify ranks beyond the first.

AoS High-Dimensional · 发表于 2019-04-01

Partial least squares prediction in high-dimensional regression

R. Dennis Cook, Liliana Forzani

摘要

We study the asymptotic behavior of predictions from partial least squares (PLS) regression as the sample size and number of predictors diverge in various alignments. We show that there is a range of regression scenarios where PLS predictions have the usual root-$n$ convergence rate, even when the sample size is substantially smaller than the number of predictors, and an even wider range where the rate is slower but may still produce practically useful results. We show also that PLS predictions achieve their best asymptotic behavior in abundant regressions where many predictors contribute information about the response. Their asymptotic behavior tends to be undesirable in sparse regressions where few predictors contribute information about the response.

AoS High-Dimensional Spatial & Time Series · 发表于 2019-04-01

On model selection from a finite family of possibly misspecified time series models

Hsiang-Ling Hsu, Ching-Kang Ing, Howell Tong

摘要

Consider finite parametric time series models. “I have $n$ observations and $k$ models, which model should I choose on the basis of the data alone” is a frequently asked question in many practical situations. This poses the key problem of selecting a model from a collection of candidate models, none of which is necessarily the true data generating process (DGP). Although existing literature on model selection is vast, there is a serious lacuna in that the above problem does not seem to have received much attention. In fact, existing model selection criteria have avoided addressing the above problem directly, either by assuming that the true DGP is included among the candidate models and aiming at choosing this DGP, or by assuming that the true DGP can be asymptotically approximated by an increasing sequence of candidate models and aiming at choosing the candidate having the best predictive capability in some asymptotic sense. In this article, we propose a misspecification-resistant information criterion (MRIC) to address the key problem directly. We first prove the asymptotic efficiency of MRIC whether the true DGP is among the candidates or not, within the fixed-dimensional framework. We then extend this result to the high-dimensional case in which the number of candidate variables is much larger than the sample size. In particular, we show that MRIC can be used in conjunction with a high-dimensional model selection method to select the (asymptotically) best predictive model across several high-dimensional misspecified time series models.

AoS Nonparametric & Semiparametric · 发表于 2019-04-01

Nonparametric implied Lévy densities

Likuan Qin, Viktor Todorov

摘要

This paper develops a nonparametric estimator for the Lévy density of an asset price, following an Itô semimartingale, implied by short-maturity options. The asymptotic setup is one in which the time to maturity of the available options decreases, the mesh of the available strike grid shrinks and the strike range expands. The estimation is based on aggregating the observed option data into nonparametric estimates of the conditional characteristic function of the return distribution, the derivatives of which allow to infer the Fourier transform of a known transform of the Lévy density in a way which is robust to the level of the unknown diffusive volatility of the asset price. The Lévy density estimate is then constructed via Fourier inversion. We derive an asymptotic bound for the integrated squared error of the estimator in the general case as well as its probability limit in the special Lévy case. We further show rate optimality of our Lévy density estimator in a minimax sense. An empirical application to market index options reveals relative stability of the left tail decay during high and low volatility periods.

AoS Machine Learning Nonparametric & Semiparametric · 发表于 2019-04-01

Generalized random forests

Susan Athey, Julie Tibshirani, Stefan Wager

摘要

We propose generalized random forests, a method for nonparametric statistical estimation based on random forests (Breiman [Mach. Learn. 45 (2001) 5–32]) that can be used to fit any quantity of interest identified as the solution to a set of local moment equations. Following the literature on local maximum likelihood estimation, our method considers a weighted set of nearby training examples; however, instead of using classical kernel weighting functions that are prone to a strong curse of dimensionality, we use an adaptive weighting function derived from a forest designed to express heterogeneity in the specified quantity of interest. We propose a flexible, computationally efficient algorithm for growing generalized random forests, develop a large sample theory for our method showing that our estimates are consistent and asymptotically Gaussian and provide an estimator for their asymptotic variance that enables valid confidence intervals. We use our approach to develop new methods for three statistical tasks: nonparametric quantile regression, conditional average partial effect estimation and heterogeneous treatment effect estimation via instrumental variables. A software implementation, grf for R and C++, is available from CRAN.

AoS Other · 发表于 2019-04-01

Fréchet regression for random objects with Euclidean predictors

Alexander Petersen, Hans-Georg Müller

摘要

Increasingly, statisticians are faced with the task of analyzing complex data that are non-Euclidean and specifically do not lie in a vector space. To address the need for statistical methods for such data, we introduce the concept of Fréchet regression. This is a general approach to regression when responses are complex random objects in a metric space and predictors are in $\mathcal{R}^{p}$, achieved by extending the classical concept of a Fréchet mean to the notion of a conditional Fréchet mean. We develop generalized versions of both global least squares regression and local weighted least squares smoothing. The target quantities are appropriately defined population versions of global and local regression for response objects in a metric space. We derive asymptotic rates of convergence for the corresponding fitted regressions using observed data to the population targets under suitable regularity conditions by applying empirical process methods. For the special case of random objects that reside in a Hilbert space, such as regression models with vector predictors and functional data as responses, we obtain a limit distribution. The proposed methods have broad applicability. Illustrative examples include responses that consist of probability distributions and correlation matrices, and we demonstrate both global and local Fréchet regression for demographic and brain imaging data. Local Fréchet regression is also illustrated via a simulation with response data which lie on the sphere.

AoS Other · 发表于 2019-04-01

Estimation and prediction using generalized Wendland covariance functions under fixed domain asymptotics

Moreno Bevilacqua, Tarik Faouzi, Reinhard Furrer, Emilio Porcu

摘要

We study estimation and prediction of Gaussian random fields with covariance models belonging to the generalized Wendland (GW) class, under fixed domain asymptotics. As for the Matérn case, this class allows for a continuous parameterization of smoothness of the underlying Gaussian random field, being additionally compactly supported. The paper is divided into three parts: first, we characterize the equivalence of two Gaussian measures with GW covariance function, and we provide sufficient conditions for the equivalence of two Gaussian measures with Matérn and GW covariance functions. In the second part, we establish strong consistency and asymptotic distribution of the maximum likelihood estimator of the microergodic parameter associated to GW covariance model, under fixed domain asymptotics. The third part elucidates the consequences of our results in terms of (misspecified) best linear unbiased predictor, under fixed domain asymptotics. Our findings are illustrated through a simulation study: the former compares the finite sample behavior of the maximum likelihood estimation of the microergodic parameter with the given asymptotic distribution. The latter compares the finite-sample behavior of the prediction and its associated mean square error when using two equivalent Gaussian measures with Matérn and GW covariance models, using covariance tapering as benchmark.

AoS Machine Learning Testing & Uncertainty · 发表于 2019-04-01

Estimating the algorithmic variance of randomized ensembles via the bootstrap

Miles E. Lopes

摘要

Although the methods of bagging and random forests are some of the most widely used prediction methods, relatively little is known about their algorithmic convergence. In particular, there are not many theoretical guarantees for deciding when an ensemble is “large enough”—so that its accuracy is close to that of an ideal infinite ensemble. Due to the fact that bagging and random forests are randomized algorithms, the choice of ensemble size is closely related to the notion of “algorithmic variance” (i.e., the variance of prediction error due only to the training algorithm). In the present work, we propose a bootstrap method to estimate this variance for bagging, random forests and related methods in the context of classification. To be specific, suppose the training dataset is fixed, and let the random variable $\mathrm{ERR}_{t}$ denote the prediction error of a randomized ensemble of size $t$. Working under a “first-order model” for randomized ensembles, we prove that the centered law of $\mathrm{ERR}_{t}$ can be consistently approximated via the proposed method as $t\to\infty$. Meanwhile, the computational cost of the method is quite modest, by virtue of an extrapolation technique. As a consequence, the method offers a practical guideline for deciding when the algorithmic fluctuations of $\mathrm{ERR}_{t}$ are negligible.

AoS Bayesian Methods Nonparametric & Semiparametric · 发表于 2019-04-01

Efficient nonparametric Bayesian inference for $X$-ray transforms

François Monard, Richard Nickl, Gabriel P. Paternain

摘要

We consider the statistical inverse problem of recovering a function $f:M\to \mathbb{R}$, where $M$ is a smooth compact Riemannian manifold with boundary, from measurements of general $X$-ray transforms $I_{a}(f)$ of $f$, corrupted by additive Gaussian noise. For $M$ equal to the unit disk with “flat” geometry and $a=0$ this reduces to the standard Radon transform, but our general setting allows for anisotropic media $M$ and can further model local “attenuation” effects—both highly relevant in practical imaging problems such as SPECT tomography. We study a nonparametric Bayesian inference method based on standard Gaussian process priors for $f$. The posterior reconstruction of $f$ corresponds to a Tikhonov regulariser with a reproducing kernel Hilbert space norm penalty that does not require the calculation of the singular value decomposition of the forward operator $I_{a}$. We prove Bernstein–von Mises theorems for a large family of one-dimensional linear functionals of $f$, and they entail that posterior-based inferences such as credible sets are valid and optimal from a frequentist point of view. In particular we derive the asymptotic distribution of smooth linear functionals of the Tikhonov regulariser, which attains the semiparametric information lower bound. The proofs rely on an invertibility result for the “Fisher information” operator $I_{a}^{*}I_{a}$ between suitable function spaces, a result of independent interest that relies on techniques from microlocal analysis. We illustrate the performance of the proposed method via simulations in various settings.

AoS Other · 发表于 2019-04-01

Divide and conquer in nonstandard problems and the super-efficiency phenomenon

Moulinath Banerjee, Cécile Durot, Bodhisattva Sen

摘要

We study how the divide and conquer principle works in non-standard problems where rates of convergence are typically slower than $\sqrt{n}$ and limit distributions are non-Gaussian, and provide a detailed treatment for a variety of important and well-studied problems involving nonparametric estimation of a monotone function. We find that for a fixed model, the pooled estimator, obtained by averaging nonstandard estimates across mutually exclusive subsamples, outperforms the nonstandard monotonicity-constrained (global) estimator based on the entire sample in the sense of pointwise estimation of the function. We also show that, under appropriate conditions, if the number of subsamples is allowed to increase at appropriate rates, the pooled estimator is asymptotically normally distributed with a variance that is empirically estimable from the subsample-level estimates. Further, in the context of monotone regression, we show that this gain in efficiency under a fixed model comes at a price—the pooled estimator’s performance, in a uniform sense (maximal risk) over a class of models worsens as the number of subsamples increases, leading to a version of the super-efficiency phenomenon. In the process, we develop analytical results for the order of the bias in isotonic regression, which are of independent interest.

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

Diagnosing Glaucoma Progression With Visual Field Data Using a Spatiotemporal Boundary Detection Method

Samuel I. Berchuck, Jean-Claude Mwanza, Joshua L. Warren

摘要

Diagnosing glaucoma progression is critical for limiting irreversible vision loss. A common method for assessing glaucoma progression uses a longitudinal series of visual fields (VF) acquired at regular intervals. VF data are characterized by a complex spatiotemporal structure due to the data generating process and ocular anatomy. Thus, advanced statistical methods are needed to make clinical determinations regarding progression status. We introduce a spatiotemporal boundary detection model that allows the underlying anatomy of the optic disc to dictate the spatial structure of the VF data across time. We show that our new method provides novel insight into vision loss that improves diagnosis of glaucoma progression using data from the Vein Pulsation Study Trial in Glaucoma and the Lions Eye Institute trial registry. Simulations are presented, showing the proposed methodology is preferred over existing spatial methods for VF data. Supplementary materials for this article are available online and the method is implemented in the R package womblR. *(abstract via PubMed)*

AoS Other · 发表于 2019-04-01

Cross: Efficient low-rank tensor completion

Anru Zhang

摘要

The completion of tensors, or high-order arrays, attracts significant attention in recent research. Current literature on tensor completion primarily focuses on recovery from a set of uniformly randomly measured entries, and the required number of measurements to achieve recovery is not guaranteed to be optimal. In addition, the implementation of some previous methods are NP-hard. In this article, we propose a framework for low-rank tensor completion via a novel tensor measurement scheme that we name Cross. The proposed procedure is efficient and easy to implement. In particular, we show that a third-order tensor of Tucker rank-$(r_{1},r_{2},r_{3})$ in $p_{1}$-by-$p_{2}$-by-$p_{3}$ dimensional space can be recovered from as few as $r_{1}r_{2}r_{3}+r_{1}(p_{1}-r_{1})+r_{2}(p_{2}-r_{2})+r_{3}(p_{3}-r_{3})$ noiseless measurements, which matches the sample complexity lower bound. In the case of noisy measurements, we also develop a theoretical upper bound and the matching minimax lower bound for recovery error over certain classes of low-rank tensors for the proposed procedure. The results can be further extended to fourth or higher-order tensors. Simulation studies show that the method performs well under a variety of settings. Finally, the procedure is illustrated through a real dataset in neuroimaging.

AoS Causal Inference · 发表于 2019-04-01

Covariate balancing propensity score by tailored loss functions

Qingyuan Zhao

摘要

In observational studies, propensity scores are commonly estimated by maximum likelihood but may fail to balance high-dimensional pretreatment covariates even after specification search. We introduce a general framework that unifies and generalizes several recent proposals to improve covariate balance when designing an observational study. Instead of the likelihood function, we propose to optimize special loss functions—covariate balancing scoring rules (CBSR)—to estimate the propensity score. A CBSR is uniquely determined by the link function in the GLM and the estimand (a weighted average treatment effect). We show CBSR does not lose asymptotic efficiency in estimating the weighted average treatment effect compared to the Bernoulli likelihood, but CBSR is much more robust in finite samples. Borrowing tools developed in statistical learning, we propose practical strategies to balance covariate functions in rich function classes. This is useful to estimate the maximum bias of the inverse probability weighting (IPW) estimators and construct honest confidence intervals in finite samples. Lastly, we provide several numerical examples to demonstrate the tradeoff of bias and variance in the IPW-type estimators and the tradeoff in balancing different function classes of the covariates.

AoS Other · 发表于 2019-04-01

Computation of maximum likelihood estimates in cyclic structural equation models

Mathias Drton, Christopher Fox, Y. Samuel Wang

摘要

Software for computation of maximum likelihood estimates in linear structural equation models typically employs general techniques from nonlinear optimization, such as quasi-Newton methods. In practice, careful tuning of initial values is often required to avoid convergence issues. As an alternative approach, we propose a block-coordinate descent method that cycles through the considered variables, updating only the parameters related to a given variable in each step. We show that the resulting block update problems can be solved in closed form even when the structural equation model comprises feedback cycles. Furthermore, we give a characterization of the models for which the block-coordinate descent algorithm is well defined, meaning that for generic data and starting values all block optimization problems admit a unique solution. For the characterization, we represent each model by its mixed graph (also known as path diagram), which leads to criteria that can be checked in time that is polynomial in the number of considered variables.

AoS Networks & Graphs · 发表于 2019-04-01

Combinatorial inference for graphical models

Matey Neykov, Junwei Lu, Han Liu

摘要

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global structure of the underlying graph. Examples include testing the graph connectivity, the presence of a cycle of certain size, or the maximum degree of the graph. To begin with, we study the information-theoretic limits of a large family of combinatorial inference problems. We propose new concepts including structural packing and buffer entropies to characterize how the complexity of combinatorial graph structures impacts the corresponding minimax lower bounds. On the other hand, we propose a family of novel and practical structural testing algorithms to match the lower bounds. We provide numerical results on both synthetic graphical models and brain networks to illustrate the usefulness of these proposed methods.

AoS Other · 发表于 2019-04-01

Chebyshev polynomials, moment matching, and optimal estimation of the unseen

Yihong Wu, Pengkun Yang

摘要

We consider the problem of estimating the support size of a discrete distribution whose minimum nonzero mass is at least $\frac{1}{k}$. Under the independent sampling model, we show that the sample complexity, that is, the minimal sample size to achieve an additive error of $\varepsilon k$ with probability at least 0.1 is within universal constant factors of $\frac{k}{\log k}\log^{2}\frac{1}{\varepsilon }$, which improves the state-of-the-art result of $\frac{k}{\varepsilon^{2}\log k}$ in [In Advances in Neural Information Processing Systems (2013) 2157–2165]. Similar characterization of the minimax risk is also obtained. Our procedure is a linear estimator based on the Chebyshev polynomial and its approximation-theoretic properties, which can be evaluated in $O(n+\log^{2}k)$ time and attains the sample complexity within constant factors. The superiority of the proposed estimator in terms of accuracy, computational efficiency and scalability is demonstrated in a variety of synthetic and real datasets.

JASA Bayesian Methods Latent Variables & Mixtures · 发表于 2019-04-01

Bayesian Repulsive Gaussian Mixture Model

Fangzheng Xie, Yanxun Xu

摘要

We develop a general class of Bayesian repulsive Gaussian mixture models that encourage well-separated clusters, aiming at reducing potentially redundant components produced by independent priors for locations (such as the Dirichlet process). The asymptotic results for the posterior distribution of the proposed models are derived, including posterior consistency and posterior contraction rate in the context of nonparametric density estimation. More importantly, we show that compared to the independent prior on the component centers, the repulsive prior introduces additional shrinkage effect on the tail probability of the posterior number of components, which serves as a measurement of the model complexity. In addition, a generalized urn model that allows a random number of components and correlated component centers is developed based on the exchangeable partition distribution, which gives rise to the corresponding blocked-collapsed Gibbs sampler for posterior inference. We evaluate the performance and demonstrate the advantages of the proposed methodology through extensive simulation studies and real data analysis. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

AoS Other · 发表于 2019-04-01

A classification criterion for definitive screening designs

Eric D. Schoen, Pieter T. Eendebak, Peter Goos

摘要

A conference design is a rectangular matrix with orthogonal columns, one zero in each column, at most one zero in each row and $-1$’s and $+1$’s elsewhere. A definitive screening design can be constructed by folding over a conference design and adding a row vector of zeroes. We prove that, for a given even number of rows, there is just one isomorphism class for conference designs with two or three columns. Next, we derive all isomorphism classes for conference designs with four columns. Based on our results, we propose a classification criterion for definitive screening designs founded on projections into four factors. We illustrate the potential of the criterion by studying designs with 24 and 82 factors.

SiM Genetics & Omics Testing & Uncertainty · 发表于 2019-03-31

Two‐stage analysis for selecting fixed numbers of features in omics association studies

Takanori Kawabata, Ryo Emoto, Jo Nishino, Kunihiko Takahashi, Shigeyuki Matsui

摘要

One of main roles of omics‐based association studies with high‐throughput technologies is to screen out relevant molecular features, such as genetic variants, genes, and proteins, from a large pool of such candidate features based on their associations with the phenotype of interest. Typically, screened features are subject to validation studies using more established or conventional assays, where the number of evaluable features is relatively limited, so that there may exist a fixed number of features measurable by these assays. Such a limitation necessitates narrowing a feature set down to a fixed size, following an initial screening analysis via multiple testing where adjustment for multiplicity is made. We propose a two‐stage screening approach to control the false discovery rate (FDR) for a feature set with fixed size that is subject to validation studies, rather than for a feature set from the initial screening analysis. Out of the feature set selected in the first stage with a relaxed FDR level, a fraction of features with most statistical significance is firstly selected. For the remaining feature set, features are selected based on biological consideration only, without regard to any statistical information, which allows evaluating the FDR level for the finally selected feature set with fixed size. Improvement of the power is discussed in the proposed two‐stage screening approach. Simulation experiments based on parametric models and real microarray datasets demonstrated substantial increment in the number of screened features for biological consideration compared with the standard screening approach, allowing for more extensive and in‐depth biological investigations in omics association studies.

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