2018 年的期刊文章 · 第 7 页

共 1294 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2018-10-08 到 2018-10-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 页

JASA Bayesian Methods Spatial & Time Series · 发表于 2018-10-08

On the Long-Run Volatility of Stocks

Carlos M. Carvalho, Hedibert F. Lopes, Robert E. McCulloch

摘要

In this article, we investigate whether or not the volatility per period of stocks is lower over longer horizons. Taking the perspective of an investor, we evaluate the predictive variance of k-period returns under different model and prior specifications. We adopt the state-space framework of Pástor and Stambaugh to model the dynamics of expected returns and evaluate the effects of prior elicitation in the resulting volatility estimates. Part of the developments includes an extension that incorporates time-varying volatilities and covariances in a constrained prior information set-up. Our conclusion for the U.S. market, under plausible prior specifications, is that stocks are less volatile in the long run. Model assessment exercises demonstrate the models and priors supporting our main conclusions are in accordance with the data. To assess the generality of the results, we extend our analysis to a number of international equity indices. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Functional Data · 发表于 2018-10-08

Modeling Motor Learning Using Heteroscedastic Functional Principal Components Analysis

Daniel Backenroth, Jeff Goldsmith, Michelle D. Harran, Juan C. Cortes, John W. Krakauer, Tomoko Kitago

摘要

We propose a novel method for estimating population-level and subject-specific effects of covariates on the variability of functional data. We extend the functional principal components analysis framework by modeling the variance of principal component scores as a function of covariates and subject-specific random effects. In a setting where principal components are largely invariant across subjects and covariate values, modeling the variance of these scores provides a flexible and interpretable way to explore factors that affect the variability of functional data. Our work is motivated by a novel dataset from an experiment assessing upper extremity motor control, and quantifies the reduction in motion variance associated with skill learning. *(abstract via PubMed)*

JASA Genetics & Omics Nonparametric & Semiparametric Testing & Uncertainty · 发表于 2018-10-08

Maximum Rank Reproducibility: A Nonparametric Approach to Assessing Reproducibility in Replicate Experiments

Daisy Philtron, Yafei Lyu, Qunhua Li, Debashis Ghosh

摘要

The identification of reproducible signals from the results of replicate high-throughput experiments is an important part of modern biological research. Often little is known about the dependence structure and the marginal distribution of the data, motivating the development of a nonparametric approach to assess reproducibility. The procedure, which we call the maximum rank reproducibility (MaRR) procedure, uses a maximum rank statistic to parse reproducible signals from noise without making assumptions about the distribution of reproducible signals. Because it uses the rank scale this procedure can be easily applied to a variety of data types. One application is to assess the reproducibility of RNA-seq technology using data produced by the sequencing quality control (SEQC) consortium, which coordinated a multi-laboratory effort to assess reproducibility across three RNA-seq platforms. Our results on simulations and SEQC data show that the MaRR procedure effectively controls false discovery rates, has desirable power properties, and compares well to existing methods. Supplementary materials for this article are available online. *(abstract via PubMed)*

JASA Causal Inference Longitudinal Data · 发表于 2018-10-08

Functional Feature Construction for Individualized Treatment Regimes

Eric B. Laber, Ana-Maria Staicu

摘要

Evidence-based personalized medicine formalizes treatment selection as an individualized treatment regime that maps up-to-date patient information into the space of possible treatments. Available patient information may include static features such race, gender, family history, genetic and genomic information, as well as longitudinal information including the emergence of comorbidities, waxing and waning of symptoms, side-effect burden, and adherence. Dynamic information measured at multiple time points before treatment assignment should be included as input to the treatment regime. However, subject longitudinal measurements are typically sparse, irregularly spaced, noisy, and vary in number across subjects. Existing estimators for treatment regimes require equal information be measured on each subject and thus standard practice is to summarize longitudinal subject information into a scalar, ad hoc summary during data pre-processing. This reduction of the longitudinal information to a scalar feature precedes estimation of a treatment regime and is therefore not informed by subject outcomes, treatments, or covariates. Furthermore, we show that this reduction requires more stringent causal assumptions for consistent estimation than are necessary. We propose a data-driven method for constructing maximally prescriptive yet interpretable features that can be used with standard methods for estimating optimal treatment regimes. In our proposed framework, we treat the subject longitudinal information as a realization of a stochastic process observed with error at discrete time points. Functionals of this latent process are then combined with outcome models to estimate an optimal treatment regime. The proposed methodology requires weaker causal assumptions than Q-learning with an ad hoc scalar summary and is consistent for the optimal treatment regime. *(abstract via PubMed)*

JASA Causal Inference · 发表于 2018-10-08

Front-Door Versus Back-Door Adjustment With Unmeasured Confounding: Bias Formulas for Front-Door and Hybrid Adjustments With Application to a Job Training Program

Adam N. Glynn, Konstantin Kashin

摘要

We demonstrate that the front-door adjustment can be a useful alternative to standard covariate adjustments (i.e., back-door adjustments), even when the assumptions required for the front-door approach do not hold. We do this by providing asymptotic bias formulas for the front-door approach that can be compared directly to bias formulas for the back-door approach. In some cases, this allows the tightening of bounds on treatment effects. We also show that under one-sided noncompliance, the front-door approach does not rely on the use of control units. This finding has implications for the design of studies when treatment cannot be withheld from individuals (perhaps for ethical reasons). We illustrate these points with an application to the National Job Training Partnership Act Study. *(abstract via OpenAlex)*

SiM Missing Data & Measurement Error Nonparametric & Semiparametric · 发表于 2018-10-08

Copula selection models for non‐Gaussian outcomes that are missing not at random

Manuel Gomes, Rosalba Radice, Jose Camarena Brenes, Giampiero Marra

摘要

Missing not at random (MNAR) data pose key challenges for statistical inference because the substantive model of interest is typically not identifiable without imposing further (eg, distributional) assumptions. Selection models have been routinely used for handling MNAR by jointly modeling the outcome and selection variables and typically assuming that these follow a bivariate normal distribution. Recent studies have advocated parametric selection approaches, for example, estimated by multiple imputation and maximum likelihood, that are more robust to departures from the normality assumption compared with those assuming that nonresponse and outcome are jointly normally distributed. However, the proposed methods have been mostly restricted to a specific joint distribution (eg, bivariate t ‐distribution). This paper discusses a flexible copula‐based selection approach (which accommodates a wide range of non‐Gaussian outcome distributions and offers great flexibility in the choice of functional form specifications for both the outcome and selection equations) and proposes a flexible imputation procedure that generates plausible imputed values from the copula selection model. A simulation study characterizes the relative performance of the copula model compared with the most commonly used selection models for estimating average treatment effects with MNAR data. We illustrate the methods in the REFLUX study, which evaluates the effect of laparoscopic surgery on long‐term quality of life in patients with reflux disease. We provide software code for implementing the proposed copula framework using the R package GJRM .

Biometrics Survey & Sampling Spatial & Time Series · 发表于 2018-10-08

Cluster Capture-Recapture to Account for Identification Uncertainty on Aerial Surveys of Animal Populations

Ben C. Stevenson, David L. Borchers, Rachel M. Fewster

摘要

Capture-recapture methods for estimating wildlife population sizes almost always require their users to identify every detected animal. Many modern-day wildlife surveys detect animals without physical capture—visual detection by cameras is one such example. However, for every pair of detections, the surveyor faces a decision that is often fraught with uncertainty: are they linked to the same individual? An inability to resolve every such decision to a high degree of certainty prevents the use of standard capture-recapture methods, impeding the estimation of animal density. Here, we develop an estimator for aerial surveys, on which two planes or unmanned vehicles (drones) fly a transect over the survey region, detecting individuals via high-definition cameras. Identities remain unknown, so one cannot discern if two detections match to the same animal; however, detections in close proximity are more likely to match. By modeling detection locations as a clustered point process, we extend recently developed methodology and propose a precise and computationally efficient estimator of animal density that does not require individual identification. We illustrate the method with an aerial survey of porpoise, on which cameras detect individuals at the surface of the sea, and we need to take account of the fact that they are not always at the surface.

SMMR Survival Analysis · 发表于 2018-10-08

Benefits of combining prevalent and incident cohorts: An application to myotonic dystrophy

David B Wolfson, Ana F Best, Vittorio Addona, Julian Wolfson, Shahinaz M Gadalla

摘要

It is frequently of interest to estimate the time that individuals survive with a disease, that is, to estimate the time between disease onset and occurrence of a clinical endpoint such as death. Epidemiologic survival data are commonly collected from either an incident cohort, whose members' disease onset occurs after the study baseline date, or from a cohort with prevalent disease that is followed forward in time. Incident cohort survival data are limited by study termination, while prevalent cohort data provide biased (left-truncated) survival data. In this article, we investigate the advantages of a study design featuring simultaneous follow-up of prevalent and incident cohorts to the estimation of the survivor function. Our analyses are supported by simulations and illustrated using data on survival after myotonic dystrophy diagnosis from the United Kingdom Clinical Practice Research Datalink (CPRD). We demonstrate that the NPMLE using combined incident and prevalent cohort data estimates the true survivor function very well, even for moderate sample sizes, and ameliorates the disadvantages of using a purely incident or prevalent cohort.

JASA Bayesian Methods · 发表于 2018-10-08

Bayesian Inference in the Presence of Intractable Normalizing Functions

Jaewoo Park, Murali Haran

摘要

Models with intractable normalizing functions arise frequently in statistics. Common examples of such models include exponential random graph models for social networks and Markov point processes for ecology and disease modeling. Inference for these models is complicated because the normalizing functions of their probability distributions include the parameters of interest. In Bayesian analysis, they result in so-called doubly intractable posterior distributions which pose significant computational challenges. Several Monte Carlo methods have emerged in recent years to address Bayesian inference for such models. We provide a framework for understanding the algorithms, and elucidate connections among them. Through multiple simulated and real data examples, we compare and contrast the computational and statistical efficiency of these algorithms and discuss their theoretical bases. Our study provides practical recommendations for practitioners along with directions for future research for Markov chain Monte Carlo (MCMC) methodologists. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Causal Inference · 发表于 2018-10-08

Assessing Time-Varying Causal Effect Moderation in Mobile Health

Audrey Boruvka, Daniel Almirall, Katie Witkiewitz, Susan A. Murphy

摘要

In mobile health interventions aimed at behavior change and maintenance, treatments are provided in real time to manage current or impending high risk situations or promote healthy behaviors in near real time. Currently there is great scientific interest in developing data analysis approaches to guide the development of mobile interventions. In particular data from mobile health studies might be used to examine effect moderators-individual characteristics, time-varying context or past treatment response that moderate the effect of current treatment on a subsequent response. This paper introduces a formal definition for moderated effects in terms of potential outcomes, a definition that is particularly suited to mobile interventions, where treatment occasions are numerous, individuals are not always available for treatment, and potential moderators might be influenced by past treatment. Methods for estimating moderated effects are developed and compared. The proposed approach is illustrated using BASICS-Mobile, a smartphone-based intervention designed to curb heavy drinking and smoking among college students. *(abstract via PubMed)*

SMMR Clinical Trials · 发表于 2018-10-08

Adaptive non-inferiority margins under observable non-constancy

Brett Hanscom, James P Hughes, Brian D Williamson, Deborah Donnell

摘要

A central assumption in the design and conduct of non-inferiority trials is that the active-control therapy will have the same degree of effectiveness in the planned non-inferiority trial as in the prior placebo-controlled trials used to define the non-inferiority margin. This is referred to as the ‘constancy’ assumption. If the constancy assumption fails, decisions based on the chosen non-inferiority margin may be incorrect, and the study runs the risk of approving an inferior product or failing to approve a beneficial product. The constancy assumption cannot be validated in a trial without a placebo arm, and it is unlikely ever to be met completely. When there are strong, observable predictors of constancy, such as dosing and adherence to the active-control product, we can specify conditions where the constancy assumption will likely fail. We propose a method for using measurable predictors of active-control effectiveness to specify non-inferiority margins targeted to the planned study population characteristics. We describe a pre-specified method, using baseline characteristics or post-baseline predictors in the active-control arm, to adapt the non-inferiority margin at the end of the study if constancy is violated. Adaptive margins can help adjust for constancy violations that will inevitably occur in real clinical trials, while maintaining pre-specified levels of Type I error and power.

JASA Other · 发表于 2018-10-08

A Randomized Sequential Procedure to Determine the Number of Factors

Lorenzo Trapani

摘要

This article proposes a procedure to estimate the number of common factors k in a static approximate factor model. The building block of the analysis is the fact that the first k eigenvalues of the covariance matrix of the data diverge, while the others stay bounded. On the grounds of this, we propose a test for the null that the ith eigenvalue diverges, using a randomized test statistic based directly on the estimated eigenvalue. The test only requires minimal assumptions on the data, and no assumptions are required on factors, loadings or idiosyncratic errors. The randomized tests are then employed in a sequential procedure to determine k. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Bayesian Methods Causal Inference Machine Learning · 发表于 2018-10-08

A Bayesian Machine Learning Approach for Optimizing Dynamic Treatment Regimes

Thomas A. Murray, Ying Yuan, Peter F. Thall

摘要

Medical therapy often consists of multiple stages, with a treatment chosen by the physician at each stage based on the patient's history of treatments and clinical outcomes. These decisions can be formalized as a dynamic treatment regime. This paper describes a new approach for optimizing dynamic treatment regimes that bridges the gap between Bayesian inference and existing approaches, like Q-learning. The proposed approach fits a series of Bayesian regression models, one for each stage, in reverse sequential order. Each model uses as a response variable the remaining payoff assuming optimal actions are taken at subsequent stages, and as covariates the current history and relevant actions at that stage. The key difficulty is that the optimal decision rules at subsequent stages are unknown, and even if these decision rules were known the relevant response variables may be counterfactual. However, posterior distributions can be derived from the previously fitted regression models for the optimal decision rules and the counterfactual response variables under a particular set of rules. The proposed approach averages over these posterior distributions when fitting each regression model. An efficient sampling algorithm for estimation is presented, along with simulation studies that compare the proposed approach with Q-learning. *(abstract via PubMed)*

SiM Other · 发表于 2018-10-07

What makes a biostatistician?

Antonia Zapf, Marianne Huebner, Geraldine Rauch, Meinhard Kieser

摘要

Biostatisticians play an important role in medical research. They are co‐responsible for an appropriate and efficient study design, they are involved in monitoring the study conduct, they plan and perform the data analysis, and they are involved in interpreting and publishing the results. However, how are the biostatisticians prepared for their tasks and responsibilities? Graduate programs in biostatistics are being offered, but some practicing biostatisticians completed their studies in a mathematical or epidemiological program, or obtained their degree in subject‐specific fields (such as medicine or biology). Therefore, the expertise and the competencies can vary widely between the individual biostatisticians, also depending on the application field. In this article, focusing on European and US practices, we discuss the required professional expertise for the main areas of applications in the medical field as well as the necessary soft skill competencies of a biostatistician.

SMMR Nonparametric & Semiparametric Bayesian Methods Survival Analysis · 发表于 2018-10-05

Semiparametric Bayesian kernel survival model for evaluating pathway effects

Lin Zhang, Inyoung Kim

摘要

Massive amounts of high-dimensional data have been accumulated over the past two decades, which has cultured increasing interests in identifying gene pathways related to certain biological processes. In particular, since pathway-based analysis has the ability to detect subtle changes of differentially expressed genes that could be missed when using gene-based analysis, detecting the gene pathways that regulate certain diseases can provide new strategies for medical procedures and new targets for drug discovery. Limited work has been carried out, primarily in regression settings, to study the effects of pathways on survival outcomes. Motivated by a breast cancer gene-pathway data set, which exhibits the “small n, large p” characteristics, we propose a semiparametric Bayesian kernel survival model (s-BKSurv) to study the effects of both clinical covariates and gene expression levels within a pathway on survival time. We model the unknown high-dimensional functions of pathways via Gaussian kernel machine to consider the possibility that genes within the same pathway interact with each other. To address the multiple comparisons problem under a full Bayesian setting, we propose a similarity-dependent procedure based on Bayes factor to control the family-wise error rate. We demonstrate the outperformance of our approach under various simulation settings and pathways data.

Biometrics Latent Variables & Mixtures · 发表于 2018-10-05

Multi-Study Factor Analysis

Roberta De Vito, Ruggero Bellio, Lorenzo Trippa, Giovanni Parmigiani

摘要

We introduce a novel class of factor analysis methodologies for the joint analysis of multiple studies. The goal is to separately identify and estimate (1) common factors shared across multiple studies, and (2) study-specific factors. We develop an Expectation Conditional-Maximization algorithm for parameter estimates and we provide a procedure for choosing the numbers of common and specific factors. We present simulations for evaluating the performance of the method and we illustrate it by applying it to gene expression data in ovarian cancer. In both, we clarify the benefits of a joint analysis compared to the standard factor analysis. We have provided a tool to accelerate the pace at which we can combine unsupervised analysis across multiple studies, and understand the cross-study reproducibility of signal in multivariate data. An R package (MSFA), is implemented and is available on GitHub.

SiM Meta-Analysis & Data Integration · 发表于 2018-10-03

Meta‐analysis of non‐linear exposure‐outcome relationships using individual participant data: A comparison of two methods

Ian R. White, Stephen Kaptoge, Patrick Royston, Willi Sauerbrei, The Emerging Risk Factors Collaboration

摘要

Non‐linear exposure‐outcome relationships such as between body mass index (BMI) and mortality are common. They are best explored as continuous functions using individual participant data from multiple studies. We explore two two‐stage methods for meta‐analysis of such relationships, where the confounder‐adjusted relationship is first estimated in a non‐linear regression model in each study, then combined across studies. The “metacurve” approach combines the estimated curves using multiple meta‐analyses of the relative effect between a given exposure level and a reference level. The “mvmeta” approach combines the estimated model parameters in a single multivariate meta‐analysis. Both methods allow the exposure‐outcome relationship to differ across studies. Using theoretical arguments, we show that the methods differ most when covariate distributions differ across studies; using simulated data, we show that mvmeta gains precision but metacurve is more robust to model mis‐specification. We then compare the two methods using data from the Emerging Risk Factors Collaboration on BMI, coronary heart disease events, and all‐cause mortality (>80 cohorts, >18 000 events). For each outcome, we model BMI using fractional polynomials of degree 2 in each study, with adjustment for confounders. For metacurve, the powers defining the fractional polynomials may be study‐specific or common across studies. For coronary heart disease, metacurve with common powers and mvmeta correctly identify a small increase in risk in the lowest levels of BMI, but metacurve with study‐specific powers does not. For all‐cause mortality, all methods identify a steep U‐shape. The metacurve and mvmeta methods perform well in combining complex exposure‐disease relationships across studies.

SiM Survival Analysis Causal Inference · 发表于 2018-10-03

Design and monitoring of survival trials in complex scenarios

Xiaodong Luo, Xuezhou Mao, Xun Chen, Junshan Qiu, Steven Bai, Hui Quan

摘要

This paper proposes an approach to design and monitor survival trials accounting for complex scenarios such as delayed treatment effect, treatment dilution, and treatment crossover. These scenarios often lead to non‐proportional hazards, making study design and monitoring more difficult. We demonstrate that, with event times following piecewise exponential distributions, the log‐rank statistic as well as its variance‐covariance structure can be easily computed, which greatly simplifies study design and monitoring. As the number of pieces in the exponential distributions can be arbitrary, this approach can handle a wide range of scenarios. Three hypothetical examples are used to demonstrate its potential use.

AoS Other · 发表于 2018-10-01

Weak convergence of a pseudo maximum likelihood estimator for the extremal index

Betina Berghaus, Axel Bücher

摘要

The extremes of a stationary time series typically occur in clusters. A primary measure for this phenomenon is the extremal index, representing the reciprocal of the expected cluster size. Both disjoint and sliding blocks estimator for the extremal index are analyzed in detail. In contrast to many competitors, the estimators only depend on the choice of one parameter sequence. We derive an asymptotic expansion, prove asymptotic normality and show consistency of an estimator for the asymptotic variance. Explicit calculations in certain models and a finite-sample Monte Carlo simulation study reveal that the sliding blocks estimator outperforms other blocks estimators, and that it is competitive to runs- and inter-exceedance estimators in various models. The methods are applied to a variety of financial time series.

AoS High-Dimensional · 发表于 2018-10-01

Variable selection with Hamming loss

Cristina Butucea, Mohamed Ndaoud, Natalia A. Stepanova, Alexandre B. Tsybakov

摘要

We derive nonasymptotic bounds for the minimax risk of variable selection under expected Hamming loss in the Gaussian mean model in $\mathbb{R}^{d}$ for classes of at most $s$-sparse vectors separated from 0 by a constant $a>0$. In some cases, we get exact expressions for the nonasymptotic minimax risk as a function of $d,s,a$ and find explicitly the minimax selectors. These results are extended to dependent or non-Gaussian observations and to the problem of crowdsourcing. Analogous conclusions are obtained for the probability of wrong recovery of the sparsity pattern. As corollaries, we derive necessary and sufficient conditions for such asymptotic properties as almost full recovery and exact recovery. Moreover, we propose data-driven selectors that provide almost full and exact recovery adaptively to the parameters of the classes.

AoS Networks & Graphs · 发表于 2018-10-01

Unifying Markov properties for graphical models

Steffen Lauritzen, Kayvan Sadeghi

摘要

Several types of graphs with different conditional independence interpretations—also known as Markov properties—have been proposed and used in graphical models. In this paper, we unify these Markov properties by introducing a class of graphs with four types of edges—lines, arrows, arcs and dotted lines—and a single separation criterion. We show that independence structures defined by this class specialize to each of the previously defined cases, when suitable subclasses of graphs are considered. In addition, we define a pairwise Markov property for the subclass of chain mixed graphs, which includes chain graphs with the LWF interpretation, as well as summary graphs (and consequently ancestral graphs). We prove the equivalence of this pairwise Markov property to the global Markov property for compositional graphoid independence models.

AoS Missing Data & Measurement Error Nonparametric & Semiparametric · 发表于 2018-10-01

Smooth backfitting for errors-in-variables additive models

Kyunghee Han, Byeong U. Park

摘要

In this work, we develop a new smooth backfitting method and theory for estimating additive nonparametric regression models when the covariates are contaminated by measurement errors. For this, we devise a new kernel function that suitably deconvolutes the bias due to measurement errors as well as renders a projection interpretation to the resulting estimator in the space of additive functions. The deconvolution property and the projection interpretation are essential for a successful solution of the problem. We prove that the method based on the new kernel weighting scheme achieves the optimal rate of convergence in one-dimensional deconvolution problems when the smoothness of measurement error distribution is less than a threshold value. We find that the speed of convergence is slower than the univariate rate when the smoothness of measurement error distribution is above the threshold, but it is still much faster than the optimal rate in multivariate deconvolution problems. The theory requires a deliberate analysis of the nonnegligible effects of measurement errors being propagated to other additive components through backfitting operation. We present the finite sample performance of the deconvolution smooth backfitting estimators that confirms our theoretical findings.

AoS High-Dimensional Nonparametric & Semiparametric · 发表于 2018-10-01

Semiparametric efficiency bounds for high-dimensional models

Jana Janková, Sara van de Geer

摘要

Asymptotic lower bounds for estimation play a fundamental role in assessing the quality of statistical procedures. In this paper, we propose a framework for obtaining semiparametric efficiency bounds for sparse high-dimensional models, where the dimension of the parameter is larger than the sample size. We adopt a semiparametric point of view: we concentrate on one-dimensional functions of a high-dimensional parameter. We follow two different approaches to reach the lower bounds: asymptotic Cramér–Rao bounds and Le Cam’s type of analysis. Both of these approaches allow us to define a class of asymptotically unbiased or “regular” estimators for which a lower bound is derived. Consequently, we show that certain estimators obtained by de-sparsifying (or de-biasing) an $\ell_{1}$-penalized M-estimator are asymptotically unbiased and achieve the lower bound on the variance: thus in this sense they are asymptotically efficient. The paper discusses in detail the linear regression model and the Gaussian graphical model.

AoS Other · 发表于 2018-10-01

Robust covariance and scatter matrix estimation under Huber’s contamination model

Mengjie Chen, Chao Gao, Zhao Ren

摘要

Covariance matrix estimation is one of the most important problems in statistics. To accommodate the complexity of modern datasets, it is desired to have estimation procedures that not only can incorporate the structural assumptions of covariance matrices, but are also robust to outliers from arbitrary sources. In this paper, we define a new concept called matrix depth and then propose a robust covariance matrix estimator by maximizing the empirical depth function. The proposed estimator is shown to achieve minimax optimal rate under Huber’s $\varepsilon$-contamination model for estimating covariance/scatter matrices with various structures including bandedness and sparsity.

AoS Causal Inference · 发表于 2018-10-01

Randomization-based causal inference from split-plot designs

Anqi Zhao, Peng Ding, Rahul Mukerjee, Tirthankar Dasgupta

摘要

Under the potential outcomes framework, we propose a randomization based estimation procedure for causal inference from split-plot designs, with special emphasis on $2^{2}$ designs that naturally arise in many social, behavioral and biomedical experiments. Point estimators of factorial effects are obtained and their sampling variances are derived in closed form as linear combinations of the between- and within-group covariances of the potential outcomes. Results are compared to those under complete randomization as measures of design efficiency. Conservative estimators of these sampling variances are proposed. Connection of the randomization-based approach to inference based on the linear mixed effects model is explored. Results on sampling variances of point estimators and their estimators are extended to general split-plot designs. The superiority over existing model-based alternatives in frequency coverage properties is reported under a variety of simulation settings for both binary and continuous outcomes.

AoS Spatial & Time Series · 发表于 2018-10-01

Principal component analysis for second-order stationary vector time series

Jinyuan Chang, Bin Guo, Qiwei Yao

摘要

We extend the principal component analysis (PCA) to second-order stationary vector time series in the sense that we seek for a contemporaneous linear transformation for a $p$-variate time series such that the transformed series is segmented into several lower-dimensional subseries, and those subseries are uncorrelated with each other both contemporaneously and serially. Therefore, those lower-dimensional series can be analyzed separately as far as the linear dynamic structure is concerned. Technically, it boils down to an eigenanalysis for a positive definite matrix. When $p$ is large, an additional step is required to perform a permutation in terms of either maximum cross-correlations or FDR based on multiple tests. The asymptotic theory is established for both fixed $p$ and diverging $p$ when the sample size $n$ tends to infinity. Numerical experiments with both simulated and real data sets indicate that the proposed method is an effective initial step in analyzing multiple time series data, which leads to substantial dimension reduction in modelling and forecasting high-dimensional linear dynamical structures. Unlike PCA for independent data, there is no guarantee that the required linear transformation exists. When it does not, the proposed method provides an approximate segmentation which leads to the advantages in, for example, forecasting for future values. The method can also be adapted to segment multiple volatility processes.

AoS Other · 发表于 2018-10-01

Optimality and sub-optimality of PCA I: Spiked random matrix models

Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, Ankur Moitra

摘要

A central problem of random matrix theory is to understand the eigenvalues of spiked random matrix models, introduced by Johnstone, in which a prominent eigenvector (or “spike”) is planted into a random matrix. These distributions form natural statistical models for principal component analysis (PCA) problems throughout the sciences. Baik, Ben Arous and Péché showed that the spiked Wishart ensemble exhibits a sharp phase transition asymptotically: when the spike strength is above a critical threshold, it is possible to detect the presence of a spike based on the top eigenvalue, and below the threshold the top eigenvalue provides no information. Such results form the basis of our understanding of when PCA can detect a low-rank signal in the presence of noise. However, under structural assumptions on the spike, not all information is necessarily contained in the spectrum. We study the statistical limits of tests for the presence of a spike, including nonspectral tests. Our results leverage Le Cam’s notion of contiguity and include: (i) For the Gaussian Wigner ensemble, we show that PCA achieves the optimal detection threshold for certain natural priors for the spike. (ii) For any non-Gaussian Wigner ensemble, PCA is sub-optimal for detection. However, an efficient variant of PCA achieves the optimal threshold (for natural priors) by pre-transforming the matrix entries. (iii) For the Gaussian Wishart ensemble, the PCA threshold is optimal for positive spikes (for natural priors) but this is not always the case for negative spikes.

AoS Bayesian Methods High-Dimensional · 发表于 2018-10-01

On the exponentially weighted aggregate with the Laplace prior

Arnak S. Dalalyan, Edwin Grappin, Quentin Paris

摘要

In this paper, we study the statistical behaviour of the Exponentially Weighted Aggregate (EWA) in the problem of high-dimensional regression with fixed design. Under the assumption that the underlying regression vector is sparse, it is reasonable to use the Laplace distribution as a prior. The resulting estimator and, specifically, a particular instance of it referred to as the Bayesian lasso, was already used in the statistical literature because of its computational convenience, even though no thorough mathematical analysis of its statistical properties was carried out. The present work fills this gap by establishing sharp oracle inequalities for the EWA with the Laplace prior. These inequalities show that if the temperature parameter is small, the EWA with the Laplace prior satisfies the same type of oracle inequality as the lasso estimator does, as long as the quality of estimation is measured by the prediction loss. Extensions of the proposed methodology to the problem of prediction with low-rank matrices are considered.

AoS Other · 发表于 2018-10-01

Local asymptotic normality property for fractional Gaussian noise under high-frequency observations

Alexandre Brouste, Masaaki Fukasawa

摘要

Local Asymptotic Normality (LAN) property for fractional Gaussian noise under high-frequency observations is proved with nondiagonal rate matrices depending on the parameter to be estimated. In contrast to the LAN families in the literature, nondiagonal rate matrices are inevitable. As consequences of the LAN property, a maximum likelihood sequence of estimators is shown to be asymptotically efficient and the likelihood ratio test on the Hurst parameter is shown to be an asymptotically uniformly most powerful unbiased test for two-sided hypotheses.

AoS Networks & Graphs · 发表于 2018-10-01

Limit theorems for eigenvectors of the normalized Laplacian for random graphs

Minh Tang, Carey E. Priebe

摘要

We prove a central limit theorem for the components of the eigenvectors corresponding to the $d$ largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we show that for stochastic blockmodel graphs, the rows of the spectral embedding of the normalized Laplacian converge to multivariate normals and, furthermore, the mean and the covariance matrix of each row are functions of the associated vertex’s block membership. Together with prior results for the eigenvectors of the adjacency matrix, we then compare, via the Chernoff information between multivariate normal distributions, how the choice of embedding method impacts subsequent inference. We demonstrate that neither embedding method dominates with respect to the inference task of recovering the latent block assignments.

AoS Missing Data & Measurement Error · 发表于 2018-10-01

Goodness-of-fit testing of error distribution in linear measurement error models

Hira L. Koul, Weixing Song, Xiaoqing Zhu

摘要

This paper investigates a class of goodness-of-fit tests for fitting an error density in linear regression models with measurement error in covariates. Each test statistic is the integrated square difference between the deconvolution kernel density estimator of the regression model error density and a smoothed version of the null error density, an analog of the so-called Bickel and Rosenblatt test statistic. The asymptotic null distributions of the proposed test statistics are derived for both the ordinary smooth and super smooth cases. The asymptotic power behavior of the proposed tests against a fixed alternative and a class of local nonparametric alternatives for both cases is also described. The finite sample performance of the proposed test is evaluated by a simulation study. The simulation study shows some superiority of the proposed test over some other tests. Finally, a real data is used to illustrate the proposed test.

AoS High-Dimensional · 发表于 2018-10-01

Global testing against sparse alternatives under Ising models

Rajarshi Mukherjee, Sumit Mukherjee, Ming Yuan

摘要

In this paper, we study the effect of dependence on detecting sparse signals. In particular, we focus on global testing against sparse alternatives for the means of binary outcomes following an Ising model, and establish how the interplay between the strength and sparsity of a signal determines its detectability under various notions of dependence. The profound impact of dependence is best illustrated under the Curie–Weiss model where we observe the effect of a “thermodynamic” phase transition. In particular, the critical state exhibits a subtle “blessing of dependence” phenomenon in that one can detect much weaker signals at criticality than otherwise. Furthermore, we develop a testing procedure that is broadly applicable to account for dependence and show that it is asymptotically minimax optimal under fairly general regularity conditions.

AoS Nonparametric & Semiparametric · 发表于 2018-10-01

Estimation of a monotone density in $s$-sample biased sampling models

Kwun Chuen Gary Chan, Hok Kan Ling, Tony Sit, Sheung Chi Phillip Yam

摘要

We study the nonparametric estimation of a decreasing density function $g_{0}$ in a general $s$-sample biased sampling model with weight (or bias) functions $w_{i}$ for $i=1,\ldots,s$. The determination of the monotone maximum likelihood estimator $\hat{g}_{n}$ and its asymptotic distribution, except for the case when $s=1$, has been long missing in the literature due to certain nonstandard structures of the likelihood function, such as nonseparability and a lack of strictly positive second order derivatives of the negative of the log-likelihood function. The existence, uniqueness, self-characterization, consistency of $\hat{g}_{n}$ and its asymptotic distribution at a fixed point are established in this article. To overcome the barriers caused by nonstandard likelihood structures, for instance, we show the tightness of $\hat{g}_{n}$ via a purely analytic argument instead of an intrinsic geometric one and propose an indirect approach to attain the $\sqrt{n}$-rate of convergence of the linear functional $\int w_{i}\hat{g}_{n}$.

AoS Survey & Sampling · 发表于 2018-10-01

Empirical best prediction under a nested error model with log transformation

Isabel Molina, Nirian Martín

摘要

In regression models involving economic variables such as income, log transformation is typically taken to achieve approximate normality and stabilize the variance. However, often the interest is predicting individual values or means of the variable in the original scale. Under a nested error model for the log transformation of the target variable, we show that the usual approach of back transforming the predicted values may introduce a substantial bias. We obtain the optimal (or “best”) predictors of individual values of the original variable and of small area means under that model. Empirical best predictors are defined by estimating the unknown model parameters in the best predictors. When estimation is desired for subpopulations with small sample sizes (small areas), nested error models are widely used to “borrow strength” from the other areas and obtain estimators with greater efficiency than direct estimators based on the scarce area-specific data. We show that naive predictors of small area means obtained by back-transformation under the mentioned model may even underperform direct estimators. Moreover, assessing the uncertainty of the considered predictor is not straightforward. Exact mean squared errors of the best predictors and second-order approximations to the mean squared errors of the empirical best predictors are derived. Estimators of the mean squared errors that are second-order correct are also obtained. Simulation studies and an example with Mexican data on living conditions illustrate the procedures.

AoS Networks & Graphs · 发表于 2018-10-01

Community detection in degree-corrected block models

Chao Gao, Zongming Ma, Anderson Y. Zhang, Harrison H. Zhou

摘要

Community detection is a central problem of network data analysis. Given a network, the goal of community detection is to partition the network nodes into a small number of clusters, which could often help reveal interesting structures. The present paper studies community detection in Degree-Corrected Block Models (DCBMs). We first derive asymptotic minimax risks of the problem for a misclassification proportion loss under appropriate conditions. The minimax risks are shown to depend on degree-correction parameters, community sizes and average within and between community connectivities in an intuitive and interpretable way. In addition, we propose a polynomial time algorithm to adaptively perform consistent and even asymptotically optimal community detection in DCBMs.

AoS Spatial & Time Series · 发表于 2018-10-01

Change-point detection in multinomial data with a large number of categories

Guanghui Wang, Changliang Zou, Guosheng Yin

摘要

We consider a sequence of multinomial data for which the probabilities associated with the categories are subject to abrupt changes of unknown magnitudes at unknown locations. When the number of categories is comparable to or even larger than the number of subjects allocated to these categories, conventional methods such as the classical Pearson’s chi-squared test and the deviance test may not work well. Motivated by high-dimensional homogeneity tests, we propose a novel change-point detection procedure that allows the number of categories to tend to infinity. The null distribution of our test statistic is asymptotically normal and the test performs well with finite samples. The number of change-points is determined by minimizing a penalized objective function based on segmentation, and the locations of the change-points are estimated by minimizing the objective function with the dynamic programming algorithm. Under some mild conditions, the consistency of the estimators of multiple change-points is established. Simulation studies show that the proposed method performs satisfactorily for identifying change-points in terms of power and estimation accuracy, and it is illustrated with an analysis of a real data set.

AoS High-Dimensional Spatial & Time Series · 发表于 2018-10-01

CLT for largest eigenvalues and unit root testing for high-dimensional nonstationary time series

Bo Zhang, Guangming Pan, Jiti Gao

摘要

Let $\{Z_{ij}\}$ be independent and identically distributed (i.i.d.) random variables with $EZ_{ij}=0$, $E\vert Z_{ij}\vert^{2}=1$ and $E\vert Z_{ij}\vert^{4}<\infty$. Define linear processes $Y_{tj}=\sum_{k=0}^{\infty}b_{k}Z_{t-k,j}$ with $\sum_{i=0}^{\infty}\vert b_{i}\vert <\infty$. Consider a $p$-dimensional time series model of the form $\mathbf{x}_{t}=\boldsymbol{\Pi} \mathbf{x}_{t-1}+\Sigma^{1/2}\mathbf{y}_{t},\ 1\leq t\leq T$ with $\mathbf{y}_{t}=(Y_{t1},\ldots,Y_{tp})'$ and $\Sigma^{1/2}$ be the square root of a symmetric positive definite matrix. Let $\mathbf{B}=(1/p)\mathbf{XX}^{*}$ with $\mathbf{X}=(\mathbf{x_{1}},\ldots,\mathbf{x_{T}})'$ and $X^{*}$ be the conjugate transpose. This paper establishes both the convergence in probability and the asymptotic joint distribution of the first $k$ largest eigenvalues of $\mathbf{B}$ when $\mathbf{x}_{t}$ is nonstationary. As an application, two new unit root tests for possible nonstationarity of high-dimensional time series are proposed and then studied both theoretically and numerically.

AoS Other · 发表于 2018-10-01

Backward nested descriptors asymptotics with inference on stem cell differentiation

Stephan F. Huckemann, Benjamin Eltzner

摘要

For sequences of random backward nested subspaces as occur, say, in dimension reduction for manifold or stratified space valued data, asymptotic results are derived. In fact, we formulate our results more generally for backward nested families of descriptors (BNFD). Under rather general conditions, asymptotic strong consistency holds. Under additional, still rather general hypotheses, among them existence of a.s. local twice differentiable charts, asymptotic joint normality of a BNFD can be shown. If charts factor suitably, this leads to individual asymptotic normality for the last element, a principal nested mean or a principal nested geodesic, say. It turns out that these results pertain to principal nested spheres (PNS) and principal nested great subsphere (PNGS) analysis by Jung, Dryden and Marron [Biometrika 99 (2012) 551–568] as well as to the intrinsic mean on a first geodesic principal component (IMo1GPC) for manifolds and Kendall’s shape spaces. A nested bootstrap two-sample test is derived and illustrated with simulations. In a study on real data, PNGS is applied to track early human mesenchymal stem cell differentiation over a coarse time grid and, among others, to locate a change point with direct consequences for the design of further studies.

AoS Other · 发表于 2018-10-01

Adaptation in log-concave density estimation

Arlene K. H. Kim, Adityanand Guntuboyina, Richard J. Samworth

摘要

The log-concave maximum likelihood estimator of a density on the real line based on a sample of size $n$ is known to attain the minimax optimal rate of convergence of $O(n^{-4/5})$ with respect to, for example, squared Hellinger distance. In this paper, we show that it also enjoys attractive adaptation properties, in the sense that it achieves a faster rate of convergence when the logarithm of the true density is $k$-affine (i.e., made up of $k$ affine pieces), or close to $k$-affine, provided in each case that $k$ is not too large. Our results use two different techniques: the first relies on a new Marshall’s inequality for log-concave density estimation, and reveals that when the true density is close to log-linear on its support, the log-concave maximum likelihood estimator can achieve the parametric rate of convergence in total variation distance. Our second approach depends on local bracketing entropy methods, and allows us to prove a sharp oracle inequality, which implies in particular a risk bound with respect to various global loss functions, including Kullback–Leibler divergence, of $O(\frac{k}{n}\log^{5/4}(en/k))$ when the true density is log-concave and its logarithm is close to $k$-affine.

AoS Testing & Uncertainty · 发表于 2018-10-01

A new perspective on robust $M$-estimation: Finite sample theory and applications to dependence-adjusted multiple testing

Wen-Xin Zhou, Koushiki Bose, Jianqing Fan, Han Liu

摘要

Heavy-tailed errors impair the accuracy of the least squares estimate, which can be spoiled by a single grossly outlying observation. As argued in the seminal work of Peter Huber in 1973 [Ann. Statist. 1 (1973) 799–821], robust alternatives to the method of least squares are sorely needed. To achieve robustness against heavy-tailed sampling distributions, we revisit the Huber estimator from a new perspective by letting the tuning parameter involved diverge with the sample size. In this paper, we develop nonasymptotic concentration results for such an adaptive Huber estimator, namely, the Huber estimator with the tuning parameter adapted to sample size, dimension and the variance of the noise. Specifically, we obtain a sub-Gaussian-type deviation inequality and a nonasymptotic Bahadur representation when noise variables only have finite second moments. The nonasymptotic results further yield two conventional normal approximation results that are of independent interest, the Berry–Esseen inequality and Cramér-type moderate deviation. As an important application to large-scale simultaneous inference, we apply these robust normal approximation results to analyze a dependence-adjusted multiple testing procedure for moderately heavy-tailed data. It is shown that the robust dependence-adjusted procedure asymptotically controls the overall false discovery proportion at the nominal level under mild moment conditions. Thorough numerical results on both simulated and real datasets are also provided to back up our theory.

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