2018 年的期刊文章 · 第 2 页

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

SiM Missing Data & Measurement Error · 发表于 2018-12-04

There is no impact of exposure measurement error on latency estimation in linear models

S.B. Peskoe, D. Spiegelman, M. Wang

摘要

Identification of the latency period for the effect of a time‐varying exposure is key when assessing many environmental, nutritional, and behavioral risk factors. A pre‐specified exposure metric involving an unknown latency parameter is often used in the statistical model for the exposure‐disease relationship. Likelihood‐based methods have been developed to estimate this latency parameter for generalized linear models but do not exist for scenarios where the exposure is measured with error, as is usually the case. Here, we explore the performance of naive estimators for both the latency parameter and the regression coefficients, which ignore exposure measurement error, assuming a linear measurement error model. We prove that, in many scenarios under this general measurement error setting, the least squares estimator for the latency parameter remains consistent, while the regression coefficient estimates are inconsistent as has previously been found in standard measurement error models where the primary disease model does not involve a latency parameter. Conditions under which this result holds are generalized to a wide class of covariance structures and mean functions. The findings are illustrated in a study of body mass index in relation to physical activity in the Health Professionals Follow‐Up Study.

SiM Causal Inference Testing & Uncertainty · 发表于 2018-12-04

New metrics for meta‐analyses of heterogeneous effects

Maya B. Mathur, Tyler J. VanderWeele

摘要

We provide two simple metrics that could be reported routinely in random‐effects meta‐analyses to convey evidence strength for scientifically meaningful effects under effect heterogeneity (ie, a nonzero estimated variance of the true effect distribution). First, given a chosen threshold of meaningful effect size, meta‐analyses could report the estimated proportion of true effect sizes above this threshold. Second, meta‐analyses could estimate the proportion of effect sizes below a second, possibly symmetric, threshold in the opposite direction from the estimated mean. These metrics could help identify if (1) there are few effects of scientifically meaningful size despite a “statistically significant” pooled point estimate, (2) there are some large effects despite an apparently null point estimate, or (3) strong effects in the direction opposite the pooled estimate also regularly occur (and thus, potential effect modifiers should be examined). These metrics should be presented with confidence intervals, which can be obtained analytically or, under weaker assumptions, using bias‐corrected and accelerated bootstrapping. Additionally, these metrics inform relative comparison of evidence strength across related meta‐analyses. We illustrate with applied examples and provide an R function to compute the metrics and confidence intervals.

SMMR Meta-Analysis & Data Integration Survival Analysis Missing Data & Measurement Error · 发表于 2018-12-04

Meta-analysis of non-statistically significant unreported effects

Anton Albajes-Eizagirre, Aleix Solanes, Joaquim Radua

摘要

Published studies in Medicine (and virtually any other discipline) sometimes report that a difference or correlation did not reach statistical significance but do not report its effect size or any statistic from which the latter may be derived. Unfortunately, meta-analysts should not exclude these studies because their exclusion would bias the meta-analytic outcome, but also they cannot be included as null effect sizes because this strategy is also associated to bias. To overcome this problem, we have developed MetaNSUE, a novel method based on multiple imputations of the censored information. We also provide an R package and an easy-to-use Graphical User Interface for non-R meta-analysts.

SMMR Testing & Uncertainty Diagnostics & Prediction · 发表于 2018-12-04

Confidence intervals for the Mann–Whitney test

Maja Pohar Perme, Damjan Manevski

摘要

The Mann–Whitney test is a commonly used non-parametric alternative of the two-sample t-test. Despite its frequent use, it is only rarely accompanied with confidence intervals of an effect size. If reported, the effect size is usually measured with the difference of medians or the shift of the two distribution locations. Neither of these two measures directly coincides with the test statistic of the Mann–Whitney test, so the interpretation of the test results and the confidence intervals may be importantly different. In this paper, we focus on the probability that random variable X is lower than random variable Y. This measure is often referred to as the degree of overlap or the probabilistic index; it is in one-to-one relationship with the Mann–Whitney test statistic. The measure equals the area under the ROC curve. Several methods have been proposed for the construction of the confidence interval for this measure, and we review the most promising ones and explain their ideas. We study the properties of different variance estimators and small sample problems of confidence intervals construction. We identify scenarios in which the existing approaches yield inadequate coverage probabilities. We conclude that the DeLong variance estimator is a reliable option regardless of the scenario, but confidence intervals should be constructed using the logit scale to avoid values above 1 or below 0 and the poor coverage probability that follows. A correction is needed for the case when all values from one sample are smaller than the values of the other. We propose a method that improves the coverage probability also in these cases.

SiM Genetics & Omics · 发表于 2018-12-04

A likelihood‐based approach to transcriptome association analysis

Jing Qian, Evan Ray, Regina L. Brecha, Muredach P. Reilly, Andrea S. Foulkes

摘要

Elucidating the mechanistic underpinnings of genetic associations with complex traits requires formally characterizing and testing associated cell and tissue‐specific expression profiles. New opportunities exist to bolster this investigation with the growing numbers of large publicly available omics level data resources. Herein, we describe a fully likelihood‐based strategy to leveraging external resources in the setting that expression profiles are partially or fully unobserved in a genetic association study. A general framework is presented to accommodate multiple data types, and strategies for implementation using existing software packages are described. The method is applied to an investigation of the genetics of evoked inflammatory response in cardiovascular disease research. Simulation studies suggest appropriate type‐1 error control and power gains compared to single regression imputation, the most commonly applied practice in this setting.

SiM Diagnostics & Prediction · 发表于 2018-12-03

Multistate models and lifetime risk estimation: Application to Alzheimer's disease

Ron Brookmeyer, Nada Abdalla

摘要

The lifetime risk of a clinical condition is the probability of onset of the condition during one's lifespan. Recent advances in Alzheimer's disease (AD) research have identified screening tests for biomarkers that can identify persons who are in the earliest stages of the AD process but who do not yet have any clinical signs or symptoms. A critical question asked by patients and clinicians is, what is the probability an individual will develop AD dementia during his or her lifetime? Here, we discuss estimation of lifetime risks using biomarkers for preclinical disease based on a discrete nonhomogeneous Markov multistate model for the disease process. We allow the transition probabilities to depend on chronological age. In addition, we allow the probabilities to depend on calendar time to account for possible calendar trends in death rates and to evaluate the impact on lifetime risks of future interventions designed to slow disease progression. We develop estimating equations for calculating the lifetime risks from the nonhomogeneous multistate Markov model. Estimates of lifetime risks for AD dementia based on biomarkers for preclinical disease are presented.

SiM Bayesian Methods Clinical Trials Longitudinal Data · 发表于 2018-12-03

Bayesian model of disease progression in GNE myopathy

M. Quintana, J. Shrader, C. Slota, G. Joe, J.C. McKew, M. Fitzgerald, W.A. Gahl, S. Berry, N. Carrillo

摘要

One Sentence Summary: A Bayesian repeated measures model based on quantitative muscle strength data from a prospective Natural History Study was developed to determine disease progression and design clinical trials for GNE myopathy, a rare and slowly progressive muscle disease. GNE myopathy is a rare muscle disease characterized by slowly progressive weakness and atrophy of skeletal muscles. To address the significant challenges of defining the natural history and designing clinical trials for GNE myopathy, we developed a Bayesian latent variable repeated measures model to determine disease progression. The model is based on longitudinal quantitative muscle strength data collected as part of a prospective Natural History Study. The GNE Myopathy Progression Model provides an understanding of disease progression that would have otherwise required a natural history of unfeasible duration. “Disease age,” the model‐generated measure of disease progression, highly correlates with a variety of clinical, functional and patient‐reported outcomes. With the incorporation of a treatment effect parameter to the GNE Disease Progression Model, we describe a novel GNE Myopathy Disease Modification Analysis that significantly increases power and reduces the number of subjects required to test the effectiveness of novel therapies when compared to more traditional analysis methods. The GNE Myopathy Disease Progression Model and Disease Modification Analysis can be applied to muscle diseases with prospectively collected muscle strength data, and a variety of rare and slowly progressive diseases.

AoS High-Dimensional Testing & Uncertainty · 发表于 2018-12-02

Uniformly valid post-regularization confidence regions for many functional parameters in z-estimation framework

Alexandre Belloni, Victor Chernozhukov, Denis Chetverikov, Ying Wei

摘要

In this paper, we develop procedures to construct simultaneous confidence bands for ${\tilde{p}}$ potentially infinite-dimensional parameters after model selection for general moment condition models where ${\tilde{p}}$ is potentially much larger than the sample size of available data, $n$. This allows us to cover settings with functional response data where each of the ${\tilde{p}}$ parameters is a function. The procedure is based on the construction of score functions that satisfy Neyman orthogonality condition approximately. The proposed simultaneous confidence bands rely on uniform central limit theorems for high-dimensional vectors (and not on Donsker arguments as we allow for ${{\tilde{p}}\gg n}$). To construct the bands, we employ a multiplier bootstrap procedure which is computationally efficient as it only involves resampling the estimated score functions (and does not require resolving the high-dimensional optimization problems). We formally apply the general theory to inference on regression coefficient process in the distribution regression model with a logistic link, where two implementations are analyzed in detail. Simulations and an application to real data are provided to help illustrate the applicability of the results.

AoS Other · 发表于 2018-12-02

Think globally, fit locally under the manifold setup: Asymptotic analysis of locally linear embedding

Hau-Tieng Wu, Nan Wu

摘要

Since its introduction in 2000, Locally Linear Embedding (LLE) has been widely applied in data science. We provide an asymptotical analysis of LLE under the manifold setup. We show that for a general manifold, asymptotically we may not obtain the Laplace–Beltrami operator, and the result may depend on nonuniform sampling unless a correct regularization is chosen. We also derive the corresponding kernel function, which indicates that LLE is not a Markov process. A comparison with other commonly applied nonlinear algorithms, particularly a diffusion map, is provided and its relationship with locally linear regression is also discussed.

AoS Spatial & Time Series · 发表于 2018-12-02

Tail-greedy bottom-up data decompositions and fast multiple change-point detection

Piotr Fryzlewicz

摘要

This article proposes a “tail-greedy”, bottom-up transform for one-dimensional data, which results in a nonlinear but conditionally orthonormal, multiscale decomposition of the data with respect to an adaptively chosen unbalanced Haar wavelet basis. The “tail-greediness” of the decomposition algorithm, whereby multiple greedy steps are taken in a single pass through the data, both enables fast computation and makes the algorithm applicable in the problem of consistent estimation of the number and locations of multiple change-points in data. The resulting agglomerative change-point detection method avoids the disadvantages of the classical divisive binary segmentation, and offers very good practical performance. It is implemented in the R package breakfast, available from CRAN.

AoS High-Dimensional · 发表于 2018-12-02

Slope meets Lasso: Improved oracle bounds and optimality

Pierre C. Bellec, Guillaume Lecué, Alexandre B. Tsybakov

摘要

We show that two polynomial time methods, a Lasso estimator with adaptively chosen tuning parameter and a Slope estimator, adaptively achieve the minimax prediction and $\ell_{2}$ estimation rate $(s/n)\log(p/s)$ in high-dimensional linear regression on the class of $s$-sparse vectors in $\mathbb{R}^{p}$. This is done under the Restricted Eigenvalue (RE) condition for the Lasso and under a slightly more constraining assumption on the design for the Slope. The main results have the form of sharp oracle inequalities accounting for the model misspecification error. The minimax optimal bounds are also obtained for the $\ell_{q}$ estimation errors with $1\le q\le2$ when the model is well specified. The results are nonasymptotic, and hold both in probability and in expectation. The assumptions that we impose on the design are satisfied with high probability for a large class of random matrices with independent and possibly anisotropically distributed rows. We give a comparative analysis of conditions, under which oracle bounds for the Lasso and Slope estimators can be obtained. In particular, we show that several known conditions, such as the RE condition and the sparse eigenvalue condition are equivalent if the $\ell_{2}$-norms of regressors are uniformly bounded.

AoS Testing & Uncertainty Spatial & Time Series Functional Data · 发表于 2018-12-02

Sieve bootstrap for functional time series

Efstathios Paparoditis

摘要

A bootstrap procedure for functional time series is proposed which exploits a general vector autoregressive representation of the time series of Fourier coefficients appearing in the Karhunen–Loève expansion of the functional process. A double sieve-type bootstrap method is developed, which avoids the estimation of process operators and generates functional pseudo-time series that appropriately mimics the dependence structure of the functional time series at hand. The method uses a finite set of functional principal components to capture the essential driving parts of the infinite dimensional process and a finite order vector autoregressive process to imitate the temporal dependence structure of the corresponding vector time series of Fourier coefficients. By allowing the number of functional principal components as well as the autoregressive order used to increase to infinity (at some appropriate rate) as the sample size increases, consistency of the functional sieve bootstrap can be established. We demonstrate this by proving a basic bootstrap central limit theorem for functional finite Fourier transforms and by establishing bootstrap validity in the context of a fully functional testing problem. A novel procedure to select the number of functional principal components is introduced while simulations illustrate the good finite sample performance of the new bootstrap method proposed.

AoS High-Dimensional · 发表于 2018-12-02

Robust low-rank matrix estimation

Andreas Elsener, Sara van de Geer

摘要

Many results have been proved for various nuclear norm penalized estimators of the uniform sampling matrix completion problem. However, most of these estimators are not robust: in most of the cases the quadratic loss function and its modifications are used. We consider robust nuclear norm penalized estimators using two well-known robust loss functions: the absolute value loss and the Huber loss. Under several conditions on the sparsity of the problem (i.e., the rank of the parameter matrix) and on the regularity of the risk function sharp and nonsharp oracle inequalities for these estimators are shown to hold with high probability. As a consequence, the asymptotic behavior of the estimators is derived. Similar error bounds are obtained under the assumption of weak sparsity, that is, the case where the matrix is assumed to be only approximately low-rank. In all of our results, we consider a high-dimensional setting. In this case, this means that we assume $n\leq pq$. Finally, various simulations confirm our theoretical results.

AoS Other · 发表于 2018-12-02

Rho-estimators revisited: General theory and applications

Yannick Baraud, Lucien Birgé

摘要

Following Baraud, Birgé and Sart [Invent. Math. 207 (2017) 425–517], we pursue our attempt to design a robust universal estimator of the joint distribution of $n$ independent (but not necessarily i.i.d.) observations for an Hellinger-type loss. Given such observations with an unknown joint distribution $\mathbf{P}$ and a dominated model $\mathscr{Q}$ for $\mathbf{P}$, we build an estimator $\widehat{\mathbf{P}}$ based on $\mathscr{Q}$ (a $\rho$-estimator) and measure its risk by an Hellinger-type distance. When $\mathbf{P}$ does belong to the model, this risk is bounded by some quantity which relies on the local complexity of the model in a vicinity of $\mathbf{P}$. In most situations, this bound corresponds to the minimax risk over the model (up to a possible logarithmic factor). When $\mathbf{P}$ does not belong to the model, its risk involves an additional bias term proportional to the distance between $\mathbf{P}$ and $\mathscr{Q}$, whatever the true distribution $\mathbf{P}$. From this point of view, this new version of $\rho$-estimators improves upon the previous one described in Baraud, Birgé and Sart [Invent. Math. 207 (2017) 425–517] which required that $\mathbf{P}$ be absolutely continuous with respect to some known reference measure. Further additional improvements have been brought as compared to the former construction. In particular, it provides a very general treatment of the regression framework with random design as well as a computationally tractable procedure for aggregating estimators. We also give some conditions for the maximum likelihood estimator to be a $\rho$-estimator. Finally, we consider the situation where the statistician has at her or his disposal many different models and we build a penalized version of the $\rho$-estimator for model selection and adaptation purposes. In the regression setting, this penalized estimator not only allows one to estimate the regression function but also the distribution of the errors.

AoS High-Dimensional · 发表于 2018-12-02

Restricted strong convexity implies weak submodularity

Ethan R. Elenberg, Rajiv Khanna, Alexandros G. Dimakis, Sahand Negahban

摘要

We connect high-dimensional subset selection and submodular maximization. Our results extend the work of Das and Kempe [In ICML (2011) 1057–1064] from the setting of linear regression to arbitrary objective functions. For greedy feature selection, this connection allows us to obtain strong multiplicative performance bounds on several methods without statistical modeling assumptions. We also derive recovery guarantees of this form under standard assumptions. Our work shows that greedy algorithms perform within a constant factor from the best possible subset-selection solution for a broad class of general objective functions. Our methods allow a direct control over the number of obtained features as opposed to regularization parameters that only implicitly control sparsity. Our proof technique uses the concept of weak submodularity initially defined by Das and Kempe. We draw a connection between convex analysis and submodular set function theory which may be of independent interest for other statistical learning applications that have combinatorial structure.

AoS Networks & Graphs Nonparametric & Semiparametric Testing & Uncertainty · 发表于 2018-12-02

ROCKET: Robust confidence intervals via Kendall’s tau for transelliptical graphical models

Rina Foygel Barber, Mladen Kolar

摘要

Understanding complex relationships between random variables is of fundamental importance in high-dimensional statistics, with numerous applications in biological and social sciences. Undirected graphical models are often used to represent dependencies between random variables, where an edge between two random variables is drawn if they are conditionally dependent given all the other measured variables. A large body of literature exists on methods that estimate the structure of an undirected graphical model, however, little is known about the distributional properties of the estimators beyond the Gaussian setting. In this paper, we focus on inference for edge parameters in a high-dimensional transelliptical model, which generalizes Gaussian and nonparanormal graphical models. We propose ROCKET, a novel procedure for estimating parameters in the latent inverse covariance matrix. We establish asymptotic normality of ROCKET in an ultra high-dimensional setting under mild assumptions, without relying on oracle model selection results. ROCKET requires the same number of samples that are known to be necessary for obtaining a $\sqrt{n}$ consistent estimator of an element in the precision matrix under a Gaussian model. Hence, it is an optimal estimator under a much larger family of distributions. The result hinges on a tight control of the sparse spectral norm of the nonparametric Kendall’s tau estimator of the correlation matrix, which is of independent interest. Empirically, ROCKET outperforms the nonparanormal and Gaussian models in terms of achieving accurate inference on simulated data. We also compare the three methods on real data (daily stock returns), and find that the ROCKET estimator is the only method whose behavior across subsamples agrees with the distribution predicted by the theory.

AoS Functional Data Longitudinal Data · 发表于 2018-12-02

Principal component analysis for functional data on Riemannian manifolds and spheres

Xiongtao Dai, Hans-Georg Müller

摘要

Functional data analysis on nonlinear manifolds has drawn recent interest. Sphere-valued functional data, which are encountered, for example, as movement trajectories on the surface of the earth are an important special case. We consider an intrinsic principal component analysis for smooth Riemannian manifold-valued functional data and study its asymptotic properties. Riemannian functional principal component analysis (RFPCA) is carried out by first mapping the manifold-valued data through Riemannian logarithm maps to tangent spaces around the Fréchet mean function, and then performing a classical functional principal component analysis (FPCA) on the linear tangent spaces. Representations of the Riemannian manifold-valued functions and the eigenfunctions on the original manifold are then obtained with exponential maps. The tangent-space approximation yields upper bounds to residual variances if the Riemannian manifold has nonnegative curvature. We derive a central limit theorem for the mean function, as well as root-$n$ uniform convergence rates for other model components. Our applications include a novel framework for the analysis of longitudinal compositional data, achieved by mapping longitudinal compositional data to trajectories on the sphere, illustrated with longitudinal fruit fly behavior patterns. RFPCA is shown to outperform an unrestricted FPCA in terms of trajectory recovery and prediction in applications and simulations.

AoS Other · 发表于 2018-12-02

Optimal maximin $L_{1}$-distance Latin hypercube designs based on good lattice point designs

Lin Wang, Qian Xiao, Hongquan Xu

摘要

Maximin distance Latin hypercube designs are commonly used for computer experiments, but the construction of such designs is challenging. We construct a series of maximin Latin hypercube designs via Williams transformations of good lattice point designs. Some constructed designs are optimal under the maximin $L_{1}$-distance criterion, while others are asymptotically optimal. Moreover, these designs are also shown to have small pairwise correlations between columns.

AoS Nonparametric & Semiparametric Clinical Trials · 发表于 2018-12-02

Nonparametric covariate-adjusted response-adaptive design based on a functional urn model

Giacomo Aletti, Andrea Ghiglietti, William F. Rosenberger

摘要

In this paper, we propose a general class of covariate-adjusted response-adaptive (CARA) designs based on a new functional urn model. We prove strong consistency concerning the functional urn proportion and the proportion of subjects assigned to the treatment groups, in the whole study and for each covariate profile, allowing the distribution of the responses conditioned on covariates to be estimated nonparametrically. In addition, we establish joint central limit theorems for the above quantities and the sufficient statistics of features of interest, which allow to construct procedures to make inference on the conditional response distributions. These results are then applied to typical situations concerning Gaussian and binary responses.

AoS Other · 发表于 2018-12-02

Multiscale scanning in inverse problems

Katharina Proksch, Frank Werner, Axel Munk

摘要

In this paper, we propose a multiscale scanning method to determine active components of a quantity $f$ w.r.t. a dictionary $\mathcal{U}$ from observations $Y$ in an inverse regression model $Y=Tf+\xi$ with linear operator $T$ and general random error $\xi$. To this end, we provide uniform confidence statements for the coefficients $\langle\varphi,f\rangle$, $\varphi\in\mathcal{U}$, under the assumption that $(T^{*})^{-1}(\mathcal{U})$ is of wavelet-type. Based on this, we obtain a multiple test that allows to identify the active components of $\mathcal{U}$, that is, $\langle f,\varphi\rangle\neq0$, $\varphi\in\mathcal{U}$, at controlled, family-wise error rate. Our results rely on a Gaussian approximation of the underlying multiscale statistic with a novel scale penalty adapted to the ill-posedness of the problem. The scale penalty furthermore ensures convergence of the statistic’s distribution towards a Gumbel limit under reasonable assumptions. The important special cases of tomography and deconvolution are discussed in detail. Further, the regression case, when $T=\text{id}$ and the dictionary consists of moving windows of various sizes (scales), is included, generalizing previous results for this setting. We show that our method obeys an oracle optimality, that is, it attains the same asymptotic power as a single-scale testing procedure at the correct scale. Simulations support our theory and we illustrate the potential of the method as an inferential tool for imaging. As a particular application, we discuss super-resolution microscopy and analyze experimental STED data to locate single DNA origami.

AoS Other · 发表于 2018-12-02

Multilayer tensor factorization with applications to recommender systems

Xuan Bi, Annie Qu, Xiaotong Shen

摘要

Recommender systems have been widely adopted by electronic commerce and entertainment industries for individualized prediction and recommendation, which benefit consumers and improve business intelligence. In this article, we propose an innovative method, namely the recommendation engine of multilayers (REM), for tensor recommender systems. The proposed method utilizes the structure of a tensor response to integrate information from multiple modes, and creates an additional layer of nested latent factors to accommodate between-subjects dependency. One major advantage is that the proposed method is able to address the “cold-start” issue in the absence of information from new customers, new products or new contexts. Specifically, it provides more effective recommendations through sub-group information. To achieve scalable computation, we develop a new algorithm for the proposed method, which incorporates a maximum block improvement strategy into the cyclic blockwise-coordinate-descent algorithm. In theory, we investigate algorithmic properties for convergence from an arbitrary initial point and local convergence, along with the asymptotic consistency of estimated parameters. Finally, the proposed method is applied in simulations and IRI marketing data with 116 million observations of product sales. Numerical studies demonstrate that the proposed method outperforms existing competitors in the literature.

AoS Other · 发表于 2018-12-02

Multiclass classification, information, divergence and surrogate risk

John Duchi, Khashayar Khosravi, Feng Ruan

摘要

We provide a unifying view of statistical information measures, multiway Bayesian hypothesis testing, loss functions for multiclass classification problems and multidistribution $f$-divergences, elaborating equivalence results between all of these objects, and extending existing results for binary outcome spaces to more general ones. We consider a generalization of $f$-divergences to multiple distributions, and we provide a constructive equivalence between divergences, statistical information (in the sense of DeGroot) and losses for multiclass classification. A major application of our results is in multiclass classification problems in which we must both infer a discriminant function $\gamma$—for making predictions on a label $Y$ from datum $X$—and a data representation (or, in the setting of a hypothesis testing problem, an experimental design), represented as a quantizer $\mathsf{q}$ from a family of possible quantizers $\mathsf{Q}$. In this setting, we characterize the equivalence between loss functions, meaning that optimizing either of two losses yields an optimal discriminant and quantizer $\mathsf{q}$, complementing and extending earlier results of Nguyen et al. [Ann. Statist. 37 (2009) 876–904] to the multiclass case. Our results provide a more substantial basis than standard classification calibration results for comparing different losses: we describe the convex losses that are consistent for jointly choosing a data representation and minimizing the (weighted) probability of error in multiclass classification problems.

AoS Other · 发表于 2018-12-02

Local asymptotic equivalence of pure states ensembles and quantum Gaussian white noise

Cristina Butucea, Mădălin Guţă, Michael Nussbaum

摘要

Quantum technology is increasingly relying on specialised statistical inference methods for analysing quantum measurement data. This motivates the development of “quantum statistics”, a field that is shaping up at the overlap of quantum physics and “classical” statistics. One of the less investigated topics to date is that of statistical inference for infinite dimensional quantum systems, which can be seen as quantum counterpart of nonparametric statistics. In this paper, we analyse the asymptotic theory of quantum statistical models consisting of ensembles of quantum systems which are identically prepared in a pure state. In the limit of large ensembles, we establish the local asymptotic equivalence (LAE) of this i.i.d. model to a quantum Gaussian white noise model. We use the LAE result in order to establish minimax rates for the estimation of pure states belonging to Hermite–Sobolev classes of wave functions. Moreover, for quadratic functional estimation of the same states we note an elbow effect in the rates, whereas for testing a pure state a sharp parametric rate is attained over the nonparametric Hermite–Sobolev class.

AoS Other · 发表于 2018-12-02

Halfspace depths for scatter, concentration and shape matrices

Davy Paindaveine, Germain Van Bever

摘要

We propose halfspace depth concepts for scatter, concentration and shape matrices. For scatter matrices, our concept is similar to those from Chen, Gao and Ren [Robust covariance and scatter matrix estimation under Huber’s contamination model (2018)] and Zhang [J. Multivariate Anal. 82 (2002) 134–165]. Rather than focusing, as in these earlier works, on deepest scatter matrices, we thoroughly investigate the properties of the proposed depth and of the corresponding depth regions. We do so under minimal assumptions and, in particular, we do not restrict to elliptical distributions nor to absolutely continuous distributions. Interestingly, fully understanding scatter halfspace depth requires considering different geometries/topologies on the space of scatter matrices. We also discuss, in the spirit of Zuo and Serfling [Ann. Statist. 28 (2000) 461–482], the structural properties a scatter depth should satisfy, and investigate whether or not these are met by scatter halfspace depth. Companion concepts of depth for concentration matrices and shape matrices are also proposed and studied. We show the practical relevance of the depth concepts considered in a real-data example from finance.

AoS Causal Inference Testing & Uncertainty · 发表于 2018-12-02

Extremal quantile treatment effects

Yichong Zhang

摘要

This paper establishes an asymptotic theory and inference method for quantile treatment effect estimators when the quantile index is close to or equal to zero. Such quantile treatment effects are of interest in many applications, such as the effect of maternal smoking on an infant’s adverse birth outcomes. When the quantile index is close to zero, the sparsity of data jeopardizes conventional asymptotic theory and bootstrap inference. When the quantile index is zero, there are no existing inference methods directly applicable in the treatment effect context. This paper addresses both of these issues by proposing new inference methods that are shown to be asymptotically valid as well as having adequate finite sample properties.

AoS Nonparametric & Semiparametric · 发表于 2018-12-02

Assessing robustness of classification using an angular breakdown point

Junlong Zhao, Guan Yu, Yufeng Liu

摘要

Robustness is a desirable property for many statistical techniques. As an important measure of robustness, the breakdown point has been widely used for regression problems and many other settings. Despite the existing development, we observe that the standard breakdown point criterion is not directly applicable for many classification problems. In this paper, we propose a new breakdown point criterion, namely angular breakdown point, to better quantify the robustness of different classification methods. Using this new breakdown point criterion, we study the robustness of binary large margin classification techniques, although the idea is applicable to general classification methods. Both bounded and unbounded loss functions with linear and kernel learning are considered. These studies provide useful insights on the robustness of different classification methods. Numerical results further confirm our theoretical findings.

AoS Networks & Graphs High-Dimensional · 发表于 2018-12-02

Approximate $\ell_{0}$-penalized estimation of piecewise-constant signals on graphs

Zhou Fan, Leying Guan

摘要

We study recovery of piecewise-constant signals on graphs by the estimator minimizing an $l_{0}$-edge-penalized objective. Although exact minimization of this objective may be computationally intractable, we show that the same statistical risk guarantees are achieved by the $\alpha$-expansion algorithm which computes an approximate minimizer in polynomial time. We establish that for graphs with small average vertex degree, these guarantees are minimax rate-optimal over classes of edge-sparse signals. For spatially inhomogeneous graphs, we propose minimization of an edge-weighted objective where each edge is weighted by its effective resistance or another measure of its contribution to the graph’s connectivity. We establish minimax optimality of the resulting estimators over corresponding edge-weighted sparsity classes. We show theoretically that these risk guarantees are not always achieved by the estimator minimizing the $l_{1}$/total-variation relaxation, and empirically that the $l_{0}$-based estimates are more accurate in high signal-to-noise settings.

AoS Other · 发表于 2018-12-02

Adaptive invariant density estimation for ergodic diffusions over anisotropic classes

Claudia Strauch

摘要

Consider some multivariate diffusion process $\mathbf{X}=(X_{t})_{t\geq0}$ with unique invariant probability measure and associated invariant density $\rho$, and assume that a continuous record of observations $X^{T}=(X_{t})_{0\leq t\leq T}$ of $\mathbf{X}$ is available. Recent results on functional inequalities for symmetric Markov semigroups are used in the statistical analysis of kernel estimators $\widehat{\rho}_{T}=\widehat{\rho}_{T}(X^{T})$ of $\rho$. For the basic problem of estimation with respect to $\mathrm{sup}$-norm risk under anisotropic Hölder smoothness constraints, the proposed approach yields an adaptive estimator which converges at a substantially faster rate than in standard multivariate density estimation from i.i.d. observations.

AoS High-Dimensional Nonparametric & Semiparametric · 发表于 2018-12-02

A new scope of penalized empirical likelihood with high-dimensional estimating equations

Jinyuan Chang, Cheng Yong Tang, Tong Tong Wu

摘要

Statistical methods with empirical likelihood (EL) are appealing and effective especially in conjunction with estimating equations for flexibly and adaptively incorporating data information. It is known that EL approaches encounter difficulties when dealing with high-dimensional problems. To overcome the challenges, we begin our study with investigating high-dimensional EL from a new scope targeting at high-dimensional sparse model parameters. We show that the new scope provides an opportunity for relaxing the stringent requirement on the dimensionality of the model parameters. Motivated by the new scope, we then propose a new penalized EL by applying two penalty functions respectively regularizing the model parameters and the associated Lagrange multiplier in the optimizations of EL. By penalizing the Lagrange multiplier to encourage its sparsity, a drastic dimension reduction in the number of estimating equations can be achieved. Most attractively, such a reduction in dimensionality of estimating equations can be viewed as a selection among those high-dimensional estimating equations, resulting in a highly parsimonious and effective device for estimating high-dimensional sparse model parameters. Allowing both the dimensionalities of model parameters and estimating equations growing exponentially with the sample size, our theory demonstrates that our new penalized EL estimator is sparse and consistent with asymptotically normally distributed nonzero components. Numerical simulations and a real data analysis show that the proposed penalized EL works promisingly.

AoS Other · 发表于 2018-12-01

Two-sample Kolmogorov–Smirnov-type tests revisited: Old and new tests in terms of local levels

Helmut Finner, Veronika Gontscharuk

摘要

From a multiple testing viewpoint, Kolmogorov–Smirnov (KS)-type tests are union-intersection tests which can be redefined in terms of local levels. The local level perspective offers a new viewpoint on ranges of sensitivity of KS-type tests and the design of new tests. We study the finite and asymptotic local level behavior of weighted KS tests which are either tail, intermediate or central sensitive. Furthermore, we provide new tests with approximately equal local levels and prove that the asymptotics of such tests with sample sizes $m$ and $n$ coincides with the asymptotics of one-sample higher criticism tests with sample size $\min (m,n)$. We compare the overall power of various tests and introduce local powers that are in line with local levels. Finally, suitably parameterized local level shape functions can be used to design new tests. We illustrate how to combine tests with different sensitivity in terms of local levels.

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

The landscape of empirical risk for nonconvex losses

Song Mei, Yu Bai, Andrea Montanari

摘要

Most high-dimensional estimation methods propose to minimize a cost function (empirical risk) that is a sum of losses associated to each data point (each example). In this paper, we focus on the case of nonconvex losses. Classical empirical process theory implies uniform convergence of the empirical (or sample) risk to the population risk. While under additional assumptions, uniform convergence implies consistency of the resulting M-estimator, it does not ensure that the latter can be computed efficiently. In order to capture the complexity of computing M-estimators, we study the landscape of the empirical risk, namely its stationary points and their properties. We establish uniform convergence of the gradient and Hessian of the empirical risk to their population counterparts, as soon as the number of samples becomes larger than the number of unknown parameters (modulo logarithmic factors). Consequently, good properties of the population risk can be carried to the empirical risk, and we are able to establish one-to-one correspondence of their stationary points. We demonstrate that in several problems such as nonconvex binary classification, robust regression and Gaussian mixture model, this result implies a complete characterization of the landscape of the empirical risk, and of the convergence properties of descent algorithms. We extend our analysis to the very high-dimensional setting in which the number of parameters exceeds the number of samples, and provides a characterization of the empirical risk landscape under a nearly information-theoretically minimal condition. Namely, if the number of samples exceeds the sparsity of the parameters vector (modulo logarithmic factors), then a suitable uniform convergence result holds. We apply this result to nonconvex binary classification and robust regression in very high-dimension.

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

Testing for periodicity in functional time series

Siegfried Hörmann, Piotr Kokoszka, Gilles Nisol

摘要

We derive several tests for the presence of a periodic component in a time series of functions. We consider both the traditional setting in which the periodic functional signal is contaminated by functional white noise, and a more general setting of a weakly dependent contaminating process. Several forms of the periodic component are considered. Our tests are motivated by the likelihood principle and fall into two broad categories, which we term multivariate and fully functional. Generally, for the functional series that motivate this research, the fully functional tests exhibit a superior balance of size and power. Asymptotic null distributions of all tests are derived and their consistency is established. Their finite sample performance is examined and compared by numerical studies and application to pollution data.

AoS Bayesian Methods · 发表于 2018-12-01

Support points

Simon Mak, V. Roshan Joseph

摘要

This paper introduces a new way to compact a continuous probability distribution $F$ into a set of representative points called support points. These points are obtained by minimizing the energy distance, a statistical potential measure initially proposed by Székely and Rizzo [InterStat 5 (2004) 1–6] for testing goodness-of-fit. The energy distance has two appealing features. First, its distance-based structure allows us to exploit the duality between powers of the Euclidean distance and its Fourier transform for theoretical analysis. Using this duality, we show that support points converge in distribution to $F$, and enjoy an improved error rate to Monte Carlo for integrating a large class of functions. Second, the minimization of the energy distance can be formulated as a difference-of-convex program, which we manipulate using two algorithms to efficiently generate representative point sets. In simulation studies, support points provide improved integration performance to both Monte Carlo and a specific quasi-Monte Carlo method. Two important applications of support points are then highlighted: (a) as a way to quantify the propagation of uncertainty in expensive simulations and (b) as a method to optimally compact Markov chain Monte Carlo (MCMC) samples in Bayesian computation.

AoS Other · 发表于 2018-12-01

Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries

Stanislav Minsker

摘要

Estimation of the covariance matrix has attracted a lot of attention of the statistical research community over the years, partially due to important applications such as principal component analysis. However, frequently used empirical covariance estimator, and its modifications, is very sensitive to the presence of outliers in the data. As P. Huber wrote [Ann. Math. Stat. 35 (1964) 73–101], “…This raises a question which could have been asked already by Gauss, but which was, as far as I know, only raised a few years ago (notably by Tukey): what happens if the true distribution deviates slightly from the assumed normal one? As is now well known, the sample mean then may have a catastrophically bad performance….” Motivated by Tukey’s question, we develop a new estimator of the (element-wise) mean of a random matrix, which includes covariance estimation problem as a special case. Assuming that the entries of a matrix possess only finite second moment, this new estimator admits sub-Gaussian or sub-exponential concentration around the unknown mean in the operator norm. We explain the key ideas behind our construction, and discuss applications to covariance estimation and matrix completion problems.

AoS Other · 发表于 2018-12-01

Strong identifiability and optimal minimax rates for finite mixture estimation

Philippe Heinrich, Jonas Kahn

摘要

We study the rates of estimation of finite mixing distributions, that is, the parameters of the mixture. We prove that under some regularity and strong identifiability conditions, around a given mixing distribution with $m_{0}$ components, the optimal local minimax rate of estimation of a mixing distribution with $m$ components is $n^{-1/(4(m-m_{0})+2)}$. This corrects a previous paper by Chen [Ann. Statist. 23 (1995) 221–233]. By contrast, it turns out that there are estimators with a (nonuniform) pointwise rate of estimation of $n^{-1/2}$ for all mixing distributions with a finite number of components.

AoS Bayesian Methods · 发表于 2018-12-01

Robust Gaussian stochastic process emulation

Mengyang Gu, Xiaojing Wang, James O. Berger

摘要

We consider estimation of the parameters of a Gaussian Stochastic Process (GaSP), in the context of emulation (approximation) of computer models for which the outcomes are real-valued scalars. The main focus is on estimation of the GaSP parameters through various generalized maximum likelihood methods, mostly involving finding posterior modes; this is because full Bayesian analysis in computer model emulation is typically prohibitively expensive. The posterior modes that are studied arise from objective priors, such as the reference prior. These priors have been studied in the literature for the situation of an isotropic covariance function or under the assumption of separability in the design of inputs for model runs used in the GaSP construction. In this paper, we consider more general designs (e.g., a Latin Hypercube Design) with a class of commonly used anisotropic correlation functions, which can be written as a product of isotropic correlation functions, each having an unknown range parameter and a fixed roughness parameter. We discuss properties of the objective priors and marginal likelihoods for the parameters of the GaSP and establish the posterior propriety of the GaSP parameters, but our main focus is to demonstrate that certain parameterizations result in more robust estimation of the GaSP parameters than others, and that some parameterizations that are in common use should clearly be avoided. These results are applicable to many frequently used covariance functions, for example, power exponential, Matérn, rational quadratic and spherical covariance. We also generalize the results to the GaSP model with a nugget parameter. Both theoretical and numerical evidence is presented concerning the performance of the studied procedures.

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

Overcoming the limitations of phase transition by higher order analysis of regularization techniques

Haolei Weng, Arian Maleki, Le Zheng

摘要

We study the problem of estimating a sparse vector $\beta\in\mathbb{R}^{p}$ from the response variables $y=X\beta+w$, where $w\sim N(0,\sigma_{w}^{2}I_{n\times n})$, under the following high-dimensional asymptotic regime: given a fixed number $\delta$, $p\rightarrow\infty$, while $n/p\rightarrow\delta$. We consider the popular class of $\ell_{q}$-regularized least squares (LQLS), a.k.a. bridge estimators, given by the optimization problem \begin{equation*}\hat{\beta}(\lambda,q)\in\arg\min_{\beta}\frac{1}{2}\|y-X\beta\|_{2}^{2}+\lambda\|\beta\|_{q}^{q},\end{equation*} and characterize the almost sure limit of $\frac{1}{p}\|\hat{\beta}(\lambda,q)-\beta\|_{2}^{2}$, and call it asymptotic mean square error (AMSE). The expression we derive for this limit does not have explicit forms, and hence is not useful in comparing LQLS for different values of $q$, or providing information in evaluating the effect of $\delta$ or sparsity level of $\beta$. To simplify the expression, researchers have considered the ideal “error-free” regime, that is, $w=0$, and have characterized the values of $\delta$ for which AMSE is zero. This is known as the phase transition analysis. In this paper, we first perform the phase transition analysis of LQLS. Our results reveal some of the limitations and misleading features of the phase transition analysis. To overcome these limitations, we propose the small error analysis of LQLS. Our new analysis framework not only sheds light on the results of the phase transition analysis, but also describes when phase transition analysis is reliable, and presents a more accurate comparison among different regularizers.

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

Optimal adaptive estimation of linear functionals under sparsity

Olivier Collier, Laëtitia Comminges, Alexandre B. Tsybakov, Nicolas Verzelen

摘要

We consider the problem of estimation of a linear functional in the Gaussian sequence model where the unknown vector $\theta \in\mathbb{R}^{d}$ belongs to a class of $s$-sparse vectors with unknown $s$. We suggest an adaptive estimator achieving a nonasymptotic rate of convergence that differs from the minimax rate at most by a logarithmic factor. We also show that this optimal adaptive rate cannot be improved when $s$ is unknown. Furthermore, we address the issue of simultaneous adaptation to $s$ and to the variance $\sigma^{2}$ of the noise. We suggest an estimator that achieves the optimal adaptive rate when both $s$ and $\sigma^{2}$ are unknown.

AoS Other · 发表于 2018-12-01

On MSE-optimal crossover designs

Christoph Neumann, Joachim Kunert

摘要

In crossover designs, each subject receives a series of treatments one after the other. Most papers on optimal crossover designs consider an estimate which is corrected for carryover effects. We look at the estimate for direct effects of treatment, which is not corrected for carryover effects. If there are carryover effects, this estimate will be biased. We try to find a design that minimizes the mean square error, that is, the sum of the squared bias and the variance. It turns out that the designs which are optimal for the corrected estimate are highly efficient for the uncorrected estimate.

AoS Survival Analysis · 发表于 2018-12-01

Multi-threshold accelerated failure time model

Jialiang Li, Baisuo Jin

摘要

A two-stage procedure for simultaneously detecting multiple thresholds and achieving model selection in the segmented accelerated failure time (AFT) model is developed in this paper. In the first stage, we formulate the threshold problem as a group model selection problem so that a concave 2-norm group selection method can be applied. In the second stage, the thresholds are finalized via a refining method. We establish the strong consistency of the threshold estimates and regression coefficient estimates under some mild technical conditions. The proposed procedure performs satisfactorily in our simulation studies. Its real world applicability is demonstrated via analyzing a follicular lymphoma data.

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