Robust approximate Bayesian inference
Erlis Ruli, Nicola Sartori, Laura Ventura

TL;DR
This paper introduces a robust Bayesian inference method using $M$-estimating functions within ABC algorithms, with theoretical analysis, simulations, and a clinical application demonstrating its effectiveness.
Contribution
It presents a novel approach combining $M$-estimating functions with ABC for robust posterior inference, including theoretical properties and practical implementation.
Findings
The method produces robust posterior distributions in linear mixed models.
Simulation studies validate the approach's effectiveness.
Application to clinical data demonstrates practical utility.
Abstract
We discuss an approach for deriving robust posterior distributions from -estimating functions using Approximate Bayesian Computation (ABC) methods. In particular, we use -estimating functions to construct suitable summary statistics in ABC algorithms. The theoretical properties of the robust posterior distributions are discussed. Special attention is given to the application of the method to linear mixed models. Simulation results and an application to a clinical study demonstrate the usefulness of the method. An R implementation is also provided in the robustBLME package.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Robust approximate Bayesian inference
Erlis Ruli, Nicola Sartori and Laura Ventura
Department of Statistical Sciences, University of Padova, Italy
[email protected], [email protected], [email protected]
Abstract
We discuss an approach for deriving robust posterior distributions from -estimating functions using Approximate Bayesian Computation (ABC) methods. In particular, we use M-estimating functions to construct suitable summary statistics in ABC algorithms. The theoretical properties of the robust posterior distributions are discussed. Special attention is given to the application of the method to linear mixed models. Simulation results and an application to a clinical study demonstrate the usefulness of the method. An R implementation is also provided in the robustBLME package.
Keywords: Influence function; likelihood-free inference; -estimators; quasi-likelihood; robustness; unbiased estimating function.
1 Introduction
The normality assumption is the usual basis of many statistical analyses in several fields, such as medicine, health sciences, quality control and engineering statistics. Under this assumption, standard parametric estimation and testing procedures are simple and efficient. However, both from a frequentist or a Bayesian perspective, it is well known that these procedures are not robust when the normal distribution is just an approximate model or in the presence of outliers in the observed data. In these situations, robust statistical methods can be considered in order to produce statistical procedures that are stable with respect to small changes in the data or to small model departures; see Huber and Ronchetti (2009) for a review on robust methods.
The concept of robustness has been widely discussed in the frequentist literature; see, for instance, Hampel et al. (1986), Tsou and Royall (1995) and Markatou et al. (1998). Also Bayesian robustness with respect to model misspecification have attracted considerable attention. For instance, Lazar (2003), Greco et al. (2008), Ventura et al. (2010) and Agostinelli and Greco (2013) discuss approaches based on robust pseudo-likelihood functions, such as the empirical likelihood, as replacement of the genuine likelihood in Bayes’ formula. Lewis et al. (2014) discuss an approach for building posterior distributions from robust -estimators using constrained Markov Chain Monte Carlo (MCMC) methods. Recent approaches based on tilted likelihoods can be found in Grünwald and van Ommen (2017), Watson and Holmes (2016), Miller and Dunson (2018). Finally, approaches based on model embedding through heavy-tailed distributions are discussed by Andrade and O’Hagan (2006).
The aforementioned approaches may present some drawbacks. The empirical likelihood is not computable for small sample sizes and posterior distributions based on the quasi-likelihood can be easily obtained only for scalar parameters. The restricted likelihood approach of Lewis et al. (2014), as well as all the approaches based on estimating equations can be computationally cumbersome with some robust -estimating functions (such as, for instance, those used in linear mixed effects models). The tilted and the weighted likelihood approaches refer to concepts of robustness that are not directly related to the one considered in this paper, which is based on the influence function (Hampel et al., 1986, Huber and Ronchetti, 2009). Finally, the idea of embedding the model in a larger structure has the cost of requiring the elicitation of a prior distribution for the extra parameters introduced. Moreover, the statistical procedures derived under an embedded model are not necessarily robust in a broad sense, since the larger model may still be too restricted.
Here we focus on the robustness approach based on the influence function and on the derivation of robust posterior distributions from robust M-estimating functions, i.e. estimating equations with bounded influence function (see, e.g., Huber and Ronchetti, 2009, Chap. 3). In particular, we propose an approach based on Approximate Bayesian Computation (ABC) methods (see, e.g., Beaumont et al., 2002) using robust M-estimating functions as summary statistics. The idea extends results of Ruli et al. (2016) on composite score functions to Bayesian robustness. The method is easy to implement and computationally efficient, even when the M-estimating functions are potentially cumbersome to evaluate. Theoretical properties, implementation details and simulation results are discussed.
The rest of the paper is structured as follows. Section 2 sets the background. Section 3 describes the proposed method and its properties. Section 4 investigates the properties of the proposed method in the context of linear mixed models through simulations and an application to a clinical study. Concluding remarks are given in Section 5.
2 Background on robust -estimating functions
Let be a random sample of size , having independent and identically distributed components, according to a distribution function , with , and . Let be the likelihood function based on model .
Furthermore, let
[TABLE]
be an unbiased estimating function for , i.e. such that for every . In (1), is a known function, is the expectation with respect to and the function is a consistency correction which ensures unbiasedness of the estimating function.
A general M-estimator (see, e.g., Hampel et al., 1986, Huber and Ronchetti, 2009) is defined as the root of the estimating equation . The class of -estimators is wide and includes a variety of well-known estimators. For example, it includes the maximum likelihood estimator (MLE), the maximum composite likelihood estimator (see, e.g., Ruli et al., 2016, and references therein) and the scoring rule estimator (see e.g. Dawid et al., 2016, and references therein). Under broad regularity conditions, assumed throughout this paper, an -estimator is consistent and approximately normal with mean and variance
[TABLE]
where and are the sensitivity and the variability matrices, respectively. The matrix is known as the Godambe information and the form of is due to the failure of the information identity since, in general, .
The influence function (IF) of the estimator is and it measures the effect on the estimator of an infinitesimal contamination at the point , standardised by the mass of the contamination. A desirable robustness property for is that its IF is bounded (B-robustness), i.e. that is bounded. Note that the IF of the MLE is proportional to the score function; therefore, in general, the MLE has unbounded IF, i.e. it is not B-robust.
3 Robust ABC inference
One possibility to perform robust Bayesian inference is to resort to a pseudo-posterior distribution of the form
[TABLE]
where is a prior distribution for and is a pseudo-likelihood based on a robust , such as the quasi- or the empirical likelihood. This approach has two main drawbacks: the empirical likelihood is not computable for very small sample sizes and for moderate sample sizes the corresponding posterior appears to have always heavy tails (see, e.g., Greco et al., 2008); moreover, the posterior distribution based on the quasi-likelihood can be easily obtained only for scalar parameters. A further limitation of this approach is related to computational cost, in the sense that it requires repeated evaluations of the consistency correction in (1), which in practice is often cumbersome.
We propose an alternative method for computing posterior distributions based on robust -estimating functions, extending the idea in Ruli et al. (2016). The method resorts to the ABC machinery (see, e.g., Beaumont et al., 2002) in which a standardised version of , evaluated at a fixed value of , is used as a summary statistic. In Ruli et al. (2016) the composite score function is used as a model-based data reduction procedure for ABC in complex models. Here we generalise the approach to general unbiased robust estimating functions. In particular, let be the -estimate of based on the observed sample . Furthermore, let be such that . The summary statistic in ABC is then the rescaled M-estimating function
[TABLE]
evaluated at , where is a simulated sample. In the sequel we use the shorthand notation .
To generate posterior samples we propose to use the ABC-R algorithm with an MCMC kernel (Algorithm 1), which is similar to Algorithm 2 of Fearnhead and Prangle (2012); see also Marjoram et al. (2003). More specifically, the ABC-R algorithm (Algorithm 1) involves a kernel density , which is governed by the bandwidth and a proposal density ; see the Appendix for the implementation details.
The proposed method gives Markov-dependent samples from the ABC-R posterior
[TABLE]
While Algorithm 1 or the use of a kernel in (5) are not new ideas in the ABC literature, the novelty here is to incorporate in such machinery the robust summary statistic in order to obtain a simulated sample from a robust posterior distribution. Using similar arguments to Soubeyrand et al. (2013), it can be shown that, for , converges to pointwise (see also Blum, 2010), in the sense that and are equivalent for sufficiently small . Since in general (4) does not give a sufficient summary statistic, then differs from and information is lost by using (4) instead of . However this difference pays off in terms of robustness in inference about .
Posteriors conditional on partial information have been extensively discussed in the literature. Soubeyrand and Haon-Lasportes (2015) study the properties of the ABC posterior when the summary statistic is the MLE or the pseudo-MLE derived from a simplified parametric model. An alternative version of the ABC-R algorithm could be based directly on , used as the summary statistic and a, possibly rescaled, distance among the observed and the simulated value of the statistic. Apparently, these two versions of ABC, namely the one based on and that based on (4) seem to be treated in the literature as two separate approaches (see, e.g., Drovandi et al., 2015). However, both alternatives use essentially the same information, i.e. , but through different distance metrics. In addition, for small tolerance levels, these two distances converge to zero, and both methods give a posterior distribution conditional on the same statistic . Indeed, let be the summary statistic of the ABC posterior and let the corresponding tolerance threshold be sufficiently small and consider the random draw and its corresponding simulated summary statistics taken with the ABC algorithm. Then, by construction will be close to . This implies that also will be close to , and hence is also a sample from the ABC-R posterior which uses the summary statistic .
Nevertheless, the use of as summary statistic requires the solution of at each iteration of the algorithm, which could be computationally cumbersome. On the contrary, the proposed approach, besides sharing the same invariance properties stated by Ruli et al. (2016), i.e. invariance with respect to both monotonic transformation of the data and with respect to reparameterisations, has the advantage of avoiding computational problems related to the repeated evaluation of as shown by the following lemma.
Lemma 3.1
The ABC-R algorithm does not require repeated evaluations of the consistency correction involved in , as given by (1).
- Proof
Let be the solution of , with of the form (1). Then, for a given simulated from , we have
[TABLE]
This implies that is computed only once, at .
Theorem 3.1 below shows that the proposed method gives a robust approximate posterior distribution with the correct curvature, even though , unlike the full score function, does not satisfy the information identity. Here, correct curvature means that asymptotically the robust posterior distribution and its normal approximation have the same covariance matrix, which is the inverse of the Godambe information, i.e. .
Theorem 3.1
The ABC-R algorithm with rescaled M-estimating function as summary statistic, as , leads to an approximate posterior distribution with the correct curvature and is also invariant to reparameterisations.
- Proof
The proof follows from Theorem 3.2 of Ruli et al. (2016), by substituting the composite estimating equation with the more general M-estimating function .
The ABC-R algorithm delivers thus a robust approximate posterior distribution which does not need calibration. On the contrary, for (3) a calibration is typically required.
Theorem 3.2 below shows that the proposed ABC posterior distribution is asymptotically normal.
Theorem 3.2
Assume the regularity assumptions of Soubeyrand and Haon-Lasportes (2015) and the usual regularity condition on M-estimators (Huber and Ronchetti, 2009, Chap. 4) are satisfied. Then, for and , the posterior is asymptotically equivalent to the density of the normal distribution with mean vector and covariance matrix :
[TABLE]
- Proof
The proof follows from Lemma 2 and Theorem 1 in Soubeyrand and Haon-Lasportes (2015) and from the asymptotic relation between the Wald-type statistic and the score-type statistic, i.e.
[TABLE]
If is bounded in , i.e. if the estimator is B-robust, then the ABC-R posterior is resistant with respect to slight violations of model assumptions. More precisely, the following theorem shows that the ABC-R posterior inherits the robustness properties of the estimating equation.
Theorem 3.3
If is bounded in , i.e. if the estimator is B-robust, then asymptotically the posterior mode, as well as other posterior summaries of have bounded IF.
- Proof
From Theorem 3.2, the asymptotic posterior mode of is , which is -robust. Moreover, following results in Greco et al. (2008), it can be shown that asymptotic posterior summaries have bounded IF if and only if the posterior mode has bounded IF.
Example. We consider an illustrative example in which we compare numerically the ABC-R posterior, with the classical posterior based on the assumed model and the pseudo-posterior (3) based on the empirical likelihood (Lazar, 2003, Greco et al., 2008). Scenarios with data simulated either from the assumed model or from a slightly misspecified model are considered.
Let be a location-scale distribution with location and scale , and let . The Huber’s estimating function is a standard choice for robust estimation of location and scale parameters. The -estimating function is , with
[TABLE]
where , , is the Huber -function, is a scalar tuning constant which controls the desired degree of robustness of , and is a consistency correction term. Let be the normal distribution and assume and a priori independent with and , where is the half Cauchy distribution with scale parameter equal to . We consider random samples of sizes drawn from either the normal distribution with and from a contaminated model , with . We set the contamination level equal to 10%, i.e. , and . Moreover, we fix and , which imply that and are, respectively, 5% and 10% less efficient than the corresponding MLE under the assumed model (see Huber and Ronchetti, 2009, Chap. 6).
The genuine, e.g. the posterior based on the likelihood function of the normal model, and the pseudo-posterior (3) based on the empirical likelihood (EL) are computed by numerical integration. The ABC-R posterior is obtained using Algorithm 1. From the posterior distributions illustrated in Figure 1 we note that, when the data come from the central model (panels (a)-(b)), i.e. for , all the posteriors are in reasonable agreement, even if the EL posterior behaves slightly worse, especially the marginal posterior of with . When the data are contaminated (panels (c)-(d)), the genuine posterior is less trustworthy as the bulk of the posterior drifts away from the true parameter value (vertical and horizontal straight lines). This is not the case however for the ABC-R posterior which remains centred around the true parameter value. We note that in the contaminated case, the ABC-R posterior is the one with smaller variability. This is due to the fact that the ABC-R posterior is not affected by the very outlying observations coming from the contamination component.
To highlight the robustness properties of the ABC-R posterior, we consider a sensitivity analysis. A sample of size is taken from the central model and the aforementioned posteriors are computed from the contaminated data given by the original data with the median observation replaced by ; is a contamination scalar with possible values The results of the sensitivity analysis, illustrated by means of violin plots in Figure 2, highlight that the posterior median of the genuine posterior (panel (c)) is substantially driven by . On the other hand, ABC-R and EL posteriors are robust. For all posteriors, the behaviour of the posterior median reflects the behaviour of the IF of the posterior mode. Furthermore, the variability of all posteriors is comparable for values of close to 0. More generally, these plots confirm that the genuine and EL posteriors under contamination are much more dispersed than the ABC-R posterior.
4 Application to linear mixed models
Linear mixed models (LMM) are a popular choice when analysing data in the context of hierarchical, longitudinal or repeated measures. A general formulation is
[TABLE]
where is a -dimensional vector of response observations, and are known and design matrices, is a -vector of unknown fixed effects, the are -vectors of unobserved random effects and is a vector of unobserved errors. The levels of each random effect are assumed to be independent with mean zero and variance . Moreover, each random error is assumed to be independent with mean zero and variance and and are assumed to be independent.
Here we focus on the classical normal LMM, which assumes that and , . For a normal LMM, it follows that is multivariate normal with and where . We assume that the set of unknown parameters is identifiable. The validity and performance of this LMM requires strict adherence to the assumed model, which is usually chosen because it simplifies the analyses and not because it fits exactly the data at hand. The robust procedure discussed in this paper specifically takes into account the fact that the normal model is only approximate and then it produces statistical analyses that are stable with respect to outliers, deviations from the model or model misspecifications.
Although the observations are not independent, if the random effects are nested, then independent subgroups of observations can be found. Indeed, in many situations, can be split into independent groups of observations , , and the log-likelihood is
[TABLE]
where and and are partitioned accordingly. Classical Bayesian inference for is based on , where is a prior distribution for . However, (9) can be very sensitive to model deviations (Richardson and Welsh, 1995, Richardson, 1997, Copt and Victoria-Feser, 2006); see also results of the simulation study in Section 4.1.
In the frequentist literature, there are two broad classes of estimators for robust estimation of Gaussian LMM: -estimators (see, e.g., Richardson and Welsh, 1995, Richardson, 1997, and references therein) and -estimators (Copt and Victoria-Feser, 2006). The latter are generally available for balanced designs whereas the formers can be applied to a wide variety of situations; for instance it can deal with unbalanced designs and robustness with respect to the design matrix (Richardson, 1997). In this work we focus on M-estimators but it is worth stressing that the idea can be applied to -estimators as well. Following Richardson and Welsh (1995), we focus on the system of M-estimating equations
[TABLE]
where is the vector or scaled marginal residuals, , with , and is the trace operator. The function is a correction factor needed to ensure consistency at the Gaussian model for each . Equations (10)-(11) are called robust REML II estimating equations and are bounded versions of restricted likelihood equations. Richardson (1997) shows that the -estimator based on (10)-(11) is asymptotically normal with mean equal to the true parameter and covariance matrix of the form (2). The ABC-R procedure in the normal LMM based on (10)-(11) will be studied by means of simulations in Section 4.1 and then applied to a dataset from a clinical study in Section 4.2.
4.1 Simulation study
Let us consider the two-component nested model
[TABLE]
where is the grand mean, are the fixed effects, constrained such that , are the random effects and is the residual term, for and . Model (12) is a particular case of (8) with , a single random effect with levels and the unit diagonal matrix. Moreover, the covariate is a categorical variable with levels; hence the design matrix is given by dummy variables.
We assess the properties of the proposed method via simulations with 500 Monte Carlo replications. For each Monte Carlo replication, the true values for and for are drawn uniformly in and , respectively. With these values, two datasets of size are generated: one from the central model and one from the contaminated model , where is the matrix of covariates for the th unit, and . We consider and . The prior distributions are and . For each scenario, we fit model (12) in the classical Bayesian way, using an adaptive random walk Metropolis-Hastings algorithm. The same model is fitted by the ABC-R method using the estimating equations (10)-(11). As in Richardson and Welsh (1995), we set and and we find solving (10)-(11) iteratively until convergence. The classical REML estimate, computed by the function lmer of the lme4 package, is used as starting value. In our experiments, the convergence of the solution is quite rapid, i.e. stabilises within 10–15 iterations.
We assess the component-wise bias of the posterior median by the modulus of in logarithmic scale, where is the true value. Moreover, the efficiency of the classical Bayesian estimator relative to the ABC-R estimator is assessed through the index , where ; see Richardson and Welsh (1995) and Copt and Victoria-Feser (2006). In addition, for each Monte Carlo replication we compute the Euclidean distance of from , which can be considered as a global measure of bias. Contrary to Richardson and Welsh (1995), we consider a different for each Monte Carlo replication. The bias and efficiency of the classical Bayesian posterior and of the ABC-R posterior for the 500 replications are illustrated in Figures 3 and 4, respectively.
Under the central model, inference with the ABC-R and the classical Bayesian posteriors is roughly similar, i.e. both bias and efficiency compare equally well across the two methods. This holds both for the fixed effects and for the variance components . Under the contaminated model, we notice important differences among ABC-R and the classical Bayesian estimation. In particular, based on ABC-R is less biased, both globally and on a component by component basis, and more efficient. The gain in efficiency is particularly evident for the variance components.
4.2 Effects of GRP94-based complexes on IL-10
The GRP94 dataset (Tramentozzi et al., 2016) concerns the measurement of glucose-regulated protein94 in plasma or other biological fluids and the study of its role as a tumour antigen, i.e. its ability to alter the production of immunoglobines (IgGs) and inflammatory cytokines in the peripheral blood mononuclear cells (PBMCs) of tumour patients. The study involved 27 patients admitted to the division of General Surgery of the Civil Hospital of Padova for ablation of primary, solid cancer of the gastro-intestinal tract. For each patient, gender, age (expressed in years), type and stage of tumour (ordinal scales of four levels) are given. Patients’ plasma and PBMCs were challenged with GRP94 complexes and the level of IgG and of the cytokines: interferon (IFN), interleukin 6 (IL-6), interleukin 10 (IL-10) and tumour necrosis factor (TNF) were measured. Owing to time and cost constraints, for patients IDs 17, 27 and 28 only IgG was measured. The following five treatments were considered: GRP94 at the dose of either 10 ng/ml or 100 ng/ml, GRP94 in complex with IgG (GRP94+IgG) at the doses 10 ng/ml or 100 ng/ml and IgG a the dose 100 ng/ml. Finally, baseline measurements of IgG and of the aforementioned cytokines were taken from untreated PMBCs. Although fresh patient’s plasma and PMBCs are taken for each treatment and patient, the resulting measures are likely to be correlated since plasma and PMBCs are taken from the same patient. Hence, a LMM can be suitable for these data. Using paired Mann-Whitney tests, Tramentozzi et al. (2016) show that GRP94 in complex with IgG at the higher dose can significantly inhibit the production of IgG, whereas GRP94 at both doses can stimulate the secretion of IL-6 and TNF from PBMCs of cancer patients. In addition, some of the differences between treatments were significant for a specific gender; see Tramentozzi et al. (2016) for full details.
A feature of these data is the presence of extreme observations, both at baseline and challenged PMBCs-based measurements, as it can be seen from the strip plots in Figure 5. Such extreme observations induce high variability on the response measurements, especially for IFN, IL-6, IL-10 and TNF. Hence, one must be cautious when fitting a LMM to such data.
We fit the two-component nested LMM (12) to the IL-10 with ABC-R using estimating equations (10)-(11). Since all measures are positive and some of them are highly skewed, a logarithmic transformation is used in order to alleviate distributional skewness. Furthermore, since Tramentozzi et al. (2016) highlight a possible gender effect (especially with respect to the cytokines) we also check for gender effects by including an interaction with gender. The model with interaction is
[TABLE]
where wi is a dummy variable for gender, is the fixed effect of the treatment-gender interaction, and is the unit vector of dimension 6. The interaction model (13) has unknown fixed effects .
As in this case there is no extra-experimental information, we assume vague priors. In particular, and , for . For the variance components, following Gelman (2006), we assume and in both models. However, we note that one of the features of the proposed method is the simultaneous ability to have robustness to possible model misspecification and to include prior information on model parameters, if available.
ABC-R posterior samples are drawn using Algorithm 1. For comparison purposes, we fit also a classical Bayesian LMM with the aforementioned prior and an adaptive random walk Metropolis-Hastings algorithm is used for sampling from this posterior. Figure 6 compares the ABC-R and the classical posterior for a subset of the fixed effects of models (12) and (13) by means of kernel density estimations. The parameters shown are those referring to the treatments based on GRP94 at the dose of 10 ng/ml (GRP94_10), GRP94 at the dose of 100 ng/ml (GRP94_100) and GRP94 in complex with IgG at the dose of 100 ng/ml (GRP94+IgG_100), which according to Tramentozzi et al. (2016) are the most prominent. The first row (d1) illustrates the marginal posteriors of the parameters of (12) (with baseline being the reference category). The second row (d2) shows the marginal posteriors of the parameters of (13) (with baseline and female being the reference categories). Numbers within parenthesis in the plot subtitles give the evidence in favour of the null hypothesis H0 that the parameter is equal to zero, computed under the Full Bayesian Significance Testing (FBST) setting of Pereira et al. (2008); inside the parenthesis, the first (last) value from left refers to the ABC-R (classical) posterior.
The FBST in favour of has been proposed by Pereira and Stern (1999) as an intuitive measure of evidence, defined as the posterior probability related to the less probable points of the parametric space. It favours whenever it is large and it is based on a specific loss function and thus the decision made under this procedure is the action that minimises the corresponding posterior risk (Pereira et al., 2008). The FBST solves the drawback of the usual Bayesian procedure for testing based on the Bayes factor (BF), that is, when the null hypothesis is precise and improper or vague priors are assumed, the BF can be undetermined and it can lead to the so-called Jeffreys-Lindley paradox.
There is a high posterior probability that the effect of GRP94_100 with or without interaction with gender is different from the baseline, since the evidence of H0 is rather low under the classical Bayesian LMM. However, such effects vanish under the robust ABC-R procedure. This is an indication to the fact that the classical LMM posterior in the case of log IL-10 is likely to be driven by few extreme observations.
5 Discussion
Currently, the only available approach for obtaining posterior distributions explicitly using robust unbiased estimating functions is through pseudo-likelihood methods such as the empirical or the quasi-likelihood (Greco et al., 2008). Bissiri et al. (2016) show how robust posterior distribution can be based on generic loss functions, in some special cases derived from robust estimating equations. In this work, we present an alternative approach that directly incorporates robust estimating functions into approximate Bayesian computation techniques. With respect to available approaches based on pseudo-likelihoods, our method can be computationally faster when the evaluation of the estimating function is expensive.
Motivated by the GRP94 dataset, we focused on two-component nested LMM, but more complex models can be fitted since the estimating equations (10)-(11) are very general (see Richardson, 1997). For instance, it is possible to deal with models with multiple random effects or even with robustness with respect to the design matrix. An R implementation of the proposed method is provided in the robustBLME package (Ruli et al., 2018).
The proposed method can be applied to any unbiased robust estimating equations, such as -estimating equations. The study of the proposed approach with S-estimating in the proposed approach is left for future work.
From a practical perspective we recommend to fit both classical and robust LMMs and compare their posteriors, say by FSBT. If the differences are mild then the posterior is probably not impacted by outliers so the classical LMM can be safely used. On the contrary, if there are important differences between them, then it is likely that the LMM posterior is driven by outliers and therefore the robust posterior would be a safer choice.
Acknowledgements
This work was partially supported by University of Padova (Progetti di Ricerca di Ateneo 2015, CPDA153257) and by the Italian Ministry of Eduction under the PRIN 2015 grant (2015EASZFS_003).
Appendix: Computational details
Provided simulation from is fast, the main demanding requirement of the proposed method is essentially the computation of the observed and the scaling matrix evaluated at . Given that, for large sample sizes,
[TABLE]
where is a -vector of zeros and is the identity matrix of order , it is reasonable to replace with the multivariate normal density centred at zero and with covariance matrix . In order to choose the bandwidth we consider several pilot runs of the ABC-R algorithm for a grid of values, and select the value of that delivers approximately 0.1% acceptance ratio (as done, for instance, by Fearnhead and Prangle, 2012).
Contrary to other ABC-MCMC algorithms in which the proposal requires pilot runs (see, Cabras et al., 2015, for building proposal distributions in ABC-MCMC), in our case a scaling matrix for the proposal can be readily build, almost effortlessly, by using the usual sandwich formula (2) evaluated at (see also Ruli et al., 2016). Even in cases in which and are not analytically available, they can be straightforwardly estimated via simulation. Indeed, in our experience, 100-500 samples from the model , give estimates with reasonably low Monte Carlo variability (see also Cattelan and Sartori, 2015). Throughout the examples considered we use the multivariate -density with 5 degrees of freedom as the proposal density and the ABC-R is always started from . In the ABC algorithm, we fix the tolerance threshold in order to give a pre-specified but small acceptance ratio, as frequently done in the ABC literature. In our experimentations we found that an acceptance value of 0.1% gives satisfactory results.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Agostinelli and Greco (2013) Agostinelli, C. and Greco, L. (2013) A weighted strategy to handle likelihood uncertainty in Bayesian inference. Computational Statistics , 28 , 319–339.
- 2Andrade and O’Hagan (2006) Andrade, J. A. A. and O’Hagan, A. (2006) Bayesian robustness modeling using regularly varying distributions. Bayesian Analysis , 1 , 169–188.
- 3Beaumont et al. (2002) Beaumont, M. A., Zhang, W. and Balding, D. J. (2002) Approximate Bayesian computation in population genetics. Genetics , 162 , 2025–2035.
- 4Bissiri et al. (2016) Bissiri, P. G., Holmes, C. C. and Walker, S. G. (2016) A general framework for updating belief distributions. Journal of the Royal Statistical Society: Series B , 78 , 1103–1130.
- 5Blum (2010) Blum, M. G. B. (2010) Approximate Bayesian computation: a nonparametric perspective. Journal of the American Statistical Association , 105 , 1178–1187.
- 6Cabras et al. (2015) Cabras, S., Castellanos Nueda, M. E. and Ruli, E. (2015) Approximate Bayesian computation by modelling summary statistics in a quasi-likelihood framework. Bayesian Analysis , 10 , 411–439.
- 7Cattelan and Sartori (2015) Cattelan, M. and Sartori, N. (2015) Empirical and simulated adjustments of composite likelihood ratio statistics. Journal of Statistical Computation and Simulation , 86 , 1056–1067.
- 8Copt and Victoria-Feser (2006) Copt, S. and Victoria-Feser, M. P. (2006) High-breakdown inference for mixed linear models. Journal of the American Statistical Association , 101 , 292–300.
