2020 年的期刊文章 · 第 3 页

共 1467 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2020-12-01 到 2020-11-24。

按期刊、按主题看 →

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

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

Test for high dimensional covariance matrices

Yuefeng Han, Wei Biao Wu

摘要

The paper introduces a new test for testing structures of covariances for high dimensional vectors and the data dimension can be much larger than the sample size. Under proper normalization, central and noncentral limit theorems are established. The asymptotic theory is attained without imposing any explicit restriction between data dimension and sample size. To facilitate the related statistical inference, we propose the balanced Rademacher weighted differencing scheme, which is also the delete-half jackknife, to approximate the distribution of the proposed test statistics. We also develop a new testing procedure for substructures of precision matrices. The simulation results show that the tests outperform the exiting methods both in terms of size and power. Our test procedure is applied to a colorectal cancer dataset.

AoS Other · 发表于 2020-12-01

Singularity, misspecification and the convergence rate of EM

Raaz Dwivedi, Nhat Ho, Koulik Khamaru, Martin J. Wainwright, Michael I. Jordan, Bin Yu

摘要

A line of recent work has analyzed the behavior of the Expectation-Maximization (EM) algorithm in the well-specified setting, in which the population likelihood is locally strongly concave around its maximizing argument. Examples include suitably separated Gaussian mixture models and mixtures of linear regressions. We consider over-specified settings in which the number of fitted components is larger than the number of components in the true distribution. Such mis-specified settings can lead to singularity in the Fisher information matrix, and moreover, the maximum likelihood estimator based on $n$ i.i.d. samples in $d$ dimensions can have a nonstandard $\mathcal{O}((d/n)^{\frac{1}{4}})$ rate of convergence. Focusing on the simple setting of two-component mixtures fit to a $d$-dimensional Gaussian distribution, we study the behavior of the EM algorithm both when the mixture weights are different (unbalanced case), and are equal (balanced case). Our analysis reveals a sharp distinction between these two cases: in the former, the EM algorithm converges geometrically to a point at Euclidean distance of $\mathcal{O}((d/n)^{\frac{1}{2}})$ from the true parameter, whereas in the latter case, the convergence rate is exponentially slower, and the fixed point has a much lower $\mathcal{O}((d/n)^{\frac{1}{4}})$ accuracy. Analysis of this singular case requires the introduction of some novel techniques: in particular, we make use of a careful form of localization in the associated empirical process, and develop a recursive argument to progressively sharpen the statistical rate.

AoS Testing & Uncertainty · 发表于 2020-12-01

Simultaneous high-probability bounds on the false discovery proportion in structured, regression and online settings

Eugene Katsevich, Aaditya Ramdas

摘要

While traditional multiple testing procedures prohibit adaptive analysis choices made by users, Goeman and Solari (Statist. Sci. 26 (2011) 584–597) proposed a simultaneous inference framework that allows users such flexibility while preserving high-probability bounds on the false discovery proportion (FDP) of the chosen set. In this paper, we propose a new class of such simultaneous FDP bounds, tailored for nested sequences of rejection sets. While most existing simultaneous FDP bounds are based on closed testing using global null tests based on sorted $p$-values, we additionally consider the setting where side information can be leveraged to boost power, the variable selection setting where knockoff statistics can be used to order variables, and the online setting where decisions about rejections must be made as data arrives. Our finite-sample, closed form bounds are based on repurposing the FDP estimates from false discovery rate (FDR) controlling procedures designed for each of the above settings. These results establish a novel connection between the parallel literatures of simultaneous FDP bounds and FDR control methods, and use proof techniques employing martingales and filtrations that are new to both these literatures. We demonstrate the utility of our results by augmenting a recent knockoffs analysis of the UK Biobank dataset.

AoS Nonparametric & Semiparametric · 发表于 2020-12-01

Robust multivariate nonparametric tests via projection averaging

Ilmun Kim, Sivaraman Balakrishnan, Larry Wasserman

摘要

In this work, we generalize the Cramér–von Mises statistic via projection averaging to obtain a robust test for the multivariate two-sample problem. The proposed test is consistent against all fixed alternatives, robust to heavy-tailed data and minimax rate optimal against a certain class of alternatives. Our test statistic is completely free of tuning parameters and is computationally efficient even in high dimensions. When the dimension tends to infinity, the proposed test is shown to have comparable power to the existing high-dimensional mean tests under certain location models. As a by-product of our approach, we introduce a new metric called the angular distance which can be thought of as a robust alternative to the Euclidean distance. Using the angular distance, we connect the proposed method to the reproducing kernel Hilbert space approach. In addition to the Cramér–von Mises statistic, we demonstrate that the projection-averaging technique can be used to define robust multivariate tests in many other problems.

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

Robust Bayes-like estimation: Rho-Bayes estimation

Yannick Baraud, Lucien Birgé

摘要

We observe $n$ independent random variables with joint distribution ${\mathbf{P}}$ and pretend that they are i.i.d. with some common density $s$ (with respect to a known measure $\mu $) that we wish to estimate. We consider a density model $\overline{S}$ for $s$ that we endow with a prior distribution $\pi $ (with support in $\overline{S}$) and build a robust alternative to the classical Bayes posterior distribution which possesses similar concentration properties around $s$ whenever the data are truly i.i.d. and their density $s$ belongs to the model $\overline{S}$. Furthermore, in this case, the Hellinger distance between the classical and the robust posterior distributions tends to 0, as the number of observations tends to infinity, under suitable assumptions on the model and the prior. However, unlike what happens with the classical Bayes posterior distribution, we show that the concentration properties of this new posterior distribution are still preserved when the model is misspecified or when the data are not i.i.d. but the marginal densities of their joint distribution are close enough in Hellinger distance to the model $\overline{S}$.

AoS Other · 发表于 2020-12-01

Optimal rates of entropy estimation over Lipschitz balls

Yanjun Han, Jiantao Jiao, Tsachy Weissman, Yihong Wu

摘要

We consider the problem of minimax estimation of the entropy of a density over Lipschitz balls. Dropping the usual assumption that the density is bounded away from zero, we obtain the minimax rates $(n\ln n)^{-s/(s+d)}+n^{-1/2}$ for $0<s\leq 2$ for densities supported on $[0,1]^{d}$, where $s$ is the smoothness parameter and $n$ is the number of independent samples. We generalize the results to densities with unbounded support: given an Orlicz functions $\Psi $ of rapid growth (such as the subexponential and sub-Gaussian classes), the minimax rates for densities with bounded $\Psi $-Orlicz norm increase to $(n\ln n)^{-s/(s+d)}(\Psi ^{-1}(n))^{d(1-d/p(s+d))}+n^{-1/2}$, where $p$ is the norm parameter in the Lipschitz ball. We also show that the integral-form plug-in estimators with kernel density estimates fail to achieve the minimax rates, and characterize their worst case performances over the Lipschitz ball. One of the key steps in analyzing the bias relies on a novel application of the Hardy–Littlewood maximal inequality, which also leads to a new inequality on the Fisher information that may be of independent interest.

AoS Nonparametric & Semiparametric · 发表于 2020-12-01

Optimal estimation of variance in nonparametric regression with random design

Yandi Shen, Chao Gao, Daniela Witten, Fang Han

摘要

Consider the heteroscedastic nonparametric regression model with random design \begin{equation*}Y_{i}=f(X_{i})+V^{1/2}(X_{i})\varepsilon _{i},\quad i=1,2,\ldots ,n,\end{equation*} with $f(\cdot )$ and $V(\cdot )$ $\alpha $- and $\beta $-Hölder smooth, respectively. We show that the minimax rate of estimating $V(\cdot )$ under both local and global squared risks is of the order \begin{equation*}n^{-\frac{8\alpha \beta }{4\alpha \beta +2\alpha +\beta }}\vee n^{-\frac{2\beta }{2\beta +1}},\end{equation*} where $a\vee b:=\max \{a,b\}$ for any two real numbers $a$, $b$. This result extends the fixed design rate $n^{-4\alpha }\vee n^{-2\beta /(2\beta +1)}$ derived in (Ann. Statist. 36 (2008) 646–664) in a nontrivial manner, as indicated by the appearances of both $\alpha $ and $\beta $ in the first term. In the special case of constant variance, we show that the minimax rate is $n^{-8\alpha /(4\alpha +1)}\vee n^{-1}$ for variance estimation, which further implies the same rate for quadratic functional estimation and thus unifies the minimax rate under the nonparametric regression model with those under the density model and the white noise model. To achieve the minimax rate, we develop a U-statistic-based local polynomial estimator and a lower bound that is constructed over a specified distribution family of randomness designed for both $\varepsilon _{i}$ and $X_{i}$.

AoS Nonparametric & Semiparametric · 发表于 2020-12-01

Nonparametric drift estimation for i.i.d. paths of stochastic differential equations

Fabienne Comte, Valentine Genon-Catalot

摘要

We consider $N$ independent stochastic processes $(X_{i}(t),t\in [0,T])$, $i=1,\ldots ,N$, defined by a one-dimensional stochastic differential equation, which are continuously observed throughout a time interval $[0,T]$ where $T$ is fixed. We study nonparametric estimation of the drift function on a given subset $A$ of ${\mathbb{R}}$. Projection estimators are defined on finite dimensional subsets of ${\mathbb{L}}^{2}(A,dx)$. We stress that the set $A$ may be compact or not and the diffusion coefficient may be bounded or not. A data-driven procedure to select the dimension of the projection space is proposed where the dimension is chosen within a random collection of models. Upper bounds of risks are obtained, the assumptions are discussed and simulation experiments are reported.

SMMR Testing & Uncertainty Bayesian Methods · 发表于 2020-12-01

Monte Carlo approaches to frequentist multiplicity-adjusted benefiting subgroup identification

Patrick M Schnell

摘要

One common goal of subgroup analyses is to determine the subgroup of the population for which a given treatment is effective. Like most problems in subgroup analyses, this benefiting subgroup identification requires careful attention to multiple testing considerations, especially Type I error inflation. To partially address these concerns, the credible subgroups approach provides a pair of bounding subgroups for the benefiting subgroup, constructed so that with high posterior probability one is contained by the benefiting subgroup while the other contains the benefiting subgroup. To date, this approach has been presented within the Bayesian paradigm only, and requires sampling from the posterior of a Bayesian model. Additionally, in many cases, such as regulatory submission, guarantees of frequentist operating characteristics are helpful or necessary. We present Monte Carlo approaches to constructing confidence subgroups, frequentist analogues to credible subgroups that replace the posterior distribution with an estimate of the joint distribution of personalized treatment effect estimates, and yield frequentist interpretations and coverage guarantees. The estimated joint distribution is produced using either draws from asymptotic sampling distributions of estimated model parameters, or bootstrap resampling schemes. The approach is applied to a publicly available dataset from randomized trials of Alzheimer’s disease treatments.

AoS Networks & Graphs Bayesian Methods Causal Inference · 发表于 2020-12-01

Model selection and local geometry

Robin J. Evans

摘要

We consider problems in model selection caused by the geometry of models close to their points of intersection. In some cases—including common classes of causal or graphical models, as well as time series models—distinct models may nevertheless have identical tangent spaces. This has two immediate consequences: first, in order to obtain constant power to reject one model in favour of another we need local alternative hypotheses that decrease to the null at a slower rate than the usual parametric $n^{-1/2}$ (typically we will require $n^{-1/4}$ or slower); in other words, to distinguish between the models we need large effect sizes or very large sample sizes. Second, we show that under even weaker conditions on their tangent cones, models in these classes cannot be made simultaneously convex by a reparameterization. This shows that Bayesian network models, amongst others, cannot be learned directly with a convex method similar to the graphical lasso. However, we are able to use our results to suggest methods for model selection that learn the tangent space directly, rather than the model itself. In particular, we give a generic algorithm for learning Bayesian network models.

AoS Other · 发表于 2020-12-01

Limit distribution theory for block estimators in multiple isotonic regression

Qiyang Han, Cun-Hui Zhang

摘要

We study limit distributions for the tuning-free max–min block estimator originally proposed in (Fokianos, Leucht and Neumann (2017)) in the problem of multiple isotonic regression, under both fixed lattice design and random design settings. We show that, if the regression function $f_{0}$ admits vanishing derivatives up to order $\alpha_{k}$ along the $k$th dimension ($k=1,\ldots,d$) at a fixed point $x_{0}\in(0,1)^{d}$, and the errors have variance $\sigma^{2}$, then the max–min block estimator $\hat{f}_{n}$ satisfies \begin{equation*}\bigl(n_{\ast}/\sigma^{2}\bigr)^{\frac{1}{2+\sum_{k\in\mathcal{D}_{\ast}}\alpha_{k}^{-1}}}\bigl(\hat{f}_{n}(x_{0})-f_{0}(x_{0})\bigr)\rightsquigarrow \mathbb{C}(f_{0},x_{0}).\end{equation*} Here, $\mathcal{D}_{\ast},n_{\ast}$, depending on $\{\alpha_{k}\}$ and the design points, are the set of all “effective dimensions” and the size of “effective samples” that drive the asymptotic limiting distribution, respectively. If furthermore either $\{\alpha_{k}\}$ are relative primes to each other or all mixed derivatives of $f_{0}$ of certain critical order vanish at $x_{0}$, then the limiting distribution can be represented as $\mathbb{C}(f_{0},x_{0})=_{d}K(f_{0},x_{0})\cdot\mathbb{D}_{\boldsymbol{\alpha}}$, where $K(f_{0},x_{0})$ is a constant depending on the local structure of the regression function $f_{0}$ at $x_{0}$, and $\mathbb{D}_{\boldsymbol{\alpha}}$ is a nonstandard limiting distribution generalizing the well-known Chernoff distribution in univariate problems. The above limit theorem is also shown to be optimal both in terms of the local rate of convergence and the dependence on the unknown regression function whenever such dependence is explicit (i.e., $K(f_{0},x_{0})$), for the full range of $\{\alpha_{k}\}$ in a local asymptotic minimax sense. There are two interesting features in our local theory. First, the max–min block estimator automatically adapts to the local smoothness and the intrinsic dimension of the isotonic regression function at the optimal rate. Second, the optimally adaptive local rates are in general not the same in fixed lattice and random designs. In fact, the local rate in the fixed lattice design case is no slower than that in the random design case, and can be much faster when the local smoothness levels of the isotonic regression function or the sizes of the lattice differ substantially along different dimensions.

SMMR Survival Analysis Longitudinal Data Nonparametric & Semiparametric · 发表于 2020-12-01

Joint analysis of multivariate interval-censored survival data and a time-dependent covariate

Di Wu, Chenxi Li

摘要

We develop a joint modeling method for multivariate interval-censored survival data and a time-dependent covariate that is intermittently measured with error. The joint model is estimated using nonparametric maximum likelihood estimation, which is carried out via an expectation–maximization algorithm, and the inference for finite-dimensional parameters is performed using bootstrap. We also develop a similar joint modeling method for univariate interval-censored survival data and a time-dependent covariate, which excels the existing methods in terms of model flexibility and interpretation. Simulation studies show that the model fitting and inference approaches perform very well under realistic sample sizes. We apply the method to a longitudinal study of dental caries in African-American children from low-income families in the city of Detroit, Michigan.

AoS Networks & Graphs · 发表于 2020-12-01

Isotonic regression in multi-dimensional spaces and graphs

Hang Deng, Cun-Hui Zhang

摘要

In this paper, we study minimax and adaptation rates in general isotonic regression. For uniform deterministic and random designs in $[0,1]^{d}$ with ${d\ge2}$ and $N(0,1)$ noise, the minimax rate for the $\ell_{2}$ risk is known to be bounded from below by $n^{-1/d}$ when the unknown mean function $f$ is nondecreasing and its range is bounded by a constant, while the least squares estimator (LSE) is known to nearly achieve the minimax rate up to a factor $(\log n)^{\gamma}$ where $n$ is the sample size, $\gamma=4$ in the lattice design and $\gamma=\max\{9/2,(d^{2}+d+1)/2\}$ in the random design. Moreover, the LSE is known to achieve the adaptation rate $(K/n)^{-2/d}\{1\vee\log(n/K)\}^{2\gamma}$ when $f$ is piecewise constant on $K$ hyperrectangles in a partition of $[0,1]^{d}$. Due to the minimax theorem, the LSE is identical on every design point to both the max-min and min-max estimators over all upper and lower sets containing the design point. This motivates our consideration of estimators which lie in-between the max-min and min-max estimators over possibly smaller classes of upper and lower sets, including a subclass of block estimators. Under a $q$th moment condition on the noise, we develop $\ell_{q}$ risk bounds for such general estimators for isotonic regression on graphs. For uniform deterministic and random designs in $[0,1]^{d}$ with $d\ge3$, our $\ell_{2}$ risk bound for the block estimator matches the minimax rate $n^{-1/d}$ when the range of $f$ is bounded and achieves the near parametric adaptation rate $(K/n)\{1\vee\log(n/K)\}^{d}$ when $f$ is $K$-piecewise constant. Furthermore, the block estimator possesses the following oracle property in variable selection: When $f$ depends on only a subset $S$ of variables, the $\ell_{2}$ risk of the block estimator automatically achieves up to a poly-logarithmic factor the minimax rate based on the oracular knowledge of $S$.

AoS Other · 发表于 2020-12-01

Irreducibility and geometric ergodicity of Hamiltonian Monte Carlo

Alain Durmus, Éric Moulines, Eero Saksman

摘要

Hamiltonian Monte Carlo (HMC) is currently one of the most popular Markov Chain Monte Carlo algorithms to sample smooth distributions over continuous state space. This paper discusses the irreducibility and geometric ergodicity of the HMC algorithm. We consider cases where the number of steps of the Störmer–Verlet integrator is either fixed or random. Under mild conditions on the potential $U$ associated with target distribution $\pi$, we first show that the Markov kernel associated to the HMC algorithm is irreducible and positive recurrent. Under more stringent conditions, we then establish that the Markov kernel is Harris recurrent. We provide verifiable conditions on $U$ under which the HMC sampler is geometrically ergodic. Finally, we illustrate our results on several examples.

AoS Other · 发表于 2020-12-01

Inference for conditional value-at-risk of a predictive regression

Yi He, Yanxi Hou, Liang Peng, Haipeng Shen

摘要

Conditional value-at-risk is a popular risk measure in risk management. We study the inference problem of conditional value-at-risk under a linear predictive regression model. We derive the asymptotic distribution of the least squares estimator for the conditional value-at-risk. Our results relax the model assumptions made in (Oper. Res. 60 (2012) 739–756) and correct their mistake in the asymptotic variance expression. We show that the asymptotic variance depends on the quantile density function of the unobserved error and whether the model has a predictor with infinite variance, which makes it challenging to actually quantify the uncertainty of the conditional risk measure. To make the inference feasible, we then propose a smooth empirical likelihood based method for constructing a confidence interval for the conditional value-at-risk based on either independent errors or GARCH errors. Our approach not only bypasses the challenge of directly estimating the asymptotic variance but also does not need to know whether there exists an infinite variance predictor in the predictive model. Furthermore, we apply the same idea to the quantile regression method, which allows infinite variance predictors and generalizes the parameter estimation in (Econometric Theory 22 (2006) 173–205) to conditional value-at-risk in the Supplementary Material. We demonstrate the finite sample performance of the derived confidence intervals through numerical studies before applying them to real data.

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

High-dimensional consistent independence testing with maxima of rank correlations

Mathias Drton, Fang Han, Hongjian Shi

摘要

Testing mutual independence for high-dimensional observations is a fundamental statistical challenge. Popular tests based on linear and simple rank correlations are known to be incapable of detecting nonlinear, nonmonotone relationships, calling for methods that can account for such dependences. To address this challenge, we propose a family of tests that are constructed using maxima of pairwise rank correlations that permit consistent assessment of pairwise independence. Built upon a newly developed Cramér-type moderate deviation theorem for degenerate U-statistics, our results cover a variety of rank correlations including Hoeffding’s $D$, Blum–Kiefer–Rosenblatt’s $R$ and Bergsma–Dassios–Yanagimoto’s $\tau^{*}$. The proposed tests are distribution-free in the class of multivariate distributions with continuous margins, implementable without the need for permutation, and are shown to be rate-optimal against sparse alternatives under the Gaussian copula model. As a by-product of the study, we reveal an identity between the aforementioned three rank correlation statistics, and hence make a step towards proving a conjecture of Bergsma and Dassios.

AoS Spatial & Time Series Networks & Graphs · 发表于 2020-12-01

Fréchet change-point detection

Paromita Dubey, Hans-Georg Müller

摘要

We propose a method to infer the presence and location of change-points in the distribution of a sequence of independent data taking values in a general metric space, where change-points are viewed as locations at which the distribution of the data sequence changes abruptly in terms of either its Fréchet mean, Fréchet variance or both. The proposed method is based on comparisons of Fréchet variances before and after putative change-point locations and does not require a tuning parameter, except for the specification of cut-off intervals near the endpoints where change-points are assumed not to occur. Our results include theoretical guarantees for consistency of the test under contiguous alternatives when a change-point exists and also for consistency of the estimated location of the change-point, if it exists, where, under the null hypothesis of no change-point, the limit distribution of the proposed scan function is the square of a standardized Brownian bridge. These consistency results are applicable for a broad class of metric spaces under mild entropy conditions. Examples include the space of univariate probability distributions and the space of graph Laplacians for networks. Simulation studies demonstrate the effectiveness of the proposed methods, both for inferring the presence of a change-point and estimating its location. We also develop theory that justifies bootstrap-based inference and illustrate the new approach with sequences of maternal fertility distributions and communication networks.

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

Empirical Bayes oracle uncertainty quantification for regression

Eduard Belitser, Subhashis Ghosal

摘要

We propose an empirical Bayes method for high-dimensional linear regression models. Following an oracle approach that quantifies the error locally for each possible value of the parameter, we show that an empirical Bayes posterior contracts at the optimal rate at all parameters and leads to uniform size-optimal credible balls with guaranteed coverage under an “excessive bias restriction” condition. This condition gives rise to a new slicing of the entire space that is suitable for ensuring uniformity in uncertainty quantification. The obtained results immediately lead to optimal contraction and coverage properties for many conceivable classes simultaneously. The results are also extended to high-dimensional additive nonparametric regression models.

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

Distance-based and RKHS-based dependence metrics in high dimension

Changbo Zhu, Xianyang Zhang, Shun Yao, Xiaofeng Shao

摘要

In this paper, we study distance covariance, Hilbert–Schmidt covariance (aka Hilbert–Schmidt independence criterion [In Advances in Neural Information Processing Systems (2008) 585–592]) and related independence tests under the high dimensional scenario. We show that the sample distance/Hilbert–Schmidt covariance between two random vectors can be approximated by the sum of squared componentwise sample cross-covariances up to an asymptotically constant factor, which indicates that the standard distance/Hilbert–Schmidt covariance based test can only capture linear dependence in high dimension. Under the assumption that the components within each high dimensional vector are weakly dependent, the distance correlation based $t$ test developed by Székely and Rizzo (J. Multivariate Anal. 117 (2013) 193–213) for independence is shown to have trivial limiting power when the two random vectors are nonlinearly dependent but component-wisely uncorrelated. This new and surprising phenomenon, which seems to be discovered and carefully studied for the first time, is further confirmed in our simulation study. As a remedy, we propose tests based on an aggregation of marginal sample distance/Hilbert–Schmidt covariances and show their superior power behavior against their joint counterparts in simulations. We further extend the distance correlation based $t$ test to those based on Hilbert–Schmidt covariance and marginal distance/Hilbert–Schmidt covariance. A novel unified approach is developed to analyze the studentized sample distance/Hilbert–Schmidt covariance as well as the studentized sample marginal distance covariance under both null and alternative hypothesis. Our theoretical and simulation results shed light on the limitation of distance/Hilbert–Schmidt covariance when used jointly in the high dimensional setting and suggest the aggregation of marginal distance/Hilbert–Schmidt covariance as a useful alternative.

AoS Latent Variables & Mixtures Longitudinal Data · 发表于 2020-12-01

Clustering in Block Markov Chains

Jaron Sanders, Alexandre Proutière, Se-Young Yun

摘要

This paper considers cluster detection in Block Markov Chains (BMCs). These Markov chains are characterized by a block structure in their transition matrix. More precisely, the $n$ possible states are divided into a finite number of $K$ groups or clusters, such that states in the same cluster exhibit the same transition rates to other states. One observes a trajectory of the Markov chain, and the objective is to recover, from this observation only, the (initially unknown) clusters. In this paper, we devise a clustering procedure that accurately, efficiently and provably detects the clusters. We first derive a fundamental information-theoretical lower bound on the detection error rate satisfied under any clustering algorithm. This bound identifies the parameters of the BMC, and trajectory lengths, for which it is possible to accurately detect the clusters. We next develop two clustering algorithms that can together accurately recover the cluster structure from the shortest possible trajectories, whenever the parameters allow detection. These algorithms thus reach the fundamental detectability limit, and are optimal in that sense.

AoS Testing & Uncertainty · 发表于 2020-12-01

Beyond Gaussian approximation: Bootstrap for maxima of sums of independent random vectors

Hang Deng, Cun-Hui Zhang

AoS Other · 发表于 2020-12-01

Asymptotic joint distribution of extreme eigenvalues and trace of large sample covariance matrix in a generalized spiked population model

Zeng Li, Fang Han, Jianfeng Yao

摘要

This paper studies the joint limiting behavior of extreme eigenvalues and trace of large sample covariance matrix in a generalized spiked population model, where the asymptotic regime is such that the dimension and sample size grow proportionally. The form of the joint limiting distribution is applied to conduct Johnson–Graybill-type tests, a family of approaches testing for signals in a statistical model. For this, higher order correction is further made, helping alleviate the impact of finite-sample bias. The proof rests on determining the joint asymptotic behavior of two classes of spectral processes, corresponding to the extreme and linear spectral statistics, respectively.

AoS Causal Inference Econometrics & Economics · 发表于 2020-12-01

Assessment of the extent of corroboration of an elaborate theory of a causal hypothesis using partial conjunctions of evidence factors

Bikram Karmakar, Dylan S. Small

摘要

An elaborate theory of predictions of a causal hypothesis consists of several falsifiable statements derived from the causal hypothesis. Statistical tests for the various pieces of the elaborate theory help to clarify how much the causal hypothesis is corroborated. In practice, the degree of corroboration of the causal hypothesis has been assessed by a verbal description of which of the several tests provides evidence for which of the several predictions. This verbal approach can miss quantitative patterns. In this paper, we develop a quantitative approach. We first decompose these various tests of the predictions into independent factors with different sources of potential biases. Support for the causal hypothesis is enhanced when many of these evidence factors support the predictions. A sensitivity analysis is used to assess the potential bias that could make the finding of the tests spurious. Along with this multiparameter sensitivity analysis, we consider the partial conjunctions of the tests. These partial conjunctions quantify the evidence supporting various fractions of the collection of predictions. A partial conjunction test involves combining tests of the components in the partial conjunction. We find the asymptotically optimal combination of tests in the context of a sensitivity analysis. Our analysis of an elaborate theory of a causal hypothesis controls for the familywise error rate.

AoS Machine Learning Networks & Graphs Optimization & Learning Theory · 发表于 2020-12-01

Analysis of a two-layer neural network via displacement convexity

Adel Javanmard, Marco Mondelli, Andrea Montanari

摘要

Fitting a function by using linear combinations of a large number $N$ of “simple” components is one of the most fruitful ideas in statistical learning. This idea lies at the core of a variety of methods, from two-layer neural networks to kernel regression, to boosting. In general, the resulting risk minimization problem is nonconvex and is solved by gradient descent or its variants. Unfortunately, little is known about global convergence properties of these approaches. Here, we consider the problem of learning a concave function $f$ on a compact convex domain $\Omega \subset {\mathbb{R}}^{d}$, using linear combinations of “bump-like” components (neurons). The parameters to be fitted are the centers of $N$ bumps, and the resulting empirical risk minimization problem is highly nonconvex. We prove that, in the limit in which the number of neurons diverges, the evolution of gradient descent converges to a Wasserstein gradient flow in the space of probability distributions over $\Omega $. Further, when the bump width $\delta $ tends to $0$, this gradient flow has a limit which is a viscous porous medium equation. Remarkably, the cost function optimized by this gradient flow exhibits a special property known as displacement convexity, which implies exponential convergence rates for $N\to \infty $, $\delta \to 0$. Surprisingly, this asymptotic theory appears to capture well the behavior for moderate values of $\delta $, $N$. Explaining this phenomenon, and understanding the dependence on $\delta $, $N$ in a quantitative manner remains an outstanding challenge.

SiM Causal Inference · 发表于 2020-11-30

Six‐way decomposition of causal effects: Unifying mediation and mechanistic interaction

Yen‐Tsung Huang, An‐Shun Tai, Meng‐Ying Chou, Geng‐Xian Lin, Sheng‐Hsuan Lin

摘要

The sufficient component cause (SCC) model and counterfactual model are two common methods for causal inference, each with their own advantages: the SCC model allows the mechanistic interaction to be detailed, whereas the counterfactual model features a systemic framework for quantifying causal effects. Hence, integrating the SCC and counterfactual models may facilitate the conceptualization of causation. Based on the marginal SCC (mSCC) model, we propose a novel counterfactual mSCC framework that includes the steps of definition, identification, and estimation. We further propose a six‐way effect decomposition for assessing mediation and the mechanistic interaction. The results demonstrate that when all variables are binary, the six‐way decomposition is an extension of four‐way decomposition and that without agonism, the six‐way decomposition is reduced to four‐way decomposition. To illustrate the utility of the proposed decomposition, we apply it to a Taiwanese cohort to examine the mechanism of hepatitis C virus (HCV)‐induced hepatocellular carcinoma (HCC) with liver inflammation measured by alanine aminotransferase (ALT) as a mediator. Among the HCV‐induced HCC cases, 62.27% are not explained by either mediation or interaction in relation to ALT; 9.32% are purely mediated by ALT; 16.53% are caused by the synergistic effect of HCV and ALT; and 9.31% are due to the mediated synergistic effect of HCV and ALT. In summary, we introduce an SCC model framework based on counterfactual theory and detail the required identification assumptions and estimation procedures; we also propose a six‐way effect decomposition to unify mediation and mechanistic interaction analyses.

JASA Causal Inference · 发表于 2020-11-30

Learning When-to-Treat Policies

Xinkun Nie, Emma Brunskill, Stefan Wager

摘要

Many applied decision-making problems have a dynamic component: The policymaker needs not only to choose whom to treat, but also when to start which treatment. For example, a medical doctor may choose between postponing treatment (watchful waiting) and prescribing one of several available treatments during the many visits from a patient. We develop an “advantage doubly robust” estimator for learning such dynamic treatment rules using observational data under the assumption of sequential ignorability. We prove welfare regret bounds that generalize results for doubly robust learning in the single-step setting, and show promising empirical performance in several different contexts. Our approach is practical for policy optimization, and does not need any structural (e.g., Markovian) assumptions. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

SiM Causal Inference Longitudinal Data · 发表于 2020-11-30

Impact of discretization of the timeline for longitudinal causal inference methods

Steve Ferreira Guerra, Mireille E. Schnitzer, Amélie Forget, Lucie Blais

摘要

In longitudinal settings, causal inference methods usually rely on a discretization of the patient timeline that may not reflect the underlying data generation process. This article investigates the estimation of causal parameters under discretized data. It presents the implicit assumptions practitioners make but do not acknowledge when discretizing data to assess longitudinal causal parameters. We illustrate that differences in point estimates under different discretizations are due to the data coarsening resulting in both a modified definition of the parameter of interest and loss of information about time‐dependent confounders. We further investigate several tools to advise analysts in selecting a timeline discretization for use with pooled longitudinal targeted maximum likelihood estimation for the estimation of the parameters of a marginal structural model. We use a simulation study to empirically evaluate bias at different discretizations and assess the use of the cross‐validated variance as a measure of data support to select a discretization under a chosen data coarsening mechanism. We then apply our approach to a study on the relative effect of alternative asthma treatments during pregnancy on pregnancy duration. The results of the simulation study illustrate how coarsening changes the target parameter of interest as well as how it may create bias due to a lack of appropriate control for time‐dependent confounders. We also observe evidence that the cross‐validated variance acts well as a measure of support in the data, by being minimized at finer discretizations as the sample size increases.

SiM Clinical Trials · 发表于 2020-11-30

Design and analysis of three‐arm parallel cluster randomized trials with small numbers of clusters

Samuel I. Watson, Alan Girling, Karla Hemming

摘要

In this article, we review and evaluate a number of methods used in the design and analysis of small three‐arm parallel cluster randomized trials. We conduct a simulation‐based study to evaluate restricted randomization methods including covariate‐constrained randomization and a novel method for matched‐group cluster randomization. We also evaluate the appropriate modelling of the data and small sample inferential methods for a variety of treatment effects relevant to three‐arm trials. Our results indicate that small‐sample corrections are required for high (0.05) but not low (0.001) values of the intraclass correlation coefficient and their performance can depend on trial design, number of clusters, and the nature of the hypothesis being tested. The Satterthwaite correction generally performed best at an ICC of 0.05 with a nominal type I error rate for single‐period trials, and in trials with repeated measures type I error rates were between 0.04 and 0.06. Restricted randomization methods produce little benefit in trials with repeated measures but in trials with single post‐intervention design can provide relatively large gains in power when compared to the most unbalanced possible allocations. Matched‐group randomization improves power but is not as effective as covariate‐constrained randomization. For model‐based analysis, adjusting for fewer covariates than were used in a restricted randomization process under any design can produce non‐nominal type I error rates and reductions in power. Where comparisons to two‐arm cluster trials are possible, the performance of the methods is qualitatively very similar.

JASA Survival Analysis Bayesian Methods · 发表于 2020-11-30

BAGS: A Bayesian Adaptive Group Sequential Trial Design With Subgroup-Specific Survival Comparisons

Ruitao Lin, Peter F. Thall, Ying Yuan

摘要

A Bayesian group sequential design is proposed that performs survival comparisons within patient subgroups in randomized trials where treatment-subgroup interactions may be present. A latent subgroup membership variable is assumed to allow the design to adaptively combine homogeneous subgroups, or split heterogeneous subgroups, to improve the procedure's within-subgroup power. If a baseline covariate related to survival is available, the design may incorporate this information to improve subgroup identification while basing the comparative test on the average hazard ratio. General guidelines are provided for calibrating prior hyperparameters and design parameters to control the overall Type I error rate and optimize performance. Simulations show that the design is robust under a wide variety of different scenarios. When two or more subgroups are truly homogeneous but differ from the other subgroups, the proposed method is substantially more powerful than tests that either ignore subgroups or conduct a separate test within each subgroup. Supplementary materials for this article are available online. *(abstract via PubMed)*

SiM Other · 发表于 2020-11-30

A simplified approach for establishing estimable functions in fixed effectage‐period‐cohortmultiple classification models

Robert M. O'Brien

摘要

Estimable functions play an important role in learning about certain aspects of the impact of ages, periods, and cohorts in age‐period‐cohort multiple classification (APCMC) models. The advantage of these estimates is that they are unbiased estimates of, for example, the deviations of age, period, and cohort effects from their linear trends, or changes in the linear trends of cohort effects within cohorts, or the residuals of fixed effect APCMC models. If the fixed effect APCMC model contains the relevant variables (is well specified), these estimable functions are unbiased estimates of functions of the parameters that generated the dependent variable data, even though the parameters that generated that data are not identified. I provide a simplified approach to establishing which functions are estimable in fixed effect APCMC models that provides an intuitive understanding of estimable functions by showing clearly and simply why they are estimable. This approach involves the partitioning of the age, period, and cohort effects into linear components and deviations from the linear components; the use of the “line of solutions”; and of the “extended null vector.

Biometrika Other · 发表于 2020-11-27

Learning block structures in U-statistic-based matrices

Weiping Zhang, Baisuo Jin, Zhidong Bai

摘要

Summary: We introduce a conceptually simple, efficient and easily implemented approach for learning the block structure in a large matrix. Using the properties of U-statistics and large-dimensional random matrix theory, the group structure of many variables can be directly identified based on the eigenvalues and eigenvectors of the scaled sample matrix. We also establish the asymptotic properties of the proposed approach under mild conditions. The finite-sample performance of the approach is examined by extensive simulations and data examples.

SiM Diagnostics & Prediction Missing Data & Measurement Error · 发表于 2020-11-27

Error‐corrected estimation of a diagnostic accuracy index of a biomarker against a continuous gold standard

Mixia Wu, Xiaoyu Zhang, Wei Zhang, Xu Zhang, Aiyi Liu

摘要

This article concerns evaluating the effectiveness of a continuous diagnostic biomarker against a continuous gold standard that is measured with error. Extending the work of Obuchowski (2005, 2016), Wu et al (2016) suggested an accuracy index and proposed an estimator for the index with error‐prone standard when the reliability coefficient is known. Combining with additional measurements (without measurement errors) on the continuous gold standard collected from some subjects, this article proposes two adaptive estimators of the accuracy index when the reliability coefficient is unknown, and further establish the consistency and asymptotic normality of these estimators. Simulation studies are conducted to compare various estimators. Data from an intervention trial on glycemic control among children with type 1 diabetes are used to illustrate the proposed methods.

Biometrika Genetics & Omics Testing & Uncertainty · 发表于 2020-11-27

Covariate adaptive familywise error rate control for genome-wide association studies

Huijuan Zhou, Xianyang Zhang, Jun Chen

摘要

Summary: The familywise error rate has been widely used in genome-wide association studies. With the increasing availability of functional genomics data, it is possible to increase detection power by leveraging these genomic functional annotations. Previous efforts to accommodate covariates in multiple testing focused on false discovery rate control, while covariate-adaptive procedures controlling the familywise error rate remain underdeveloped. Here, we propose a novel covariate-adaptive procedure to control the familywise error rate that incorporates external covariates which are potentially informative of either the statistical power or the prior null probability. An efficient algorithm is developed to implement the proposed method. We prove its asymptotic validity and obtain the rate of convergence through a perturbation-type argument. Our numerical studies show that the new procedure is more powerful than competing methods and maintains robustness across different settings. We apply the proposed approach to the UK Biobank data and analyse 27 traits with 9 million single-nucleotide polymorphisms tested for associations. Seventy-five genomic annotations are used as covariates. Our approach detects more genome-wide significant loci than other methods in 21 out of the 27 traits.

SiM Survey & Sampling Causal Inference · 发表于 2020-11-26

Generalizing randomized trial findings to a target population using complex survey population data

Benjamin Ackerman, Catherine R. Lesko, Juned Siddique, Ryoko Susukida, Elizabeth A. Stuart

摘要

Randomized trials are considered the gold standard for estimating causal effects. Trial findings are often used to inform policy and programming efforts, yet their results may not generalize well to a relevant target population due to potential differences in effect moderators between the trial and population. Statistical methods have been developed to improve generalizability by combining trials and population data, and weighting the trial to resemble the population on baseline covariates. Large‐scale surveys in fields such as health and education with complex survey designs are a logical source for population data; however, there is currently no best practice for incorporating survey weights when generalizing trial findings to a complex survey. We propose and investigate ways to incorporate survey weights in this context. We examine the performance of our proposed estimator through simulations in comparison to estimators that ignore the complex survey design. We then apply the methods to generalize findings from two trials—a lifestyle intervention for blood pressure reduction and a web‐based intervention to treat substance use disorders—to their respective target populations using population data from complex surveys. The work highlights the importance in properly accounting for the complex survey design when generalizing trial findings to a population represented by a complex survey sample.

SMMR Bayesian Methods Survival Analysis · 发表于 2020-11-26

Bayesian mixture cure rate frailty models with an application to gastric cancer data

Ali Karamoozian, Mohammad Reza Baneshi, Abbas Bahrampour

摘要

Mixture cure rate models are commonly used to analyze lifetime data with long-term survivors. On the other hand, frailty models also lead to accurate estimation of coefficients by controlling the heterogeneity in survival data. Gamma frailty models are the most common models of frailty. Usually, the gamma distribution is used in the frailty random variable models. However, for survival data which are suitable for populations with a cure rate, it may be better to use a discrete distribution for the frailty random variable than a continuous distribution. Therefore, we proposed two models in this study. In the first model, continuous gamma as the distribution is used, and in the second model, discrete hyper-Poisson distribution is applied for the frailty random variable. Also, Bayesian inference with Weibull distribution and generalized modified Weibull distribution as the baseline distribution were used in the two proposed models, respectively. In this study, we used data of patients with gastric cancer to show the application of these models in real data analysis. The parameters and regression coefficients were estimated using the Metropolis with Gibbs sampling algorithm, so that this algorithm is one of the crucial techniques in Markov chain Monte Carlo simulation. A simulation study was also used to evaluate the performance of the Bayesian estimates to confirm the proposed models. Based on the results of the Bayesian inference, it was found that the model with generalized modified Weibull and hyper-Poisson distributions is a suitable model in practical study and also this model fits better than the model with Weibull and Gamma distributions.

SMMR Clinical Trials Bayesian Methods · 发表于 2020-11-26

Bayesian adaptive decision-theoretic designs for multi-arm multi-stage clinical trials

Andrea Bassi, Johannes Berkhof, Daphne de Jong, Peter M van de Ven

摘要

Multi-arm multi-stage clinical trials in which more than two drugs are simultaneously investigated provide gains over separate single- or two-arm trials. In this paper we propose a generic Bayesian adaptive decision-theoretic design for multi-arm multi-stage clinical trials with K ([Formula: see text]) arms. The basic idea is that after each stage a decision about continuation of the trial and accrual of patients for an additional stage is made on the basis of the expected reduction in loss. For this purpose, we define a loss function that incorporates the patient accrual costs as well as costs associated with an incorrect decision at the end of the trial. An attractive feature of our loss function is that its estimation is computationally undemanding, also when K > 2. We evaluate the frequentist operating characteristics for settings with a binary outcome and multiple experimental arms. We consider both the situation with and without a control arm. In a simulation study, we show that our design increases the probability of making a correct decision at the end of the trial as compared to nonadaptive designs and adaptive two-stage designs.

SiM Clinical Trials Bayesian Methods Optimization & Learning Theory · 发表于 2020-11-26

Adaptive enrichment trials: What are the benefits?

Thomas Burnett, Christopher Jennison

摘要

When planning a Phase III clinical trial, suppose a certain subset of patients is expected to respond particularly well to the new treatment. Adaptive enrichment designs make use of interim data in selecting the target population for the remainder of the trial, either continuing with the full population or restricting recruitment to the subset of patients. We define a multiple testing procedure that maintains strong control of the familywise error rate, while allowing for the adaptive sampling procedure. We derive the Bayes optimal rule for deciding whether or not to restrict recruitment to the subset after the interim analysis and present an efficient algorithm to facilitate simulation‐based optimisation, enabling the construction of Bayes optimal rules in a wide variety of problem formulations. We compare adaptive enrichment designs with traditional nonadaptive designs in a broad range of examples and draw clear conclusions about the potential benefits of adaptive enrichment.

SiM Other · 发表于 2020-11-25

Simulation model of disease incidence driven by diagnostic activity

Marcus Westerberg, Rolf Larsson, Lars Holmberg, Pär Stattin, Hans Garmo

摘要

It is imperative to understand the effects of early detection and treatment of chronic diseases, such as prostate cancer, regarding incidence, overtreatment and mortality. Previous simulation models have emulated clinical trials, and relied on extensive assumptions on the natural history of the disease. In addition, model parameters were typically calibrated to a variety of data sources. We propose a model designed to emulate real‐life scenarios of chronic disease using a proxy for the diagnostic activity without explicitly modeling the natural history of the disease and properties of clinical tests. Our model was applied to Swedish nation‐wide population‐based prostate cancer data, and demonstrated good performance in terms of reconstructing observed incidence and mortality. The model was used to predict the number of prostate cancer diagnoses with a high or limited diagnostic activity between 2017 and 2060. In the long term, high diagnostic activity resulted in a substantial increase in the number of men diagnosed with lower risk disease, fewer men with metastatic disease, and decreased prostate cancer mortality. The model can be used for prediction of outcome, to guide decision‐making, and to evaluate diagnostic activity in real‐life settings with respect to overdiagnosis and prostate cancer mortality.

SMMR Clinical Trials High-Dimensional Longitudinal Data · 发表于 2020-11-24

Small sample sizes: A big data problem in high-dimensional data analysis

Frank Konietschke, Karima Schwab, Markus Pauly

摘要

In many experiments and especially in translational and preclinical research, sample sizes are (very) small. In addition, data designs are often high dimensional, i.e. more dependent than independent replications of the trial are observed. The present paper discusses the applicability of max t-test-type statistics (multiple contrast tests) in high-dimensional designs (repeated measures or multivariate) with small sample sizes. A randomization-based approach is developed to approximate the distribution of the maximum statistic. Extensive simulation studies confirm that the new method is particularly suitable for analyzing data sets with small sample sizes. A real data set illustrates the application of the methods.

JASA Bayesian Methods Spatial & Time Series High-Dimensional · 发表于 2020-11-24

Highly Scalable Bayesian Geostatistical Modeling via Meshed Gaussian Processes on Partitioned Domains

Michele Peruzzi, Sudipto Banerjee, Andrew O. Finley

摘要

We introduce a class of scalable Bayesian hierarchical models for the analysis of massive geostatistical datasets. The underlying idea combines ideas on high-dimensional geostatistics by partitioning the spatial domain and modeling the regions in the partition using a sparsity-inducing directed acyclic graph (DAG). We extend the model over the DAG to a well-defined spatial process, which we call the Meshed Gaussian Process (MGP). A major contribution is the development of a MGPs on tessellated domains, accompanied by a Gibbs sampler for the efficient recovery of spatial random effects. In particular, the cubic MGP (Q-MGP) can harness high-performance computing resources by executing all large-scale operations in parallel within the Gibbs sampler, improving mixing and computing time compared to sequential updating schemes. Unlike some existing models for large spatial data, a Q-MGP facilitates massive caching of expensive matrix operations, making it particularly apt in dealing with spatiotemporal remote-sensing data. We compare Q-MGPs with large synthetic and real world data against state-of-the-art methods. We also illustrate using Normalized Difference Vegetation Index (NDVI) data from the Serengeti park region to recover latent multivariate spatiotemporal random effects at millions of locations. The source code is available at github.com/mkln/meshgp. *(abstract via PubMed)*

第 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 页