研究园简易版 · 经典书籍 · 期刊文章 · 有原文 · 完整版(可多选筛选、搜索) · 首页
2021 年的期刊文章 · 第 23 页
共 1542 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2021-04-01 到 2021-03-24。
按期刊、按主题看 →
AoS Other · 发表于 2021-04-01
Changxiao Cai, Gen Li, Yuejie Chi, H. Vincent Poor, Yuxin Chen
摘要
This paper is concerned with estimating the column space of an unknown low-rank matrix A⋆∈Rd1×d2, given noisy and partial observations of its entries. There is no shortage of scenarios where the observations—while being too noisy to support faithful recovery of the entire matrix—still convey sufficient information to enable reliable estimation of the column space of interest. This is particularly evident and crucial for the highly unbalanced case where the column dimension d2 far exceeds the row dimension d1, which is the focal point of the current paper. We investigate an efficient spectral method, which operates upon the sample Gram matrix with diagonal deletion. While this algorithmic idea has been studied before, we establish new statistical guarantees for this method in terms of both ℓ2 and ℓ2,∞ estimation accuracy, which improve upon prior results if d2 is substantially larger than d1. To illustrate the effectiveness of our findings, we derive matching minimax lower bounds with respect to the noise levels, and develop consequences of our general theory for three applications of practical importance: (1) tensor completion from noisy data, (2) covariance estimation/principal component analysis with missing data and (3) community recovery in bipartite graphs. Our theory leads to improved performance guarantees for all three cases.
AoS Other · 发表于 2021-04-01
Xiucai Ding, Fan Yang
摘要
We study a class of separable sample covariance matrices of the form Q˜1:=A˜1/2XB˜X∗A˜1/2. Here, A˜ and B˜ are positive definite matrices whose spectrums consist of bulk spectrums plus several spikes, that is, larger eigenvalues that are separated from the bulks. Conceptually, we call Q˜1 a spiked separable covariance matrix model. On the one hand, this model includes the spiked covariance matrix as a special case with B˜=I. On the other hand, it allows for more general correlations of datasets. In particular, for spatio-temporal dataset, A˜ and B˜ represent the spatial and temporal correlations, respectively. In this paper, we study the outlier eigenvalues and eigenvectors, that is, the principal components, of the spiked separable covariance model Q˜1. We prove the convergence of the outlier eigenvalues λ˜i and the generalized components (i.e., ⟨v,ξ˜i⟩ for any deterministic vector v) of the outlier eigenvectors ξ˜i with optimal convergence rates. Moreover, we also prove the delocalization of the nonoutlier eigenvectors. We state our results in full generality, in the sense that they also hold near the so-called BBP transition and for degenerate outliers. Our results highlight both the similarity and difference between the spiked separable covariance matrix model and the spiked covariance matrix model in (Probab. Theory Related Fields 164 (2016) 459–552). In particular, we show that the spikes of both A˜ and B˜ will cause outliers of the eigenvalue spectrum, and the eigenvectors can help to select the outliers that correspond to the spikes of A˜ (or B˜).
AoS Other · 发表于 2021-04-01
Bernard Delyon, François Portier
摘要
This paper investigates adaptive importance sampling algorithms for which the policy, the sequence of distributions used to generate the particles, is a mixture distribution between a flexible kernel density estimate (based on the previous particles), and a “safe” heavy-tailed density. When the share of samples generated according to the safe density goes to zero but not too quickly, two results are established: (i) uniform convergence rates are derived for the policy toward the target density; (ii) a central limit theorem is obtained for the resulting integral estimates. The fact that the asymptotic variance is the same as the variance of an “oracle” procedure with variance-optimal policy, illustrates the benefits of the approach. In addition, a subsampling step (among the particles) can be conducted before constructing the kernel estimate in order to decrease the computational effort without altering the performance of the method. The practical behavior of the algorithms is illustrated in a simulation study.
AoS Other · 发表于 2021-04-01
Federico Camerlenghi, Stefano Favaro, Zacharie Naulet, Francesca Panero
摘要
Protection against disclosure is a legal and ethical obligation for agencies releasing microdata files for public use. Consider a microdata sample of size n from a finite population of size n¯=n+λn, with λ>0, such that each sample record contains two disjoint types of information: identifying categorical information and sensitive information. Any decision about releasing data is supported by the estimation of measures of disclosure risk, which are defined as discrete functionals of the number of sample records with a unique combination of values of identifying variables. The most common measure is arguably the number τ1 of sample unique records that are population uniques. In this paper, we first study nonparametric estimation of τ1 under the Poisson abundance model for sample records. We introduce a class of linear estimators of τ1 that are simple, computationally efficient and scalable to massive datasets, and we give uniform theoretical guarantees for them. In particular, we show that they provably estimate τ1 all of the way up to the sampling fraction (λ+1)−1∝(logn)−1, with vanishing normalized mean-square error (NMSE) for large n. We then establish a lower bound for the minimax NMSE for the estimation of τ1, which allows us to show that: (i) (λ+1)−1∝(logn)−1 is the smallest possible sampling fraction for consistently estimating τ1; (ii) estimators’ NMSE is near optimal, in the sense of matching the minimax lower bound, for large n. This is the main result of our paper, and it provides a rigorous answer to an open question about the feasibility of nonparametric estimation of τ1 under the Poisson abundance model and for a sampling fraction (λ+1)−1<1/2.
AoS Testing & Uncertainty · 发表于 2021-04-01
Jelle J. Goeman, Jesse Hemerik, Aldo Solari
摘要
We consider the class of all multiple testing methods controlling tail probabilities of the false discovery proportion, either for one random set or simultaneously for many such sets. This class encompasses methods controlling familywise error rate, generalized familywise error rate, false discovery exceedance, joint error rate, simultaneous control of all false discovery proportions, and others, as well as gene set testing in genomics and cluster inference in neuroimaging. We show that all such methods are either equivalent to a closed testing procedure, or are uniformly improved by one. Moreover, we show that a closed testing method is admissible if and only if all its local tests are admissible. This implies that, when designing methods, it is sufficient to restrict attention to closed testing. We demonstrate the practical usefulness of this design principle by obtaining more informative inferences from the method of higher criticism, and by constructing a uniform improvement of a recently proposed method. *(abstract via OpenAlex)*
AoS Networks & Graphs · 发表于 2021-04-01
Jing Lei
摘要
Exchangeable random graphs serve as an important probabilistic framework for the statistical analysis of network data. In this work, we develop an alternative parameterization for a large class of exchangeable random graphs, where the nodes are independent random vectors in a linear space equipped with an indefinite inner product, and the edge probability between two nodes equals the inner product of the corresponding node vectors. Therefore, the distribution of exchangeable random graphs in this subclass can be represented by a node sampling distribution on this linear space, which we call the graph root distribution. We study existence and identifiability of such representations, the topological relationship between the graph root distribution and the exchangeable random graph sampling distribution and estimation of graph root distributions.
AoS High-Dimensional · 发表于 2021-04-01
Soumendra N. Lahiri
摘要
This paper investigates conditions for variable selection consistency of the LASSO in high dimensional regression models and gives necessary and sufficient conditions for the same, potentially allowing the model dimension p to grow arbitrarily fast as a function of the sample size n. These conditions require both upper and lower bounds on the growth rate of the penalty parameter. It turns out that a variant of the irrepresentable Condition (IRC) of (J. Mach. Learn. Res. 7 (2006) 2541–2563), herein called the lower irrepresentable Condition (or LIRC), is determined by the lower bound considerations while the upper bound considerations lead to a new condition, called the upper irrepresentable Condition (or UIRC) in this paper. It is shown that the LIRC together with the UIRC is necessary and sufficient for the variable selection consistency of the LASSO, thereby settling a conjecture of (J. Mach. Learn. Res. 7 (2006) 2541–2563). Further, it is shown that under some mild regularity conditions, the penalty parameter must necessarily tend to infinity at a certain minimal rate to ensure variable selection consistency of the LASSO and that the corresponding LASSO estimators of the nonzero regression parameters cannot be n-consistent (even for individual parameters). Thus, under fairly general conditions, the LASSO with a single choice of the penalty parameter cannot achieve both variable selection consistency and n-consistency simultaneously.
AoS Nonparametric & Semiparametric · 发表于 2021-04-01
Billy Fang, Adityanand Guntuboyina, Bodhisattva Sen
摘要
We consider the problem of nonparametric regression when the covariate is d dimensional, where d≥1. In this paper, we introduce and study two nonparametric least squares estimators (LSEs) in this setting—the entirely monotonic LSE and the constrained Hardy–Krause variation LSE. We show that these two LSEs are natural generalizations of univariate isotonic regression and univariate total variation denoising, respectively, to multiple dimensions. We discuss the characterization and computation of these two LSEs obtained from n data points. We provide a detailed study of their risk properties under the squared error loss and fixed uniform lattice design. We show that the finite sample risk of these LSEs is always bounded from above by n−2/3 modulo logarithmic factors depending on d; thus these nonparametric LSEs avoid the curse of dimensionality to some extent. We also prove nearly matching minimax lower bounds. Further, we illustrate that these LSEs are particularly useful in fitting rectangular piecewise constant functions. Specifically, we show that the risk of the entirely monotonic LSE is almost parametric (at most 1/n up to logarithmic factors) when the true function is well approximable by a rectangular piecewise constant entirely monotone function with not too many constant pieces. A similar result is also shown to hold for the constrained Hardy–Krause variation LSE for a simple subclass of rectangular piecewise constant functions. We believe that the proposed LSEs yield a novel approach to estimating multivariate functions using convex optimization that avoid the curse of dimensionality to some extent.
AoS High-Dimensional · 发表于 2021-04-01
Gabriel Chandler, Wolfgang Polonik
摘要
A method for extracting multiscale geometric features from a data cloud is proposed and analyzed. Based on geometric considerations, we map each pair of data points into a real-valued feature function defined on the unit interval. Further statistical analysis is then based on the collection of feature functions. The potential of the method is illustrated by different applications, including classification and anomaly detection. Connections to other concepts, such as random set theory, localized depth measures and nonlinear dimension reduction, are also explored.
AoS High-Dimensional Spatial & Time Series · 发表于 2021-04-01
Haoyang Liu, Chao Gao, Richard J. Samworth
摘要
We study the detection of a sparse change in a high-dimensional mean vector as a minimax testing problem. Our first main contribution is to derive the exact minimax testing rate across all parameter regimes for n independent, p-variate Gaussian observations. This rate exhibits a phase transition when the sparsity level is of order ploglog(8n) and has a very delicate dependence on the sample size: in a certain sparsity regime, it involves a triple iterated logarithmic factor in n. Further, in a dense asymptotic regime, we identify the sharp leading constant, while in the corresponding sparse asymptotic regime, this constant is determined to within a factor of 2. Extensions that cover spatial and temporal dependence, primarily in the dense case, are also provided.
AoS Optimization & Learning Theory · 发表于 2021-04-01
Jan-Christian Hütter, Philippe Rigollet
摘要
Brenier’s theorem is a cornerstone of optimal transport that guarantees the existence of an optimal transport map T between two probability distributions P and Q over Rd under certain regularity conditions. The main goal of this work is to establish the minimax estimation rates for such a transport map from data sampled from P and Q under additional smoothness assumptions on T. To achieve this goal, we develop an estimator based on the minimization of an empirical version of the semidual optimal transport problem, restricted to truncated wavelet expansions. This estimator is shown to achieve near minimax optimality using new stability arguments for the semidual and a complementary minimax lower bound. Furthermore, we provide numerical experiments on synthetic data supporting our theoretical findings and highlighting the practical benefits of smoothness regularization. These are the first minimax estimation rates for transport maps in general dimension. *(abstract via OpenAlex)*
AoS Machine Learning Networks & Graphs Nonparametric & Semiparametric · 发表于 2021-04-01
Behrooz Ghorbani, Song Mei, Theodor Misiakiewicz, Andrea Montanari
摘要
We consider the problem of learning an unknown function f⋆ on the d-dimensional sphere with respect to the square loss, given i.i.d. samples {(yi,xi)}i≤n where xi is a feature vector uniformly distributed on the sphere and yi=f⋆(xi)+εi. We study two popular classes of models that can be regarded as linearizations of two-layers neural networks around a random initialization: the random features model of Rahimi–Recht (RF); the neural tangent model of Jacot–Gabriel–Hongler (NT). Both these models can also be regarded as randomized approximations of kernel ridge regression (with respect to different kernels), and enjoy universal approximation properties when the number of neurons N diverges, for a fixed dimension d. We consider two specific regimes: the infinite-sample finite-width regime, in which n=∞ while d and N are large but finite, and the infinite-width finite-sample regime in which N=∞ while d and n are large but finite. In the first regime, we prove that if dℓ+δ≤N≤dℓ+1−δ for small δ>0, then RF effectively fits a degree-ℓ polynomial in the raw features, and NT fits a degree-(ℓ+1) polynomial. In the second regime, both RF and NT reduce to kernel methods with rotationally invariant kernels. We prove that, if the sample size satisfies dℓ+δ≤n≤dℓ+1−δ, then kernel methods can fit at most a degree-ℓ polynomial in the raw features. This lower bound is achieved by kernel ridge regression, and near-optimal prediction error is achieved for vanishing ridge regularization.
AoS Nonparametric & Semiparametric High-Dimensional · 发表于 2021-04-01
Min Xu, Richard J. Samworth
摘要
We tackle the problem of high-dimensional nonparametric density estimation by taking the class of log-concave densities on Rp and incorporating within it symmetry assumptions, which facilitate scalable estimation algorithms and can mitigate the curse of dimensionality. Our main symmetry assumption is that the super-level sets of the density are K-homothetic (i.e., scalar multiples of a convex body K⊆Rp). When K is known, we prove that the K-homothetic log-concave maximum likelihood estimator based on n independent observations from such a density achieves the minimax optimal rate of convergence with respect to, for example, squared Hellinger loss, of order n−4/5, independent of p. Moreover, we show that the estimator is adaptive in the sense that if the data generating density admits a special form, then a nearly parametric rate may be attained. We also provide worst case and adaptive risk bounds in cases where K is only known up to a positive definite transformation, and where it is completely unknown and must be estimated nonparametrically. Our estimation algorithms are fast even when n and p are on the order of hundreds of thousands, and we illustrate the strong finite-sample performance of our methods on simulated data.
AoS Other · 发表于 2021-04-01
James A. Duffy, Ioannis Kasparis
摘要
We provide new limit theory for functionals of a general class of processes lying at the boundary between stationarity and nonstationarity—what we term weakly nonstationary processes (WNPs). This includes, as leading examples, fractional processes with d=1/2, and arrays of autoregressive processes with roots drifting slowly towards unity. We first apply the theory to study inference in parametric and nonparametric regression models involving WNPs as covariates. We then use these results to develop a new specification test for parametric regression models. By construction, our specification test statistic has a χ2 limiting distribution regardless of the form and extent of persistence of the regressor, implying that a practitioner can validly perform the test using a fixed critical value, while remaining agnostic about the mechanism generating the regressor. Simulation exercises confirm that the test controls size across a wide range of data generating processes, and outperforms a comparable test due to Wang and Phillips (Ann. Statist. 40 (2012) 727–758) against many alternatives.
AoS Other · 发表于 2021-04-01
Laurent Davezies, Xavier D’Haultfœuille, Yannick Guyonvarch
摘要
Exchangeable arrays are natural tools to model common forms of dependence between units of a sample. Jointly exchangeable arrays are well suited to dyadic data, where observed random variables are indexed by two units from the same population. Examples include trade flows between countries or relationships in a network. Separately exchangeable arrays are well suited to multiway clustering, where units sharing the same cluster (e.g., geographical areas or sectors of activity when considering individual wages) may be dependent in an unrestricted way. We prove uniform laws of large numbers and central limit theorems for such exchangeable arrays. We obtain these results under the same moment restrictions and conditions on the class of functions as those typically assumed with i.i.d. data. We also show the convergence of bootstrap processes adapted to such arrays.
AoS Nonparametric & Semiparametric · 发表于 2021-04-01
Marc Hallin, Eustasio del Barrio, Juan Cuesta-Albertos, Carlos Matrán
摘要
Unlike the real line, the real space Rd, for d≥2, is not canonically ordered. As a consequence, such fundamental univariate concepts as quantile and distribution functions and their empirical counterparts, involving ranks and signs, do not canonically extend to the multivariate context. Palliating that lack of a canonical ordering has been an open problem for more than half a century, generating an abundant literature and motivating, among others, the development of statistical depth and copula-based methods. We show that, unlike the many definitions proposed in the literature, the measure transportation-based ranks and signs introduced in Chernozhukov, Galichon, Hallin and Henry (Ann. Statist. 45 (2017) 223–256) enjoy all the properties that make univariate ranks a successful tool for semiparametric inference. Related with those ranks, we propose a new center-outward definition of multivariate distribution and quantile functions, along with their empirical counterparts, for which we establish a Glivenko–Cantelli result. Our approach is based on McCann (Duke Math. J. 80 (1995) 309–323) and our results do not require any moment assumptions. The resulting ranks and signs are shown to be strictly distribution-free and essentially maximal ancillary in the sense of Basu (Sankhyā 21 (1959) 247–256) which, in semiparametric models involving noise with unspecified density, can be interpreted as a finite-sample form of semiparametric efficiency. Although constituting a sufficient summary of the sample, empirical center-outward distribution functions are defined at observed values only. A continuous extension to the entire d-dimensional space, yielding smooth empirical quantile contours and sign curves while preserving the essential monotonicity and Glivenko–Cantelli features of the concept, is provided. A numerical study of the resulting empirical quantile contours is conducted.
AoS Meta-Analysis & Data Integration Testing & Uncertainty · 发表于 2021-04-01
Edgar Dobriban, Yue Sheng
摘要
Distributed statistical learning problems arise commonly when dealing with large datasets. In this setup, datasets are partitioned over machines, which compute locally, and communicate short messages. Communication is often the bottleneck. In this paper, we study one-step and iterative weighted parameter averaging in statistical linear models under data parallelism. We do linear regression on each machine, send the results to a central server and take a weighted average of the parameters. Optionally, we iterate, sending back the weighted average and doing local ridge regressions centered at it. How does this work compared to doing linear regression on the full data? Here, we study the performance loss in estimation and test error, and confidence interval length in high dimensions, where the number of parameters is comparable to the training data size. We find the performance loss in one-step weighted averaging, and also give results for iterative averaging. We also find that different problems are affected differently by the distributed framework. Estimation error and confidence interval length increases a lot, while prediction error increases much less. We rely on recent results from random matrix theory, where we develop a new calculus of deterministic equivalents as a tool of broader interest.
AoS Missing Data & Measurement Error · 发表于 2021-04-01
Denis Belomestny, Alexander Goldenshluger
摘要
In this paper, we study the problem of density deconvolution under general assumptions on the measurement error distribution. Typically, deconvolution estimators are constructed using Fourier transform techniques, and it is assumed that the characteristic function of the measurement errors does not have zeros on the real line. This assumption is rather strong and is not fulfilled in many cases of interest. In this paper, we develop a methodology for constructing optimal density deconvolution estimators in the general setting that covers vanishing and nonvanishing characteristic functions of the measurement errors. We derive upper bounds on the risk of the proposed estimators and provide sufficient conditions under which zeros of the corresponding characteristic function have no effect on estimation accuracy. Moreover, we show that the derived conditions are also necessary in some specific problem instances.
AoS Causal Inference · 发表于 2021-04-01
Fredrik Sävje, Peter M. Aronow, Michael G. Hudgens
摘要
We investigate large-sample properties of treatment effect estimators under unknown interference in randomized experiments. The inferential target is a generalization of the average treatment effect estimand that marginalizes over potential spillover effects. We show that estimators commonly used to estimate treatment effects under no interference are consistent for the generalized estimand for several common experimental designs under limited but otherwise arbitrary and unknown interference. The rates of convergence depend on the growth rate of the unit-average amount of interference and the degree to which the interference aligns with dependencies in treatment assignment. Importantly for practitioners, the results imply that even if one erroneously assumes that units do not interfere in a setting with moderate interference, standard estimators are nevertheless likely to be close to an average treatment effect if the sample is sufficiently large. Conventional confidence statements may, however, not be accurate.
AoS Optimization & Learning Theory · 发表于 2021-04-01
Bernard Bercu, Jérémie Bigot
摘要
This paper is devoted to the stochastic approximation of entropically regularized Wasserstein distances between two probability measures, also known as Sinkhorn divergences. The semi-dual formulation of such regularized optimal transportation problems can be rewritten as a nonstrongly concave optimisation problem. It allows to implement a Robbins–Monro stochastic algorithm to estimate the Sinkhorn divergence using a sequence of data sampled from one of the two distributions. Our main contribution is to establish the almost sure convergence and the asymptotic normality of a new recursive estimator of the Sinkhorn divergence between two probability measures in the discrete and semi-discrete settings. We also study the rate of convergence of the expected excess risk of this estimator in the absence of strong concavity of the objective function. Numerical experiments on synthetic and real datasets are also provided to illustrate the usefulness of our approach for data analysis.
AoS Other · 发表于 2021-04-01
Daniel Nevo, Judith J. Lok, Donna Spiegelman
摘要
In Learn-As-you-GO (LAGO) adaptive studies, the intervention is a complex multicomponent package, and is adapted in stages during the study based on past outcome data. This design formalizes standard practice in public health intervention studies. An effective intervention package is sought, while minimizing intervention package cost. In LAGO study data, the interventions in later stages depend upon the outcomes in the previous stages, violating standard statistical theory. We develop an estimator for the intervention effects, and prove consistency and asymptotic normality using a novel coupling argument, ensuring the validity of the test for the hypothesis of no overall intervention effect. We develop a confidence set for the optimal intervention package and confidence bands for the success probabilities under alternative package compositions. We illustrate our methods in the BetterBirth Study, which aimed to improve maternal and neonatal outcomes among 157,689 births in Uttar Pradesh, India through a multicomponent intervention package.
SiM Other · 发表于 2021-03-31
Qi Zhang, Feifei Chen, Shunyao Wu, Hua Liang
摘要
We evaluate the validity of a projection‐based test checking linear models when the number of covariates tends to infinity, and analyze two gene expression datasets. We show that the test is still consistent and derive the asymptotic distributions under the null and alternative hypotheses. The asymptotic properties are almost the same as those when the number of covariates is fixed as long as p/n → 0 with additional mild assumptions. The test dramatically gains dimension reduction, and its numerical performance is remarkable.
Biometrics High-Dimensional · 发表于 2021-03-30
Sandra E. Safo, Eun Jeong Min, Lillian Haine
摘要
Classification methods that leverage the strengths of data from multiple sources (multiview data) simultaneously have enormous potential to yield more powerful findings than two‐step methods: association followed by classification. We propose two methods, sparse integrative discriminant analysis (SIDA), and SIDA with incorporation of network information (SIDANet), for joint association and classification studies. The methods consider the overall association between multiview data, and the separation within each view in choosing discriminant vectors that are associated and optimally separate subjects into different classes. SIDANet is among the first methods to incorporate prior structural information in joint association and classification studies. It uses the normalized Laplacian of a graph to smooth coefficients of predictor variables, thus encouraging selection of predictors that are connected. We demonstrate the effectiveness of our methods on a set of synthetic datasets and explore their use in identifying potential nontraditional risk factors that discriminate healthy patients at low versus high risk for developing atherosclerosis cardiovascular disease in 10 years. Our findings underscore the benefit of joint association and classification methods if the goal is to correlate multiview data and to perform classification.
Biometrics Genetics & Omics Econometrics & Economics · 发表于 2021-03-30
Zhen Yang, Yen‐Yi Ho
摘要
Interactions between biological molecules in a cell are tightly coordinated and often highly dynamic. As a result of these varying signaling activities, changes in gene coexpression patterns could often be observed. The advancements in next‐generation sequencing technologies bring new statistical challenges for studying these dynamic changes of gene coexpression. In recent years, methods have been developed to examine genomic information from individual cells. Single‐cell RNA sequencing (scRNA‐seq) data are count‐based, and often exhibit characteristics such as overdispersion and zero inflation. To explore the dynamic dependence structure in scRNA‐seq data and other zero‐inflated count data, new approaches are needed. In this paper, we consider overdispersion and zero inflation in count outcomes and propose a ZEro‐inflated negative binomial dynamic COrrelation model (ZENCO). The observed count data are modeled as a mixture of two components: success amplifications and dropout events in ZENCO. A latent variable is incorporated into ZENCO to model the covariate‐dependent correlation structure. We conduct simulation studies to evaluate the performance of our proposed method and to compare it with existing approaches. We also illustrate the implementation of our proposed approach using scRNA‐seq data from a study of minimal residual disease in melanoma.
Biometrika Genetics & Omics High-Dimensional · 发表于 2021-03-30
Pixu Shi, Yuchen Zhou, Anru R Zhang
摘要
Summary: In microbiome and genomic studies, the regression of compositional data has been a crucial tool for identifying microbial taxa or genes that are associated with clinical phenotypes. To account for the variation in sequencing depth, the classic log-contrast model is often used where read counts are normalized into compositions. However, zero read counts and the randomness in covariates remain critical issues. We introduce a surprisingly simple, interpretable and efficient method for the estimation of compositional data regression through the lens of a novel high-dimensional log-error-in-variable regression model. The proposed method provides corrections on sequencing data with possible overdispersion and simultaneously avoids any subjective imputation of zero read counts. We provide theoretical justifications with matching upper and lower bounds for the estimation error. The merit of the procedure is illustrated through real data analysis and simulation studies.
Biometrika Other · 发表于 2021-03-30
Ye Tian, Hongquan Xu
摘要
Summary: Space-filling designs are widely used in computer experiments. Inspired by the stratified orthogonality of strong orthogonal arrays, we propose a criterion of minimum aberration-type for assessing the space-filling properties of designs based on design stratification properties on various grids. A space-filling hierarchy principle is proposed as a basic assumption of the criterion. The new criterion provides a systematic way of classifying and ranking space-filling designs, including various types of strong orthogonal arrays and Latin hypercube designs. Theoretical results and examples are presented to show that strong orthogonal arrays of maximum strength are favourable under the proposed criterion. For strong orthogonal arrays of the same strength, the space-filling criterion can further rank them based on their space-filling patterns.
SiM Spatial & Time Series Bayesian Methods · 发表于 2021-03-29
Dipankar Bandyopadhyay, Marcos O. Prates, Xiaoyue Zhao, Victor H. Lachos
摘要
Clinical studies on periodontal disease (PD) often lead to data collected which are clustered in nature (viz. clinical attachment level, or CAL, measured at tooth‐sites and clustered within subjects) that are routinely analyzed under a linear mixed model framework, with underlying normality assumptions of the random effects and random errors. However, a careful look reveals that these data might exhibit skewness and tail behavior, and hence the usual normality assumptions might be questionable. Besides, PD progression is often hypothesized to be spatially associated, that is, a diseased tooth‐site may influence the disease status of a set of neighboring sites. Also, the presence/absence of a tooth is informative, as the number and location of missing teeth informs about the periodontal health in that region. In this paper, we develop a (shared) random effects model for site‐level CAL and binary presence/absence status of a tooth under a Bayesian paradigm. The random effects are modeled using a spatial skew‐normal/independent (S‐SNI) distribution, whose dependence structure is conditionally autoregressive (CAR). Our S‐SNI density presents an attractive parametric tool to model spatially referenced asymmetric thick‐tailed structures. Both simulation studies and application to a clinical dataset recording PD status reveal the advantages of our proposition in providing a significantly improved fit, over models that do not consider these features in a unified way.
SiM Survival Analysis Nonparametric & Semiparametric · 发表于 2021-03-29
Qingning Zhou, Jianwen Cai, Haibo Zhou
摘要
Interval‐censored failure time data commonly arise in epidemiological and biomedical studies where the occurrence of an event or a disease is determined via periodic examinations. Subject to interval‐censoring, available information on the failure time can be quite limited. Cost‐effective sampling designs are desirable to enhance the study power, especially when the disease rate is low and the covariates are expensive to obtain. In this work, we formulate the case‐cohort design with multiple interval‐censored disease outcomes and also generalize it to nonrare diseases where only a portion of diseased subjects are sampled. We develop a marginal sieve weighted likelihood approach, which assumes that the failure times marginally follow the proportional hazards model. We consider two types of weights to account for the sampling bias, and adopt a sieve method with Bernstein polynomials to handle the unknown baseline functions. We employ a weighted bootstrap procedure to obtain a variance estimate that is robust to the dependence structure between failure times. The proposed method is examined via simulation studies and illustrated with a dataset on incident diabetes and hypertension from the Atherosclerosis Risk in Communities study.
SiM Bayesian Methods Optimization & Learning Theory · 发表于 2021-03-29
Nicolás M. Ballarini, Thomas Burnett, Thomas Jaki, Christoper Jennison, Franz König, Martin Posch
摘要
We design two‐stage confirmatory clinical trials that use adaptation to find the subgroup of patients who will benefit from a new treatment, testing for a treatment effect in each of two disjoint subgroups. Our proposal allows aspects of the trial, such as recruitment probabilities of each group, to be altered at an interim analysis. We use the conditional error rate approach to implement these adaptations with protection of overall error rates. Applying a Bayesian decision‐theoretic framework, we optimize design parameters by maximizing a utility function that takes the population prevalence of the subgroups into account. We show results for traditional trials with familywise error rate control (using a closed testing procedure) as well as for umbrella trials in which only the per‐comparison type 1 error rate is controlled. We present numerical examples to illustrate the optimization process and the effectiveness of the proposed designs.
SMMR Diagnostics & Prediction · 发表于 2021-03-29
Gianfranco Adimari, Duc-Khanh To, Monica Chiogna
摘要
We comment here on a recent paper in this journal, on a non-monotone transformation of biomarkers aimed at improving diagnostic accuracy. We highlight that, in a binary classification problem, the proposed transformation finds its motivation in the Neyman–Pearson lemma, so that the underlying approach is very general and it is applicable to many parametric families, other than the normal one.
SiM Causal Inference Clinical Trials · 发表于 2021-03-29
Alexander Breskin, Stephen R. Cole, Jessie K. Edwards, Ron Brookmeyer, Joseph J. Eron, Adimora A. Adimora
摘要
While randomized trials remain the best evidence for treatment effectiveness, lack of generalizability often remains an important concern. Additionally, when new treatments are compared against existing standards of care, the potentially small benefit of the new treatment may be difficult to detect in a trial without extremely large sample sizes and long follow‐up times. Recent advances in “data fusion” provide a framework to combine results across studies that are applicable to a given population of interest and allow treatment comparisons that may not be feasible with traditional study designs. We propose a data fusion‐based estimator that can be used to combine information from two studies: (1) a study comparing a new treatment to the standard of care in the local population of interest, and (2) a study comparing the standard of care to placebo in a separate, distal population. We provide conditions under which the parameter of interest can be identified from the two studies described and explore properties of the estimator through simulation. Finally, we apply the estimator to estimate the effect of triple‐ vs monotherapy for the treatment of HIV using data from two randomized trials. The proposed estimator can account for underlying population structures that induce differences in case mix, adherence, and outcome prevalence between the local and distal populations, and the estimator can also account for potentially informative loss to follow‐up. Approaches like those detailed here are increasingly important to speed the approval and adoption of effective new therapies by leveraging multiple sources of information.
JASA Bayesian Methods Functional Data High-Dimensional · 发表于 2021-03-29
James Matuk, Karthik Bharath, Oksana Chkrebtii, Sebastian Kurtek
摘要
In many applications, smooth processes generate data that is recorded under a variety of observational regimes, including dense sampling and sparse or fragmented observations that are often contaminated with error. The statistical goal of registering and estimating the individual underlying functions from discrete observations has thus far been mainly approached sequentially without formal uncertainty propagation, or in an application-specific manner by pooling information across subjects. We propose a unified Bayesian framework for simultaneous registration and estimation, which is flexible enough to accommodate inference on individual functions under general observational regimes. Our ability to do this relies on the specification of strongly informative prior models over the amplitude component of function variability using two strategies: a data-driven approach that defines an empirical basis for the amplitude subspace based on training data, and a shape-restricted approach when the relative location and number of extrema is well-understood. The proposed methods build on the elastic functional data analysis framework to separately model amplitude and phase variability inherent in functional data. We emphasize the importance of uncertainty quantification and visualization of these two components as they provide complementary information about the estimated functions. We validate the proposed framework using multiple simulation studies and real applications. *(abstract via PubMed)*
Biometrics Survival Analysis Nonparametric & Semiparametric Diagnostics & Prediction · 发表于 2021-03-26
Bo Han, Ingrid Van Keilegom, Xiaoguang Wang
摘要
With rapidly increasing data sources, statistical methods that make use of external information are gradually becoming popular tools in medical research. In this article, we efficiently synthesize the auxiliary survival information and propose a semiparametric estimation method for the combined empirical likelihood in the framework of the nonmixture cure model, to enhance inference about the associations between exposures and disease outcomes. The auxiliary survival probabilities from external sources are first summarized as unbiased estimation equations, which help produce more efficient estimates of the effects of interest and improve the prediction accuracy for the risk of the event. Then we develop a Bernstein‐based sieve empirical likelihood method to estimate the parametric and nonparametric components simultaneously. Such an estimation procedure allows us to reduce the computation burden while preserving the shape constraint on the baseline distribution function. The resulting estimators for the true associations are strongly consistent and asymptotically normal. Instead of collecting substantial exposure data, the auxiliary survival information at multiple time points is incorporated, which further reduces the mean squared error of the estimators. This contributes to biomarker evaluation and treatment effect analysis within smaller studies. We show how to choose the number of auxiliary survival probabilities appropriately and provide a guideline for practical applications. Simulation studies demonstrate that the estimators enjoy large gains in efficiency. A melanoma dataset is analyzed for illustrating the methodology.
SiM Longitudinal Data Latent Variables & Mixtures Genetics & Omics · 发表于 2021-03-26
Mitra Ebrahimpoor, Pietro Spitali, Jelle J. Goeman, Roula Tsonaka
摘要
We propose a top‐down approach for pathway analysis of longitudinal metabolite data. We apply a score test based on a shared latent process mixed model which can identify pathways with differentially progressing metabolites. The strength of our approach is that it can handle unbalanced designs, deals with potential missing values in the longitudinal markers, and gives valid results even with small sample sizes. Contrary to bottom‐up approaches, correlations between metabolites are explicitly modeled leveraging power gains. For large pathway sizes, a computationally efficient solution is proposed based on pseudo‐likelihood methodology. We demonstrate the advantages of the proposed method in identification of differentially expressed pathways through simulation studies. Finally, longitudinal metabolite data from a mice experiment is analyzed to demonstrate our methodology.
SiM Diagnostics & Prediction Survival Analysis · 发表于 2021-03-26
Joie Ensor, Kym I. E. Snell, Thomas P. A. Debray, Paul C. Lambert, Maxime P. Look, Mamas A. Mamas, Karel G. M. Moons, Richard D. Riley
摘要
Individual participant data (IPD) from multiple sources allows external validation of a prognostic model across multiple populations. Often this reveals poor calibration, potentially causing poor predictive performance in some populations. However, rather than discarding the model outright, it may be possible to modify the model to improve performance using recalibration techniques. We use IPD meta‐analysis to identify the simplest method to achieve good model performance. We examine four options for recalibrating an existing time‐to‐event model across multiple populations: (i) shifting the baseline hazard by a constant, (ii) re‐estimating the shape of the baseline hazard, (iii) adjusting the prognostic index as a whole, and (iv) adjusting individual predictor effects. For each strategy, IPD meta‐analysis examines (heterogeneity in) model performance across populations. Additionally, the probability of achieving good performance in a new population can be calculated allowing ranking of recalibration methods. In an applied example, IPD meta‐analysis reveals that the existing model had poor calibration in some populations, and large heterogeneity across populations. However, re‐estimation of the intercept substantially improved the expected calibration in new populations, and reduced between‐population heterogeneity. Comparing recalibration strategies showed that re‐estimating both the magnitude and shape of the baseline hazard gave the highest predicted probability of good performance in a new population. In conclusion, IPD meta‐analysis allows a prognostic model to be externally validated in multiple settings, and enables recalibration strategies to be compared and ranked to decide on the least aggressive recalibration strategy to achieve acceptable external model performance without discarding existing model information.
SiM Clinical Trials Diagnostics & Prediction Bayesian Methods · 发表于 2021-03-26
Daniel Kang, Christopher S Coffey, Brian J Smith, Ying Yuan, Qian Shi, Jun Yin
摘要
Given the Food and Drug Administration's (FDA's) acceptance of master protocol designs in recent guidance documents, the oncology field is rapidly moving to address the paradigm shift to molecular subtype focused studies. Identifying new “marker‐based” treatments requires new methodologies to address the growing demand to conduct clinical trials in smaller molecular subpopulations, identify effective treatment and marker interactions, and control for false positives. We introduce our methodology, Hierarchical Bayesian Clustering Design of Multiple Biomarker Subgroups (HCOMBS), a two‐stage umbrella Phase II design with effect size clustering and information borrowing across multiple biomarker‐treatment pairs. HCOMBS was designed to reduce required sample size, differentiate between varying effect sizes, and control for operating characteristics in the multi‐arm setting. When compared to independently applied Simon's Optimal two‐stage design, we showed through simulations that HCOMBS required less participants per treatment arm with a well‐controlled family‐wise error rate and desirable marginal power. Additionally, HCOMBS features a statistical approach that simultaneously conducts clustering and hypothesis testing in one step. We also applied the proposed design on the alliance brain metastases umbrella trial.
JASA Nonparametric & Semiparametric Longitudinal Data · 发表于 2021-03-25
Paolo Frumento, Matteo Bottai, Iván Fernández-Val
摘要
In ordinary quantile regression, quantiles of different order are estimated one at a time. An alternative approach, which is referred to as quantile regression coefficients modeling (qrcm), is to model quantile regression coefficients as parametric functions of the order of the quantile. In this article, we describe how the qrcm paradigm can be applied to longitudinal data. We introduce a two-level quantile function, in which two different quantile regression models are used to describe the (conditional) distribution of the within-subject response and that of the individual effects. We propose a novel type of penalized fixed-effects estimator, and discuss its advantages over standard methods based on l1 and l2 penalization. We provide model identifiability conditions, derive asymptotic properties, describe goodness-of-fit measures and model selection criteria, present simulation results, and discuss an application. The proposed method has been implemented in the R package qrcm. *(abstract via OpenAlex)*
SiM Genetics & Omics Meta-Analysis & Data Integration · 发表于 2021-03-25
Hyunwook Koh, Susan Tuddenham, Cynthia L Sears, Ni Zhao
摘要
Meta‐analysis is a practical and powerful analytic tool that enables a unified statistical inference across the results from multiple studies. Notably, researchers often report the results on multiple related markers in each study (eg, various α‐diversity indices in microbiome studies). However, univariate meta‐analyses are limited to combining the results on a single common marker at a time, whereas existing multivariate meta‐analyses are limited to the situations where marker‐by‐marker correlations are given in each study. Thus, here we introduce two meta‐analysis methods, multi‐marker meta‐analysis (mMeta) and adaptive multi‐marker meta‐analysis (aMeta), to combine multiple studies throughout multiple related markers with no priori results on marker‐by‐marker correlations. mMeta is a statistical estimator for a pooled estimate and its SE across all the studies and markers, whereas aMeta is a statistical test based on the test statistic of the minimum P‐value among marker‐specific meta‐analyses. mMeta conducts both effect estimation and hypothesis testing based on a weighted average of marker‐specific pooled estimates while estimating marker‐by‐marker correlations non‐parametrically via permutations, yet its power is only moderate. In contrast, aMeta closely approaches the highest power among marker‐specific meta‐analyses, yet it is limited to hypothesis testing. While their applications can be broader, we illustrate the use of mMeta and aMeta to combine microbiome studies throughout multiple α‐diversity indices. We evaluate mMeta and aMeta in silico and apply them to real microbiome studies on the disparity in α‐diversity by the status of human immunodeficiency virus (HIV) infection. The R package for mMeta and aMeta is freely available at https://github.com/hk1785/mMeta.
JASA Networks & Graphs · 发表于 2021-03-25
Jingnan Zhang, Xin He, Junhui Wang
摘要
Community detection in network data aims at grouping similar nodes sharing certain characteristics together. Most existing methods focus on detecting communities in undirected networks, where similarity between nodes is measured by their node features and whether they are connected. In this article, we propose a novel method to conduct network embedding and community detection simultaneously in a directed network. The network embedding model introduces two sets of vectors to represent the out- and in-nodes separately, and thus allows the same nodes belong to different out- and in-communities. The community detection formulation equips the negative log-likelihood with a novel regularization term to encourage community structure among the nodes representations, and thus achieves better performance by jointly estimating the nodes embeddings and their community structures. To tackle the resultant optimization task, an efficient alternative updating scheme is developed. More importantly, the asymptotic properties of the proposed method are established in terms of both network embedding and community detection, which are also supported by numerical experiments on some simulated and real examples. *(abstract via OpenAlex)*