2021 年的期刊文章 · 第 28 页

共 1542 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2021-02-01 到 2021-01-19。

按期刊、按主题看 →

第 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 34 35 36 37 38 39 页

AoS High-Dimensional · 发表于 2021-02-01

Concordance and value information criteria for optimal treatment decision

Chengchun Shi, Rui Song, Wenbin Lu

摘要

Personalized medicine is a medical procedure that receives considerable scientific and commercial attention. The goal of personalized medicine is to assign the optimal treatment regime for each individual patient, according to his/her personal prognostic information. When there are a large number of pretreatment variables, it is crucial to identify those important variables that are necessary for treatment decision making. In this paper, we study two information criteria: the concordance and value information criteria, for variable selection in optimal treatment decision making. We consider both fixed-$p$ and high dimensional settings, and show our information criteria are consistent in model/tuning parameter selection. We further apply our information criteria to four estimation approaches, including robust learning, concordance-assisted learning, penalized A-learning and sparse concordance-assisted learning, and demonstrate the empirical performance of our methods by simulations.

AoS Nonparametric & Semiparametric Latent Variables & Mixtures · 发表于 2021-02-01

Concentration of kernel matrices with application to kernel spectral clustering

Arash A. Amini, Zahra S. Razaee

摘要

We study the concentration of random kernel matrices around their mean. We derive nonasymptotic exponential concentration inequalities for Lipschitz kernels assuming that the data points are independent draws from a class of multivariate distributions on $\mathbb{R}^{d}$, including the strongly log-concave distributions under affine transformations. A feature of our result is that the data points need not have identical distributions or zero mean, which is key in certain applications such as clustering. Our bound for the Lipschitz kernels is dimension-free and sharp up to constants. For comparison, we also derive the companion result for the Euclidean (inner product) kernel for a class of sub-Gaussian distributions. A notable difference between the two cases is that, in contrast to the Euclidean kernel, in the Lipschitz case, the concentration inequality does not depend on the mean of the underlying vectors. As an application of these inequalities, we derive a bound on the misclassification rate of a kernel spectral clustering (KSC) algorithm, under a perturbed nonparametric mixture model. We show an example where this bound establishes the high-dimensional consistency (as $d\to \infty $) of the KSC, when applied with a Gaussian kernel, to a noisy model of nested nonlinear manifolds.

AoS Survey & Sampling · 发表于 2021-02-01

Complex sampling designs: Uniform limit theorems and applications

Qiyang Han, Jon A. Wellner

摘要

In this paper, we develop a general approach to proving global and local uniform limit theorems for the Horvitz–Thompson empirical process arising from complex sampling designs. Global theorems such as Glivenko–Cantelli and Donsker theorems, and local theorems such as local asymptotic modulus and related ratio-type limit theorems are proved for both the Horvitz–Thompson empirical process, and its calibrated version. Limit theorems of other variants and their conditional versions are also established. Our approach reveals an interesting feature: the problem of deriving uniform limit theorems for the Horvitz–Thompson empirical process is essentially no harder than the problem of establishing the corresponding finite-dimensional limit theorems, once the usual complexity conditions on the function class are satisfied. These global and local uniform limit theorems are then applied to important statistical problems including (i) $M$-estimation, (ii) $Z$-estimation and (iii) frequentist theory of pseudo-Bayes procedures, all with weighted likelihood, to illustrate their wide applicability.

SMMR Diagnostics & Prediction · 发表于 2021-02-01

Combining multiple biomarkers to linearly maximize the diagnostic accuracy under ordered multi-class setting

Jia Hua, Lili Tian

摘要

Either in clinical study or biomedical research, it is a common practice to combine multiple biomarkers to improve the overall diagnostic performance. Despite the fact there exist a large number of statistical methods for biomarker combination under binary classification, research on this topic under multi-class setting is sparse. The overall diagnostic accuracy, i.e. the sum of correct classification rates, directly measures the classification accuracy of the combined biomarkers. Hence the overall accuracy can serve as an important objective function for biomarker combination, especially when the combined biomarkers are used for the purpose of making medical diagnosis. In this paper, we address the problem of combining multiple biomarkers to directly maximize the overall diagnostic accuracy by presenting several grid search methods and derivation-based methods. A comprehensive simulation study was conducted to compare the performances of these methods. An ovarian cancer data set is analyzed in the end.

AoS Other · 发表于 2021-02-01

Classification accuracy as a proxy for two-sample testing

Ilmun Kim, Aaditya Ramdas, Aarti Singh, Larry Wasserman

摘要

When data analysts train a classifier and check if its accuracy is significantly different from chance, they are implicitly performing a two-sample test. We investigate the statistical properties of this flexible approach in the high-dimensional setting. We prove two results that hold for all classifiers in any dimensions: if its true error remains $\epsilon $-better than chance for some $\epsilon >0$ as $d,n\to \infty $, then (a) the permutation-based test is consistent (has power approaching to one), (b) a computationally efficient test based on a Gaussian approximation of the null distribution is also consistent. To get a finer understanding of the rates of consistency, we study a specialized setting of distinguishing Gaussians with mean-difference $\delta $ and common (known or unknown) covariance $\Sigma $, when $d/n\to c\in (0,\infty )$. We study variants of Fisher’s linear discriminant analysis (LDA) such as “naive Bayes” in a nontrivial regime when $\epsilon \to 0$ (the Bayes classifier has true accuracy approaching 1/2), and contrast their power with corresponding variants of Hotelling’s test. Surprisingly, the expressions for their power match exactly in terms of $n$, $d$, $\delta $, $\Sigma $, and the LDA approach is only worse by a constant factor, achieving an asymptotic relative efficiency (ARE) of $1/\sqrt{\pi }$ for balanced samples. We also extend our results to high-dimensional elliptical distributions with finite kurtosis. Other results of independent interest include minimax lower bounds, and the optimality of Hotelling’s test when $d=o(n)$. Simulation results validate our theory, and we present practical takeaway messages along with natural open problems.

AoS Spatial & Time Series · 发表于 2021-02-01

Asymptotics for spherical functional autoregressions

Alessia Caponera, Domenico Marinucci

摘要

In this paper, we investigate a class of spherical functional autoregressive processes, and we discuss the estimation of the corresponding autoregressive kernels. In particular, we first establish a consistency result (in mean-square and sup norm), then a quantitative central limit theorem (in Wasserstein distance), and finally a weak convergence result, under more restrictive regularity conditions. Our results are validated by a small numerical investigation.

AoS High-Dimensional Testing & Uncertainty · 发表于 2021-02-01

Asymptotically independent U-statistics in high-dimensional testing

Yinqiu He, Gongjun Xu, Chong Wu, Wei Pan

摘要

Many high-dimensional hypothesis tests aim to globally examine marginal or low-dimensional features of a high-dimensional joint distribution, such as testing of mean vectors, covariance matrices and regression coefficients. This paper constructs a family of U-statistics as unbiased estimators of the $\ell_{p}$-norms of those features. We show that under the null hypothesis, the U-statistics of different finite orders are asymptotically independent and normally distributed. Moreover, they are also asymptotically independent with the maximum-type test statistic, whose limiting distribution is an extreme value distribution. Based on the asymptotic independence property, we propose an adaptive testing procedure which combines $p$-values computed from the U-statistics of different orders. We further establish power analysis results and show that the proposed adaptive procedure maintains high power against various alternatives.

AoS Optimization & Learning Theory · 发表于 2021-02-01

Asymptotic optimality in stochastic optimization

John C. Duchi, Feng Ruan

摘要

We study local complexity measures for stochastic convex optimization problems, providing a local minimax theory analogous to that of Hájek and Le Cam for classical statistical problems. We give complementary optimality results, developing fully online methods that adaptively achieve optimal convergence guarantees. Our results provide function-specific lower bounds and convergence results that make precise a correspondence between statistical difficulty and the geometric notion of tilt-stability from optimization. As part of this development, we show how variants of Nesterov’s dual averaging—a stochastic gradient-based procedure—guarantee finite time identification of constraints in optimization problems, while stochastic gradient procedures fail. Additionally, we highlight a gap between problems with linear and nonlinear constraints: standard stochastic-gradient-based procedures are suboptimal even for the simplest nonlinear constraints, necessitating the development of asymptotically optimal Riemannian stochastic gradient methods.

AoS Other · 发表于 2021-02-01

Asymmetry helps: Eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices

Yuxin Chen, Chen Cheng, Jianqing Fan

摘要

This paper is concerned with the interplay between statistical asymmetry and spectral methods. Suppose we are interested in estimating a rank-1 and symmetric matrix $\boldsymbol{M}^{\star }\in \mathbb{R}^{n\times n}$, yet only a randomly perturbed version $\boldsymbol{M}$ is observed. The noise matrix $\boldsymbol{M}-\boldsymbol{M}^{\star }$ is composed of independent (but not necessarily homoscedastic) entries and is, therefore, not symmetric in general. This might arise if, for example, when we have two independent samples for each entry of $\boldsymbol{M}^{\star }$ and arrange them in an asymmetric fashion. The aim is to estimate the leading eigenvalue and the leading eigenvector of $\boldsymbol{M}^{\star }$. We demonstrate that the leading eigenvalue of the data matrix $\boldsymbol{M}$ can be $O(\sqrt{n})$ times more accurate (up to some log factor) than its (unadjusted) leading singular value of $\boldsymbol{M}$ in eigenvalue estimation. Moreover, the eigen-decomposition approach is fully adaptive to heteroscedasticity of noise, without the need of any prior knowledge about the noise distributions. In a nutshell, this curious phenomenon arises since the statistical asymmetry automatically mitigates the bias of the eigenvalue approach, thus eliminating the need of careful bias correction. Additionally, we develop appealing nonasymptotic eigenvector perturbation bounds; in particular, we are able to bound the perturbation of any linear function of the leading eigenvector of $\boldsymbol{M}$ (e.g., entrywise eigenvector perturbation). We also provide partial theory for the more general rank-$r$ case. The takeaway message is this: arranging the data samples in an asymmetric manner and performing eigendecomposition could sometimes be quite beneficial.

AoS Other · 发表于 2021-02-01

Adaptation in multivariate log-concave density estimation

Oliver Y. Feng, Adityanand Guntuboyina, Arlene K. H. Kim, Richard J. Samworth

摘要

We study the adaptation properties of the multivariate log-concave maximum likelihood estimator over three subclasses of log-concave densities. The first consists of densities with polyhedral support whose logarithms are piecewise affine. The complexity of such densities $f$ can be measured in terms of the sum $\Gamma(f)$ of the numbers of facets of the subdomains in the polyhedral subdivision of the support induced by $f$. Given $n$ independent observations from a $d$-dimensional log-concave density with $d\in\{2,3\}$, we prove a sharp oracle inequality, which in particular implies that the Kullback–Leibler risk of the log-concave maximum likelihood estimator for such densities is bounded above by $\Gamma(f)/n$, up to a polylogarithmic factor. Thus, the rate can be essentially parametric, even in this multivariate setting. For the second type of adaptation, we consider densities that are bounded away from zero on a polytopal support; we show that up to polylogarithmic factors, the log-concave maximum likelihood estimator attains the rate $n^{-4/7}$ when $d=3$, which is faster than the worst-case rate of $n^{-1/2}$. Finally, our third type of subclass consists of densities whose contours are well separated; these new classes are constructed to be affine invariant and turn out to contain a wide variety of densities, including those that satisfy Hölder regularity conditions. Here, we prove another sharp oracle inequality, which reveals in particular that the log-concave maximum likelihood estimator attains a risk bound of order $n^{-\min (\frac{\beta+3}{\beta+7},\frac{4}{7})}$ when $d=3$ over the class of $\beta$-Hölder log-concave densities with $\beta >1$, again up to a polylogarithmic factor.

AoS Other · 发表于 2021-02-01

A rule of thumb: Run lengths to false alarm of many types of control charts run in parallel on dependent streams are asymptotically independent

Moshe Pollak

摘要

Consider a process that produces a series of independent identically distributed vectors. A change in an underlying state may become manifest in a modification of one or more of the marginal distributions. Often, the dependence structure between coordinates is unknown, impeding surveillance based on the joint distribution. A popular approach is to construct control charts for each coordinate separately and raise an alarm the first time any (or some) of the control charts signals. The difficulty is obtaining an expression for the overall average run length to false alarm (ARL2FA). We argue that despite the dependence structure, when the process is in control, for large ARLs to false alarm, run lengths of many types of control charts run in parallel are asymptotically independent. Furthermore, often, in-control run lengths are asymptotically exponentially distributed, enabling uncomplicated asymptotic expressions for the ARL2FA. We prove this assertion for certain Cusum and Shiryaev–Roberts-type control charts and illustrate it by simulations.

SiM Spatial & Time Series · 发表于 2021-01-31

Point process models for sweat gland activation observed with noise

Mikko Kuronen, Mari Myllymäki, Adam Loavenbruck, Aila Särkkä

摘要

The aim of this article is to construct spatial models for the activation of sweat glands for healthy subjects and subjects suffering from peripheral neuropathy by using videos of sweating recorded from the subjects. The sweat patterns are regarded as realizations of spatial point processes and two point process models for the sweat gland activation and two methods for inference are proposed. Several image analysis steps are needed to extract the point patterns from the videos and some incorrectly identified sweat gland locations may be present in the data. To take into account the errors, we either include an error term in the point process model or use an estimation procedure that is robust with respect to the errors.

Biometrika Bayesian Methods High-Dimensional · 发表于 2021-01-31

Large-scale model selection in misspecified generalized linear models

Emre Demirkaya, Yang Feng, Pallavi Basu, Jinchi Lv

摘要

Summary: Model selection is crucial both to high-dimensional learning and to inference for contemporary big data applications in pinpointing the best set of covariates among a sequence of candidate interpretable models. Most existing work implicitly assumes that the models are correctly specified or have fixed dimensionality, yet both model misspecification and high dimensionality are prevalent in practice. In this paper, we exploit the framework of model selection principles under the misspecified generalized linear models presented in Lv & Liu (2014), and investigate the asymptotic expansion of the posterior model probability in the setting of high-dimensional misspecified models. With a natural choice of prior probabilities that encourages interpretability and incorporates the Kullback–Leibler divergence, we suggest using the high-dimensional generalized Bayesian information criterion with prior probability for large-scale model selection with misspecification. Our new information criterion characterizes the impacts of both model misspecification and high dimensionality on model selection. We further establish the consistency of covariance contrast matrix estimation and the model selection consistency of the new information criterion in ultrahigh dimensions under some mild regularity conditions. Our numerical studies demonstrate that the proposed method enjoys improved model selection consistency over its main competitors.

SiM Longitudinal Data High-Dimensional · 发表于 2021-01-31

Capturing heterogeneity in repeated measures data by fusion penalty

Lili Liu, Mae Gordon, J. Philip Miller, Michael Kass, Lu Lin, Shujie Ma, Lei Liu

摘要

In this article, we are interested in capturing heterogeneity in clustered or longitudinal data. Traditionally such heterogeneity is modeled by either fixed effects (FE) or random effects (RE). In FE models, the degree of freedom for the heterogeneity equals the number of clusters/subjects minus 1, which could result in less efficiency. In RE models, the heterogeneity across different clusters/subjects is described by, for example, a random intercept with 1 parameter (for the variance of the random intercept), which could lead to oversimplification and biases (for the estimates of subject‐specific effects). Our “fused effects” model stands in between these two approaches: we assume that there are unknown number of distinct levels of heterogeneity, and use the fusion penalty approach for estimation and inference. We evaluate and compare the performance of our method to the FE and RE models by simulation studies. We apply our method to the Ocular Hypertension Treatment Study to capture the heterogeneity in the progression rate of primary open‐angle glaucoma of left and right eyes of different subjects.

Biometrika Meta-Analysis & Data Integration · 发表于 2021-01-30

Distributed inference for the extreme value index

Liujun Chen, Deyuan Li, Chen Zhou

摘要

Summary: In this paper we investigate a divide-and-conquer algorithm for estimating the extreme value index when data are stored in multiple machines. The oracle property of such an algorithm based on extreme value methods is not guaranteed by the general theory of distributed inference. We propose a distributed Hill estimator and establish its asymptotic theories. We consider various cases where the number of observations involved in each machine can be either homogeneous or heterogeneous, and either fixed or varying according to the total sample size. In each case we provide a sufficient, sometimes also necessary, condition under which the oracle property holds.

Biometrics Clinical Trials Diagnostics & Prediction High-Dimensional · 发表于 2021-01-29

Two‐stage penalized regression screening to detect biomarker–treatment interactions in randomized clinical trials

Jixiong Wang, Ashish Patel, James M.S. Wason, Paul J. Newcombe

摘要

High‐dimensional biomarkers such as genomics are increasingly being measured in randomized clinical trials. Consequently, there is a growing interest in developing methods that improve the power to detect biomarker–treatment interactions. We adapt recently proposed two‐stage interaction detecting procedures in the setting of randomized clinical trials. We also propose a new stage 1 multivariate screening strategy using ridge regression to account for correlations among biomarkers. For this multivariate screening, we prove the asymptotic between‐stage independence, required for familywise error rate control, under biomarker–treatment independence. Simulation results show that in various scenarios, the ridge regression screening procedure can provide substantially greater power than the traditional one‐biomarker‐at‐a‐time screening procedure in highly correlated data. We also exemplify our approach in two real clinical trial data applications.

SMMR Longitudinal Data Latent Variables & Mixtures · 发表于 2021-01-29

Clustered longitudinal data subject to irregular observation

Eleanor M Pullenayegum, Catherine Birken, Jonathon Maguire, The TARGet Kids! Collaboration

摘要

Data collected longitudinally as part of usual health care is becoming increasingly available for research, and is often available across several centres. Because the frequency of follow-up is typically determined by the patient’s health, the timing of measurements may be related to the outcome of interest. Failure to account for the informative nature of the observation process can result in biased inferences. While methods for accounting for the association between observation frequency and outcome are available, they do not currently account for clustering within centres. We formulate a semi-parametric joint model to include random effects for centres as well as subjects. We also show how inverse-intensity weighted GEEs can be adapted to account for clustering, comparing stratification, frailty models, and covariate adjustment to account for clustering in the observation process. The finite-sample performance of the proposed methods is evaluated through simulation and the methods illustrated using a study of the relationship between outdoor play and air quality in children aged 2–9 living in the Greater Toronto Area.

Biometrics Other · 发表于 2021-01-28

Small‐sample inference for cluster‐based outcome‐dependent sampling schemes in resource‐limited settings: Investigating low birthweight in Rwanda

Sara Sauer, Bethany Hedt‐Gauthier, Claudia Rivera‐Rodriguez, Sebastien Haneuse

摘要

The neonatal mortality rate in Rwanda remains above the United Nations Sustainable Development Goal 3 target of 12 deaths per 1000 live births. As part of a larger effort to reduce preventable neonatal deaths in the country, we conducted a study to examine risk factors for low birthweight. The data were collected via a cost‐efficient cluster‐based outcome‐dependent sampling (ODS) scheme wherein clusters of individuals (health centers) were selected on the basis of, in part, the outcome rate of the individuals. For a given data set collected via a cluster‐based ODS scheme, estimation for a marginal model may proceed via inverse‐probability‐weighted generalized estimating equations, where the cluster‐specific weights are the inverse probability of the health center's inclusion in the sample. In this paper, we provide a detailed treatment of the asymptotic properties of this estimator, together with an explicit expression for the asymptotic variance and a corresponding estimator. Furthermore, motivated by the study we conducted in Rwanda, we propose a number of small‐sample bias corrections to both the point estimates and the standard error estimates. Through simulation, we show that applying these corrections when the number of clusters is small generally reduces the bias in the point estimates, and results in closer to nominal coverage. The proposed methods are applied to data from 18 health centers and 1 district hospital in Rwanda.

JASA Testing & Uncertainty Spatial & Time Series · 发表于 2021-01-28

LAWS: A Locally Adaptive Weighting and Screening Approach to Spatial Multiple Testing

T. Tony Cai, Wenguang Sun, Yin Xia

摘要

Exploiting spatial patterns in large-scale multiple testing promises to improve both power and interpretability of false discovery rate (FDR) analyses. This article develops a new class of locally adaptive weighting and screening (LAWS) rules that directly incorporates useful local patterns into inference. The idea involves constructing robust and structure-adaptive weights according to the estimated local sparsity levels. LAWS provides a unified framework for a broad range of spatial problems and is fully data-driven. It is shown that LAWS controls the FDR asymptotically under mild conditions on dependence. The finite sample performance is investigated using simulated data, which demonstrates that LAWS controls the FDR and outperforms existing methods in power. The efficiency gain is substantial in many settings. We further illustrate the merits of LAWS through applications to the analysis of two-dimensional and three-dimensional images. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

Biometrics Genetics & Omics Testing & Uncertainty · 发表于 2021-01-27

Post‐selection inference for changepoint detection algorithms with application to copy number variation data

Sangwon Hyun, Kevin Z. Lin, Max G'Sell, Ryan J. Tibshirani

摘要

Changepoint detection methods are used in many areas of science and engineering, for example, in the analysis of copy number variation data to detect abnormalities in copy numbers along the genome. Despite the broad array of available tools, methodology for quantifying our uncertainty in the strength (or the presence) of given changepoints post‐selection are lacking. Post‐selection inference offers a framework to fill this gap, but the most straightforward application of these methods results in low‐powered hypothesis tests and leaves open several important questions about practical usability. In this work, we carefully tailor post‐selection inference methods toward changepoint detection, focusing on copy number variation data. To accomplish this, we study commonly used changepoint algorithms: binary segmentation, as well as two of its most popular variants, wild and circular, and the fused lasso. We implement some of the latest developments in post‐selection inference theory, mainly auxiliary randomization. This improves the power, which requires implementations of Markov chain Monte Carlo algorithms (importance sampling and hit‐and‐run sampling) to carry out our tests. We also provide recommendations for improving practical useability, detailed simulations, and example analyses on array comparative genomic hybridization as well as sequencing data.

JASA Nonparametric & Semiparametric · 发表于 2021-01-27

Multiscale Quantile Segmentation

Laura Jula Vanegas, Merle Behr, Axel Munk

摘要

We introduce a new methodology for analyzing serial data by quantile regression assuming that the underlying quantile function consists of constant segments. The procedure does not rely on any distributional assumption besides serial independence. It is based on a multiscale statistic, which allows to control the (finite sample) probability for selecting the correct number of segments S at a given error level, which serves as a tuning parameter. For a proper choice of this parameter, this probability tends exponentially fast to one, as sample size increases. We further show that the location and size of segments are estimated at minimax optimal rate (compared to a Gaussian setting) up to a log-factor. Thereby, our approach leads to (asymptotically) uniform confidence bands for the entire quantile regression function in a fully nonparametric setup. The procedure is efficiently implemented using dynamic programming techniques with double heap structures, and software is provided. Simulations and data examples from genetic sequencing and ion channel recordings confirm the robustness of the proposed procedure, which at the same time reliably detects changes in quantiles from arbitrary distributions with precise statistical guarantees. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Machine Learning Networks & Graphs Nonparametric & Semiparametric · 发表于 2021-01-27

Mehler’s Formula, Branching Process, and Compositional Kernels of Deep Neural Networks

Tengyuan Liang, Hai Tran-Bach

摘要

–We use a connection between compositional kernels and branching processes via Mehler’s formula to study deep neural networks. This new probabilistic insight provides us a novel perspective on the mathematical role of activation functions in compositional neural networks. We study the unscaled and rescaled limits of the compositional kernels and explore the different phases of the limiting behavior, as the compositional depth increases. We investigate the memorization capacity of the compositional kernels and neural networks by characterizing the interplay among compositional depth, sample size, dimensionality, and nonlinearity of the activation. Explicit formulas on the eigenvalues of the compositional kernel are provided, which quantify the complexity of the corresponding reproducing kernel Hilbert space. On the methodological front, we propose a new random features algorithm, which compresses the compositional layers by devising a new activation function. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

SMMR Testing & Uncertainty · 发表于 2021-01-27

Inference under covariate-adaptive randomization: A simulation study

Andrea Callegaro, B S Harsha Shree, Naveen Karkada

摘要

In clinical trials, several covariate-adaptive designs have been proposed to balance treatment arms with respect to key covariates. Although some argue that conventional asymptotic tests are still appropriate when covariate-adaptive randomization is used, others think that re-randomization tests should be used. In this manuscript, we compare by simulation the performance of asymptotic and re-randomization tests under covariate-adaptive randomization. Our simulation study confirms results expected by the existing theory (e.g. asymptotic tests do not control type I error when the model is miss-specified). Furthermore, it shows that (i) re-randomization tests are as powerful as the asymptotic tests if the model is correct; (ii) re-randomization tests are more powerful when adjusting for covariates; (iii) minimization and permuted blocks provide similar results.

JASA Genetics & Omics Econometrics & Economics · 发表于 2021-01-27

IFAA: Robust Association Identification and Inference for Absolute Abundance in Microbiome Analyses

Zhigang Li, Lu Tian, A. James O’Malley, Margaret R. Karagas, Anne G. Hoen, Brock C. Christensen, Juliette C. Madan, Quran Wu, Raad Z. Gharaibeh, Christian Jobin, Hongzhe Li

摘要

The target of inference in microbiome analyses is usually relative abundance (RA) because RA in a sample (e.g., stool) can be considered as an approximation of RA in an entire ecosystem (e.g., gut). However, inference on RA suffers from the fact that RA are calculated by dividing absolute abundances (AAs) over the common denominator (CD), the summation of all AA (i.e., library size). Because of that, perturbation in one taxon will result in a change in the CD and thus cause false changes in RA of all other taxa, and those false changes could lead to false positive/negative findings. We propose a novel analysis approach (IFAA) to make robust inference on AA of an ecosystem that can circumvent the issues induced by the CD problem and compositional structure of RA. IFAA can also address the issues of overdispersion and handle zero-inflated data structures. IFAA identifies microbial taxa associated with the covariates in Phase 1 and estimates the association parameters by employing an independent reference taxon in Phase 2. Two real data applications are presented and extensive simulations show that IFAA outperforms other established existing approaches by a big margin in the presence of unbalanced library size. Supplementary materials for this article are available online. *(abstract via PubMed)*

JASA Spatial & Time Series High-Dimensional · 发表于 2021-01-27

High-Dimensional Vector Autoregressive Time Series Modeling via Tensor Decomposition

Di Wang, Yao Zheng, Heng Lian, Guodong Li

摘要

The classical vector autoregressive model is a fundamental tool for multivariate time series analysis. However, it involves too many parameters when the number of time series and lag order are even moderately large. This article proposes to rearrange the transition matrices of the model into a tensor form such that the parameter space can be restricted along three directions simultaneously via tensor decomposition. In contrast, the reduced-rank regression method can restrict the parameter space in only one direction. Besides achieving substantial dimension reduction, the proposed model is interpretable from the factor modeling perspective. Moreover, to handle high-dimensional time series, this article considers imposing sparsity on factor matrices to improve the model interpretability and estimation efficiency, which leads to a sparsity-inducing estimator. For the low-dimensional case, we derive asymptotic properties of the proposed least squares estimator and introduce an alternating least squares algorithm. For the high-dimensional case, we establish nonasymptotic properties of the sparsity-inducing estimator and propose an ADMM algorithm for regularized estimation. Simulation experiments and a real data example demonstrate the advantages of the proposed approach over various existing methods. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Spatial & Time Series · 发表于 2021-01-27

Hierarchical Transformed Scale Mixtures for Flexible Modeling of Spatial Extremes on Datasets With Many Locations

Likun Zhang, Benjamin A. Shaby, Jennifer L. Wadsworth

摘要

–Flexible spatial models that allow transitions between tail dependence classes have recently appeared in the literature. However, inference for these models is computationally prohibitive, even in moderate dimensions, due to the necessity of repeatedly evaluating the multivariate Gaussian distribution function. In this work, we attempt to achieve truly high-dimensional inference for extremes of spatial processes, while retaining the desirable flexibility in the tail dependence structure, by modifying an established class of models based on scale mixtures Gaussian processes. We show that the desired extremal dependence properties from the original models are preserved under the modification, and demonstrate that the corresponding Bayesian hierarchical model does not involve the expensive computation of the multivariate Gaussian distribution function. We fit our model to exceedances of a high threshold, and perform coverage analyses and cross-model checks to validate its ability to capture different types of tail characteristics. We use a standard adaptive Metropolis algorithm for model fitting, and further accelerate the computation via parallelization and Rcpp. Lastly, we apply the model to a dataset of a fire threat index on the Great Plains region of the United States, which is vulnerable to massively destructive wildfires. We find that the joint tail of the fire threat index exhibits a decaying dependence structure that cannot be captured by limiting extreme value models. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

SMMR Clinical Trials Bayesian Methods · 发表于 2021-01-27

Bridging across patient subgroups in phase I oncology trials that incorporate animal data

Haiyan Zheng, Lisa V Hampson, Thomas Jaki

摘要

In this paper, we develop a general Bayesian hierarchical model for bridging across patient subgroups in phase I oncology trials, for which preliminary information about the dose–toxicity relationship can be drawn from animal studies. Parameters that re-scale the doses to adjust for intrinsic differences in toxicity, either between animals and humans or between human subgroups, are introduced to each dose–toxicity model. Appropriate priors are specified for these scaling parameters, which capture the magnitude of uncertainty surrounding the animal-to-human translation and bridging assumption. After mapping data onto a common, ‘average’ human dosing scale, human dose–toxicity parameters are assumed to be exchangeable either with the standardised, animal study-specific parameters, or between themselves across human subgroups. Random-effects distributions are distinguished by different covariance matrices that reflect the between-study heterogeneity in animals and humans. Possibility of non-exchangeability is allowed to avoid inferences for extreme subgroups being overly influenced by their complementary data. We illustrate the proposed approach with hypothetical examples, and use simulation to compare the operating characteristics of trials analysed using our Bayesian model with several alternatives. Numerical results show that the proposed approach yields robust inferences, even when data from multiple sources are inconsistent and/or the bridging assumptions are incorrect.

Biometrics Survival Analysis Bayesian Methods High-Dimensional · 发表于 2021-01-27

Bayesian group sequential enrichment designs based on adaptive regression of response and survival time on baseline biomarkers

Yeonhee Park, Suyu Liu, Peter F. Thall, Ying Yuan

摘要

Precision medicine relies on the idea that, for a particular targeted agent, only a subpopulation of patients is sensitive to it and thus may benefit from it therapeutically. In practice, it is often assumed based on preclinical data that a treatment‐sensitive subpopulation is known, and moreover that the agent is substantively efficacious in that subpopulation. Due to important differences between preclinical settings and human biology, however, data from patients treated with a new targeted agent often show that one or both of these assumptions are false. This paper provides a Bayesian randomized group sequential enrichment design that compares an experimental treatment to a control based on survival time and uses early response as an ancillary outcome to assist with adaptive variable selection and enrichment. Initially, the design enrolls patients under broad eligibility criteria. At each interim decision, submodels for regression of response and survival time on a baseline covariate vector and treatment are fit; variable selection is used to identify a covariate subvector that characterizes treatment‐sensitive patients and determines a personalized benefit index, and comparative superiority and futility decisions are made. Enrollment of each cohort is restricted to the most recent adaptively identified treatment‐sensitive patients. Group sequential decision cutoffs are calibrated to control overall type I error and account for the adaptive enrollment restriction. The design provides a basis for precision medicine by identifying a treatment‐sensitive subpopulation, if it exists, and determining whether the experimental treatment is superior to the control in that subpopulation. A simulation study shows that the proposed design reliably identifies a sensitive subpopulation, yields much higher generalized power compared to several existing enrichment designs and a conventional all‐comers group sequential design, and is robust.

SMMR Bayesian Methods Meta-Analysis & Data Integration · 发表于 2021-01-27

A Bayesian dose–response meta-analysis model: A simulations study and application

Tasnim Hamza, Andrea Cipriani, Toshi A Furukawa, Matthias Egger, Nicola Orsini, Georgia Salanti

摘要

Dose–response models express the effect of different dose or exposure levels on a specific outcome. In meta-analysis, where aggregated-level data is available, dose–response evidence is synthesized using either one-stage or two-stage models in a frequentist setting. We propose a hierarchical dose–response model implemented in a Bayesian framework. We develop our model assuming normal or binomial likelihood and accounting for exposures grouped in clusters. To allow maximum flexibility, the dose–response association is modelled using restricted cubic splines. We implement these models in R using JAGS and we compare our approach to the one-stage dose–response meta-analysis model in a simulation study. We found that the Bayesian dose–response model with binomial likelihood has lower bias than the Bayesian model with normal likelihood and the frequentist one-stage model when studies have small sample size. When the true underlying shape is log–log or half-sigmoid, the performance of all models depends on choosing an appropriate location for the knots. In all other examined situations, all models perform very well and give practically identical results. We also re-analyze the data from 60 randomized controlled trials (15,984 participants) examining the efficacy (response) of various doses of serotonin-specific reuptake inhibitor (SSRI) antidepressant drugs. All models suggest that the dose–response curve increases between zero dose and 30–40 mg of fluoxetine-equivalent dose, and thereafter shows small decline. We draw the same conclusion when we take into account the fact that five different antidepressants have been studied in the included trials. We show that implementation of the hierarchical model in Bayesian framework has similar performance to, but overcomes some of the limitations of the frequentist approach and offers maximum flexibility to accommodate features of the data.

SMMR Machine Learning · 发表于 2021-01-26

An effective technique for diabetic retinopathy using hybrid machine learning technique

N Satyanarayana Murthy, B Arunadevi

摘要

Diabetic retinopathy (DR) stays as an eye issue that has continuously developed in individuals who experienced diabetes. The complexities in diabetes cause harm to the vein at the back of the retina. In outrageous cases, DR could swift apparition disaster or visual impairment. This genuine impact had the option to charge through convenient treatment and early recognition. As of late, this issue has been spreading quickly, particularly in the working region, which in the end constrained the interest of an analysis of this disease from the most prompt stage. Therefore, that are castoff to protect the progressions of this disorder, revealing of the retinal blood vessels (RBVs) play a foremost role. The growth of an abnormal vessel leads to the development steps of DR, where it can be well known by extracting the RBV. The recognition of the BV for DR by developing an automatic approach is a major aim of our research study. In the proposed method, there are two major steps: one is segmentation and the second one is classification of affected retinal BV. The proposed method uses the Kinetic Gas Molecule Optimization based on centroid initialization used for the Fuzzy C-means Clustering. In the classification step, those segmented images are given as input to hybrid techniques such as a convolution neural network with bidirectional-long short-term memory (CNN with Bi-LSTM). The learning degree of Bi-LSTM is revised by using the self-attention mechanism for refining the classification accuracy. The trial consequences disclosed that the mixture algorithm achieved higher accuracy, specificity, and sensitivity than existing techniques.

Biometrika Nonparametric & Semiparametric · 发表于 2021-01-25

Backfitting tests in generalized structured models

E Mammen, S Sperlich

摘要

Summary: We introduce bootstrap tests for semiparametric generalized structured models. These can be used for testing different kinds of model specifications like separability, functional forms and homogeneity of effects, or for performing variable selection in a large class of semiparametric models. The test statistics are based on the comparison of non- and semiparametric alternatives in which both the null hypothesis and the alternative are non- or semiparametric. All estimators are obtained by smooth backfitting. Simulation studies show excellent performance of the test procedures.

JRSSB Causal Inference · 发表于 2021-01-25

Anchor Regression: Heterogeneous Data Meet Causality

Dominik Rothenhäusler, Nicolai Meinshausen, Peter Bühlmann, Jonas Peters

摘要

We consider the problem of predicting a response variable from a set of covariates on a data set that differs in distribution from the training data. Causal parameters are optimal in terms of predictive accuracy if in the new distribution either many variables are affected by interventions or only some variables are affected, but the perturbations are strong. If the training and test distributions differ by a shift, causal parameters might be too conservative to perform well on the above task. This motivates anchor regression, a method that makes use of exogenous variables to solve a relaxation of the ‘causal’ minimax problem by considering a modification of the least-squares loss. The procedure naturally provides an interpolation between the solutions of ordinary least squares (OLS) and two-stage least squares. We prove that the estimator satisfies predictive guarantees in terms of distributional robustness against shifts in a linear class; these guarantees are valid even if the instrumental variable assumptions are violated. If anchor regression and least squares provide the same answer (‘anchor stability’), we establish that OLS parameters are invariant under certain distributional changes. Anchor regression is shown empirically to improve replicability and protect against distributional shifts.

SiM Networks & Graphs Missing Data & Measurement Error · 发表于 2021-01-22

Link predictions for incomplete network data with outcome misclassification

Qiong Wu, Zhen Zhang, Tianzhou Ma, James Waltz, Donald Milton, Shuo Chen

摘要

Link prediction is a fundamental problem in network analysis. In a complex network, links can be unreported and/or under detection limits due to heterogeneous sources of noise and technical challenges during data collection. The incomplete network data can lead to an inaccurate inference of network based data analysis. We propose a parametric link prediction model and consider latent links as misclassified binary outcomes. We develop new algorithms to optimize model parameters and yield robust predictions of unobserved links. Theoretical properties of the predictive model are also discussed. We apply the new method to a partially observed social network data and incomplete brain network data. The results demonstrate that our method outperforms the existing latent‐link prediction methods.

SiM Diagnostics & Prediction Longitudinal Data Functional Data · 发表于 2021-01-22

Dynamic prediction of disease processes based on recurrent history and functional principal component analysis of longitudinal biomarkers: Application for ovarian epithelial cancer

Yizhou Hong, Liwen Su, Siyi Song, Fangrong Yan

摘要

Ovarian epithelial cancer is a gynecological tumor with a high risk of recurrence and death. In the clinical diagnosis of ovarian epithelial cancer, CA125 has become an important indicator of disease burden. To account for patient recurrence and death, a proper method is needed to integrate information from biomarkers and recurrence simultaneously. In the past 10 years, many methods have been proposed for joint modeling of longitudinal biomarkers and survival data, but few of them are applicable to longitudinal data and disease processes, including recurrence and death. In this article, we proposed a new joint frailty model based on functional principal component analysis for dynamic prediction of survival probabilities on the total time scale, which took recurrent history and longitudinal data into account simultaneously. The estimation of the joint frailty model is achieved by maximizing the penalized log‐likelihood function. The simulation results demonstrated the advantages of our method in both discrimination and accuracy under different scenarios. To indicate the method's practicality, it is applied to an actual dataset of patients with ovarian epithelial cancer to predict survival dynamically using longitudinal data of biomarker CA125 and recurrent history data.

SiM Spatial & Time Series · 发表于 2021-01-20

Spatial modeling of individual‐level infectious disease transmission: Tuberculosis data in Manitoba, Canada

Leila Amiri, Mahmoud Torabi, Rob Deardon, Michael Pickles

摘要

Geographically dependent individual level models (GD‐ILMs) are a class of statistical models that can be used to study the spread of infectious disease through a population in discrete‐time in which covariates can be measured both at individual and area levels. The typical ILMs to illustrate spatial data are based on the distance between susceptible and infectious individuals. A key feature of GD‐ILMs is that they take into account the spatial location of the individuals in addition to the distance between susceptible and infectious individuals. As a motivation of this article, we consider tuberculosis (TB) data which is an infectious disease which can be transmitted through individuals. It is also known that certain areas/demographics/communities have higher prevalent of TB (see Section 4 for more details). It is also of interest of policy makers to identify those areas with higher infectivity rate of TB for possible preventions. Therefore, we need to analyze this data properly to address those concerns. In this article, the expectation conditional maximization algorithm is proposed for estimating the parameters of GD‐ILMs to be able to predict the areas with the highest average infectivity rates of TB. We also evaluate the performance of our proposed approach through some simulations. Our simulation results indicate that the proposed method provides reliable estimates of parameters which confirms accuracy of the infectivity rates.

JRSSB Bayesian Methods · 发表于 2021-01-20

Gibbs Flow for Approximate Transport with Applications to Bayesian Computation

Jeremy Heng, Arnaud Doucet, Yvo Pokern

摘要

Let π0 and π1 be two distributions on the Borel space (Rd,B(Rd)). Any measurable function T:Rd→Rd such that Y=T(X)∼π1 if X∼π0 is called a transport map from π0 to π1. For any π0 and π1, if one could obtain an analytical expression for a transport map from π0 to π1, then this could be straightforwardly applied to sample from any distribution. One would map draws from an easy-to-sample distribution π0 to the target distribution π1 using this transport map. Although it is usually impossible to obtain an explicit transport map for complex target distributions, we show here how to build a tractable approximation of a novel transport map. This is achieved by moving samples from π0 using an ordinary differential equation with a velocity field that depends on the full conditional distributions of the target. Even when this ordinary differential equation is time-discretised and the full conditional distributions are numerically approximated, the resulting distribution of mapped samples can be efficiently evaluated and used as a proposal within sequential Monte Carlo samplers. We demonstrate significant gains over state-of-the-art sequential Monte Carlo samplers at a fixed computational complexity on a variety of applications.

SiM Bayesian Methods Spatial & Time Series Nonparametric & Semiparametric · 发表于 2021-01-20

Conditional adaptive Bayesian spectral analysis of replicated multivariate time series

Zeda Li, Scott A. Bruce, Clinton J. Wutzke, Yang Long

摘要

This article introduces a flexible nonparametric approach for analyzing the association between covariates and power spectra of multivariate time series observed across multiple subjects, which we refer to as multivariate conditional adaptive Bayesian power spectrum analysis (MultiCABS). The proposed procedure adaptively collects time series with similar covariate values into an unknown number of groups and nonparametrically estimates group‐specific power spectra through penalized splines. A fully Bayesian framework is developed in which the number of groups and the covariate partition defining the groups are random and fit using Markov chain Monte Carlo techniques. MultiCABS offers accurate estimation and inference on power spectra of multivariate time series with both smooth and abrupt dynamics across covariate by averaging over the distribution of covariate partitions. Performance of the proposed method compared with existing methods is evaluated in simulation studies. The proposed methodology is used to analyze the association between fear of falling and power spectra of center‐of‐pressure trajectories of postural control while standing in people with Parkinson's disease.

JASA Other · 发表于 2021-01-19

On Constraining Projections of Future Climate Using Observations and Simulations From Multiple Climate Models

Philip G. Sansom, David B. Stephenson, Thomas J. Bracegirdle

摘要

Numerical climate models are used to project future climate change due to both anthropogenic and natural causes. Differences between projections from different climate models are a major source of uncertainty about future climate. Emergent relationships shared by multiple climate models have the potential to constrain our uncertainty when combined with historical observations. We combine projections from 13 climate models with observational data to quantify the impact of emergent relationships on projections of future warming in the Arctic at the end of the 21st century. We propose a hierarchical Bayesian framework based on a coexchangeable representation of the relationship between climate models and the Earth system. We show how emergent constraints fit into the coexchangeable representation, and extend it to account for internal variability simulated by the models and natural variability in the Earth system. Our analysis shows that projected warming in some regions of the Arctic may be more than 2 °C lower and our uncertainty reduced by up to 30% when constrained by historical observations. A detailed theoretical comparison with existing multi-model projection frameworks is also provided. In particular, we show that projections may be biased if we do not account for internal variability in climate model predictions. Supplementary materials for this article, including a standardized description of the materials available for reproducing the work, are available as an online supplement. *(abstract via OpenAlex)*

SiM Missing Data & Measurement Error Survival Analysis · 发表于 2021-01-19

Multiple imputation strategies for a bounded outcome variable in a competing risks analysis

Elinor Curnow, Rachael A. Hughes, Kate Birnie, Michael J. Crowther, Margaret T. May, Kate Tilling

摘要

In patient follow‐up studies, events of interest may take place between periodic clinical assessments and so the exact time of onset is not observed. Such events are known as “bounded” or “interval‐censored.” Methods for handling such events can be categorized as either (i) applying multiple imputation (MI) strategies or (ii) taking a full likelihood‐based (LB) approach. We focused on MI strategies, rather than LB methods, because of their flexibility. We evaluated MI strategies for bounded event times in a competing risks analysis, examining the extent to which interval boundaries, features of the data distribution and substantive analysis model are accounted for in the imputation model. Candidate imputation models were predictive mean matching (PMM); log‐normal regression with postimputation back‐transformation; normal regression with and without restrictions on the imputed values and Delord and Genin's method based on sampling from the cumulative incidence function. We used a simulation study to compare MI methods and one LB method when data were missing at random and missing not at random, also varying the proportion of missing data, and then applied the methods to a hematopoietic stem cell transplantation dataset. We found that cumulative incidence and median event time estimation were sensitive to model misspecification. In a competing risks analysis, we found that it is more important to account for features of the data distribution than to restrict imputed values based on interval boundaries or to ensure compatibility with the substantive analysis by sampling from the cumulative incidence function. We recommend MI by type 1 PMM.

JASA Testing & Uncertainty High-Dimensional Causal Inference · 发表于 2021-01-19

Markov Neighborhood Regression for High-Dimensional Inference

Faming Liang, Jingnan Xue, Bochao Jia

摘要

This paper proposes an innovative method for constructing confidence intervals and assessing p-values in statistical inference for high-dimensional linear models. The proposed method has successfully broken the high-dimensional inference problem into a series of low-dimensional inference problems: For each regression coefficient β i , the confidence interval and p-value are computed by regressing on a subset of variables selected according to the conditional independence relations between the corresponding variable X i and other variables. Since the subset of variables forms a Markov neighborhood of X i in the Markov network formed by all the variables X 1, X 2, … , X p , the proposed method is coined as Markov neighborhood regression. The proposed method is tested on high-dimensional linear, logistic and Cox regression. The numerical results indicate that the proposed method significantly outperforms the existing ones. Based on the Markov neighborhood regression, a method of learning causal structures for high-dimensional linear models is proposed and applied to identification of drug sensitive genes and cancer driver genes. The idea of using conditional independence relations for dimension reduction is general and potentially can be extended to other high-dimensional or big data problems as well. *(abstract via PubMed)*

第 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 34 35 36 37 38 39 页