研究园简易版 · 经典书籍 · 期刊文章 · 有原文 · 完整版(可多选筛选、搜索) · 首页
2021 年的期刊文章 · 第 8 页
共 1542 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2021-10-01 到 2021-09-24。
按期刊、按主题看 →
AoS Nonparametric & Semiparametric Spatial & Time Series · 发表于 2021-10-01
Michaël Lalancette, Sebastian Engelke, Stanislav Volgushev
摘要
Multivariate extreme value theory is concerned with modeling the joint tail behavior of several random variables. Existing work mostly focuses on asymptotic dependence, where the probability of observing a large value in one of the variables is of the same order as observing a large value in all variables simultaneously. However, there is growing evidence that asymptotic independence is equally important in real world applications. Available statistical methodology in the latter setting is scarce and not well understood theoretically. We revisit nonparametric estimation and introduce rank-based M-estimators for parametric models that simultaneously work under asymptotic dependence and asymptotic independence, without requiring prior knowledge on which of the two regimes applies. Asymptotic normality of the proposed estimators is established under weak regularity conditions. We further show how bivariate estimators can be leveraged to obtain parametric estimators in spatial tail models, and again provide a thorough theoretical justification for our approach.
AoS Other · 发表于 2021-10-01
Francesco Ortelli, Sara van de Geer
摘要
We establish adaptive results for trend filtering: least squares estimation with a penalty on the total variation of (k−1)th order differences. Our approach is based on combining a general oracle inequality for the ℓ1-penalized least squares estimator with “interpolating vectors” to upper bound the “effective sparsity.” This allows one to show that the ℓ1-penalty on the kth order differences leads to an estimator that can adapt to the number of jumps in the (k−1)th order differences of the underlying signal or an approximation thereof. We show the result for k∈{1,2,3,4} and indicate how it could be derived for general k∈N.
AoS Latent Variables & Mixtures · 发表于 2021-10-01
Matthias Löffler, Anderson Y. Zhang, Harrison H. Zhou
摘要
Spectral clustering is one of the most popular algorithms to group high- dimensional data. It is easy to implement and computationally efficient. Despite its popularity and successful applications, its theoretical properties have not been fully understood. In this paper, we show that spectral clustering is minimax optimal in the Gaussian mixture model with isotropic covariance matrix, when the number of clusters is fixed and the signal-to-noise ratio is large enough. Spectral gap conditions are widely assumed in the literature to analyze spectral clustering. On the contrary, these conditions are not needed to establish optimality of spectral clustering in this paper.
AoS Testing & Uncertainty · 发表于 2021-10-01
Thomas B. Berrett, Ioannis Kontoyiannis, Richard J. Samworth
摘要
We study the problem of independence testing given independent and identically distributed pairs taking values in a σ-finite, separable measure space. Defining a natural measure of dependence D(f) as the squared L2-distance between a joint density f and the product of its marginals, we first show that there is no valid test of independence that is uniformly consistent against alternatives of the form {f:D(f)≥ρ2}. We therefore restrict attention to alternatives that impose additional Sobolev-type smoothness constraints, and define a permutation test based on a basis expansion and a U-statistic estimator of D(f) that we prove is minimax optimal in terms of its separation rates in many instances. Finally, for the case of a Fourier basis on [0,1]2, we provide an approximation to the power function that offers several additional insights. Our methodology is implemented in the R package USP.
AoS Bayesian Methods Nonparametric & Semiparametric Optimization & Learning Theory · 发表于 2021-10-01
Marta Catalano, Antonio Lijoi, Igor Prünster
摘要
The proposal and study of dependent Bayesian nonparametric models has been one of the most active research lines in the last two decades, with random vectors of measures representing a natural and popular tool to define them. Nonetheless, a principled approach to understand and quantify the associated dependence structure is still missing. We devise a general, and not model-specific, framework to achieve this task for random measure based models, which consists in: (a) quantify dependence of a random vector of probabilities in terms of closeness to exchangeability, which corresponds to the maximally dependent coupling with the same marginal distributions, that is, the comonotonic vector; (b) recast the problem in terms of the underlying random measures (in the same Fréchet class) and quantify the closeness to comonotonicity; (c) define a distance based on the Wasserstein metric, which is ideally suited for spaces of measures, to measure the dependence in a principled way. Several results, which represent the very first in the area, are obtained. In particular, useful bounds in terms of the underlying Lévy intensities are derived relying on compound Poisson approximations. These are then specialized to popular models in the Bayesian literature leading to interesting insights.
AoS Other · 发表于 2021-10-01
Snigdha Panigrahi, Jonathan Taylor, Asaf Weinstein
摘要
Inference after model selection has been an active research topic in the past few years, with numerous works offering different approaches to addressing the perils of the reuse of data. In particular, major progress has been made recently on large and useful classes of problems by harnessing general theory of hypothesis testing in exponential families, but these methods have their limitations. Perhaps most immediate is the gap between theory and practice: implementing the exact theoretical prescription in realistic situations—for example, when new data arrives and inference needs to be adjusted accordingly—may be a prohibitive task. In this paper, we propose a Bayesian framework for carrying out inference after variable selection. Our framework is very flexible in the sense that it naturally accommodates different models for the data instead of requiring a case-by-case treatment. This flexibility is achieved by considering the full selective likelihood function where, crucially, we propose a novel and nontrivial approximation to the exact but intractable expression. The advantages of our methods in practical data analysis are demonstrated in an application to HIV drug-resistance data.
AoS Diagnostics & Prediction · 发表于 2021-10-01
Zhantao Lin, Nancy Flournoy, William F. Rosenberger
摘要
Two-stage enrichment designs can be used to target the benefiting population in clinical trials based on patients’ biomarkers. In the case of continuous biomarkers, we show that using a bivariate model that treats biomarkers as random variables more accurately identifies a treatment-benefiting enriched population than assuming biomarkers are fixed. Additionally, we show that under the bivariate model, the maximum likelihood estimators (MLEs) follow a randomly scaled mixture of normal distributions. Using random normings, we obtain asymptotically standard normal MLEs and construct hypothesis tests. Finally, in a simulation study, we demonstrate that our proposed design is more powerful than a single stage design when outcomes and biomarkers are correlated; the model-based estimators have smaller bias and mean square error (MSE) than weighted average estimators.
AoS Causal Inference Latent Variables & Mixtures · 发表于 2021-10-01
Stephan Bongers, Patrick Forré, Jonas Peters, Joris M. Mooij
摘要
Structural causal models (SCMs), also known as (nonparametric) structural equation models (SEMs), are widely used for causal modeling purposes. In particular, acyclic SCMs, also known as recursive SEMs, form a well-studied subclass of SCMs that generalize causal Bayesian networks to allow for latent confounders. In this paper, we investigate SCMs in a more general setting, allowing for the presence of both latent confounders and cycles. We show that in the presence of cycles, many of the convenient properties of acyclic SCMs do not hold in general: they do not always have a solution; they do not always induce unique observational, interventional and counterfactual distributions; a marginalization does not always exist, and if it exists the marginal model does not always respect the latent projection; they do not always satisfy a Markov property; and their graphs are not always consistent with their causal semantics. We prove that for SCMs in general each of these properties does hold under certain solvability conditions. Our work generalizes results for SCMs with cycles that were only known for certain special cases so far. We introduce the class of simple SCMs that extends the class of acyclic SCMs to the cyclic setting, while preserving many of the convenient properties of acyclic SCMs. With this paper, we aim to provide the foundations for a general theory of statistical causal modeling with SCMs.
AoS Clinical Trials · 发表于 2021-10-01
Mathias Drton, Satoshi Kuriki, Peter Hoff
摘要
In matrix-valued datasets the sampled matrices often exhibit correlations among both their rows and their columns. A useful and parsimonious model of such dependence is the matrix normal model, in which the covariances among the elements of a random matrix are parameterized in terms of the Kronecker product of two covariance matrices, one representing row covariances and one representing column covariance. An appealing feature of such a matrix normal model is that the Kronecker covariance structure allows for standard likelihood inference even when only a very small number of data matrices is available. For instance, in some cases a likelihood ratio test of dependence may be performed with a sample size of one. However, more generally the sample size required to ensure boundedness of the matrix normal likelihood or the existence of a unique maximizer depends in a complicated way on the matrix dimensions. This motivates the study of how large a sample size is needed to ensure that maximum likelihood estimators exist, and exist uniquely with probability one. Our main result gives precise sample size thresholds in the paradigm where the number of rows and the number of columns of the data matrices differ by at most a factor of two. Our proof uses invariance properties that allow us to consider data matrices in canonical form, as obtained from the Kronecker canonical form for matrix pencils.
AoS Other · 发表于 2021-10-01
Vladimir Koltchinskii, Mayya Zhilova
摘要
Let X1,…,Xn be i.i.d. random variables sampled from a normal distribution N(μ,Σ) in Rd with unknown parameter θ=(μ,Σ)∈Θ:=Rd×C+d, where C+d is the cone of positively definite covariance operators in Rd. Given a smooth functional f:Θ↦R1, the goal is to estimate f(θ) based on X1,…,Xn. Let Θ(a;d):=Rd×{Σ∈C+d:σ(Σ)⊂[1/a,a]},a≥1, where σ(Σ) is the spectrum of covariance Σ. Let θˆ:=(μˆ,Σˆ), where μˆ is the sample mean and Σˆ is the sample covariance, based on the observations X1,…,Xn. For an arbitrary functional f∈Cs(Θ), s=k+1+ρ,k≥0,ρ∈(0,1], we define a functional fk:Θ↦R such that supθ∈Θ(a;d)‖fk(θˆ)−f(θ)‖L2(Pθ)≲s,β‖f‖Cs(Θ)[(a n∨aβs( d n)s)∧1], where β=1 for k=0 and β>s−1 is arbitrary for k≥1. This error rate is minimax optimal and similar bounds hold for more general loss functions. If d=dn≤nα for some α∈(0,1) and s≥11−α, the rate becomes O(n−1/2). Moreover, for s>11−α, the estimator fk(θˆ) is shown to be asymptotically efficient. The crucial part of the construction of estimator fk(θˆ) is a bias reduction method studied in the paper for more general statistical models than normal.
AoS Nonparametric & Semiparametric Functional Data · 发表于 2021-10-01
John H. J. Einmahl, Johan Segers
摘要
For multivariate distributions in the domain of attraction of a max-stable distribution, the tail copula and the stable tail dependence function are equivalent ways to capture the dependence in the upper tail. The empirical versions of these functions are rank-based estimators whose inflated estimation errors are known to converge weakly to a Gaussian process that is similar in structure to the weak limit of the empirical copula process. We extend this multivariate result to continuous functional data by establishing the asymptotic normality of the estimators of the tail copula, uniformly over all finite subsets of at most D points (D fixed). An application for testing tail copula stationarity is presented. The main tool for deriving the result is the uniform asymptotic normality of all the D-variate tail empirical processes. The proof of the main result is nonstandard.
AoS Bayesian Methods High-Dimensional · 发表于 2021-10-01
Chris Sherlock, Alexandre H. Thiery, Andrew Golightly
摘要
Delayed-acceptance Metropolis–Hastings and delayed-acceptance pseudo-marginal Metropolis–Hastings algorithms can be applied when it is computationally expensive to calculate the true posterior or an unbiased stochastic approximation thereof, but a computationally cheap deterministic approximation is available. An initial accept–reject stage uses the cheap approximation for computing the Metropolis–Hastings ratio; proposals which are accepted at this stage are subjected to a further accept–reject step, which corrects for the error in the approximation. Since the expensive posterior, or the approximation thereof, is only evaluated for proposals which are accepted at the first stage, the cost of the algorithm is reduced and larger scalings may be used. We focus on the random walk Metropolis (RWM) and consider the delayed-acceptance RWM and the delayed-acceptance pseudo-marginal RWM. We provide a framework for incorporating relatively general deterministic approximations into the theoretical analysis of high-dimensional targets. Justified by diffusion-approximation arguments, we derive expressions for the limiting efficiency and acceptance rates in high-dimensional settings. Finally, these theoretical insights are leveraged to formulate practical guidelines for the efficient tuning of the algorithms. The robustness of these guidelines and predicted properties are verified against simulation studies, all of which are strictly outside of the domain of validity of our limit results.
AoS Meta-Analysis & Data Integration Testing & Uncertainty · 发表于 2021-10-01
Song Xi Chen, Liuhua Peng
摘要
This paper considers distributed statistical inference for general symmetric statistics in the context of massive data with efficient computation. Estimation efficiency and asymptotic distributions of the distributed statistics are provided, which reveal different results between the nondegenerate and degenerate cases, and show the number of the data subsets plays an important role. Two distributed bootstrap methods are proposed and analyzed to approximation the underlying distribution of the distributed statistics with improved computation efficiency over existing methods. The accuracy of the distributional approximation by the bootstrap are studied theoretically. One of the methods, the pseudo-distributed bootstrap, is particularly attractive if the number of datasets is large as it directly resamples the subset-based statistics, assumes less stringent conditions and its performance can be improved by studentization.
AoS Other · 发表于 2021-10-01
Shanqi Pang, Jing Wang, Dennis K. J. Lin, Min-Qian Liu
摘要
A considerable portion of the work on mixed orthogonal arrays applies specifically to arrays of strength 2. Although strength t=2 is arguably the most important case for statistical applications, there is an urgent need for better methods for t≥3. However, the knowledge on the existence of arrays for t≥3 is rather limited. In this paper, new construction methods for symmetric and asymmetric orthogonal arrays (OAs) with high strength are proposed by using lower strength orthogonal partitions of spaces and OAs. A positive answer is provided to the open problem in Hedayat, Sloane and Stufken (Orthogonal Arrays: Theory and Applications (1999) Springer) on developing better methods and tools for the construction of mixed orthogonal arrays with strength t≥3. Not only are the methods straightforward, but also they are useful for constructing symmetric or asymmetric OAs of arbitrary strengths, numbers of levels and various sizes. The constructed OAs can be utilized to generate more OAs. The resulting OAs have a high degree of flexibility and many other desirable properties. Some selective OAs are tabulated for practical uses.
AoS Missing Data & Measurement Error Optimization & Learning Theory · 发表于 2021-10-01
Yuxin Chen, Jianqing Fan, Cong Ma, Yuling Yan
摘要
This paper delivers improved theoretical guarantees for the convex programming approach in low-rank matrix estimation, in the presence of (1) random noise, (2) gross sparse outliers and (3) missing data. This problem, often dubbed as robust principal component analysis (robust PCA), finds applications in various domains. Despite the wide applicability of convex relaxation, the available statistical support (particularly the stability analysis in the presence of random noise) remains highly suboptimal, which we strengthen in this paper. When the unknown matrix is well conditioned, incoherent and of constant rank, we demonstrate that a principled convex program achieves near-optimal statistical accuracy, in terms of both the Euclidean loss and the ℓ∞ loss. All of this happens even when nearly a constant fraction of observations are corrupted by outliers with arbitrary magnitudes. The key analysis idea lies in bridging the convex program in use and an auxiliary nonconvex optimization algorithm, and hence the title of this paper.
AoS Other · 发表于 2021-10-01
Jeong Min Jeon, Byeong U. Park, Ingrid Van Keilegom
摘要
Additive regression is studied in a very general setting where both the response and predictors are allowed to be non-Euclidean. The response takes values in a general separable Hilbert space, whereas the predictors take values in general semimetric spaces, which covers a very wide range of nonstandard response variables and predictors. A general framework of estimating additive models is presented for semimetric space-valued predictors. In particular, full details of implementation and the corresponding theory are given for predictors taking values in Hilbert spaces and/or Riemannian manifolds. The existence of the estimators, convergence of a backfitting algorithm, rates of convergence and asymptotic distributions of the estimators are discussed. The finite sample performance of the estimators is investigated by means of two simulation studies. Finally, three data sets covering several types of non-Euclidean data are analyzed to illustrate the usefulness of the proposed general approach.
AoS Other · 发表于 2021-10-01
Sabyasachi Chatterjee, Subhajit Goswami
摘要
Proposed by Donoho (Ann. Statist. 25 (1997) 1870–1911), Dyadic CART is a nonparametric regression method which computes a globally optimal dyadic decision tree and fits piecewise constant functions in two dimensions. In this article, we define and study Dyadic CART and a closely related estimator, namely Optimal Regression Tree (ORT), in the context of estimating piecewise smooth functions in general dimensions in the fixed design setup. More precisely, these optimal decision tree estimators fit piecewise polynomials of any given degree. Like Dyadic CART in two dimensions, we reason that these estimators can also be computed in polynomial time in the sample size N via dynamic programming. We prove oracle inequalities for the finite sample risk of Dyadic CART and ORT, which imply tight risk bounds for several function classes of interest. First, they imply that the finite sample risk of ORT of order r≥0 is always bounded by CklogN N whenever the regression function is piecewise polynomial of degree r on some reasonably regular axis aligned rectangular partition of the domain with at most k rectangles. Beyond the univariate case, such guarantees are scarcely available in the literature for computationally efficient estimators. Second, our oracle inequalities uncover minimax rate optimality and adaptivity of the Dyadic CART estimator for function spaces with bounded variation. We consider two function spaces of recent interest where multivariate total variation denoising and univariate trend filtering are the state of the art methods. We show that Dyadic CART enjoys certain advantages over these estimators while still maintaining all their known guarantees.
Biometrika Networks & Graphs · 发表于 2021-09-29
Hoseung Song, Hao Chen
摘要
Summary: A nonparametric framework for changepoint detection, based on scan statistics utilizing graphs that represent similarities among observations, is gaining attention owing to its flexibility and good performance for high-dimensional and non-Euclidean data sequences. However, this graph-based framework faces challenges when there are repeated observations in the sequence, which is often the case for discrete data such as network data. In this article we extend the graph-based framework to solve this problem by averaging or taking the union of all possible optimal graphs resulting from repeated observations. We consider both the single-changepoint alternative and the changed-interval alternative, and derive analytical formulas to control the Type I error for the new methods, making them readily applicable to large datasets. The extended methods are illustrated on an application in detecting changes in a sequence of dynamic networks over time. All proposed methods are implemented in an $\texttt{R}$ package $\texttt{gSeg}$ available on CRAN.
SiM Missing Data & Measurement Error Clinical Trials · 发表于 2021-09-29
Tra My Pham, Ian R. White, Brennan C. Kahan, Tim P. Morris, Simon J. Stanworth, Gordon Forbes
摘要
Composite endpoints are commonly used to define primary outcomes in randomized controlled trials. A participant may be classified as meeting the endpoint if they experience an event in one or several components (eg, a favorable outcome based on a composite of being alive and attaining negative culture results in trials assessing tuberculosis treatments). Partially observed components that are not missing simultaneously complicate the analysis of the composite endpoint. An intuitive strategy frequently used in practice for handling missing values in the components is to derive the values of the composite endpoint from observed components when possible, and exclude from analysis participants whose composite endpoint cannot be derived. Alternatively, complete record analysis (CRA) (excluding participants with any missing components) or multiple imputation (MI) can be used. We compare a set of methods for analyzing a composite endpoint with partially observed components mathematically and by simulation, and apply these methods in a reanalysis of a published trial (TOPPS). We show that the derived composite endpoint can be missing not at random even when the components are missing completely at random. Consequently, the treatment effect estimated from the derived endpoint is biased while CRA results without the derived endpoint are valid. Missing at random mechanisms require MI of the components. We conclude that, although superficially attractive, deriving the composite endpoint from observed components should generally be avoided. Despite the potential risk of imputation model mis‐specification, MI of missing components is the preferred approach in this study setting.
SiM Other · 发表于 2021-09-28
Yolanda M. Gómez, Diego I. Gallardo, Jeremias Leão, Vinicius F. Calsavara
摘要
In this article, we discuss an extension of the classical negative binomial cure rate model with piecewise exponential distribution of the time to event for concurrent causes, which enables the modeling of monotonic and non‐monotonic hazard functions (ie, the shape of the hazard function is not assumed as in traditional parametric models). This approach produces a flexible cure rate model, depending on the choice of time partition. We discuss local influence on this negative binomial power piecewise exponential model. We report on Monte Carlo simulation studies and application of the model to real melanoma and leukemia datasets.
Biometrics Testing & Uncertainty · 发表于 2021-09-28
Andrew Whiteman
摘要
Chapman and Hall/CRC has published a practical and unique perspective textbook for statisticians, analysts, and consultants, "Statistics for Making Decisions" by Nicholas T. Longford.Making decisions is an important action in everyone's lives, and statistics can help us to provide the options for making a better decision depending on the limited information.However, the general statistical methods omit the client's perspective and value such as greatest benefits and least losses.In this book, the author incorporates the client's concern into the statistical methods to make the proper verdicts.Many examples in different subject areas help the reader to understand the statistical concepts.The book is organized into 12 chapters covering a wide range of statistical for making decision concepts.Chapter 1 emphasizes making decisions from the client's perspective rather than just the analyst's perspective, and the statistics are meaningful after a comprehensive assessment from each viewpoint.Chapter 2 broadly introduces the familiar approaches for statistical inference and making decisions, including estimation and hypothesis testing.The concept involves the frequentist, Bayesian, and fiducial paradigms.Chapter 3 uses the simple case, one cutpoint with two options for a parameter from the normal distribution, to introduce the notations, terminologies, and theories.Three straightforward loss functions, including constant, linear, and quadratic forms, are explored.The relationship between various loss functions and corresponding verdicts, equilibrium, cutpoint, and errors are explained.The unequivocal and impasse decision-making depends on the setting for the plausible range of loss ratio.The concepts are connected to the commonly used estimation and significant level for hypothesis testing.Two parameters case with plausible rectangles is also extended.Chapter 4 goes on the parameters from the nonnormal distributions, including t, F, binomial, beta, Poisson, and gamma distributions.Chapter 5 starts with the special *(abstract via OpenAlex)*
SiM Missing Data & Measurement Error · 发表于 2021-09-28
Kyunghee Han, Pamela A. Shaw, Thomas Lumley
摘要
Multiple imputation (MI) provides us with efficient estimators in model‐based methods for handling missing data under the true model. It is also well‐understood that design‐based estimators are robust methods that do not require accurately modeling the missing data; however, they can be inefficient. In any applied setting, it is difficult to know whether a missing data model may be good enough to win the bias‐efficiency trade‐off. Raking of weights is one approach that relies on constructing an auxiliary variable from data observed on the full cohort, which is then used to adjust the weights for the usual Horvitz‐Thompson estimator. Computing the optimally efficient raking estimator requires evaluating the expectation of the efficient score given the full cohort data, which is generally infeasible. We demonstrate MI as a practical method to compute a raking estimator that will be optimal. We compare this estimator to common parametric and semi‐parametric estimators, including standard MI. We show that while estimators, such as the semi‐parametric maximum likelihood and MI estimator, obtain optimal performance under the true model, the proposed raking estimator utilizing MI maintains a better robustness‐efficiency trade‐off even under mild model misspecification. We also show that the standard raking estimator, without MI, is often competitive with the optimal raking estimator. We demonstrate these properties through several numerical examples and provide a theoretical discussion of conditions for asymptotically superior relative efficiency of the proposed raking estimator.
Biometrics High-Dimensional Functional Data · 发表于 2021-09-27
Rahul Ghosal, Arnab Maity
摘要
We develop a new method for variable selection in a nonlinear additive function‐on‐scalar regression (FOSR) model. Existing methods for variable selection in FOSR have focused on the linear effects of scalar predictors, which can be a restrictive assumption in the presence of multiple continuously measured covariates. We propose a computationally efficient approach for variable selection in existing linear FOSR using functional principal component scores of the functional response and extend this framework to a nonlinear additive function‐on‐scalar model. The proposed method provides a unified and flexible framework for variable selection in FOSR, allowing nonlinear effects of the covariates. Numerical analysis using simulation study illustrates the advantages of the proposed method over existing variable selection methods in FOSR even when the underlying covariate effects are all linear. The proposed procedure is demonstrated on accelerometer data from the 2003–2004 cohorts of the National Health and Nutrition Examination Survey (NHANES) in understanding the association between diurnal patterns of physical activity and demographic, lifestyle, and health characteristics of the participants.
JASA High-Dimensional · 发表于 2021-09-27
Danielle C. Tucker, Yichao Wu, Hans-Georg Müller
摘要
Global Fréchet regression is an extension of linear regression to cover more general types of responses, such as distributions, networks, and manifolds, which are becoming more prevalent. In such models, predictors are Euclidean while responses are metric space valued. Predictor selection is of major relevance for regression modeling in the presence of multiple predictors but has not yet been addressed for Fréchet regression. Due to the metric space-valued nature of the responses, Fréchet regression models do not feature model parameters, and this lack of parameters makes it a major challenge to extend existing variable selection methods for linear regression to global Fréchet regression. In this work, we address this challenge and propose a novel variable selection method that overcomes it and has good practical performance. We provide theoretical support and demonstrate that the proposed variable selection method achieves selection consistency. We also explore the finite sample performance of the proposed method with numerical examples and data illustrations. *(abstract via OpenAlex)*
Biometrika Spatial & Time Series Testing & Uncertainty · 发表于 2021-09-27
Alexander Henzi, Johanna F Ziegel
摘要
Summary: Probability forecasts for binary events play a central role in many applications. Their quality is commonly assessed with proper scoring rules, which assign forecasts numerical scores such that a correct forecast achieves a minimal expected score. In this paper, we construct e-values for testing the statistical significance of score differences of competing forecasts in sequential settings. E-values have been proposed as an alternative to $p$-values for hypothesis testing, and they can easily be transformed into conservative $p$-values by taking the multiplicative inverse. The e-values proposed in this article are valid in finite samples without any assumptions on the data-generating processes. They also allow optional stopping, so a forecast user may decide to interrupt evaluation, taking into account the available data at any time, and still draw statistically valid inference, which is generally not true for classical $p$-value-based tests. In a case study on post-processing of precipitation forecasts, state-of-the-art forecast dominance tests and e-values lead to the same conclusions.
SMMR Nonparametric & Semiparametric Survival Analysis · 发表于 2021-09-27
Chew-Seng Chee, Il Do Ha, Byungtae Seo, Youngjo Lee
摘要
A consequence of using a parametric frailty model with nonparametric baseline hazard for analyzing clustered time-to-event data is that its regression coefficient estimates could be sensitive to the underlying frailty distribution. Recently, there has been a proposal for specifying both the baseline hazard and the frailty distribution nonparametrically, and estimating the unknown parameters by the maximum penalized likelihood method. Instead, in this paper, we propose the nonparametric maximum likelihood method for a general class of nonparametric frailty models, i.e. models where the frailty distribution is completely unspecified but the baseline hazard can be either parametric or nonparametric. The implementation of the estimation procedure can be based on a combination of either the Broyden–Fletcher–Goldfarb–Shanno or expectation-maximization algorithm and the constrained Newton algorithm with multiple support point inclusion. Simulation studies to investigate the performance of estimation of a regression coefficient by several different model-fitting methods were conducted. The simulation results show that our proposed regression coefficient estimator generally gives a reasonable bias reduction when the number of clusters is increased under various frailty distributions. Our proposed method is also illustrated with two data examples.
Biometrics Other · 发表于 2021-09-27
Jonas Moss, Riccardo De Bin
摘要
Publication bias and p ‐hacking are two well‐known phenomena that strongly affect the scientific literature and cause severe problems in meta‐analyses. Due to these phenomena, the assumptions of meta‐analyses are seriously violated and the results of the studies cannot be trusted. While publication bias is very often captured well by the weighting function selection model, p ‐hacking is much harder to model and no definitive solution has been found yet. In this paper, we advocate the selection model approach to model publication bias and propose a mixture model for p ‐hacking. We derive some properties for these models, and we compare them formally and through simulations. Finally, two real data examples are used to show how the models work in practice.
Biometrics Clinical Trials · 发表于 2021-09-27
Liwen Wu, Junyao Wang, Abdus S. Wahed
摘要
A sequential multiple assignment randomized trial (SMART) facilitates the comparison of multiple adaptive treatment strategies (ATSs) simultaneously. Previous studies have established a framework to test the homogeneity of multiple ATSs by a global Wald test through inverse probability weighting. SMARTs are generally lengthier than classical clinical trials due to the sequential nature of treatment randomization in multiple stages. Thus, it would be beneficial to add interim analyses allowing for an early stop if overwhelming efficacy is observed. We introduce group sequential methods to SMARTs to facilitate interim monitoring based on the multivariate chi‐square distribution. Simulation studies demonstrate that the proposed interim monitoring in SMART (IM‐SMART) maintains the desired type I error and power with reduced expected sample size compared to the classical SMART. Finally, we illustrate our method by reanalyzing a SMART assessing the effects of cognitive behavioral and physical therapies in patients with knee osteoarthritis and comorbid subsyndromal depressive symptoms.
SMMR Causal Inference Clinical Trials Longitudinal Data · 发表于 2021-09-27
Rhys Bowden, Andrew B Forbes, Jessica Kasza
摘要
In cluster-randomized trials, sometimes the effect of the intervention being studied differs between clusters, commonly referred to as treatment effect heterogeneity. In the analysis of stepped wedge and cluster-randomized crossover trials, it is possible to include terms in outcome regression models to allow for such treatment effect heterogeneity yet this is not frequently considered. Outside of some simulation studies of specific cases where the outcome is binary, the impact of failing to include terms for treatment effect heterogeneity on the variance of the treatment effect estimator is unknown. We analytically examine the impact of failing to include terms for treatment effect heterogeneity on the variance of the treatment effect estimator, when outcomes are continuous. Using analysis of variance and feasible generalized least squares we provide expressions for this variance. For both the cluster-randomized crossover design and the stepped wedge design, our analytic derivations indicate that failing to include treatment effect heterogeneity results in the estimates for variance of the treatment effect that are too small, leading to inflation of type I error rates. We therefore recommend assessing the sensitivity of sample size calculations and conclusions drawn from the analysis of cluster randomized trials to the inclusion of treatment effect heterogeneity.
SiM Survival Analysis · 发表于 2021-09-27
F. Scott Dahlgren, Ivo M. Foppa, Melissa S. Stockwell, Celibell Y. Vargas, Philip LaRussa, Carrie Reed
摘要
People living within the same household as someone ill with influenza are at increased risk of infection. Here, we use Markov chain Monte Carlo methods to partition the hazard of influenza illness within a cohort into the hazard from the community and the hazard from the household. During the 2013‐2014 influenza season, 49 (4.7%) of the 1044 people enrolled in a community surveillance cohort had an acute respiratory illness (ARI) attributable to influenza. During the 2014‐2015 influenza season, 50 (4.7%) of the 1063 people in the cohort had an ARI attributable to influenza. The secondary attack rate from a household member was 2.3% for influenza A (H1) during 2013‐2014, 5.3% for influenza B during 2013‐2014, and 7.6% for influenza A (H3) during 2014‐2015. Living in a household with a person ill with influenza increased the risk of an ARI attributable to influenza up to 350%, depending on the season and the influenza virus circulating within the household.
JASA Spatial & Time Series · 发表于 2021-09-27
Fabian Mies
摘要
Tests for structural breaks in time series should ideally be sensitive to breaks in the parameter of interest, while being robust to nuisance changes. Statistical analysis thus needs to allow for some form of nonstationarity under the null hypothesis of no change. In this article, estimators for integrated parameters of locally stationary time series are constructed and a corresponding functional central limit theorem is established, enabling change-point inference for a broad class of parameters under mild assumptions. The proposed framework covers all parameters which may be expressed as nonlinear functions of moments, for example kurtosis, autocorrelation, and coefficients in a linear regression model. To perform feasible inference based on the derived limit distribution, a bootstrap variant is proposed and its consistency is established. The methodology is illustrated by means of a simulation study and by an application to high-frequency asset prices. *(abstract via OpenAlex)*
Biometrics Survival Analysis Causal Inference Clinical Trials · 发表于 2021-09-27
Torben Martinussen, Mats Julius Stensrud
摘要
Many research questions involve time‐to‐event outcomes that can be prevented from occurring due to competing events. In these settings, we must be careful about the causal interpretation of classical statistical estimands. In particular, estimands on the hazard scale, such as ratios of cause‐specific or subdistribution hazards, are fundamentally hard to interpret causally. Estimands on the risk scale, such as contrasts of cumulative incidence functions, do have a clear causal interpretation, but they only capture the total effect of the treatment on the event of interest; that is, effects both through and outside of the competing event. To disentangle causal treatment effects on the event of interest and competing events, the separable direct and indirect effects were recently introduced. Here we provide new results on the estimation of direct and indirect separable effects in continuous time. In particular, we derive the nonparametric influence function in continuous time and use it to construct an estimator that has certain robustness properties. We also propose a simple estimator based on semiparametric models for the two cause‐specific hazard functions. We describe the asymptotic properties of these estimators and present results from simulation studies, suggesting that the estimators behave satisfactorily in finite samples. Finally, we reanalyze the prostate cancer trial from Stensrud et al. (2020).
SMMR Other 讨论 / 评论 · 发表于 2021-09-27
Carolin Vegvari, Sam Abbott, Frank Ball, Ellen Brooks-Pollock, Robert Challen, Benjamin S Collyer, Ciara Dangerfield, Julia R Gog, Katelyn M Gostic, Jane M Heffernan, T Déirdre Hollingsworth, Valerie Isham, Eben Kenah, Denis Mollison, Jasmina Panovska-Griffiths, Lorenzo Pellis, Michael G Roberts, Gianpaolo Scalia Tomba, Robin N Thompson, Pieter Trapman
摘要
Since the beginning of the COVID-19 pandemic, the reproduction number [Formula: see text] has become a popular epidemiological metric used to communicate the state of the epidemic. At its most basic, [Formula: see text] is defined as the average number of secondary infections caused by one primary infected individual. [Formula: see text] seems convenient, because the epidemic is expanding if [Formula: see text] and contracting if [Formula: see text]. The magnitude of [Formula: see text] indicates by how much transmission needs to be reduced to control the epidemic. Using [Formula: see text] in a naïve way can cause new problems. The reasons for this are threefold: (1) There is not just one definition of [Formula: see text] but many, and the precise definition of [Formula: see text] affects both its estimated value and how it should be interpreted. (2) Even with a particular clearly defined [Formula: see text], there may be different statistical methods used to estimate its value, and the choice of method will affect the estimate. (3) The availability and type of data used to estimate [Formula: see text] vary, and it is not always clear what data should be included in the estimation. In this review, we discuss when [Formula: see text] is useful, when it may be of use but needs to be interpreted with care, and when it may be an inappropriate indicator of the progress of the epidemic. We also argue that careful definition of [Formula: see text], and the data and methods used to estimate it, can make [Formula: see text] a more useful metric for future management of the epidemic.
SMMR Causal Inference Testing & Uncertainty Machine Learning · 发表于 2021-09-27
Chi Chang, Thomas Jaki, Muhammad Saad Sadiq, Alena Kuhlemeier, Daniel Feaster, Natalie Cole, Andrea Lamont, Daniel Oberski, Yasin Desai, M. Lee Van Horn, The Pooled Resource Open-Access ALS Clinical Trials Consortium
摘要
An important goal of personalized medicine is to identify heterogeneity in treatment effects and then use that heterogeneity to target the intervention to those most likely to benefit. Heterogeneity is assessed using the predicted individual treatment effects framework, and a permutation test is proposed to establish if significant heterogeneity is present given the covariates and predictive model or algorithm used for predicted individual treatment effects. We first show evidence for heterogeneity in the effects of treatment across an illustrative example data set. We then use simulations with two different predictive methods (linear regression model and Random Forests) to show that the permutation test has adequate type-I error control. Next, we use an example dataset as the basis for simulations to demonstrate the ability of the permutation test to find heterogeneity in treatment effects for a predicted individual treatment effects estimate as a function of both effect size and sample size. We find that the proposed test has good power for detecting heterogeneity in treatment effects when the heterogeneity was due primarily to a single predictor, or when it was spread across the predictors. Power was found to be greater for predictions from a linear model than from random forests. This non-parametric permutation test can be used to test for significant differences across individuals in predicted individual treatment effects obtained with a given set of covariates using any predictive method with no additional assumptions.
SiM Longitudinal Data Nonparametric & Semiparametric Survival Analysis · 发表于 2021-09-25
Lu You, Peihua Qiu
摘要
In many clinical studies, evaluating the association between longitudinal and survival outcomes is of primary concern. For analyzing data from such studies, joint modeling of longitudinal and survival data becomes an appealing approach. In some applications, there are multiple longitudinal outcomes whose longitudinal pattern is difficult to describe by a parametric form. For such applications, existing research on joint modeling is limited. In this article, we develop a novel joint modeling method to fill the gap. In the new method, a local polynomial mixed‐effects model is used for describing the nonparametric longitudinal pattern of the multiple longitudinal outcomes. Two model estimation procedures, that is, the local EM algorithm and the local penalized quasi‐likelihood estimation, are explored. Practical guidelines for choosing tuning parameters and for variable selection are provided. The new method is justified by some theoretical arguments and numerical studies.
SiM Other · 发表于 2021-09-24
Chenguang Wang, Gary L. Rosner, Tingting Bao, Nelson Lu, Wei‐Chen Chen, Heng Li, Ram Tiwari, Yunling Xu, Lilly Q. Yue
摘要
Performance goals are numerical target values pertaining to effectiveness or safety endpoints in single‐arm medical device clinical studies. Typically, performance goals are determined at the planning stage of the investigational study under consideration based on summarized outcome information from existing relevant clinical trials. In recent years, there is a growing interest in leveraging real‐world evidence in medical product development. In this article, we introduce a new method for proposing performance goals by leveraging real‐world evidence. The method applies entropy balancing to address possible patient dissimilarities between the study's target patient population and existing real‐world patients, and can take into account operation differences between clinical studies and real‐world clinical practice. An illustrative example is provided to demonstrate how to implement the proposed method for performance goal determination while leveraging real‐world evidence.
JASA Bayesian Methods Nonparametric & Semiparametric · 发表于 2021-09-24
Nikolaos Ignatiadis, Sujayam Saha, Dennis L. Sun, Omkar Muralidharan
摘要
We study empirical Bayes estimation of the effect sizes of $N$ units from $K$ noisy observations on each unit. We show that it is possible to achieve near-Bayes optimal mean squared error, without any assumptions or knowledge about the effect size distribution or the noise. The noise distribution can be heteroskedastic and vary arbitrarily from unit to unit. Our proposal, which we call Aurora, leverages the replication inherent in the $K$ observations per unit and recasts the effect size estimation problem as a general regression problem. Aurora with linear regression provably matches the performance of a wide array of estimators including the sample mean, the trimmed mean, the sample median, as well as James-Stein shrunk versions thereof. Aurora automates effect size estimation for Internet-scale datasets, as we demonstrate on data from a large technology firm. *(abstract via OpenAlex)*
JASA High-Dimensional · 发表于 2021-09-24
Le Zhou, Hui Zou
摘要
There is a vast amount of work on high-dimensional regression. The common starting point for the existing theoretical work is to assume the data generating model is a homoscedastic linear regression model with some sparsity structure. In reality the homoscedasticity assumption is often violated, and hence understanding the heteroscedasticity of the data is of critical importance. In this article we systematically study the estimation of a high-dimensional heteroscedastic regression model. In particular, the emphasis is on how to detect and estimate the heteroscedasticity effects reliably and efficiently. To this end, we propose a cross-fitted residual regression approach and prove the resulting estimator is selection consistent for heteroscedasticity effects and establish its rates of convergence. Our estimator has tuning parameters to be determined by the data in practice. We propose a novel high-dimensional BIC for tuning parameter selection and establish its consistency. This is the first high-dimensional BIC result under heteroscedasticity. The theoretical analysis is more involved in order to handle heteroscedasticity, and we develop a couple of interesting new concentration inequalities that are of independent interests. *(abstract via OpenAlex)*
JASA Optimization & Learning Theory · 发表于 2021-09-24
Yuxin Chen, Jianqing Fan, Bingyan Wang, Yuling Yan
摘要
We investigate the effectiveness of convex relaxation and nonconvex optimization in solving bilinear systems of equations under two different designs (i.e. a sort of random Fourier design and Gaussian design). Despite the wide applicability, the theoretical understanding about these two paradigms remains largely inadequate in the presence of random noise. The current paper makes two contributions by demonstrating that: (1) a two-stage nonconvex algorithm attains minimax-optimal accuracy within a logarithmic number of iterations, and (2) convex relaxation also achieves minimax-optimal statistical accuracy vis-à-vis random noise. Both results significantly improve upon the state-of-the-art theoretical guarantees. *(abstract via PubMed)*
JASA Meta-Analysis & Data Integration · 发表于 2021-09-24
Jianqing Fan, Yongyi Guo, Kaizheng Wang
摘要
When the data are stored in a distributed manner, direct applications of traditional statistical inference procedures are often prohibitive due to communication costs and privacy concerns. This paper develops and investigates two Communication-Efficient Accurate Statistical Estimators (CEASE), implemented through iterative algorithms for distributed optimization. In each iteration, node machines carry out computation in parallel and communicate with the central processor, which then broadcasts aggregated information to node machines for new updates. The algorithms adapt to the similarity among loss functions on node machines, and converge rapidly when each node machine has large enough sample size. Moreover, they do not require good initialization and enjoy linear converge guarantees under general conditions. The contraction rate of optimization errors is presented explicitly, with dependence on the local sample size unveiled. In addition, the improved statistical accuracy per iteration is derived. By regarding the proposed method as a multi-step statistical estimator, we show that statistical efficiency can be achieved in finite steps in typical statistical applications. In addition, we give the conditions under which the one-step CEASE estimator is statistically efficient. Extensive numerical experiments on both synthetic and real data validate the theoretical results and demonstrate the superior performance of our algorithms. *(abstract via PubMed)*