Search

Weighting methods are widely used to adjust for covariates in observational studies, sample surveys, and regression settings. In this paper, we study a class of recently proposed weighting methods which find the weights of minimum dispersion that approximately balance the covariates. We call these weights "minimal weights" and study them under a common optimization framework. The key observation is the connection between approximate covariate balance and shrinkage estimation of the propensity score. This connection leads to both theoretical and practical developments. From a theoretical standpoint, we characterize the asymptotic properties of minimal weights and show that, under standard smoothness conditions on the propensity score function, minimal weights are consistent estimates of the true inverse probability weights. Also, we show that the resulting weighting estimator is consistent, asymptotically normal, and semiparametrically efficient. From a practical standpoint, we present a finite sample oracle inequality that bounds the loss incurred by balancing more functions of the covariates than strictly needed. This inequality shows that minimal weights implicitly bound the number of active covariate balance constraints. We finally provide a tuning algorithm for choosing the degree of approximate balance in minimal weights. We conclude the paper with four empirical studies that suggest approximate balance is preferable to exact balance, especially when there is limited overlap in covariate distributions. In these studies, we show that the root mean squared error of the weighting estimator can be reduced by as much as a half with approximate balance., 41 pages

In this paper we consider a location model of the form $Y = m(X) + \varepsilon$, where $m(\cdot)$ is the unknown regression function, the error $\varepsilon$ is independent of the $p$-dimensional covariate $X$ and $E(\varepsilon)=0$. Given i.i.d. data $(X_1,Y_1),\ldots,(X_n,Y_n)$ and given an estimator $\hat m(\cdot)$ of the function $m(\cdot)$ (which can be parametric or nonparametric of nature), we estimate the distribution of the error term $\varepsilon$ by the empirical distribution of the residuals $Y_i-\hat m(X_i)$, $i=1,\ldots,n$. To approximate the distribution of this estimator, Koul and Lahiri (1994) and Neumeyer (2008, 2009) proposed bootstrap procedures, based on smoothing the residuals either before or after drawing bootstrap samples. So far it has been an open question whether a classical non-smooth residual bootstrap is asymptotically valid in this context. In this paper we solve this open problem, and show that the non-smooth residual bootstrap is consistent. We illustrate this theoretical result by means of simulations, that show the accuracy of this bootstrap procedure for various models, testing procedures and sample sizes.

Summary Instrumental variables are widely used to deal with unmeasured confounding in observational studies and imperfect randomized controlled trials. In these studies, researchers often target the so-called local average treatment effect as it is identifiable under mild conditions. In this paper we consider estimation of the local average treatment effect under the binary instrumental variable model. We discuss the challenges of causal estimation with a binary outcome and show that, surprisingly, it can be more difficult than in the case with a continuous outcome. We propose novel modelling and estimation procedures that improve upon existing proposals in terms of model congeniality, interpretability, robustness and efficiency. Our approach is illustrated via simulation studies and a real data analysis.

Summary For estimating the population mean of a response variable subject to ignorable missingness, a new class of methods, called multiply robust procedures, has been proposed. The advantage of multiply robust procedures over the traditional doubly robust methods is that they permit the use of multiple candidate models for both the propensity score and the outcome regression, and they are consistent if any one of the multiple models is correctly specified, a property termed multiple robustness. This paper shows that, somewhat surprisingly, multiply robust estimators are special cases of doubly robust estimators, where the final propensity score and outcome regression models are certain combinations of the candidate models. To further improve model specifications in the doubly robust estimators, we adapt a model mixing procedure as an alternative method for combining multiple candidate models. We show that multiple robustness and asymptotic normality can also be achieved by our mixing-based doubly robust estimator. Moreover, our estimator and its theoretical properties are not confined to parametric models. Numerical examples demonstrate that the proposed estimator is comparable to and can even outperform existing multiply robust estimators.

Summary Cross-sectional sampling is often used when investigating inter-event times, resulting in left-truncated and right-censored data. In this paper, we consider a semiparametric truncation model in which the truncating variable is assumed to belong to a certain parametric family. We examine two methods of estimating both the truncation and the lifetime distributions. We obtain asymptotic representations of the estimators for the lifetime distribution and establish their weak convergence. Both of the proposed estimators perform better than Wang’s (1991) nonparametric maximum likelihood estimator in terms of the integrated mean squared error, when the parametric family for the truncation is sufficiently close to its true distribution. The full likelihood approach is preferable to the conditional likelihood approach in estimating the lifetime distribution, though not necessarily the truncation distribution. In an application to Alzheimer’s disease data, hypothesis tests reject the uniform truncation distribution, but several other parametric models lead to similar behaviour of the truncation and lifetime distributions after disease onset.

Summary This paper is concerned with empirical likelihood inference on the population mean when the dimension $p$ and the sample size $n$ satisfy $p/n\rightarrow c\in [1,\infty)$. As shown in Tsao (2004), the empirical likelihood method fails with high probability when $p/n>1/2$ because the convex hull of the $n$ observations in $\mathbb{R}^p$ becomes too small to cover the true mean value. Moreover, when $p> n$, the sample covariance matrix becomes singular, and this results in the breakdown of the first sandwich approximation for the log empirical likelihood ratio. To deal with these two challenges, we propose a new strategy of adding two artificial data points to the observed data. We establish the asymptotic normality of the proposed empirical likelihood ratio test. The proposed test statistic does not involve the inverse of the sample covariance matrix. Furthermore, its form is explicit, so the test can easily be carried out with low computational cost. Our numerical comparison shows that the proposed test outperforms some existing tests for high-dimensional mean vectors in terms of power. We also illustrate the proposed procedure with an empirical analysis of stock data.

Summary This paper proposes a new set of testable implications for the instrumental variable independence assumption for discrete treatment, but unrestricted outcome and instruments: generalized instrumental inequalities. When outcome and treatment are both binary, but instruments are unrestricted, we show that the generalized instrumental inequalities are necessary and sufficient to detect all observable violations of the instrumental variable independence assumption. To test the generalized instrumental inequalities, we propose an approach combining a sample splitting procedure and an inference method for intersection bounds. This idea allows one to easily implement the test using existing Stata packages. We apply our proposed strategy to assess the validity of the instrumental variable independence assumption for various instruments used in the returns to college literature.

SUMMARY An important and often discussed research problem in statistics is how to compare several populations; examples arise in medical science, engineering, finance and other fields. Often population means or medians are compared. However, one population may have a higher mean income, for example, because of a small number of super-rich individuals; the mean therefore may not reflect the wealth of the general population. Instead, an index of the degree of stochastic dominance of one population over another would better reflect their relative wealth. Currently, we can estimate such an index under restrictive conditions, but there is no generic estimator with a known asymptotic distribution. In this paper, we suggest linking the populations via the density ratio model. Under this model, we develop an empirical likelihood estimator and establish its asymptotic normality. In addition, we improve the estimation efficiency by examining the similarities between the populations. Furthermore, we provide a valid bootstrap method for hypothesis testing and the construction of confidence intervals. Simulation experiments show that the proposed estimator substantially improves the estimation efficiency and power of the test, and leads to confidence intervals with satisfactorily precise coverage probabilities. It is also robust with respect to mild model misspecification. Two examples are given to demonstrate the usefulness of both the method and the concept.

SummaryMax-stable processes are increasingly widely used for modelling complex extreme events, but existing fitting methods are computationally demanding, limiting applications to a few dozen variables. ${r}$-Pareto processes are mathematically simpler and have the potential advantage of incorporating all relevant extreme events, by generalizing the notion of a univariate exceedance. In this paper we investigate the use of proper scoring rules for high-dimensional peaks-over-threshold inference, focusing on extreme-value processes associated with log-Gaussian random functions, and compare gradient score estimators with the spectral and censored likelihood estimators for regularly varying distributions with normalized marginals, using data with several hundred locations. When simulating from the true model, the spectral estimator performs best, closely followed by the gradient score estimator, but censored likelihood estimation performs better with simulations from the domain of attraction, though it is outperformed by the gradient score in cases of weak extremal dependence. We illustrate the potential and flexibility of our ideas by modelling extreme rainfall on a grid with 3600 locations, based on exceedances for locally intense and for spatially accumulated rainfall, and discuss diagnostics of model fit. The differences between the two fitted models highlight how the definition of rare events affects the estimated dependence structure.

Ignoring the model selection step in inference after selection is harmful. This paper studies the asymptotic distribution of estimators after model selection using the Akaike information criterion. First, we consider the classical setting in which a true model exists and is included in the candidate set of models. We exploit the overselection property of this criterion in the construction of a selection region, and obtain the asymptotic distribution of estimators and linear combinations thereof conditional on the selected model. The limiting distribution depends on the set of competitive models and on the smallest overparameterized model. Second, we relax the assumption about the existence of a true model, and obtain uniform asymptotic results. We use simulation to study the resulting postselection distributions and to calculate confidence regions for the model parameters. We apply themethod to data. ispartof: Biometrika vol:105 issue:3 pages:645-664 status: published

A prevailing challenge in the biomedical and social sciences is to estimate a population mean from a sample obtained with unknown selection probabilities. Using a well-known ratio estimator, Aronow and Lee (2013) proposed a method for partial identification of the mean by allowing the unknown selection probabilities to vary arbitrarily between two fixed extreme values. In this paper, we show how to leverage auxiliary shape constraints on the population outcome distribution, such as symmetry or log-concavity, to obtain tighter bounds on the population mean. We use this method to estimate the performance of Aymara students---an ethnic minority in the north of Chile---in a national educational standardized test. We implement this method in the new statistical software package scbounds for R.

Summary Composite likelihood has been widely used in applications. The asymptotic distribution of the composite likelihood ratio statistic at the boundary of the parameter space is a complicated mixture of weighted $\chi^2$ distributions. In this paper we propose a conditional test with data-dependent degrees of freedom. We consider a modification of the composite likelihood which satisfies the second-order Bartlett identity. We show that the modified composite likelihood ratio statistic given the number of estimated parameters lying on the boundary converges to a simple $\chi^2$ distribution. This conditional testing procedure is validated through simulation studies.

Many statistical models have likelihoods which are intractable: it is impossible or too expensive to compute the likelihood exactly. In such settings, a common approach is to replace the likelihood with an approximation, and proceed with inference as if the approximate likelihood were the exact likelihood. In this paper, we describe conditions on the approximate likelihood which guarantee that this naive inference with an approximate likelihood has the same first-order asymptotic properties as inference with the exact likelihood. We investigate the implications of these results for inference using a Laplace approximation to the likelihood in a simple two-level latent variable model, and using reduced dependence approximations to the likelihood in an Ising model on a lattice., Updated to add an additional example (inference for an Ising model on a lattice using reduced dependence approximations to the likelihood)

SUMMARY Consider a semiparametric model indexed by a Euclidean parameter of interest and an infinite-dimensional nuisance parameter. In many applications, pseudolikelihood provides a convenient way to infer the parameter of interest, where the nuisance parameter is replaced by a consistent estimator. The purpose of this paper is to establish the asymptotic behaviour of the pseudolikelihood ratio statistic under semiparametric models. In particular, we consider testing the hypothesis that the parameter of interest lies on the boundary of its parameter space. Under regularity conditions, we establish the equivalence between the asymptotic distributions of the pseudolikelihood ratio statistic and a likelihood ratio statistic for a normal mean problem with a misspecified covariance matrix. This result holds when the nuisance parameter is estimated at a rate slower than the usual rate in parametric models. We study three examples in which the asymptotic distributions are shown to be mixtures of chi-squared variables. We conduct simulation studies to examine the finite-sample performance of the pseudolikelihood ratio test.

This paper addresses the topic of nonnested time series model comparisons. The main result is a central limit theorem for the likelihood ratio statistic when the models are nonnested and non-equivalent. The concepts of model equivalence and forecast equivalence, which are important for determining the parameter subset corresponding to the null hypothesis, are developed. The method is validated through a simulation study and illustrated on a retail time series.

Case-cohort designs are widely used in large cohort studies to reduce the cost associated with covariate measurement. In many such studies the number of covariates is very large, so an efficient variable selection method is necessary. In this paper, we study the properties of a variable selection procedure using the smoothly clipped absolute deviation penalty in a case-cohort design with a diverging number of parameters. We establish the consistency and asymptotic normality of the maximum penalized pseudo-partial-likelihood estimator, and show that the proposed variable selection method is consistent and has an asymptotic oracle property. Simulation studies compare the finite-sample performance of the procedure with tuning parameter selection methods based on the Akaike information criterion and the Bayesian information criterion. We make recommendations for use of the proposed procedures in case-cohort studies, and apply them to the Busselton Health Study.

Micro-organisms such as bacteria form complex ecological community networks that can be greatly influenced by diet and other environmental factors. Differential analysis of microbial community structures aims to elucidate systematic changes during an adaptive response to changes in environment. In this paper, we propose a flexible Markov random field model for microbial network structure and introduce a hypothesis testing framework for detecting differences between networks, also known as differential network analysis. Our global test for differential networks is particularly powerful against sparse alternatives. In addition, we develop a multiple testing procedure with false discovery rate control to identify the structure of the differential network. The proposed method is applied to data from a gut microbiome study on U.K. twins to evaluate how age affects the microbial community network.

SUMMARY Sufficient dimension reduction is popular for reducing data dimensionality without stringent model assumptions. However, most existing methods may work poorly for binary classification. For example, sliced inverse regression (Li, 1991) can estimate at most one direction if the response is binary. In this paper we propose principal weighted support vector machines, a unified framework for linear and nonlinear sufficient dimension reduction in binary classification. Its asymptotic properties are studied, and an efficient computing algorithm is proposed. Numerical examples demonstrate its performance in binary classification.