研究园简易版 · 经典书籍 · 期刊文章 · 有原文 · 完整版(可多选筛选、搜索) · 首页
2019 年的期刊文章 · 第 23 页
共 1232 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2019-02-17 到 2019-02-01。
按期刊、按主题看 →
SiM Longitudinal Data Genetics & Omics · 发表于 2019-02-13
Ivonne Martin, Hae‐Won Uh, Taniawati Supali, Makedonka Mitreva, Jeanine J. Houwing‐Duistermaat
摘要
Clustered overdispersed multivariate count data are challenging to model due to the presence of correlation within and between samples. Typically, the first source of correlation needs to be addressed but its quantification is of less interest. Here, we focus on the correlation between time points. In addition, the effects of covariates on the multivariate counts distribution need to be assessed. To fulfill these requirements, a regression model based on the Dirichlet‐multinomial distribution for association between covariates and the categorical counts is extended by using random effects to deal with the additional clustering. This model is the Dirichlet‐multinomial mixed regression model. Alternatively, a negative binomial regression mixed model can be deployed where the corresponding likelihood is conditioned on the total count. It appears that these two approaches are equivalent when the total count is fixed and independent of the random effects. We consider both subject‐specific and categorical‐specific random effects. However, the latter has a larger computational burden when the number of categories increases. Our work is motivated by microbiome data sets obtained by sequencing of the amplicon of the bacterial 16S rRNA gene. These data have a compositional structure and are typically overdispersed. The microbiome data set is from an epidemiological study carried out in a helminth‐endemic area in Indonesia. The conclusions are as follows: time has no statistically significant effect on microbiome composition, the correlation between subjects is statistically significant, and treatment has a significant effect on the microbiome composition only in infected subjects who remained infected.
Biometrika Other · 发表于 2019-02-13
Adam M Sykulski, Sofia C Olhede, Arthur P Guillaumin, Jonathan M Lilly, Jeffrey J Early
摘要
The Whittle likelihood is a widely used and computationally efficient pseudolikelihood. However, it is known to produce biased parameter estimates with finite sample sizes for large classes of models. We propose a method for debiasing Whittle estimates for second-order stationary stochastic processes. The debiased Whittle likelihood can be computed in the same |${O}(n\log n)$| operations as the standard Whittle approach. We demonstrate the superior performance of our method in simulation studies and in application to a large-scale oceanographic dataset, where in both cases the debiased approach reduces bias by up to two orders of magnitude, achieving estimates that are close to those of the exact maximum likelihood, at a fraction of the computational cost. We prove that the method yields estimates that are consistent at an optimal convergence rate of |$n^{-1/2}$| for Gaussian processes and for certain classes of non-Gaussian or nonlinear processes. This is established under weaker assumptions than in the standard theory, and in particular the power spectral density is not required to be continuous in frequency. We describe how the method can be readily combined with standard methods of bias reduction, such as tapering and differencing, to further reduce bias in parameter estimates. *(abstract via OpenAlex)*
SMMR Causal Inference · 发表于 2019-02-13
Fei Wan
摘要
Pre-post parallel group randomized designs have been frequently used to compare the effectiveness of competing treatment strategies and the ordinary least squares (OLS)-based analysis of covariance model (ANCOVA) is a routine analytic approach. In many scenarios, the associations between the baseline and the post-randomization scores could differ between the treatment and control arms, which justifies the inclusion of the treatment by baseline score interaction in ANCOVA. This heterogeneity may also cause heteroscedastic errors in ANCOVA. In this study, we compared the performances of the ANCOVA models with and without the interaction term in estimating the marginal treatment effect in a heterogeneous two-arm pre-post design. We explored the relationship between the two nested ANCOVA models from the perspective of an omitted variable bias problem and further revealed the reasons why the usual ANCOVA may fail in heterogeneous scenario through the discussion of the three types of variances associated with the ANCOVA estimators of the marginal treatment effect: the target unconditional variance, the conditional variance allowing unequal error variances, and the OLS conditional variance derived under the assumption of constant error variance. We demonstrated analytically and with simulations that the proposed heteroscadastic-consistent variance estimators provide valid unconditional inference for ANCOVA, and the ANCOVA interaction model is more powerful than the ANCOVA main effect model when a design is unbalanced.
Biometrics Latent Variables & Mixtures · 发表于 2019-02-12
P. Besbeas, B.J.T. Morgan
摘要
Integrated population modelling is widely used in statistical ecology. It allows data from population time series and independent surveys to be analysed simultaneously. In classical analysis the time-series likelihood component can be conveniently approximated using Kalman filter methodology. However, the natural way to model systems which have a discrete state space is to use hidden Markov models (HMMs). The proposed method avoids the Kalman filter approximations and Monte Carlo simulations. Subject to possible numerical sensitivity analysis, it is exact, flexible, and allows the use of standard techniques of classical inference. We apply the approach to data on Little owls, where the model is shown to require a one-dimensional state space, and Northern lapwings, with a two-dimensional state space. In the former example the method identifies a parameter redundancy which changes the perception of the data needed to estimate immigration in integrated population modelling. The latter example may be analysed using either first- or second-order HMMs, describing numbers of one-year olds and adults or adults only, respectively. The use of first-order chains is found to be more efficient, mainly due to the smaller number of one-year olds than adults in this application. For the lapwing modelling it is necessary to group the states in order to reduce the large dimension of the state space. Results check with Bayesian and Kalman filter analyses, and avenues for future research are identified.
Biometrics Testing & Uncertainty Diagnostics & Prediction · 发表于 2019-02-12
Yuejia Xu, Oliver Laeyendecker, Rui Wang
摘要
Accurate estimation of human immunodeficiency virus (HIV) incidence rates is crucial for the monitoring of HIV epidemics, the evaluation of prevention programs, and the design of prevention studies. Traditional cohort approaches to measure HIV incidence require repeatedly testing large cohorts of HIV-uninfected individuals with an HIV diagnostic test (eg, enzyme-linked immunosorbent assay) for long periods of time to identify new infections, which can be prohibitively costly, time-consuming, and subject to loss to follow-up. Cross-sectional approaches based on the usual HIV diagnostic test and biomarkers of recent infection offer important advantages over standard cohort approaches, in terms of time, cost, and attrition. Cross-sectional samples usually consist of individuals from different communities. However, small sample sizes limit the ability to estimate community-specific incidence and existing methods typically ignore heterogeneity in incidence across communities. We propose a permutation test for the null hypothesis of no heterogeneity in incidence rates across communities, develop a random-effects model to account for this heterogeneity and to estimate community-specific incidence, and provide one way to estimate the coefficient of variation. We evaluate the performance of the proposed methods through simulation studies and apply them to the data from the National Institute of Mental Health Project ACCEPT, a phase 3 randomized controlled HIV prevention trial in Sub-Saharan Africa, to estimate the overall and community-specific HIV incidence rates.
SiM Causal Inference · 发表于 2019-02-11
W. Xiao, H. H. Zhang, W. Lu
摘要
Because different patients may respond quite differently to the same drug or treatment, there is an increasing interest in discovering individualized treatment rules. In particular, there is an emerging need to find optimal individualized treatment rules, which would lead to the “best” clinical outcome. In this paper, we propose a new class of loss functions and estimators based on robust regression to estimate the optimal individualized treatment rules. Compared to existing estimation methods in the literature, the new estimators are novel and advantageous in the following aspects. First, they are robust against skewed, heterogeneous, heavy‐tailed errors or outliers in data. Second, they are robust against a misspecification of the baseline function. Third, under some general situations, the new estimator coupled with the pinball loss approximately maximizes the outcome's conditional quantile instead of the conditional mean, which leads to a more robust optimal individualized treatment rule than the traditional mean‐based estimators. Consistency and asymptotic normality of the proposed estimators are established. Their empirical performance is demonstrated via extensive simulation studies and an analysis of an AIDS data set.
SiM Other · 发表于 2019-02-11
Manzoor Khan, Jake Olivier
摘要
Regression to the mean (RTM) occurs when subjects having relatively high or low measurements are remeasured and found closer to the population mean. This phenomenon can potentially lead to an inaccurate conclusion in a pre‐post study design. Expressions are available for quantifying RTM when the distribution of pre and post observations are bivariate normal and bivariate Poisson. However, situations exist where the response variables are the number of successes in a fixed number of trials and follow the bivariate binomial distribution. In this article, expressions for quantifying RTM effects are derived when the underlying distribution is the bivariate binomial. Unlike the normal and Poisson distributions, the correlation between pre and post observations can be either negative or positive under the bivariate binomial distribution and the severity of RTM is greater in the former case. The percentage relative difference is used to highlight the differences in quantifying RTM under the bivariate binomial distribution and normal and Poisson approximations to the bivariate binomial distribution. Expressions for estimating RTM using the method of maximum likelihood along with its asymptotic distribution are derived. A simulation study is conducted to empirically assess the statistical properties of the RTM estimator and its asymptotic distribution. Data examples using the number of obese individuals and the number of nonconforming cardboard cans are discussed.
SMMR Missing Data & Measurement Error Nonparametric & Semiparametric Bayesian Methods · 发表于 2019-02-11
Getachew A Dagne
摘要
In clinical research and practice, there is often an interest in assessing the effect of time varying predictors, such as CD4/CD8 ratio, on immune recovery following antiretroviral therapy. Such predictors are measured with errors, and ignoring those measurement errors during data analysis may lead to biased results. Though parametric methods have been used for reducing biases, they usually depend on untestable assumptions. To relax those assumptions, this paper presents semiparametric mixed-effect models which deal with predictors having measurement errors and missing values. We develop a fully Bayesian approach for fitting these models and discriminating between patients who are potentially progressors or nonprogressors to severe disease condition (AIDS). The proposed methods are demonstrated using real data from an AIDS clinical study.
Biometrics Missing Data & Measurement Error Longitudinal Data Diagnostics & Prediction · 发表于 2019-02-06
Juned Siddique, Michael J. Daniels, Raymond J. Carroll, Trivellore E. Raghunathan, Elizabeth A. Stuart, Laurence S. Freedman
摘要
In lifestyle intervention trials, where the goal is to change a participant's weight or modify their eating behavior, self-reported diet is a longitudinal outcome variable that is subject to measurement error. We propose a statistical framework for correcting for measurement error in longitudinal self-reported dietary data by combining intervention data with auxiliary data from an external biomarker validation study where both self-reported and recovery biomarkers of dietary intake are available. In this setting, dietary intake measured without error in the intervention trial is missing data and multiple imputation is used to fill in the missing measurements. Since most validation studies are cross-sectional, they do not contain information on whether the nature of the measurement error changes over time or differs between treatment and control groups. We use sensitivity analyses to address the influence of these unverifiable assumptions involving the measurement error process and how they affect inferences regarding the effect of treatment. We apply our methods to self-reported sodium intake from the PREMIER study, a multi-component lifestyle intervention trial.
SiM Other · 发表于 2019-02-05
Sven Knoth, Philipp Wittenberg, Fah Fatt Gan
摘要
In recent years, quality control charts have been increasingly applied in the healthcare environment, for example, to monitor surgical performance. Risk‐adjusted cumulative (CUSUM) charts that utilize risk scores like the Parsonnet score to estimate the probability of death of a patient from an operation turn out to be susceptible to misfitted risk models causing deterioration of the charts' properties, in particular, the false alarm behavior. Our approach considers the application of power transformations in the logistic regression model to improve the fit to the binary outcome data. We propose two different approaches of estimating the power exponent δ. The average run length (ARL) to false alarm is calculated with the popular Markov chain approximation in a more efficient way by utilizing the Toeplitz structure of the transition matrix. A sensitivity analysis of the in‐control ARL against the true value δ shows potential effects of incorrect choice of δ. Depending on the underlying patient mix, the results vary from robustness to severe impact (doubling of false alarm rate).
Biometrika Causal Inference Testing & Uncertainty · 发表于 2019-02-04
G W Basse, A Feller, P Toulis
摘要
Many causal questions involve interactions between units, also known as interference, for example between individuals in households, students in schools, or firms in markets. In this paper we formalize the concept of a conditioning mechanism, which provides a framework for constructing valid and powerful randomization tests under general forms of interference. We describe our framework in the context of two-stage randomized designs and apply our approach to a randomized evaluation of an intervention targeting student absenteeism in the school district of Philadelphia. We show improvements over existing methods in terms of computational and statistical power. *(abstract via OpenAlex)*
Biometrics Bayesian Methods · 发表于 2019-02-04
D. S. Robertson, J. M. S. Wason
摘要
Response-adaptive designs allow the randomization probabilities to change during the course of a trial based on cumulated response data so that a greater proportion of patients can be allocated to the better performing treatments. A major concern over the use of response-adaptive designs in practice, particularly from a regulatory viewpoint, is controlling the type I error rate. In particular, we show that the naïve z-test can have an inflated type I error rate even after applying a Bonferroni correction. Simulation studies have often been used to demonstrate error control but do not provide a guarantee. In this article, we present adaptive testing procedures for normally distributed outcomes that ensure strong familywise error control by iteratively applying the conditional invariance principle. Our approach can be used for fully sequential and block randomized trials and for a large class of adaptive randomization rules found in the literature. We show there is a high price to pay in terms of power to guarantee familywise error control for randomization schemes with extreme allocation probabilities. However, for proposed Bayesian adaptive randomization schemes in the literature, our adaptive tests maintain or increase the power of the trial compared to the z-test. We illustrate our method using a three-armed trial in primary hypercholesterolemia.
Biometrics Causal Inference Nonparametric & Semiparametric · 发表于 2019-02-04
Caleb H. Miles, Maya Petersen, Mark J. van der Laan
摘要
The assumption that no subject's exposure affects another subject's outcome, known as the no-interference assumption, has long held a foundational position in the study of causal inference. However, this assumption may be violated in many settings, and in recent years has been relaxed considerably. Often this has been achieved with either the aid of a known underlying network, or the assumption that the population can be partitioned into separate groups, between which there is no interference, and within which each subject's outcome may be affected by all the other subjects in the group via the proportion exposed (the stratified interference assumption). In this article, we instead consider a complete interference setting, in which each subject affects every other subject's outcome. In particular, we make the stratified interference assumption for a single group consisting of the entire sample. We show that a targeted maximum likelihood estimator for the i.i.d. setting can be used to estimate a class of causal parameters that includes direct effects and overall effects under certain interventions. This estimator remains doubly-robust, semiparametric efficient, and continues to allow for incorporation of machine learning under our model. We conduct a simulation study, and present results from a data application where we study the effect of a nurse-based triage system on the outcomes of patients receiving HIV care in Kenyan health clinics.
Biometrics High-Dimensional · 发表于 2019-02-04
Qing Mai, Xin Zhang
摘要
It is increasingly interesting to model the relationship between two sets of high-dimensional measurements with potentially high correlations. Canonical correlation analysis (CCA) is a classical tool that explores the dependency of two multivariate random variables and extracts canonical pairs of highly correlated linear combinations. Driven by applications in genomics, text mining, and imaging research, among others, many recent studies generalize CCA to high-dimensional settings. However, most of them either rely on strong assumptions on covariance matrices, or do not produce nested solutions. We propose a new sparse CCA (SCCA) method that recasts high-dimensional CCA as an iterative penalized least squares problem. Thanks to the new iterative penalized least squares formulation, our method directly estimates the sparse CCA directions with efficient algorithms. Therefore, in contrast to some existing methods, the new SCCA does not impose any sparsity assumptions on the covariance matrices. The proposed SCCA is also very flexible in the sense that it can be easily combined with properly chosen penalty functions to perform structured variable selection and incorporate prior information. Moreover, our proposal of SCCA produces nested solutions and thus provides great convenient in practice. Theoretical results show that SCCA can consistently estimate the true canonical pairs with an overwhelming probability in ultra-high dimensions. Numerical results also demonstrate the competitive performance of SCCA.
SMMR Other · 发表于 2019-02-01
Ehsan Zamanzade, M Mahdizadeh
摘要
This article studies the properties of the maximum likelihood estimator of the population proportion in ranked set sampling with extreme ranks. The maximum likelihood estimator is described and its asymptotic distribution is derived. Finite sample size properties of the estimator are investigated using simulation studies. It turns out that the proposed estimator is substantially more efficient than its simple random sampling and ranked set sampling analogs, as the true population proportion tends to zero/unity. The method is illustrated using data from the National Health and Nutrition Examination Survey.
AoS Other · 发表于 2019-02-01
Fasheng Sun, Yaping Wang, Hongquan Xu
摘要
Efficient designs are in high demand in practice for both computer and physical experiments. Existing designs (such as maximin distance designs and uniform designs) may have bad low-dimensional projections, which is undesirable when only a few factors are active. We propose a new design criterion, called uniform projection criterion, by focusing on projection uniformity. Uniform projection designs generated under the new criterion scatter points uniformly in all dimensions and have good space-filling properties in terms of distance, uniformity and orthogonality. We show that the new criterion is a function of the pairwise $L_{1}$-distances between the rows, so that the new criterion can be computed at no more cost than a design criterion that ignores projection properties. We develop some theoretical results and show that maximin $L_{1}$-equidistant designs are uniform projection designs. In addition, a class of asymptotically optimal uniform projection designs based on good lattice point sets are constructed. We further illustrate an application of uniform projection designs via a multidrug combination experiment.
AoS Optimization & Learning Theory · 发表于 2019-02-01
Rudrasis Chakraborty, Baba C. Vemuri
摘要
A Stiefel manifold of the compact type is often encountered in many fields of engineering including, signal and image processing, machine learning, numerical optimization and others. The Stiefel manifold is a Riemannian homogeneous space but not a symmetric space. In previous work, researchers have defined probability distributions on symmetric spaces and performed statistical analysis of data residing in these spaces. In this paper, we present original work involving definition of Gaussian distributions on a homogeneous space and show that the maximum-likelihood estimate of the location parameter of a Gaussian distribution on the homogeneous space yields the Fréchet mean (FM) of the samples drawn from this distribution. Further, we present an algorithm to sample from the Gaussian distribution on the Stiefel manifold and recursively compute the FM of these samples. We also prove the weak consistency of this recursive FM estimator. Several synthetic and real data experiments are then presented, demonstrating the superior computational performance of this estimator over the gradient descent based nonrecursive counter part as well as the stochastic gradient descent based method prevalent in literature.
AoS Bayesian Methods High-Dimensional Networks & Graphs · 发表于 2019-02-01
Xuan Cao, Kshitij Khare, Malay Ghosh
摘要
Covariance estimation and selection for high-dimensional multivariate datasets is a fundamental problem in modern statistics. Gaussian directed acyclic graph (DAG) models are a popular class of models used for this purpose. Gaussian DAG models introduce sparsity in the Cholesky factor of the inverse covariance matrix, and the sparsity pattern in turn corresponds to specific conditional independence assumptions on the underlying variables. A variety of priors have been developed in recent years for Bayesian inference in DAG models, yet crucial convergence and sparsity selection properties for these models have not been thoroughly investigated. Most of these priors are adaptations/generalizations of the Wishart distribution in the DAG context. In this paper, we consider a flexible and general class of these “DAG-Wishart” priors with multiple shape parameters. Under mild regularity assumptions, we establish strong graph selection consistency and establish posterior convergence rates for estimation when the number of variables $p$ is allowed to grow at an appropriate subexponential rate with the sample size $n$.
AoS Other · 发表于 2019-02-01
Hera Y. He, Kinjal Basu, Qingyuan Zhao, Art B. Owen
摘要
It is common for genomic data analysis to use $p$-values from a large number of permutation tests. The multiplicity of tests may require very tiny $p$-values in order to reject any null hypotheses and the common practice of using randomly sampled permutations then becomes very expensive. We propose an inexpensive approximation to $p$-values for two sample linear test statistics, derived from Stolarsky’s invariance principle. The method creates a geometrically derived reference set of approximate $p$-values for each hypothesis. The average of that set is used as a point estimate $\hat{p}$ and our generalization of the invariance principle allows us to compute the variance of the $p$-values in that set. We find that in cases where the point estimate is small, the variance is a modest multiple of the square of that point estimate, yielding a relative error property similar to that of saddlepoint approximations. On a Parkinson’s disease data set, the new approximation is faster and more accurate than the saddlepoint approximation. We also obtain a simple probabilistic explanation of Stolarsky’s invariance principle.
AoS Nonparametric & Semiparametric · 发表于 2019-02-01
O. V. Lepski, T. Willer
摘要
We study the problem of nonparametric estimation under $\mathbb{L}_{p}$-loss, $p\in[1,\infty)$, in the framework of the convolution structure density model on $\mathbb{R}^{d}$. This observation scheme is a generalization of two classical statistical models, namely density estimation under direct and indirect observations. The original pointwise selection rule from a family of “kernel-type” estimators is proposed. For the selected estimator, we prove an $\mathbb{L}_{p}$-norm oracle inequality and several of its consequences. Next, the problem of adaptive minimax estimation under $\mathbb{L}_{p}$-loss over the scale of anisotropic Nikol’skii classes is addressed. We fully characterize the behavior of the minimax risk for different relationships between regularity parameters and norm indexes in the definitions of the functional class and of the risk. We prove that the proposed selection rule leads to the construction of an optimally or nearly optimally (up to logarithmic factors) adaptive estimator.
AoS Nonparametric & Semiparametric Survival Analysis Clinical Trials · 发表于 2019-02-01
Hsin-wen Chang, Ian W. McKeague
摘要
New nonparametric tests for the ordering of multiple survival functions are developed with the possibility of right censorship taken into account. The motivation comes from noninferiority trials with multiple treatments. The proposed tests are based on nonparametric likelihood ratio statistics, which are known to provide more powerful tests than Wald-type procedures, but in this setting have only been studied for pairs of survival functions or in the absence of censoring. We introduce a novel type of pool adjacent violator algorithm that leads to a complete solution of the problem. The limit distributions can be expressed as weighted sums of squares involving projections of certain Gaussian processes onto the given ordered alternative. A simulation study shows that the new procedures have superior power to a competing combined-pairwise Cox model approach. We illustrate the proposed methods using data from a three-arm noninferiority trial.
AoS Other · 发表于 2019-02-01
Eddie Aamari, Clément Levrard
摘要
Given a noisy sample from a submanifold $M\subset\mathbb{R}^{D}$, we derive optimal rates for the estimation of tangent spaces $T_{X}M$, the second fundamental form $\mathit{II}_{X}^{M}$ and the submanifold $M$. After motivating their study, we introduce a quantitative class of $\mathcal{C}^{k}$-submanifolds in analogy with Hölder classes. The proposed estimators are based on local polynomials and allow to deal simultaneously with the three problems at stake. Minimax lower bounds are derived using a conditional version of Assouad’s lemma when the base point $X$ is random.
AoS Testing & Uncertainty · 发表于 2019-02-01
Tim Patschkowski, Angelika Rohde
摘要
We develop honest and locally adaptive confidence bands for probability densities. They provide substantially improved confidence statements in case of inhomogeneous smoothness, and are easily implemented and visualized. The article contributes conceptual work on locally adaptive inference as a straightforward modification of the global setting imposes severe obstacles for statistical purposes. Among others, we introduce a statistical notion of local Hölder regularity and prove a correspondingly strong version of local adaptivity. We substantially relax the straightforward localization of the self-similarity condition in order not to rule out prototypical densities. The set of densities permanently excluded from the consideration is shown to be pathological in a mathematically rigorous sense. On a technical level, the crucial component for the verification of honesty is the identification of an asymptotically least favorable stationary case by means of Slepian’s comparison inequality.
AoS High-Dimensional · 发表于 2019-02-01
Jiang Hu, Weiming Li, Zhi Liu, Wang Zhou
摘要
This paper discusses fluctuations of linear spectral statistics of high-dimensional sample covariance matrices when the underlying population follows an elliptical distribution. Such population often possesses high order correlations among their coordinates, which have great impact on the asymptotic behaviors of linear spectral statistics. Taking such kind of dependency into consideration, we establish a new central limit theorem for the linear spectral statistics in this paper for a class of elliptical populations. This general theoretical result has wide applications and, as an example, it is then applied to test the sphericity of elliptical populations.
AoS Other · 发表于 2019-02-01
Juan A. Cuesta-Albertos, Eduardo García-Portugués, Manuel Febrero-Bande, Wenceslao González-Manteiga
摘要
We consider marked empirical processes indexed by a randomly projected functional covariate to construct goodness-of-fit tests for the functional linear model with scalar response. The test statistics are built from continuous functionals over the projected process, resulting in computationally efficient tests that exhibit root-$n$ convergence rates and circumvent the curse of dimensionality. The weak convergence of the empirical process is obtained conditionally on a random direction, whilst the almost surely equivalence between the testing for significance expressed on the original and on the projected functional covariate is proved. The computation of the test in practice involves calibration by wild bootstrap resampling and the combination of several $p$-values, arising from different projections, by means of the false discovery rate method. The finite sample properties of the tests are illustrated in a simulation study for a variety of linear models, underlying processes, and alternatives. The software provided implements the tests and allows the replication of simulations and data applications.
AoS Functional Data · 发表于 2019-02-01
Marie-Hélène Descary, Victor M. Panaretos
摘要
Functional data analyses typically proceed by smoothing, followed by functional PCA. This paradigm implicitly assumes that rough variation is due to nuisance noise. Nevertheless, relevant functional features such as time-localised or short scale fluctuations may indeed be rough relative to the global scale, but still smooth at shorter scales. These may be confounded with the global smooth components of variation by the smoothing and PCA, potentially distorting the parsimony and interpretability of the analysis. The goal of this paper is to investigate how both smooth and rough variations can be recovered on the basis of discretely observed functional data. Assuming that a functional datum arises as the sum of two uncorrelated components, one smooth and one rough, we develop identifiability conditions for the recovery of the two corresponding covariance operators. The key insight is that they should possess complementary forms of parsimony: one smooth and finite rank (large scale), and the other banded and potentially infinite rank (small scale). Our conditions elucidate the precise interplay between rank, bandwidth and grid resolution. Under these conditions, we show that the recovery problem is equivalent to rank-constrained matrix completion, and exploit this to construct estimators of the two covariances, without assuming knowledge of the true bandwidth or rank; we study their asymptotic behaviour, and then use them to recover the smooth and rough components of each functional datum by best linear prediction. As a result, we effectively produce separate functional PCAs for smooth and rough variation.
AoS Nonparametric & Semiparametric High-Dimensional · 发表于 2019-02-01
Sayan Dasgupta, Yair Goldberg, Michael R. Kosorok
摘要
We develop an approach for feature elimination in statistical learning with kernel machines, based on recursive elimination of features. We present theoretical properties of this method and show that it is uniformly consistent in finding the correct feature space under certain generalized assumptions. We present a few case studies to show that the assumptions are met in most practical situations and present simulation results to demonstrate performance of the proposed approach.
AoS Meta-Analysis & Data Integration · 发表于 2019-02-01
Thomas B. Berrett, Richard J. Samworth, Ming Yuan
摘要
Many statistical procedures, including goodness-of-fit tests and methods for independent component analysis, rely critically on the estimation of the entropy of a distribution. In this paper, we seek entropy estimators that are efficient and achieve the local asymptotic minimax lower bound with respect to squared error loss. To this end, we study weighted averages of the estimators originally proposed by Kozachenko and Leonenko [Probl. Inform. Transm. 23 (1987), 95–101], based on the $k$-nearest neighbour distances of a sample of $n$ independent and identically distributed random vectors in $\mathbb{R}^{d}$. A careful choice of weights enables us to obtain an efficient estimator in arbitrary dimensions, given sufficient smoothness, while the original unweighted estimator is typically only efficient when $d\leq 3$. In addition to the new estimator proposed and theoretical understanding provided, our results facilitate the construction of asymptotically valid confidence intervals for the entropy of asymptotically minimal width.
AoS Spatial & Time Series Nonparametric & Semiparametric · 发表于 2019-02-01
Jia Li, Yunxiao Liu, Dacheng Xiu
摘要
We propose semiparametrically efficient estimators for general integrated volatility functionals of multivariate semimartingale processes. A plug-in method that uses nonparametric estimates of spot volatilities is known to induce high-order biases that need to be corrected to obey a central limit theorem. Such bias terms arise from boundary effects, the diffusive and jump movements of stochastic volatility and the sampling error from the nonparametric spot volatility estimation. We propose a novel jackknife method for bias correction. The jackknife estimator is simply formed as a linear combination of a few uncorrected estimators associated with different local window sizes used in the estimation of spot volatility. We show theoretically that our estimator is asymptotically mixed Gaussian, semiparametrically efficient, and more robust to the choice of local windows. To facilitate the practical use, we introduce a simulation-based estimator of the asymptotic variance, so that our inference is derivative-free, and hence is convenient to implement.
AoS Other · 发表于 2019-02-01
Federico Camerlenghi, Antonio Lijoi, Peter Orbanz, Igor Prünster
摘要
Hierarchies of discrete probability measures are remarkably popular as nonparametric priors in applications, arguably due to two key properties: (i) they naturally represent multiple heterogeneous populations; (ii) they produce ties across populations, resulting in a shrinkage property often described as “sharing of information.” In this paper, we establish a distribution theory for hierarchical random measures that are generated via normalization, thus encompassing both the hierarchical Dirichlet and hierarchical Pitman–Yor processes. These results provide a probabilistic characterization of the induced (partially exchangeable) partition structure, including the distribution and the asymptotics of the number of partition sets, and a complete posterior characterization. They are obtained by representing hierarchical processes in terms of completely random measures, and by applying a novel technique for deriving the associated distributions. Moreover, they also serve as building blocks for new simulation algorithms, and we derive marginal and conditional algorithms for Bayesian inference.
AoS Testing & Uncertainty · 发表于 2019-02-01
Johannes Tewes, Dimitris N. Politis, Daniel J. Nordman
摘要
The block bootstrap approximates sampling distributions from dependent data by resampling data blocks. A fundamental problem is establishing its consistency for the distribution of a sample mean, as a prototypical statistic. We use a structural relationship with subsampling to characterize the bootstrap in a new and general manner. While subsampling and block bootstrap differ, the block bootstrap distribution of a sample mean equals that of a $k$-fold self-convolution of a subsampling distribution. Motivated by this, we provide simple necessary and sufficient conditions for a convolved subsampling estimator to produce a normal limit that matches the target of bootstrap estimation. These conditions may be linked to consistency properties of an original subsampling distribution, which are often obtainable under minimal assumptions. Through several examples, the results are shown to validate the block bootstrap for means under significantly weakened assumptions in many existing (and some new) dependence settings, which also addresses a standing conjecture of Politis, Romano and Wolf [Subsampling (1999) Springer]. Beyond sample means, convolved subsampling may not match the block bootstrap, but instead provides an alternative resampling estimator that may be of interest. Under minimal dependence conditions, results also broadly establish convolved subsampling for general statistics having normal limits.
AoS High-Dimensional · 发表于 2019-02-01
Zhigang Bao, Jiang Hu, Guangming Pan, Wang Zhou
摘要
Consider a Gaussian vector $\mathbf{z}=(\mathbf{x}',\mathbf{y}')'$, consisting of two sub-vectors $\mathbf{x}$ and $\mathbf{y}$ with dimensions $p$ and $q$, respectively. With $n$ independent observations of $\mathbf{z}$, we study the correlation between $\mathbf{x}$ and $\mathbf{y}$, from the perspective of the canonical correlation analysis. We investigate the high-dimensional case: both $p$ and $q$ are proportional to the sample size $n$. Denote by $\Sigma_{uv}$ the population cross-covariance matrix of random vectors $\mathbf{u}$ and $\mathbf{v}$, and denote by $S_{uv}$ the sample counterpart. The canonical correlation coefficients between $\mathbf{x}$ and $\mathbf{y}$ are known as the square roots of the nonzero eigenvalues of the canonical correlation matrix $\Sigma_{xx}^{-1}\Sigma_{xy}\Sigma_{yy}^{-1}\Sigma_{yx}$. In this paper, we focus on the case that $\Sigma_{xy}$ is of finite rank $k$, that is, there are $k$ nonzero canonical correlation coefficients, whose squares are denoted by $r_{1}\geq\cdots\geq r_{k}>0$. We study the sample counterparts of $r_{i},i=1,\ldots,k$, that is, the largest $k$ eigenvalues of the sample canonical correlation matrix $S_{xx}^{-1}S_{xy}S_{yy}^{-1}S_{yx}$, denoted by $\lambda_{1}\geq\cdots\geq\lambda_{k}$. We show that there exists a threshold $r_{c}\in(0,1)$, such that for each $i\in\{1,\ldots,k\}$, when $r_{i}\leq r_{c}$, $\lambda_{i}$ converges almost surely to the right edge of the limiting spectral distribution of the sample canonical correlation matrix, denoted by $d_{+}$. When $r_{i}>r_{c}$, $\lambda_{i}$ possesses an almost sure limit in $(d_{+},1]$, from which we can recover $r_{i}$’s in turn, thus provide an estimate of the latter in the high-dimensional scenario. We also obtain the limiting distribution of $\lambda_{i}$’s under appropriate normalization. Specifically, $\lambda_{i}$ possesses Gaussian type fluctuation if $r_{i}>r_{c}$, and follows Tracy–Widom distribution if $r_{i}<r_{c}$. Some applications of our results are also discussed.
AoS Bayesian Methods · 发表于 2019-02-01
Anirban Bhattacharya, Debdeep Pati, Yun Yang
摘要
We consider the fractional posterior distribution that is obtained by updating a prior distribution via Bayes theorem with a fractional likelihood function, a usual likelihood function raised to a fractional power. First, we analyze the contraction property of the fractional posterior in a general misspecified framework. Our contraction results only require a prior mass condition on certain Kullback–Leibler (KL) neighborhood of the true parameter (or the KL divergence minimizer in the misspecified case), and obviate constructions of test functions and sieves commonly used in the literature for analyzing the contraction property of a regular posterior. We show through a counterexample that some condition controlling the complexity of the parameter space is necessary for the regular posterior to contract, rendering additional flexibility on the choice of the prior for the fractional posterior. Second, we derive a novel Bayesian oracle inequality based on a PAC-Bayes inequality in misspecified models. Our derivation reveals several advantages of averaging based Bayesian procedures over optimization based frequentist procedures. As an application of the Bayesian oracle inequality, we derive a sharp oracle inequality in multivariate convex regression problems. We also illustrate the theory in Gaussian process regression and density estimation problems.
AoS Spatial & Time Series · 发表于 2019-02-01
Lynna Chu, Hao Chen
摘要
We consider the testing and estimation of change-points, locations where the distribution abruptly changes, in a sequence of multivariate or non-Euclidean observations. We study a nonparametric framework that utilizes similarity information among observations, which can be applied to various data types as long as an informative similarity measure on the sample space can be defined. The existing approach along this line has low power and/or biased estimates for change-points under some common scenarios. We address these problems by considering new tests based on similarity information. Simulation studies show that the new approaches exhibit substantial improvements in detecting and estimating change-points. In addition, under some mild conditions, the new test statistics are asymptotically distribution-free under the null hypothesis of no change. Analytic $p$-value approximations to the significance of the new test statistics for the single change-point alternative and changed interval alternative are derived, making the new approaches easy off-the-shelf tools for large datasets. The new approaches are illustrated in an analysis of New York taxi data.
AoS Other · 发表于 2019-02-01
Yohann De Castro, Fabrice Gamboa, Didier Henrion, Roxana Hess, Jean-Bernard Lasserre
摘要
We introduce a new approach aiming at computing approximate optimal designs for multivariate polynomial regressions on compact (semialgebraic) design spaces. We use the moment-sum-of-squares hierarchy of semidefinite programming problems to solve numerically the approximate optimal design problem. The geometry of the design is recovered via semidefinite programming duality theory. This article shows that the hierarchy converges to the approximate optimal design as the order of the hierarchy increases. Furthermore, we provide a dual certificate ensuring finite convergence of the hierarchy and showing that the approximate optimal design can be computed numerically with our method. As a byproduct, we revisit the equivalence theorem of the experimental design theory: it is linked to the Christoffel polynomial and it characterizes finite convergence of the moment-sum-of-square hierarchies.
AoS High-Dimensional · 发表于 2019-02-01
Alexandra Carpentier, Nicolas Verzelen
摘要
Consider the Gaussian vector model with mean value $\theta$. We study the twin problems of estimating the number $\Vert \theta \Vert_{0}$ of nonzero components of $\theta$ and testing whether $\Vert \theta \Vert_{0}$ is smaller than some value. For testing, we establish the minimax separation distances for this model and introduce a minimax adaptive test. Extensions to the case of unknown variance are also discussed. Rewriting the estimation of $\Vert \theta \Vert_{0}$ as a multiple testing problem of all hypotheses $\{\Vert \theta \Vert_{0}\leq q\}$, we both derive a new way of assessing the optimality of a sparsity estimator and we exhibit such an optimal procedure. This general approach provides a roadmap for estimating the complexity of the signal in various statistical models.