Local quasi-likelihood estimation is useful for nonparametric modeling in a widely-used exponential family of distributions, called generalized linear models. Yet, the technique cannot be directly applied to situations where a response variable is missing at random. Three local quasi-likelihood estimation techniques are introduced: the local quasi-likelihood estimator using only complete-data; the locally weighted quasi-likelihood method; the local quasi-likelihood estimator with imputed values. These estimators share basically the same first order asymptotic biases and variances. Our simulation results show that substantial efficiency gains can be obtained by using the local quasi-likelihood estimator with imputed values. We develop the local quasi-likelihood imputation methods for estimating the mean functional of the response variable. It is shown that the proposed mean imputation estimators are asymptotically normal with asymptotic variance that can be easily estimated. Data from an ongoing environmental epidemiologic study is used to illustrate the proposed methods.

We treat all the bivariate lack-of-memory (BLM) distributions in a unified approach and develop some new general properties of the BLM distributions, including joint moment generating function, product moments, and dependence structure. Necessary and sufficient conditions for the survival functions of BLM distributions to be totally positive of order two are given. Some previous results about specific BLM distributions are improved. In particular, we show that both the Marshall–Olkin survival copula and survival function are totally positive of all orders, regardless of parameters. Besides, we point out that Slepian’s inequality also holds true for BLM distributions.

Problems of nonparametric ltering arises frequently in engineering and nancial economics. Nonparametric lters often involve some ltering parameters to choose. These parameters can be chosen to optimize the performance locally at each time point or globally over a time interval. In this article, the ltering parameters are chosen via minimizing the prediction error for a large class of lters. Under a general martingale setting, with mild conditions on the time series structure and virtually no assumption on lters, we show that the adaptive lter with ltering parameter chosen by historical data performs nearly as well as the one with the ideal lter in the class, in terms of ltering errors. The theoretical result is also veri ed via intensive simulations. Our approach is also useful for choosing the orders of parametric models such as AR or GARCH processes. It can also be applied to volatility estimation in nancial economics. We illustrate the proposed methods by estimating the volatility of the returns of the S&P500 index and the yields of the three-month Treasury bills.

In survival analysis, the relationship between a survival time and a covariate is conveniently modeled with the proportional hazards regression model. This model usually assumes that the covariate has a log-linear effect on the hazard function. In this paper we consider the proportional hazards regression model with a nonparametric risk effect. We discuss estimation of the risk function and its derivatives in two cases: when the baseline hazard function is parametrized and when it is not parametrized. In the case of a parametric baseline hazard function, inference is based on a local version of the likelihood function, while in the case of a nonparametric baseline hazard, we use a local version of the partial likelihood. This results in maximum local likelihood estimators and maximum local partial likelihood estimators, respectively. We establish the asymptotic normality of the estimators. It turns out that both methods have

We present a new estimator for precision matrix in high dimensional Gaussian graphical models. At the core of the proposed estimator is a collection of node-wise linear regression with nonconvex penalty. In contrast to existing estimators for Gaussian graphical models with O (s log d/n) estimation error bound in terms of spectral norm, where s is the maximum degree of a graph, the proposed estimator could attain O (s/ n+ log d/n) spectral norm based convergence rate in the best case, and it is no worse than exiting estimators in general. In addition, our proposed estimator enjoys the oracle property under a milder condition than existing estimators. We show through extensive experiments on both synthetic and real datasets that our estimator outperforms the state-of-the-art estimators.