2021 年的期刊文章 · 第 13 页

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

按期刊、按主题看 →

第 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 Other · 发表于 2021-08-01

On Charles Stein’s contributions to (in)admissibility

William E. Strawderman

摘要

Charles Stein made fundamental contributions to admissibility and inadmissibility in estimation and testing. This paper surveys some of the more important ones. Particular attention will be paid to his monumentally important, and at the time, incredibly surprising discovery of the inadmissibility of the usual estimator of the mean in three and higher dimensions. His result on admissibility of Pitman’s estimator of a mean in one and two dimensions, and his results on estimation of a mean matrix and a covariance matrix are also discussed. His work on testing is briefly covered.

AoS Latent Variables & Mixtures · 发表于 2021-08-01

Nonexchangeable random partition models for microclustering

Giuseppe Di Benedetto, François Caron, Yee Whye Teh

摘要

Many popular random partition models, such as the Chinese restaurant process and its two-parameter extension, fall in the class of exchangeable random partitions, and have found wide applicability in various fields. While the exchangeability assumption is sensible in many cases, it implies that the size of the clusters necessarily grows linearly with the sample size, and such feature may be undesirable for some applications. We present here a flexible class of nonexchangeable random partition models, which are able to generate partitions whose cluster sizes grow sublinearly with the sample size, and where the growth rate is controlled by one parameter. Along with this result, we provide the asymptotic behaviour of the number of clusters of a given size, and show that the model can exhibit a power-law behaviour, controlled by another parameter. The construction is based on completely random measures and a Poisson embedding of the random partition, and inference is performed using a Sequential Monte Carlo algorithm. Experiments on real data sets emphasise the usefulness of the approach compared to a two-parameter Chinese restaurant process.

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

Monitoring for a change point in a sequence of distributions

Lajos Horváth, Piotr Kokoszka, Shixuan Wang

摘要

We propose a method for the detection of a change point in a sequence {Fi} of distributions, which are available through a large number of observations at each i≥1. Under the null hypothesis, the distributions Fi are equal. Under the alternative hypothesis, there is a change point i∗>1, such that Fi=G for i≥i∗ and some unknown distribution G, which is not equal to F1. The change point, if it exists, is unknown, and the distributions before and after the potential change point are unknown. The decision about the existence of a change point is made sequentially, as new data arrive. At each time i, the count of observations, N, can increase to infinity. The detection procedure is based on a weighted version of the Wasserstein distance. Its asymptotic and finite sample validity is established. Its performance is illustrated by an application to returns on stocks in the S&P 500 index.

AoS Other · 发表于 2021-08-01

Minimax optimal conditional independence testing

Matey Neykov, Sivaraman Balakrishnan, Larry Wasserman

摘要

We consider the problem of conditional independence testing of X and Y given Z where X,Y and Z are three real random variables and Z is continuous. We focus on two main cases—when X and Y are both discrete, and when X and Y are both continuous. In view of recent results on conditional independence testing [Ann. Statist. 48 (2020) 1514–1538], one cannot hope to design nontrivial tests, which control the type I error for all absolutely continuous conditionally independent distributions, while still ensuring power against interesting alternatives. Consequently, we identify various, natural smoothness assumptions on the conditional distributions of X,Y|Z=z as z varies in the support of Z, and study the hardness of conditional independence testing under these smoothness assumptions. We derive matching lower and upper bounds on the critical radius of separation between the null and alternative hypotheses in the total variation metric. The tests we consider are easily implementable and rely on binning the support of the continuous variable Z. To complement these results, we provide a new proof of the hardness result of Shah and Peters [Ann. Statist. 48 (2020) 1514–1538].

AoS Other · 发表于 2021-08-01

Infinite-dimensional gradient-based descent for alpha-divergence minimisation

Kamélia Daudel, Randal Douc, François Portier

摘要

This paper introduces the (α,Γ)-descent, an iterative algorithm which operates on measures and performs α-divergence minimisation in a Bayesian framework. This gradient-based procedure extends the commonly-used variational approximation by adding a prior on the variational parameters in the form of a measure. We prove that for a rich family of functions Γ, this algorithm leads at each step to a systematic decrease in the α-divergence and derive convergence results. Our framework recovers the Entropic Mirror Descent algorithm and provides an alternative algorithm that we call the Power Descent. Moreover, in its stochastic formulation, the (α,Γ)-descent allows to optimise the mixture weights of any given mixture model without any information on the underlying distribution of the variational parameters. This renders our method compatible with many choices of parameters updates and applicable to a wide range of Machine Learning tasks. We demonstrate empirically on both toy and real-world examples the benefit of using the Power Descent and going beyond the Entropic Mirror Descent framework, which fails as the dimension grows.

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

Estimation of the number of components of nonparametric multivariate finite mixture models

Caleb Kwon, Eric Mbakop

摘要

We propose a novel estimator for the number of mixture components (denoted by M) in a nonparametric finite mixture model. The setting that we consider is one where the analyst has repeated observations of K≥2 variables that are conditionally independent given a finitely supported latent variable with M support points. Under a mild assumption on the joint distribution of the observed and latent variables, we show that an integral operator T that is identified from the data has rank equal to M. We use this observation, in conjunction with the fact that singular values of operators are stable under perturbations, to propose an estimator of M, which essentially consists of a thresholding rule that counts the number of singular values of a consistent estimator of T that are greater than a data-driven threshold. We prove that our estimator of M is consistent, and establish nonasymptotic results, which provide finite sample performance guarantees for our estimator. We present a Monte Carlo study, which shows that our estimator performs well for samples of moderate size.

AoS Causal Inference Genetics & Omics · 发表于 2021-08-01

Debiased inverse-variance weighted estimator in two-sample summary-data Mendelian randomization

Ting Ye, Jun Shao, Hyunseung Kang

摘要

Mendelian randomization (MR) has become a popular approach to study the effect of a modifiable exposure on an outcome by using genetic variants as instrumental variables. A challenge in MR is that each genetic variant explains a relatively small proportion of variance in the exposure and there are many such variants, a setting known as many weak instruments. To this end, we provide a theoretical characterization of the statistical properties of two popular estimators in MR: the inverse-variance weighted (IVW) estimator and the IVW estimator with screened instruments using an independent selection dataset, under many weak instruments. We then propose a debiased IVW estimator, a simple modification of the IVW estimator, that is robust to many weak instruments and does not require screening. Additionally, we present two instrument selection methods to improve the efficiency of the new estimator when a selection dataset is available. An extension of the debiased IVW estimator to handle balanced horizontal pleiotropy is also discussed. We conclude by demonstrating our results in simulated and real datasets.

AoS Networks & Graphs Nonparametric & Semiparametric High-Dimensional · 发表于 2021-08-01

Consistent nonparametric estimation for heavy-tailed sparse graphs

Christian Borgs, Jennifer T. Chayes, Henry Cohn, Shirshendu Ganguly

摘要

We study graphons as a nonparametric generalization of stochastic block models, and show how to obtain compactly represented estimators for sparse networks in this framework. In contrast to previous work, we relax the usual boundedness assumption for the generating graphon and instead assume only integrability, so that we can handle networks that have long tails in their degree distributions. We also relax the usual assumption that the graphon is defined on the unit interval, to allow latent position graphs based on more general spaces. We analyze three algorithms. The first is a least squares algorithm, which gives a consistent estimator for all square-integrable graphons, with errors expressed in terms of the best possible stochastic block model approximation. Next, we analyze an algorithm based on the cut norm, which works for all integrable graphons. Finally, we show that clustering based on degrees works whenever the underlying degree distribution is atomless.

AoS Testing & Uncertainty · 发表于 2021-08-01

Confidence intervals for multiple isotonic regression and other monotone models

Hang Deng, Qiyang Han, Cun-Hui Zhang

摘要

We consider the problem of constructing pointwise confidence intervals in the multiple isotonic regression model. Recently, Han and Zhang (2020) obtained a pointwise limit distribution theory for the so-called block max–min and min–max estimators (Fokianos, Leucht and Neumann (2020); Deng and Zhang (2020)) in this model, but inference remains a difficult problem due to the nuisance parameter in the limit distribution that involves multiple unknown partial derivatives of the true regression function. In this paper, we show that this difficult nuisance parameter can be effectively eliminated by taking advantage of information beyond point estimates in the block max–min and min–max estimators. Formally, let uˆ(x0) (resp. vˆ(x0)) be the maximizing lower-left (resp. minimizing upper-right) vertex in the block max–min (resp. min–max) estimator, and fˆn be the average of the block max–min and min–max estimators. If all (first-order) partial derivatives of f0 are nonvanishing at x0, then the following pivotal limit distribution theory holds: nuˆ,vˆ(x0)(fˆn(x0)−f0(x0))⇝σ·L1d. Here nuˆ,vˆ(x0) is the number of design points in the block [uˆ(x0),vˆ(x0)], σ is the standard deviation of the errors, and L1d is a universal limit distribution free of nuisance parameters. This immediately yields confidence intervals for f0(x0) with asymptotically exact confidence level and oracle length. Notably, the construction of the confidence intervals, even new in the univariate setting, requires no more efforts than performing an isotonic regression once using the block max–min and min–max estimators, and can be easily adapted to other common monotone models including, for example, (i) monotone density estimation, (ii) interval censoring model with current status data, (iii) counting process model with panel count data, and (iv) generalized linear models. Extensive simulations are carried out to support our theory.

AoS Networks & Graphs · 发表于 2021-08-01

Community detection with dependent connectivity

Yubai Yuan, Annie Qu

摘要

In network analysis, within-community members are more likely to be connected than between-community members, which is reflected in that the edges within a community are intercorrelated. However, existing probabilistic models for community detection such as the stochastic block model (SBM) are not designed to capture the dependence among edges. In this paper, we propose a new community detection approach to incorporate intra-community dependence of connectivities through the Bahadur representation. The proposed method does not require specifying the likelihood function, which could be intractable for correlated binary connectivities. In addition, the proposed method allows for heterogeneity among edges between different communities. In theory, we show that incorporating correlation information can achieve a faster convergence rate compared to the independent SBM, and the proposed algorithm has a lower estimation bias and accelerated convergence compared to the variational EM. Our simulation studies show that the proposed algorithm outperforms the existing multinetwork community detection methods assuming conditional independence among edges. We also demonstrate the application of the proposed method to agricultural product trading networks from different countries and to brain fMRI imaging networks.

AoS Other · 发表于 2021-08-01

Charles Stein and invariance: Beginning with the Hunt–Stein theorem

Morris L. Eaton, Edward I. George

摘要

When statistical decision theory was emerging as a promising new paradigm, Charles Stein was to play a major role in the development of minimax theory for invariant statistical problems. In some of his earliest work with Gil Hunt, he set out to prove that, in problems where invariant procedures have constant risk, any best invariant test would be minimax among all tests. Although finding it not quite true in general, this led to the legendary Hunt–Stein theorem, which established the result under restrictive conditions on the underlying group of transformations. In decision problems invariant under such suitable groups, an overall minimax test was guaranteed to reside within the class of invariant procedures where it would typically be much easier to find. But when it did not seem possible to establish this result for invariance under the full linear group, he instead turned to prove its impossibility with counterexamples such as the nonminimaxity of the usual sample covariance estimator where the full linear group was just too big for the Hunt–Stein theorem to apply. Further explorations of invariance such as the sometimes problematic inference under a fiducial distribution, or the characterization of a best invariant procedure as a formal Bayes procedure under a right Haar prior, are further examples of the far reaching influence of Stein’s contributions to invariance theory.

AoS Survival Analysis Nonparametric & Semiparametric Machine Learning · 发表于 2021-08-01

Boosted nonparametric hazards with time-dependent covariates

Donald K. K. Lee, Ningyuan Chen, Hemant Ishwaran

摘要

Given functional data from a survival process with time-dependent covariates, we derive a smooth convex representation for its nonparametric log-likelihood functional and obtain its functional gradient. From this, we devise a generic gradient boosting procedure for estimating the hazard function nonparametrically. An illustrative implementation of the procedure using regression trees is described to show how to recover the unknown hazard. The generic estimator is consistent if the model is correctly specified; alternatively, an oracle inequality can be demonstrated for tree-based models. To avoid overfitting, boosting employs several regularization devices. One of them is stepsize restriction, but the rationale for this is somewhat mysterious from the viewpoint of consistency. Our work brings some clarity to this issue by revealing that stepsize restriction is a mechanism for preventing the curvature of the risk from derailing convergence.

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

Asymptotic distributions of high-dimensional distance correlation inference

Lan Gao, Yingying Fan, Jinchi Lv, Qi-Man Shao

摘要

Distance correlation has become an increasingly popular tool for detecting the nonlinear dependence between a pair of potentially high-dimensional random vectors. Most existing works have explored its asymptotic distributions under the null hypothesis of independence between the two random vectors when only the sample size or the dimensionality diverges. Yet its asymptotic null distribution for the more realistic setting when both sample size and dimensionality diverge in the full range remains largely underdeveloped. In this paper, we fill such a gap and develop central limit theorems and associated rates of convergence for a rescaled test statistic based on the bias-corrected distance correlation in high dimensions under some mild regularity conditions and the null hypothesis. Our new theoretical results reveal an interesting phenomenon of blessing of dimensionality for high-dimensional distance correlation inference in the sense that the accuracy of normal approximation can increase with dimensionality. Moreover, we provide a general theory on the power analysis under the alternative hypothesis of dependence, and further justify the capability of the rescaled distance correlation in capturing the pure nonlinear dependency under moderately high dimensionality for a certain type of alternative hypothesis. The theoretical results and finite-sample performance of the rescaled statistic are illustrated with several simulation examples and a blockchain application.

SiM Testing & Uncertainty Diagnostics & Prediction Causal Inference · 发表于 2021-07-30

Using knockoffs for controlled predictive biomarker identification

Konstantinos Sechidis, Matthias Kormaksson, David Ohlssen

摘要

One of the key challenges of personalized medicine is to identify which patients will respond positively to a given treatment. The area of subgroup identification focuses on this challenge, that is, identifying groups of patients that experience desirable characteristics, such as an enhanced treatment effect. A crucial first step towards the subgroup identification is to identify the baseline variables (eg, biomarkers) that influence the treatment effect, which are known as predictive variables. Many subgroup discovery algorithms return importance scores that capture the variables' predictive strength. However, a major limitation of these scores is that they do not answer the core question: “Which variables are actually predictive?” With our work we answer this question by using the knockoff framework, which is a general framework for controlling the false discovery rate when performingprognosticvariable selection. In contrast, our work is the first that uses knockoffs forpredictivevariable selection. We introduce two novel knockoff filters: one parametric, building on variable importance scores derived from a penalized linear regression model, and one non‐parametric, building on causal forest variable importance scores. We conduct extensive simulations to validate performance of the proposed methodology and we also apply the proposed methods to data from a randomized clinical trial.

JASA Other · 发表于 2021-07-30

Uniform Projection Designs and Strong Orthogonal Arrays

Cheng-Yu Sun, Boxin Tang

摘要

We explore the connections between uniform projection designs and strong orthogonal arrays of strength 2+ in this article. Both of these classes of designs are suitable designs for computer experiments and space-filling in two-dimensional margins, but they are motivated by different considerations. Uniform projection designs are introduced by Sun, Wang, and Xu to capture two-dimensional uniformity using the centered L2-discrepancy whereas strong orthogonal arrays of strength 2+ are brought forth by He, Cheng, and Tang as they achieve stratifications in two-dimensions on finer grids than ordinary orthogonal arrays. We first derive a new expression for the centered L2-discrepancy, which gives a decomposition of the criterion into a sum of squares where each square measures one aspect of design uniformity. This result is not only insightful in itself but also allows us to study strong orthogonal arrays in terms of the discrepancy criterion. More specifically, we show that strong orthogonal arrays of strength 2+ are optimal or nearly optimal under the uniform projection criterion. *(abstract via OpenAlex)*

SiM Other · 发表于 2021-07-30

Effective disease surveillance by using covariate information

Peihua Qiu, Kai Yang

摘要

Effective surveillance of infectious diseases, cancers, and other deadly diseases is critically important for public health and safety of our society. Incidence data of such diseases are often collected spatially from different clinics and hospitals through a regional, national or global disease reporting system. In such a system, new batches of data keep being collected over time, and a decision needs to be made immediately after new data are collected regarding whether there is a disease outbreak at the current time point. This is the disease surveillance problem that will be focused in this article. There are some existing methods for solving this problem, most of which use the disease incidence data only. In practice, however, disease incidence is often associated with some covariates, including the air temperature, humidity, and other weather or environmental conditions. In this article, we develop a new methodology for disease surveillance which can make use of helpful covariate information to improve its effectiveness. A novelty of this new method is behind the property that only those covariate information that is associated with a true disease outbreak can help trigger a signal. The new method can accommodate seasonality, spatio‐temporal data correlation, and nonparametric data distribution. These features make it feasible to use in many real applications.

SiM High-Dimensional · 发表于 2021-07-30

A permutation‐based approach for heterogeneous meta‐analyses of rare events

Brinley N. Zabriskie, Chris Corcoran, Pralay Senchaudhuri

摘要

The increasingly widespread use of meta‐analysis has led to growing interest in meta‐analytic methods for rare events and sparse data. Conventional approaches tend to perform very poorly in such settings. Recent work in this area has provided options for sparse data, but these are still often hampered when heterogeneity across the available studies differs based on treatment group. We propose a permutation‐based approach based on conditional logistic regression that accommodates this common contingency, providing more reliable statistical tests when such patterns of heterogeneity are observed. We find that commonly used methods can yield highly inflated Type I error rates, low confidence interval coverage, and bias when events are rare and non‐negligible heterogeneity is present. Our method often produces much lower Type I error rates and higher confidence interval coverage than traditional methods in these circumstances. We illustrate the utility of our method by comparing it to several other methods via a simulation study and analyzing an example data set, which assess the use of antibiotics to prevent acute rheumatic fever.

SiM Survival Analysis Nonparametric & Semiparametric Causal Inference · 发表于 2021-07-30

A comparison of semiparametric approaches to evaluate composite endpoints in heart failure trials

Gerrit Toenges, Tobias Mütze, Antje Jahn‐Eimermacher

摘要

In heart failure (HF) trials efficacy is usually assessed by a composite endpoint including cardiovascular death (CVD) and heart failure hospitalizations (HFHs), which has traditionally been evaluated with a time‐to‐first‐event analysis based on a Cox model. As a considerable fraction of events is ignored that way, methods for recurrent events were suggested, among others the semiparametric proportional rates models by Lin, Wei, Yang, and Ying (LWYY model) and Mao and Lin (Mao‐Lin model). In our work we apply least false parameter theory to explain the behavior of the composite treatment effect estimates resulting from the Cox model, the LWYY model, and the Mao‐Lin model in clinically relevant scenarios parameterized through joint frailty models. These account for both different treatment effects on the two outcomes (CVD, HFHs) and the positive correlation between their risk rates. For the important setting of beneficial outcome‐specific treatment effects we show that the correlation results in composite treatment effect estimates, which are decreasing with trial duration. The estimate from the Cox model is affected more by the attenuation than the estimates from the recurrent event models, which both demonstrate very similar behavior. Since the Mao‐Lin model turns out to be less sensitive to harmful effects on mortality, we conclude that, among the three investigated approaches, the LWYY model is the most appropriate one for the composite endpoint in HF trials. Our investigations are motivated and compared with empirical results from the PARADIGM‐HF trial (ClinicalTrials.gov identifier: NCT01035255), a large multicenter trial including 8399 chronic HF patients.

SMMR Latent Variables & Mixtures · 发表于 2021-07-28

Validity of a method for identifying disease subtypes that are etiologically heterogeneous

Emily C Zabor, Venkatraman E Seshan, Shuang Wang, Colin B Begg

摘要

A focus of cancer epidemiologic research has become the identification of risk factors that influence specific subtypes of disease, a phenomenon known as etiologic heterogeneity. In previous work we developed a novel strategy to cluster tumor markers and identify disease subtypes that differ maximally with respect to known risk factors for use in the context of case-control studies. The method relies on the premise that unsupervised k-means clustering will find candidate solutions that are closely aligned with the sought-after etiologically distinct clusters, which may not be true in the presence of clusters of tumor markers that are not related to risk of disease. In this article, we investigate in detail the ability of the method to identify the “true” clusters in the presence of clusters that are unrelated to risk factors, what we term “counterfeit” clusters. We find that our method works when the strength of structure is larger in the clusters that truly represent etiologic heterogeneity than in the counterfeit clusters, but when this condition is not met, or when there are many tumor markers that simply represent noise, the method will not find the correct solution without first performing variable selection to identify the tumor markers most strongly related to the risk factors. We illustrate the results using data from a breast cancer case-control study.

SMMR Networks & Graphs · 发表于 2021-07-28

General regression methods for respondent-driven sampling data

Mamadou Yauck, Erica EM Moodie, Herak Apelian, Alain Fourmigue, Daniel Grace, Trevor Hart, Gilles Lambert, Joseph Cox

摘要

Respondent-driven sampling is a variant of link-tracing sampling techniques that aim to recruit hard-to-reach populations by leveraging individuals’ social relationships. As such, a respondent-driven sample has a graphical component which represents a partially observed network of unknown structure. Moreover, it is common to observe homophily, or the tendency to form connections with individuals who share similar traits. Currently, there is a lack of principled guidance on multivariate modelling strategies for respondent-driven sampling to address peer effects driven by homophily and the dependence between observations within the network. In this work, we propose a methodology for general regression techniques using respondent-driven sampling data. This is used to study the socio-demographic predictors of HIV treatment optimism (about the value of antiretroviral therapy) among gay, bisexual and other men who have sex with men, recruited into a respondent-driven sampling study in Montreal, Canada.

SMMR Other · 发表于 2021-07-28

Distance-based Classification and Regression Trees for the analysis of complex predictors in health and medical research

Hannah Johns, Julie Bernhardt, Leonid Churilov

摘要

Predicting patient outcomes based on patient characteristics and care processes is a common task in medical research. Such predictive features are often multifaceted and complex, and are usually simplified into one or more scalar variables to facilitate statistical analysis. This process, while necessary, results in a loss of important clinical detail. While this loss may be prevented by using distance-based predictive methods which better represent complex healthcare features, the statistical literature on such methods is limited, and the range of tools facilitating distance-based analysis is substantially smaller than those of other methods. Consequently, medical researchers must choose to either reduce complex predictive features to scalar variables to facilitate analysis, or instead use a limited number of distance-based predictive methods which may not fulfil the needs of the analysis problem at hand. We address this limitation by developing a Distance-Based extension of Classification and Regression Trees (DB-CART) capable of making distance-based predictions of categorical, ordinal and numeric patient outcomes. We also demonstrate how this extension is compatible with other extensions to CART, including a recently published method for predicting care trajectories in chronic disease. We demonstrate DB-CART by using it to expand upon previously published dose–response analysis of stroke rehabilitation data. Our method identified additional detail not captured by the previously published analysis, reinforcing previous conclusions. We also demonstrate how by combining DB-CART with other extensions to CART, the method is capable of making predictions about complex, multifaceted outcome data based on complex, multifaceted predictive features.

SMMR Other · 发表于 2021-07-28

A novel model-checking approach for dose-response relationships

Shunyao Wu, Xinmin Li, Yu Xia, Hua Liang

摘要

We propose a test for assessing nonlinear dose-response models based on a Crámer–von Mises statistic. We establish the asymptotic distribution of the test and demonstrate that the test can detect the local alternative converging to the null at the parametric rate [Formula: see text]. We provide a bootstrap resampling technique to calculate the critical values. It is observed that the test has good power performance in small sample sizes. We apply the proposed method to analyze 250 datasets from a pharmacologic study and conduct two small simulation experiments to explore the numerical performance of the proposed test and compare one commonly used test in practice.

SiM Clinical Trials · 发表于 2021-07-27

Optimal design of cluster randomized trials allowing unequal allocation of clusters and unequal cluster size between arms

Andrew J. Copas, Richard Hooper

摘要

There are sometimes cost, scientific, or logistical reasons to allocate individuals unequally in an individually randomized trial. In cluster randomized trials we can allocate clusters unequally and/or allow different cluster size between trial arms. We consider parallel group designs with a continuous outcome, and optimal designs that require the smallest number of individuals to be measured given the number of clusters. Previous authors have derived the optimal allocation ratio for clusters under different variance and/or intracluster correlations (ICCs) between arms, allowing different but prespecified cluster sizes by arm. We derive closed‐form expressions to identify the optimal proportions of clusters and of individuals measured for each arm, thereby defining optimal cluster sizes, when cluster size can be chosen freely. When ICCs differ between arms but the variance is equal, the optimal design allocates more than half the clusters to the arm with the higher ICC, but (typically only slightly) less than half the individuals and hence a smaller cluster size. We also describe optimal design under constraints on the number of clusters or cluster size in one or both arms. This methodology allows trialists to consider a range for the number of clusters in the trial and for each to identify the optimal design. Except if there is clear prior evidence for the ICC and variance by arm, a range of values will need to be considered. Researchers should choose a design with adequate power across the range, while also keeping enough clusters in each arm to permit the intended analysis method.

JASA Nonparametric & Semiparametric · 发表于 2021-07-26

Semiparametric Efficiency in Convexity Constrained Single-Index Model

Arun K. Kuchibhotla, Rohit K. Patra, Bodhisattva Sen

摘要

We consider estimation and inference in a single-index regression model with an unknown convex link function. We introduce a convex and Lipschitz constrained least-square estimator (CLSE) for both the parametric and the nonparametric components given independent and identically distributed observations. We prove the consistency and find the rates of convergence of the CLSE when the errors are assumed to have only q≥2 moments and are allowed to depend on the covariates. When q≥5, we establish n−1/2-rate of convergence and asymptotic normality of the estimator of the parametric component. Moreover, the CLSE is proved to be semiparametrically efficient if the errors happen to be homoscedastic. We develop and implement a numerically stable and computationally fast algorithm to compute our proposed estimator in the R package simest. We illustrate our methodology through extensive simulations and data analysis. Finally, our proof of efficiency is geometric and provides a general framework that can be used to prove efficiency of estimators in a wide variety of semiparametric models even when they do not satisfy the efficient score equation directly. Supplementary files for this article are available online. *(abstract via OpenAlex)*

JASA Bayesian Methods High-Dimensional Latent Variables & Mixtures · 发表于 2021-07-26

Neuronized Priors for Bayesian Sparse Linear Regression

Minsuk Shin, Jun S. Liu

摘要

Although Bayesian variable selection methods have been intensively studied, their routine use in practice has not caught up with their non-Bayesian counterparts such as Lasso, likely due to difficulties in both computations and flexibilities of prior choices. To ease these challenges, we propose the neuronized priors to unify and extend some popular shrinkage priors, such as Laplace, Cauchy, horseshoe, and spike-and-slab priors. A neuronized prior can be written as the product of a Gaussian weight variable and a scale variable transformed from Gaussian via an activation function. Compared with classic spike-and-slab priors, the neuronized priors achieve the same explicit variable selection without employing any latent indicator variables, which results in both more efficient and flexible posterior sampling and more effective posterior modal estimation. Theoretically, we provide specific conditions on the neuronized formulation to achieve the optimal posterior contraction rate, and show that a broadly applicable MCMC algorithm achieves an exponentially fast convergence rate under the neuronized formulation. We also examine various simulated and real data examples and demonstrate that using the neuronization representation is computationally more or comparably efficient than its standard counterpart in all well-known cases. An R package NPrior is provided for using neuronized priors in Bayesian linear regression. *(abstract via OpenAlex)*

JASA Spatial & Time Series Latent Variables & Mixtures · 发表于 2021-07-26

Latent Gaussian Count Time Series

Yisu Jia, Stefanos Kechagias, James Livsey, Robert Lund, Vladas Pipiras

摘要

This article develops the theory and methods for modeling a stationary count time series via Gaussian transformations. The techniques use a latent Gaussian process and a distributional transformation to construct stationary series with very flexible correlation features that can have any prespecified marginal distribution, including the classical Poisson, generalized Poisson, negative binomial, and binomial structures. Gaussian pseudo-likelihood and implied Yule–Walker estimation paradigms, based on the autocovariance function of the count series, are developed via a new Hermite expansion. Particle filtering and sequential Monte Carlo methods are used to conduct likelihood estimation. Connections to state space models are made. Our estimation approaches are evaluated in a simulation study and the methods are used to analyze a count series of weekly retail sales. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Other · 发表于 2021-07-26

Improving Predictions When Interest Focuses on Extreme Random Effects

Charles E. McCulloch, John M. Neuhaus

摘要

Statistical models that generate predicted random effects are widely used to evaluate the performance of and rank patients, physicians, hospitals and health plans from longitudinal and clustered data. Predicted random effects have been proven to outperform treating clusters as fixed effects (essentially a categorical predictor variable) and using standard regression models, on average. These predicted random effects are often used to identify extreme or outlying values, such as poorly performing hospitals or patients with rapid declines in their health. When interest focuses on the extremes rather than performance on average, there has been no systematic investigation of best approaches. We develop novel methods for prediction of extreme values, evaluate their performance, and illustrate their application using data from the Osteoarthritis Initiative to predict walking speed in older adults. The new methods substantially outperform standard random and fixed-effects approaches for extreme values. *(abstract via OpenAlex)*

JASA Missing Data & Measurement Error Functional Data · 发表于 2021-07-26

Elucidating Age and Sex-Dependent Association Between Frontal EEG Asymmetry and Depression: An Application of Multiple Imputation in Functional Regression

Adam Ciarleglio, Eva Petkova, Ofer Harel

摘要

Frontal power asymmetry (FA), a measure of brain function derived from electroencephalography, is a potential biomarker for major depressive disorder (MDD). Though FA is functional in nature, it is typically reduced to a scalar value prior to analysis, possibly obscuring its relationship with MDD and leading to a number of studies that have provided contradictory results. To overcome this issue, we sought to fit a functional regression model to characterize the association between FA and MDD status, adjusting for age, sex, cognitive ability, and handedness using data from a large clinical study that included both MDD and healthy control (HC) subjects. Since nearly 40% of the observations are missing data on either FA or cognitive ability, we propose an extension of multiple imputation (MI) by chained equations that allows for the imputation of both scalar and functional data. We also propose an extension of Rubin's Rules for conducting valid inference in this setting. The proposed methods are evaluated in a simulation and applied to our FA data. For our FA data, a pooled analysis from the imputed data sets yielded similar results to those of the complete case analysis. We found that, among young females, HCs tended to have higher FA over the θ, α, and β frequency bands, but that the difference between HC and MDD subjects diminishes and ultimately reverses with age. For males, HCs tended to have higher FA in the β frequency band, regardless of age. Young male HCs had higher FA in the θ and α bands, but this difference diminishes with increasing age in the α band and ultimately reverses with increasing age in the θ band. *(abstract via PubMed)*

JASA Spatial & Time Series · 发表于 2021-07-26

Correlation Tensor Decomposition and Its Application in Spatial Imaging Data

Yujia Deng, Xiwei Tang, Annie Qu

摘要

Multi-dimensional tensor data have gained increasing attention in the recent years, especially in biomedical imaging analyses. However, the most existing tensor models are only based on the mean information of imaging pixels. Motivated by multimodal optical imaging data in a breast cancer study, we develop a new tensor learning approach to use pixel-wise correlation information, which is represented through the higher order correlation tensor. We proposed a novel semi-symmetric correlation tensor decomposition method which effectively captures the informative spatial patterns of pixel-wise correlations to facilitate cancer diagnosis. We establish the theoretical properties for recovering structure and for classification consistency. In addition, we develop an efficient algorithm to achieve computational scalability. Our simulation studies and an application on breast cancer imaging data all indicate that the proposed method outperforms other competing methods in terms of pattern recognition and prediction accuracy. *(abstract via OpenAlex)*

SiM Bayesian Methods Testing & Uncertainty · 发表于 2021-07-26

Bayes estimate of primary threshold in clusterwise functional magnetic resonance imaging inferences

Yunjiang Ge, Stephanie Hare, Gang Chen, James A. Waltz, Peter Kochunov, L. Elliot Hong, Shuo Chen

摘要

Clusterwise statistical inference is the most widely used technique for functional magnetic resonance imaging (fMRI) data analyses. Clusterwise statistical inference consists of two steps: (i) primary thresholding that excludes less significant voxels by a prespecified cut‐off (eg, ); and (ii) clusterwise thresholding that controls the familywise error rate caused by clusters consisting of false positive suprathreshold voxels. The selection of the primary threshold is critical because it determines both statistical power and false discovery rate (FDR). However, in most existing statistical packages, the primary threshold is selected based on prior knowledge (eg, ) without taking into account the information in the data. In this article, we propose a data‐driven approach to algorithmically select the optimal primary threshold based on an empirical Bayes framework. We evaluate the proposed model using extensive simulation studies and real fMRI data. In the simulation, we show that our method can effectively increase statistical power by 20% to over 100% while effectively controlling the FDR. We then investigate the brain response to the dose‐effect of chlorpromazine in patients with schizophrenia by analyzing fMRI scans and generate consistent results.

JASA Other · 发表于 2021-07-26

Adaptive-to-Model Hybrid of Tests for Regressions

Lingzhu Li, Xuehu Zhu, Lixing Zhu

摘要

In model checking for regressions, nonparametric estimation-based tests usually have tractable limiting null distributions and are sensitive to oscillating alternative models, but suffer from the curse of dimensionality. In contrast, empirical process-based tests can, at the fastest possible rate, detect local alternatives distinct from the null model, yet are less sensitive to oscillating alternatives and rely on Monte Carlo approximation for critical value determination, which is costly in computation. We propose an adaptive-to-model hybrid of moment and conditional moment-based tests to fully inherit the merits of these two types of tests and avoid the shortcomings. Further, such a hybrid makes nonparametric estimation-based tests, under the alternatives, also share the merits of existing empirical process-based tests. The methodology can be readily applied to other kinds of data and construction of other hybrids. As a by-product in sufficient dimension reduction field, a study on residual-related central mean subspace and central subspace for model adaptation is devoted to showing when alternative models can be indicated and when cannot. Numerical studies are conducted to verify the powerfulness of the proposed test. *(abstract via OpenAlex)*

JASA Nonparametric & Semiparametric Spatial & Time Series · 发表于 2021-07-26

A Dynamic Interaction Semiparametric Function-on-Scalar Model

Hua Liu, Jinhong You, Jiguo Cao

摘要

Motivated by recent work studying massive functional data, such as the COVID-19 data, we propose a new dynamic interaction semiparametric function-on-scalar (DISeF) model. The proposed model is useful to explore the dynamic interaction among a set of covariates and their effects on the functional response. The proposed model includes many important models investigated recently as special cases. By tensor product B-spline approximating the unknown bivariate coefficient functions, a three-step efficient estimation procedure is developed to iteratively estimate bivariate varying-coefficient functions, the vector of index parameters, and the covariance functions of random effects. We also establish the asymptotic properties of the estimators including the convergence rate and their asymptotic distributions. In addition, we develop a test statistic to check whether the dynamic interaction varies with time/spatial locations, and we prove the asymptotic normality of the test statistic. The finite sample performance of our proposed method and of the test statistic are investigated with several simulation studies. Our proposed DISeF model is also used to analyze the COVID-19 data and the ADNI data. In both applications, hypothesis testing shows that the bivariate varying-coefficient functions significantly vary with the index and the time/spatial locations. For instance, we find that the interaction effect of the population aging and the socio-economic covariates, such as the number of hospital beds, physicians, nurses per 1000 people and GDP per capita, on the COVID-19 mortality rate varies in different periods of the COVID-19 pandemic. The healthcare infrastructure index related to the COVID-19 mortality rate is also obtained for 141 countries estimated based on the proposed DISeF model. *(abstract via OpenAlex)*

JRSSB High-Dimensional · 发表于 2021-07-24

Wang and Leng (2016), High-Dimensional Ordinary Least-Squares Projection for Screening Variables, Journal of The Royal Statistical Society Series B, 78, 589–611

Xiangyu Wang, Chenlei Leng, Tom Boot

摘要

The conclusion in Lemma 5 in the supplementary material (SM) of Wang and Leng (2016), on which Theorems 1-3 rely, is incorrect.Here we provide an additional condition under which the conclusion of this lemma holds.We assume that the rows of the matrix X follow a Gaussian distribution with precision matrix Ω = Σ -1 that satisfies c -1 4 n -∕2 ≤ min (Ω) ≤ max (Ω) ≤ c 4 n ∕2 .This implies the assumption on the condition number of Σ in Assumption A3.We drop the assumption that Σ ii = 1 (SM, Proposition 5).We append the assumptions in Wang and Leng (2016) with condition (C1) max j,k≠i | Ω ij -Ω ik | ≤ c 0 *(abstract via OpenAlex)*

SiM Bayesian Methods Clinical Trials · 发表于 2021-07-24

Unit information prior for adaptive information borrowing from multiple historical datasets

Huaqing Jin, Guosheng Yin

摘要

In clinical trials, there often exist multiple historical studies for the same or related treatment investigated in the current trial. Incorporating historical data in the analysis of the current study is of great importance, as it can help to gain more information, improve efficiency, and provide a more comprehensive evaluation of treatment. Enlightened by the unit information prior (UIP) concept in the reference Bayesian test, we propose a new informative prior called UIP from an information perspective that can adaptively borrow information from multiple historical datasets. We consider both binary and continuous data and also extend the new UIP to linear regression settings. Extensive simulation studies demonstrate that our method is comparable to other commonly used informative priors, while the interpretation of UIP is intuitive and its implementation is relatively easy. One distinctive feature of UIP is that its construction only requires summary statistics commonly reported in the literature rather than the patient‐level data. By applying our UIP to phase III clinical trials for investigating the efficacy of memantine in Alzheimer's disease, we illustrate its ability to adaptively borrow information from multiple historical datasets. The Python codes for simulation studies and the real data application are available at https://github.com/JINhuaqing/UIP.

SiM Survival Analysis High-Dimensional · 发表于 2021-07-24

Penalized regression for left‐truncated and right‐censored survival data

Sarah F. McGough, Devin Incerti, Svetlana Lyalina, Ryan Copping, Balasubramanian Narasimhan, Robert Tibshirani

摘要

High‐dimensional data are becoming increasingly common in the medical field as large volumes of patient information are collected and processed by high‐throughput screening, electronic health records, and comprehensive genomic testing. Statistical models that attempt to study the effects of many predictors on survival typically implement feature selection or penalized methods to mitigate the undesirable consequences of overfitting. In some cases survival data are also left‐truncated which can give rise to an immortal time bias, but penalized survival methods that adjust for left truncation are not commonly implemented. To address these challenges, we apply a penalized Cox proportional hazards model for left‐truncated and right‐censored survival data and assess implications of left truncation adjustment on bias and interpretation. We use simulation studies and a high‐dimensional, real‐world clinico‐genomic database to highlight the pitfalls of failing to account for left truncation in survival modeling.

JRSSB Testing & Uncertainty · 发表于 2021-07-24

Inference on the History of a Randomly Growing Tree

Harry Crane, Min Xu

摘要

The spread of infectious disease in a human community or the proliferation of fake news on social media can be modelled as a randomly growing tree-shaped graph. The history of the random growth process is often unobserved but contains important information such as the source of the infection. We consider the problem of statistical inference on aspects of the latent history using only a single snapshot of the final tree. Our approach is to apply random labels to the observed unlabelled tree and analyse the resulting distribution of the growth process, conditional on the final outcome. We show that this conditional distribution is tractable under a shape exchangeability condition, which we introduce here, and that this condition is satisfied for many popular models for randomly growing trees such as uniform attachment, linear preferential attachment and uniform attachment on a D-regular tree. For inference of the root under shape exchangeability, we propose O(n log n) time algorithms for constructing confidence sets with valid frequentist coverage as well as bounds on the expected size of the confidence sets. We also provide efficient sampling algorithms which extend our methods to a wide class of inference problems.

SiM Testing & Uncertainty Diagnostics & Prediction · 发表于 2021-07-24

Confidence intervals of prediction accuracy measures for multivariable prediction models based on the bootstrap‐based optimism correction methods

Hisashi Noma, Tomohiro Shinozaki, Katsuhiro Iba, Satoshi Teramukai, Toshi A. Furukawa

摘要

In assessing prediction accuracy of multivariable prediction models, optimism corrections are essential for preventing biased results. However, in most published papers of clinical prediction models, the point estimates of the prediction accuracy measures are corrected by adequate bootstrap‐based correction methods, but their confidence intervals are not corrected, for example, the DeLong's confidence interval is usually used for assessing the C ‐statistic. These naïve methods do not adjust for the optimism bias and do not account for statistical variability in the estimation of parameters in the prediction models. Therefore, their coverage probabilities of the true value of the prediction accuracy measure can be seriously below the nominal level (eg, 95%). In this article, we provide two generic bootstrap methods, namely, (1) location‐shifted bootstrap confidence intervals and (2) two‐stage bootstrap confidence intervals, that can be generally applied to the bootstrap‐based optimism correction methods, that is, the Harrell's bias correction, 0.632, and 0.632+ methods. In addition, they can be widely applied to various methods for prediction model development involving modern shrinkage methods such as the ridge and lasso regressions. Through numerical evaluations by simulations, the proposed confidence intervals showed favorable coverage performances. Besides, the current standard practices based on the optimism‐uncorrected methods showed serious undercoverage properties. To avoid erroneous results, the optimism‐uncorrected confidence intervals should not be used in practice, and the adjusted methods are recommended instead. We also developed the R package predboot for implementing these methods ( https://github.com/nomahi/predboot ). The effectiveness of the proposed methods are illustrated via applications to the GUSTO‐I clinical trial.

JASA Latent Variables & Mixtures · 发表于 2021-07-23

Estimation of the Number of Spiked Eigenvalues in a Covariance Matrix by Bulk Eigenvalue Matching Analysis

Zheng Tracy Ke, Yucong Ma, Xihong Lin

摘要

The spiked covariance model has gained increasing popularity in high-dimensional data analysis. A fundamental problem is determination of the number of spiked eigenvalues, K . For estimation of K , most attention has focused on the use of top eigenvalues of sample covariance matrix, and there is little investigation into proper ways of utilizing bulk eigenvalues to estimate K . We propose a principled approach to incorporating bulk eigenvalues in the estimation of K . Our method imposes a working model on the residual covariance matrix, which is assumed to be a diagonal matrix whose entries are drawn from a gamma distribution. Under this model, the bulk eigenvalues are asymptotically close to the quantiles of a fixed parametric distribution. This motivates us to propose a two-step method: the first step uses bulk eigenvalues to estimate parameters of this distribution, and the second step leverages these parameters to assist the estimation of K . The resulting estimator K ˆ aggregates information in a large number of bulk eigenvalues. We show the consistency of K ˆ under a standard spiked covariance model. We also propose a confidence interval estimate for K . Our extensive simulation studies show that the proposed method is robust and outperforms the existing methods in a range of scenarios. We apply the proposed method to analysis of a lung cancer microarray data set and the 1000 Genomes data set. *(abstract via PubMed)*

JASA Other · 发表于 2021-07-23

Earthquake Risk Embedded in Property Prices: Evidence From Five Japanese Cities

Masako Ikefuji, Roger J. A. Laeven, Jan R. Magnus, Yuan Yue

摘要

We analyze the impact of short-run (90 days) and long-run (30 years) earthquake risk on real estate transaction prices in five Japanese cities (Tokyo, Osaka, Nagoya, Fukuoka, and Sapporo), using quarterly data over the period 2006–2015. We exploit a rich panel dataset (331,343 observations) with property characteristics, ward attractiveness information, macroeconomic variables, and long-run seismic hazard data, supplemented with short-run earthquake probabilities generated from a seismic excitation model using historical earthquake occurrences. We design a hedonic property price model that allows for subjective probability weighting, employ a multivariate error components structure, and develop associated maximum likelihood estimation and variance computation procedures. Our approach enables us to identify the total compensation for earthquake risk embedded in property prices, to decompose this into pieces stemming from short-run and long-run risk, and to distinguish between objective and subjectively weighted (“distorted”) earthquake probabilities. We find that objective long-run earthquake probabilities have a statistically significant negative impact on property prices, whereas short-run earthquake probabilities become statistically significant only when we allow them to be distorted. The total compensation for earthquake risk amounts to an average –2.0% of log property prices, slightly more than the annual income of a middle-income Japanese household. 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)*

JRSSB High-Dimensional · 发表于 2021-07-22

Modelling High-Dimensional Categorical Data using Nonconvex Fusion Penalties

Benjamin G. Stokell, Rajen D. Shah, Ryan J. Tibshirani

摘要

We propose a method for estimation in high-dimensional linear models with nominal categorical data. Our estimator, called SCOPE, fuses levels together by making their corresponding coefficients exactly equal. This is achieved using the minimax concave penalty on differences between the order statistics of the coefficients for a categorical variable, thereby clustering the coefficients. We provide an algorithm for exact and efficient computation of the global minimum of the resulting nonconvex objective in the case with a single variable with potentially many levels, and use this within a block coordinate descent procedure in the multivariate case. We show that an oracle least squares solution that exploits the unknown level fusions is a limit point of the coordinate descent with high probability, provided the true levels have a certain minimum separation; these conditions are known to be minimal in the univariate case. We demonstrate the favourable performance of SCOPE across a range of real and simulated datasets. An R package CatReg implementing SCOPE for linear models and also a version for logistic regression is available on CRAN.

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