A fiducial approach for testing the non-inferiority of proportion difference in matched-pairs design

The non-inferiority of one treatment/drug to another is a common and important issue in medical and pharmaceutical fields. This study explored a fiducial approach for testing the non-inferiority of proportion difference in matched-pairs design. Approximate tests constructed using fiducial quantities with a combination of different parameters were proposed. Four simulation studies were employed to compare the performance of fiducial tests by comparing their type I errors and powers. The results showed that fiducial quantities with parameter $0.6\le w_1\le 0.8$ performed satisfactorily from small to large samples. Therefore, the fiducial tests could be recommended for practical applications. The recommended fiducial tests might be a competitive alternative to other available tests. Three real data sets were analyzed to illustrate the proposed methods were competitive or even better than other tests.     

Alone,together: On the benefits of Bayesian borrowing in a meta-analytic setting

It is common practice to use hierarchical Bayesian model for the informing of a pediatric randomized controlled trial (RCT) by adult data, using a prespecified borrowing fraction parameter (BFP). This implicitly assumes that the BFP is intuitive and corresponds to the degree of similarity between the populations. Generalizing this model to any $K\ge 1$ historical studies, naturally leads to empirical Bayes meta-analysis. In this paper we calculate the Bayesian BFPs and study the factors that drive them. We prove that simultaneous mean squared error reduction relative to an uninformed model is always achievable through application of this model. Power and sample size calculations for a future RCT, designed to be informed by multiple external RCTs, are also provided. Potential applications include inference on treatment efficacy from independent trials involving either heterogeneous patient populations or different therapies from a common class.     

Two-dimensional projection uniformity for space-filling designs

We investigate a space-filling criterion based on $L_2$-type discrepancies, namely the uniform projection criterion, aiming at improving designs' two-dimensional projection uniformity. Under a general reproducing kernel, we establish a formula for the uniform projection criterion function, which builds a connection between rows and columns of the design. For the commonly used discrepancies, we further use this formula to represent the two-dimensional projection uniformity in terms of the $L_p$-distances of U-type designs. These results generalize existing works and reveal new links between the two seemingly unrelated criteria of projection uniformity and the maximin $L_p$-distance for U-type designs. We also apply the obtained results to study several families of space-filling designs with appealing projection uniformity. Because of good projected space-filling properties, these designs are well adapted for computer experiments, especially for the case where not all the input factors are active.     

Asymptotic approximation of the likelihood of stationary determinantal point processes

Continuous determinantal point processes (DPPs) are a class of repulsive point processes on ${ℝ}^d$ with many statistical applications. Although an explicit expression of their density is known, it is too complicated to be used directly for maximum likelihood estimation. In the stationary case, an approximation using Fourier series has been suggested, but it is limited to rectangular observation windows and no theoretical results support it. In this contribution, we investigate a different way to approximate the likelihood by looking at its asymptotic behavior when the observation window grows toward ${ℝ}^d$. This new approximation is not limited to rectangular windows, is faster to compute than the previous one, does not require any tuning parameter, and some theoretical justifications are provided. It moreover provides an explicit formula for estimating the asymptotic variance of the associated estimator. The performances are assessed in a simulation study on standard parametric models on ${ℝ}^d$ and compare favorably to common alternative estimation methods for continuous DPPs.     

Daisee: Adaptive importance sampling by balancing exploration and exploitation

We study adaptive importance sampling (AIS) as an online learning problem and argue for the importance of the trade-off between exploration and exploitation in this adaptation. Borrowing ideas from the online learning literature, we propose Daisee, a partition-based AIS algorithm. We further introduce a notion of regret for AIS and show that Daisee has $𝒪(\sqrt{T}{(\log T)}^{\frac{3}{4}})$ cumulative pseudo-regret, where $T$ is the number of iterations. We then extend Daisee to adaptively learn a hierarchical partitioning of the sample space for more efficient sampling and confirm the performance of both algorithms empirically.     

Selection of linear mixed-effects models for clustered data

We consider model selection for linear mixed-effects models with clustered structure, where conditional Kullback–Leibler (CKL) loss is applied to measure the efficiency of the selection. We estimate the CKL loss by substituting the empirical best linear unbiased predictors (EBLUPs) into random effects with model parameters estimated by maximum likelihood. Although the BLUP approach is commonly used in predicting random effects and future observations, selecting random effects to achieve asymptotic loss efficiency concerning CKL loss is challenging and has not been well studied. In this paper, we propose addressing this difficulty using a conditional generalized information criterion (CGIC) with two tuning parameters. We further consider a challenging but practically relevant situation where the number, $m$, of clusters does not go to infinity with the sample size. Hence the random-effects variances are not consistently estimable. We show that via a novel decomposition of the CKL risk, the CGIC achieves consistency and asymptotic loss efficiency, whether $m$ is fixed or increases to infinity with the sample size. We also conduct numerical experiments to illustrate the theoretical findings.     

Asymptotic properties of the maximum smoothed partial likelihood estimator in the change-plane Cox model

The change-plane Cox model is a popular tool for the subgroup analysis of survival data. Despite the rich literature on this model, there has been limited investigation into the asymptotic properties of the estimators of the finite-dimensional parameter. Particularly, the convergence rate, not to mention the asymptotic distribution, has not been fully characterized for the general model where classification is based on multiple covariates. To bridge this theoretical gap, this study proposes a maximum smoothed partial likelihood estimator and establishes the following asymptotic properties. First, it shows that the convergence rate for the classification parameter can be arbitrarily close to $n^{-1}$ up to a logarithmic factor under a certain condition on covariates and the choice of tuning parameter. Given this convergence rate result, it also establishes the asymptotic normality for the regression parameter.     

On the robustness to outliers of the Student-t process

The theory of Bayesian robustness modeling uses heavy-tailed distributions to resolve conflicts of information by rejecting automatically the outlying information in favor of the other sources of information. In particular, the Student's-t process is a natural alternative to the Gaussian process when the data might carry atypical information. Several works attest to the robustness of the Student $t$ process, however, the studies are mostly guided by intuition and focused mostly on the computational aspects rather than the mathematical properties of the involved distributions. This work uses the theory of regular variation to address the robustness of the Student $t$ process in the context of nonlinear regression, that is, the behavior of the posterior distribution in the presence of outliers in the inputs, in the outputs, or in both sources of information. In all these cases, under certain conditions, it is shown that the posterior distribution tends to a quantity that does not depend on the atypical information, then, for every case, the limiting posterior distribution as the outliers tend to infinity is provided. The impact of outliers on the predictive posterior distribution is also addressed. The theory is illustrated with a few simulated examples.     

Sparse concordance-based ordinal classification

Ordinal classification is an important area in statistical machine learning, where labels exhibit a natural order. One of the major goals in ordinal classification is to correctly predict the relative order of instances. We develop a novel concordance-based approach to ordinal classification, where a concordance function is introduced and a penalized smoothed method for optimization is designed. Variable selection using the $L_1$ penalty is incorporated for sparsity considerations. Within the set of classification rules that maximize the concordance function, we find optimal thresholds to predict labels by minimizing a loss function. After building the classifier, we derive nonparametric estimation of class conditional probabilities. The asymptotic properties of the estimators as well as the variable selection consistency are established. Extensive simulations and real data applications show the robustness and advantage of the proposed method in terms of classification accuracy, compared with other existing methods.     

High-dimensional covariance matrix estimation using a low-rank and diagonal decomposition

We study high-dimensional covariance/precision matrix estimation under the assumption that the covariance/precision matrix can be decomposed into a low-rank component $L$ and a diagonal component $D$. The rank of $L$ can either be chosen to be small or controlled by a penalty function. Under moderate conditions on the population covariance/precision matrix itself and on the penalty function, we prove some consistency results for our estimators. A block-wise coordinate descent algorithm, which iteratively updates $L$ and $D$, is then proposed to obtain the estimator in practice. Finally, various numerical experiments are presented; using simulated data, we show that our estimator performs quite well in terms of the Kullback–Leibler loss; using stock return data, we show that our method can be applied to obtain enhanced solutions to the Markowitz portfolio selection problem. The Canadian Journal of Statistics 48: 308–337; 2020 © 2019 Statistical Society of Canada     

Grenander functionals and Cauchy's formula

Let ${\widehat{f}}_n$ be the nonparametric maximum likelihood estimator of a decreasing density. Grenander characterized this as the left‐continuous slope of the least concave majorant of the empirical distribution function. For a sample from the uniform distribution, the asymptotic distribution of the L₂‐distance of the Grenander estimator to the uniform density was derived in an article by Groeneboom and Pyke by using a representation of the Grenander estimator in terms of conditioned Poisson and gamma random variables. This representation was also used in an article by Groeneboom and Lopuhaä to prove a central limit result of Sparre Andersen on the number of jumps of the Grenander estimator. Here we extend this to the proof of the main result on the L₂‐distance of the Grenander estimator to the uniform density and also prove a similar asymptotic normality results for the entropy functional. Cauchy's formula and saddle point methods are the main tools in our development.     

Direct estimation of differential networks under high-dimensional nonparanormal graphical models

In genomics, it is often of interest to study the structural change of a genetic network between two phenotypes. Under Gaussian graphical models, the problem can be transformed to estimating the difference between two precision matrices, and several approaches have been recently developed for this task such as joint graphical lasso and fused graphical lasso. However, the multivariate Gaussian assumptions made in the existing approaches are often violated in reality. For instance, most RNA-Seq data follow non-Gaussian distributions even after log-transformation or other variance-stabilizing transformations. In this work, we consider the problem of directly estimating differential networks under a flexible semiparametric model, namely the nonparanormal graphical model, where the random variables are assumed to follow a multivariate Gaussian distribution after a set of monotonically increasing transformations. We propose to use a novel rank-based estimator to directly estimate the differential network, together with a parametric simplex algorithm for fast implementation. Theoretical properties of the new estimator are established under a high-dimensional setting where $p$ grows with $n$ almost exponentially fast. In particular, we show that the proposed estimator is consistent in both parameter estimation and support recovery. Both synthetic data and real genomic data are used to illustrate the promise of the new approach. The Canadian Journal of Statistics 48: 187–203; 2020 © 2019 Statistical Society of Canada     

Construction of blocked two-level regular designs with general minimum lower order confounding

Zhang et al. (2008) proposed a general minimum lower order confounding (GMC for short) criterion, which aims to select optimal factorial designs in a more elaborate and explicit manner. By extending the GMC criterion to the case of blocked designs, Wei et al. (submitted for publication) proposed a B¹-GMC criterion. The present paper gives a construction theory and obtains the B¹-GMC 2^n−m:2^r$2^{n-m}:2^r$ designs with n≥5N/16+1$n\ge 5N/16+1$, where 2^n−m:2^r$2^{n-m}:2^r$ denotes a two-level regular blocked design with N=2^n−m$N=2^{n-m}$ runs, n   treatment factors, and 2^r$2^r$ blocks. The construction result is simple. Up to isomorphism, the B¹-GMC 2^n−m:2^r$2^{n-m}:2^r$ designs can be constructed as follows: the n   treatment factors and the 2^r−1$2^r-1$ block effects are, respectively, assigned to the last n   columns and specific 2^r−1$2^r-1$ columns of the saturated 2^{(N−1)−(N−1−n+m)}$2^{(N-1)-(N-1-n+m)}$ design with Yates order. With such a simple structure, the B¹-GMC designs can be conveniently used in practice. Examples are included to illustrate the theory.     

On the distributions of multivariate sample skewness

In this paper, we consider the multivariate normality test based on measure of multivariate sample skewness defined by Srivastava (1984). Srivastava derived asymptotic expectation up to the order N⁻¹ for the multivariate sample skewness and approximate χ²${\chi }^2$ test statistic, where N   is sample size. Under normality, we derive another expectation and variance for Srivastava's multivariate sample skewness in order to obtain a better test statistic. From this result, improved approximate χ²${\chi }^2$ test statistic using the multivariate sample skewness is also given for assessing multivariate normality. Finally, the numerical result by Monte Carlo simulation is shown in order to evaluate accuracy of the obtained expectation, variance and improved approximate χ²${\chi }^2$ test statistic. Furthermore, upper and lower percentiles of χ²${\chi }^2$ test statistic derived in this paper are compared with those of χ²${\chi }^2$ test statistic derived by Mardia (1974) which is used multivariate sample skewness defined by Mardia (1970).     

On E(s)-optimal supersaturated designs

A popular measure to assess 2-level supersaturated designs is the E(s²)$E(s^2)$ criterion. In this paper, improved lower bounds on E(s²)$E(s^2)$ are obtained. The same improvement has recently been established by Ryan and Bulutoglu [2007. E(s²)$E(s^2)$-optimal supersaturated designs with good minimax properties. J. Statist. Plann. Inference 137, 2250–2262]. However, our analysis provides more details on precisely when an improvement is possible, which is lacking in Ryan and Bulutoglu [2007. E(s²)$E(s^2)$-optimal supersaturated designs with good minimax properties. J. Statist. Plann. Inference 137, 2250–2262]. The equivalence of the bounds obtained by Butler et al. [2001. A general method of constructing E(s²)$E(s^2)$-optimal supersaturated designs. J. Roy. Statist. Soc. B 63, 621–632] (in the cases where their result applies) and those obtained by Bulutoglu and Cheng [2004. Construction of E(s²)$E(s^2)$-optimal supersaturated designs. Ann. Statist. 32, 1662–1678] is established. We also give two simple methods of constructing E(s²)$E(s^2)$-optimal designs.     

Lattice and Schröder paths with periodic boundaries

We consider paths in the plane with (1,0$1,0$), (0,1$0,1$), and (a,b$a,b$)-steps that start at the origin, end at height n$n$, and stay strictly to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at most b/a$b/a$, then the ordinary generating function for the number of such paths ending at height n   is algebraic. Our argument is in two parts. We use a simple combinatorial decomposition to obtain an Appell relation or “umbral” generating function, in which the power zⁿ$z^n$ is replaced by a power series of the form zⁿ_φn(z),$z^n{\phi }_n(z),$ where _φn(0)=1.${\phi }_n(0)=1.$ Then we convert (in an explicit way) the umbral generating function to an ordinary generating function by solving a system of linear equations and a polynomial equation. This conversion implies that the ordinary generating function is algebraic. We give several concrete examples, including an alternative way to solve the tennis ball problem.