Non‐parametric Copula Estimation Under Bivariate Censoring

In this paper, we consider non‐parametric copula inference under bivariate censoring. Based on an estimator of the joint cumulative distribution function, we define a discrete and two smooth estimators of the copula. The construction that we propose is valid for a large range of estimators of the distribution function and therefore for a large range of bivariate censoring frameworks. Under some conditions on the tails of the distributions, the weak convergence of the corresponding copula processes is obtained in l^∞([0,1]²). We derive the uniform convergence rates of the copula density estimators deduced from our smooth copula estimators. Investigation of the practical behaviour of these estimators is performed through a simulation study and two real data applications, corresponding to different censoring settings. We use our non‐parametric estimators to define a goodness‐of‐fit procedure for parametric copula models. A new bootstrap scheme is proposed to compute the critical values.     

Inference on proportional hazard rate model parameter under Type-I progressively hybrid censoring scheme

ABSTRACT

In this paper, under Type-I progressive hybrid censoring sample, we obtain maximum likelihood estimator of unknown parameter when the parent distribution belongs to proportional hazard rate family. We derive the conditional probability density function of the maximum likelihood estimator using moment-generating function technique. The exact confidence interval is obtained and compared by conducting a Monte Carlo simulation study for burr Type XII distribution. Finally, we obtain the Bayes and posterior regret gamma minimax estimates of the parameter under a precautionary loss function with precautionary index k = 2 and compare their behavior via a Monte Carlo simulation study.     

Approximations for marginal densities of M-estimators

We develop a saddle-point approximation for the marginal density of a real-valued function p(), where is a general M-estimator of a p-dimensional parameter, that is, the solution of the system {n^-1_ljl (Y_l,) = 0}_j=1,…,p. The approximation is applied to several regression problems and yields very good accuracy for small samples. This enables us to compare different classes of estimators according to their finite-sample properties and to determine when asymptotic approximations are useful in practice.     

A unified approach to marginal equivalence in the general framework of group invariance

ABSTRACT

Two Bayesian models with different sampling densities are said to be marginally equivalent if the joint distribution of observables and the parameter of interest is the same for both models. We discuss marginal equivalence in the general framework of group invariance. We introduce a class of sampling models and derive marginal equivalence when the prior for the nuisance parameter is relatively invariant. We also obtain some robustness properties of invariant statistics under our sampling models. Besides the prototypical example of v-spherical distributions, we apply our general results to two examples—analysis of affine shapes and principal component analysis.     

Nonparametric comparison of curves with dependent errors

Suppose that data {(x _l,i,n , y _l,i,n ): l?=?1, …, k; i?=?1, …, n} are observed from the regression models: Y _l,i,n ?=?m _l (x _l,i,n )?+?? _l,i,n , l?=?1, …, k, where the regression functions {m _l } _l=1 ^k are unknown and the random errors {? _l,i,n } are dependent, following an MA(∞) structure. A new test is proposed for testing the hypothesis H ₀: m ₁?=?·?·?·?=?m _k , without assuming that {m _l } _l=1 ^k are in a parametric family. The criterion of the test derives from a Crámer-von-Mises-type functional based on different distances between {[mcirc]} _l and {[mcirc]} _s , l?≠?s, l, s?=?1, …, k, where {[mcirc] _l } _l=1 ^k are nonparametric Gasser–Müller estimators of {m _l } _l=1 ^k . A generalization of the test to the case of unequal design points, with different sample sizes {n _l } _l=1 ^k and different design densities {f _l } _l=1 ^k , is also considered. The asymptotic normality of the test statistic is obtained under general conditions. Finally, a simulation study and an analysis with real data show a good behavior of the proposed test.     

A general long-term aging model with different underlying activation mechanisms: Modeling,Bayesian estimation,and case influence diagnostics

In this paper we propose a general cure rate aging model. Our approach enables different underlying activation mechanisms which lead to the event of interest. The number of competing causes of the event of interest is assumed to follow a logarithmic distribution. The model is parameterized in terms of the cured fraction which is then linked to covariates. We explore the use of Markov chain Monte Carlo methods to develop a Bayesian analysis for the proposed model. Moreover, some discussions on the model selection to compare the fitted models are given, as well as case deletion influence diagnostics are developed for the joint posterior distribution based on the ψ-divergence, which has several divergence measures as particular cases, such as the Kullback–Leibler (K-L), J-distance, L₁ norm, and χ²-square divergence measures. Simulation studies are performed and experimental results are illustrated based on a real malignant melanoma data.     

How Many Iterations are Sufficient for Efficient Semiparametric Estimation?

Abstract. A common practice in obtaining an efficient semiparametric estimate is through iteratively maximizing the (penalized) full log‐likelihood w.r.t. its Euclidean parameter and functional nuisance parameter. A rigorous theoretical study of this semiparametric iterative estimation approach is the main purpose of this study. We first show that the grid search algorithm produces an initial estimate with the proper convergence rate. Our second contribution is to provide a formula in calculating the minimal number of iterations k ^* needed to produce an efficient estimate . We discover that (i) k ^* depends on the convergence rates of the initial estimate and the nuisance functional estimate, and (ii) k ^* iterations are also sufficient for recovering the estimation sparsity in high dimensional data. The last contribution is the novel construction of which does not require knowing the explicit expression of the efficient score function. The above general conclusions apply to semiparametric models estimated under various regularizations, for example, kernel or penalized estimation. As far as we are aware, this study provides a first general theoretical justification for the ‘one‐/two‐step iteration’ phenomena observed in the semiparametric literature.     

LINEAR MINIMAX ESTIMATORS FOR ESTIMATING A FUNCTION OF THE PARAMETER

In this note we provide sufficient conditions for the minimaxity of linear estimators of the form aX+b in the one-parameter exponential family for estimating a differentiable function g(θ) with normalized quadratic loss. We provide some examples which show that the natural estimator X is minimax in estimating a function of the parameter (different from the mean).     

Estimation and Inference for Linear Panel Data Models Under Misspecification When Both n and T are Large

This article considers fixed effects (FE) estimation for linear panel data models under possible model misspecification when both the number of individuals, n, and the number of time periods, T, are large. We first clarify the probability limit of the FE estimator and argue that this probability limit can be regarded as a pseudo-true parameter. We then establish the asymptotic distributional properties of the FE estimator around the pseudo-true parameter when n and T jointly go to infinity. Notably, we show that the FE estimator suffers from the incidental parameters bias of which the top order is O(T^{? 1}), and even after the incidental parameters bias is completely removed, the rate of convergence of the FE estimator depends on the degree of model misspecification and is either (nT)^{? 1/2} or n^{? 1/2}. Second, we establish asymptotically valid inference on the (pseudo-true) parameter. Specifically, we derive the asymptotic properties of the clustered covariance matrix (CCM) estimator and the cross-section bootstrap, and show that they are robust to model misspecification. This establishes a rigorous theoretical ground for the use of the CCM estimator and the cross-section bootstrap when model misspecification and the incidental parameters bias (in the coefficient estimate) are present. We conduct Monte Carlo simulations to evaluate the finite sample performance of the estimators and inference methods, together with a simple application to the unemployment dynamics in the U.S.     

Bias correction and improved residuals for non-exponential family nonlinear models

In this paper we derive general formulae for the biases to order n ^?1 of the parameter estimates in a general class of nonlinear regression models, where n is the sample size. The formulae are related to those of Cordeiro and McCullagh (1991) and Paula (1992) and may be viewed as extensions of their results, Correction factors are derived for the score and deviance component residuals in these models. The practical use of such corrections is illustrated for the log-gamma model.     

Semiparametric Regression Analysis of Longitudinal Skewed Data

In this paper, we develop a semiparametric regression model for longitudinal skewed data. In the new model, we allow the transformation function and the baseline function to be unknown. The proposed model can provide a much broader class of models than the existing additive and multiplicative models. Our estimators for regression parameters, transformation function and baseline function are asymptotically normal. Particularly, the estimator for the transformation function converges to its true value at the rate n ^{? 1 ∕ 2}, the convergence rate that one could expect for a parametric model. In simulation studies, we demonstrate that the proposed semiparametric method is robust with little loss of efficiency. Finally, we apply the new method to a study on longitudinal health care costs.     

Bias correction for exponential family nonlinear modles

In this paper we discuss the computation of the bias to order n ^-1 for the parameter estimates in a general class of nonlinear regression models. Simple formulae are given to some special models. Diagnostic methods to assess the relationship between bias and observations are presented. Finally the proposed methods are illustrated by two examples.     

Graphical Tests for the Assumption of Gamma and Inverse Gaussian Frailty Distributions

The common choices of frailty distribution in lifetime data models include the Gamma and Inverse Gaussian distributions. We present diagnostic plots for these distributions when frailty operates in a proportional hazards framework. Firstly, we present plots based on the form of the unconditional survival function when the baseline hazard is assumed to be Weibull. Secondly, we base a plot on a closure property that applies for any baseline hazard, namely, that the frailty distribution among survivors at time t has the same form as the original distribution, with the same shape parameter but different scale parameter. We estimate the shape parameter at different values of t and examine whether it is constant, that is, whether plotted values form a straight line parallel to the time axis. We provide simulation results assuming Weibull baseline hazard and an example to illustrate the methods.     

Some results on constructing two-level block designs with general minimum lower order confounding

Block designs are widely used in experimental situations where the experimental units are heterogeneous. The blocked general minimum lower order confounding (B-GMC) criterion is suitable for selecting optimal block designs when the experimenters have some prior information on the importance of ordering of the treatment factors. This paper constructs B-GMC 2^{n ? m}: 2^r designs with 5 × 2^l/16 + 1 ? n ? (N ? 2^l) < 2^{l ? 1} for l(r + 1 ? l ? n ? m ? 1), where 2^{n ? m}: 2^r denotes a two-level regular block design with N = 2^{n ? m} runs, n treatment factors, and 2^r blocks. With suitable choice of the blocking factors, each B-GMC block design has a common specific structure. Some examples illustrate the simple and effective construction method.     

Alternatives to post‐processing posterior predictive p values

The posterior predictive p value (ppp) was invented as a Bayesian counterpart to classical p values. The methodology can be applied to discrepancy measures involving both data and parameters and can, hence, be targeted to check for various modeling assumptions. The interpretation can, however, be difficult since the distribution of the ppp value under modeling assumptions varies substantially between cases. A calibration procedure has been suggested, treating the ppp value as a test statistic in a prior predictive test. In this paper, we suggest that a prior predictive test may instead be based on the expected posterior discrepancy, which is somewhat simpler, both conceptually and computationally. Since both these methods require the simulation of a large posterior parameter sample for each of an equally large prior predictive data sample, we furthermore suggest to look for ways to match the given discrepancy by a computation‐saving conflict measure. This approach is also based on simulations but only requires sampling from two different distributions representing two contrasting information sources about a model parameter. The conflict measure methodology is also more flexible in that it handles non‐informative priors without difficulty. We compare the different approaches theoretically in some simple models and in a more complex applied example.     

Bayesian Robustness Modelling of Location and Scale Parameters

Abstract. The modelling process in Bayesian Statistics constitutes the fundamental stage of the analysis, since depending on the chosen probability laws the inferences may vary considerably. This is particularly true when conflicts arise between two or more sources of information. For instance, inference in the presence of an outlier (which conflicts with the information provided by the other observations) can be highly dependent on the assumed sampling distribution. When heavy‐tailed (e.g. t) distributions are used, outliers may be rejected whereas this kind of robust inference is not available when we use light‐tailed (e.g. normal) distributions. A long literature has established sufficient conditions on location‐parameter models to resolve conflict in various ways. In this work, we consider a location–scale parameter structure, which is more complex than the single parameter cases because conflicts can arise between three sources of information, namely the likelihood, the prior distribution for the location parameter and the prior for the scale parameter. We establish sufficient conditions on the distributions in a location–scale model to resolve conflicts in different ways as a single observation tends to infinity. In addition, for each case, we explicitly give the limiting posterior distributions as the conflict becomes more extreme.     

Empirical likelihood confidence regions in the single-index model with growing dimensions

This paper investigates statistical inference for the single-index model when the number of predictors grows with sample size. Empirical likelihood method for constructing confidence region for the index vector, which does not require a multivariate non parametric smoothing, is employed. However, the classical empirical likelihood ratio for this model does not remain valid because plug-in estimation of an infinite-dimensional nuisance parameter causes a non negligible bias and the diverging number of parameters/predictors makes the limit not chi-squared any more. To solve these problems, we define an empirical likelihood ratio based on newly proposed weighted estimating equations and show that it is asymptotically normal. Also we find that different weights used in the weighted residuals require, for asymptotic normality, different diverging rate of the number of predictors. However, the rate n^1/3, which is a possible fastest rate when there are no any other conditions assumed in the setting under study, is still attainable. A simulation study is carried out to assess the performance of our method.     

Bayesian Analysis in Regression Models Using Pseudo-Likelihoods

This article deals with the issue of using a suitable pseudo-likelihood, instead of an integrated likelihood, when performing Bayesian inference about a scalar parameter of interest in the presence of nuisance parameters. The proposed approach has the advantages of avoiding the elicitation on the nuisance parameters and the computation of multidimensional integrals. Moreover, it is particularly useful when it is difficult, or even impractical, to write the full likelihood function.

We focus on Bayesian inference about a scalar regression coefficient in various regression models. First, in the context of non-normal regression-scale models, we give a theroetical result showing that there is no loss of information about the parameter of interest when using a posterior distribution derived from a pseudo-likelihood instead of the correct posterior distribution. Second, we present non trivial applications with high-dimensional, or even infinite-dimensional, nuisance parameters in the context of nonlinear normal heteroscedastic regression models, and of models for binary outcomes and count data, accounting also for possibile overdispersion. In all these situtations, we show that non Bayesian methods for eliminating nuisance parameters can be usefully incorporated into a one-parameter Bayesian analysis.     

Another look at linear programming for feature selection via methods of regularization

We consider statistical procedures for feature selection defined by a family of regularization problems with convex piecewise linear loss functions and penalties of l ₁ nature. Many known statistical procedures (e.g. quantile regression and support vector machines with l ₁-norm penalty) are subsumed under this category. Computationally, the regularization problems are linear programming (LP) problems indexed by a single parameter, which are known as ‘parametric cost LP’ or ‘parametric right-hand-side LP’ in the optimization theory. Exploiting the connection with the LP theory, we lay out general algorithms, namely, the simplex algorithm and its variant for generating regularized solution paths for the feature selection problems. The significance of such algorithms is that they allow a complete exploration of the model space along the paths and provide a broad view of persistent features in the data. The implications of the general path-finding algorithms are outlined for several statistical procedures, and they are illustrated with numerical examples.     

$${\mathcal{L}}_p$$ loss functions: a robust bayesian approach

In bayesian inference, the Bayes estimator is the alternative with the minimum expected loss. In most cases, the loss function shows the distance between the alternative and the parameter. Therefore, any distance can lead to a loss function. Among the best known distance functions is L _p one, where the choice of value p may be difficult and arbitrary. This paper examines robust models where the loss function is modelled by family L _p . Our solution concept is the non-dominated alternative. We characterize the non-dominated set by having the posterior distribution function satisfy a particular asymmetry property. We also include an example to illustrate the methodology described.