Research Article  Open Access
Tom Burr, Alexei Skurikhin, "Selecting Summary Statistics in Approximate Bayesian Computation for Calibrating Stochastic Models", BioMed Research International, vol. 2013, Article ID 210646, 10 pages, 2013. https://doi.org/10.1155/2013/210646
Selecting Summary Statistics in Approximate Bayesian Computation for Calibrating Stochastic Models
Abstract
Approximate Bayesian computation (ABC) is an approach for using measurement data to calibrate stochastic computer models, which are common in biology applications. ABC is becoming the “goto” option when the data and/or parameter dimension is large because it relies on userchosen summary statistics rather than the full data and is therefore computationally feasible. One technical challenge with ABC is that the quality of the approximation to the posterior distribution of model parameters depends on the userchosen summary statistics. In this paper, the user requirement to choose effective summary statistics in order to accurately estimate the posterior distribution of model parameters is investigated and illustrated by example, using a model and corresponding real data of mitochondrial DNA population dynamics. We show that for some choices of summary statistics, the posterior distribution of model parameters is closely approximated and for other choices of summary statistics, the posterior distribution is not closely approximated. A strategy to choose effective summary statistics is suggested in cases where the stochastic computer model can be run at many trial parameter settings, as in the example.
1. Introduction
To advance knowledge of biological systems, bioinformatics includes a wide range of real and modeled data. For a model with parameters and data , a key quantity in Bayesian inference is the posterior distribution of model parameters given by Bayes rule as , where is the probability distribution for prior to observing data , is the likelihood, and is the marginal probability of the data, used to normalize the posterior probability to integrate to 1 [1]. The likelihood can be regarded as the “data model” for a given value of . Alternatively, when the data is considered fixed, is regarded as a function of , and nonBayesian methods such as maximum likelihood find the value of that maximizes [1]. Regarding notation, note, for example, that is not the same as , but to keep the notation simple, we assume the distinction is clear from context.
In many applications, the data model is computationally intractable but instead is implemented in a stochastic model (SM), so many realizations from are available by running the model many times at each of many trial values of . In a bioinformatics example, [2] considered the classic problem of inferring the time to the most recent common ancestor of a random sample of DNA sequences. The full likelihood of the data involves the branching order and branch lengths, which is known to be computationally intractable because the number of possible branching orders of a sample of DNA sequences grows approximately as !. Therefore, [2] greatly simplified the analysis by replacing with the number of segregating sites (a segregating site is a site that exhibits variation in the DNA character across the sample) in the sample of sequences. The key simplification exploited in [2] is that the distribution of does not depend on the branching order or individual branch lengths, but only on the total length of the phylogenetic tree, which is the sum of all branch lengths. Of course is a summary statistic that has long been of interest in population genetics. But how effective is for estimating the posterior distribution of the time to the most recent common ancestor of the sample? The main point of this paper is to explore the impact of the choice of summary statistic(s) on the quality of the estimated posterior distribution when using approximate Bayesian computation (ABC), which is defined in Section 2. We investigate the user requirement to choose good summary statistics to effectively estimate the posterior distribution of model parameters by example, using a model and corresponding real data of mitochondrial DNA population dynamics.
In our context, the SM provides the data generation mechanism, so there is no explicit functional form for . Likelihoodfree inference dates to at least [3], but the name approximate Bayesian computation (ABC) originated in [4] while referring to an approach to likelihoodfree inference methods. Effective values of input parameters for both deterministic and stochastic computer models are typically chosen by some type of comparison to measured data. Parameter estimation for deterministic models is frequently done by running the model at multiple values of the input parameters, constructing an approximator to the model, and using the approximator inside a numerically intense loop that examines many trail values for the input parameters [5–8]. The numerically intense loop is often Markov Chain Monte Carlo (MCMC), which is a method to simulate observations from the posterior distribution of model parameters [1, 9]. Parameter estimation for stochastic models for which an explicit likelihood is not available has been attempted at least once using MCMC with a model approximator [10], but is far more commonly done using ABC. For examples of ABC applied to calibrate SMs, see [11–27] and the many references cited by [11–27]. The example in Section 4 is based on the example in [10], but we use ABC instead of a model approximator inside the MCMC loop.
The paper is organized as follows. The next section gives background on ABC. Section 3 describes in more detail the challenge in ABC of choosing effective summary statistics. Section 4 is an example, using a model and corresponding lab data of mitochondrial DNA population dynamics. The example shows that for some choices of summary statistics, the posterior distribution of model parameters is closely approximated and for other choices of summary statistics, the posterior distribution is not closely approximated. A strategy to choose effective summary statistics is suggested in cases where the stochastic computer model can be run at many trial parameter settings, as in the example.
2. ABC Background
Assume that a SM has input parameters and outputs data ( for “model”) and that there is corresponding observed real data . In this section and the remaining sections we either use the conventional notation for data or the informal used in the Introduction, depending on context. We replace the notation for the data generation mechanism with to convey the fact that there is no explicit functional form for the likelihood, but only a “black box” SM that outputs data for given values of inputs . That is, traditionally, the notation conveys a specific functional form, such as the familiar Gaussian distribution, while the notation conveys the black box function encoded by the SM.
The ABC approach uses to “calibrate” the SM by choosing effective values for the parameters. If the SM can be run for many trial values of , MCMC can be used, where candidate values are accepted in the chain if the distance between and is reasonably small. Alternatively, for most applications, and for our focus here, it is necessary to reduce the dimension of to a relatively small set of summary statistics and instead accept trial values of inside the MCMC loop if . For example, can be a time series of changes in the proportion of mutant species at various time lags, while could be a scalar count of how often successive differences in are larger than a multiple of the measurement error. Most applications of ABC have relied on summary statistics that are chosen on the basis of expert opinion or established practice (such as the number of segregating sites in the example in Section 1) rather than for their role in providing a high quality approximation to the posterior distribution [4, 12, 14, 18, 20].
The goal in nearly all Bayesian inference is to approximate the posterior distribution of given the data . The ABC approach to do so is to estimate using the socalled partial posterior distribution . That is, ABC conditions on the value of the observed summary statistic rather than on the actual data . Because trial values of are accepted if , an approximation error to the partial posterior distribution arises that several ABC options attempt to mitigate. Such options involve weighting the accepted values by the actual distance [13].
ABC was developed to calibrate a model using summary statistics, but ABC has the potential to choose between candidate models, say models and . When analytical likelihoods are available, one typically evaluates using the likelihoods and and the prior probabilities of the models and . Bayesian model selection is a large topic [1, 4, 12, 21], and it is currently used in calibrating deterministic models using field data [5–8]. Using Bayes rule, and are the marginal likelihood for model , defined as . In model selection to decide between and , the prior probabilities and must also be specified so that can be compared to [1, 21]. The analogous concept in the case of stochastic models is still the posterior distribution or , but summary statistics are used to approximate and . Applications papers have extended ABC to include an option to choose among candidate models that includes different models with possibly different numbers of parameters in a solution space that is explored by simulation [4, 12, 21]. However, the approximation quality of ABC with or without model selection is a subject of ongoing research [18–21].
ABC is compelling, when the data and/or parameter dimension is large, and is becoming the “goto” option for many application areas, particularly whenever the likelihood involves summing probabilities over many unobserved states such as genealogies in biology [2], applications in epidemiology [22], astronomy, and cosmology [23]. However, challenges remain in ensuring that ABC leads to reasonable approximation to the full posterior distribution of SM parameters .
3. Choosing Summary Statistics for ABC
To obtain samples from the approximate posterior distribution for candidate models and model parameters, ABC invokes MCMC [1, 9, 17] with summary statistics such as moments of the observed data to those in the simulated data to decide whether to accept each candidate model and set of parameter values inside the MCMC loop. Note that in cases where the likelihood (the probability density function, pdf, viewed as a function of the parameters values) is known except for a normalizing constant, MCMC has been the main option for numerical Bayesian inference since the 1990s [1]. The main challenges with MCMC using a known likelihood function are that efficient sampling methods are sometimes needed to choose candidate parameter values, and in all cases the burden is on the user to check whether the MCMC is actually converging to the correct full posterior distribution. Because ABC simply accepts trial values of the parameters provided , a common version of ABC uses a very specialized form of MCMC that is called the “rejection” method. Other ABC versions are under investigation [17].
ABC typically consists of three steps: (1) sample from the prior distribution of parameter values ; (2) simulate data for each simulated value of ; (3) accept a fraction of the samples prior values in (1) by checking whether the summary statistics computed from the data in (2) satisfy . If desired, adjust the accepted values on the basis of the actual value. Despite the simplicity of ABC, open questions remain regarding to what extent ABC achieves its goal of approximating the full posterior probability. ABC has been shown to work well in some cases [19], but it has also proven not to work well in other cases [21]. There are open questions for ABC regarding the choice of summary statistics [18–21], whether model selection via ABC is viable (meaning that the user can know whether the estimation quality of the full posterior distribution is adequate to successfully compare candidate models [21]), and regarding error bounds for the estimated posterior distribution. Approximate error bounds are possible by simulation using auxiliary simulations such as in Section 4 and [20].
ABC requires the user to make three choices: the summary statistics, the threshold , and the distance measure . This paper’s focus is on the user’s choice of summary statistics. Recall from the Introduction that in many applications of ABC, the user chooses summary statistics such as the number of segregating sites in a random sample of DNA sequences simply because such a statistic is heavily used in the application area without considering whether the chosen summary statistic renders the partial posterior to be a good approximation to the full posterior.
A few recent papers have considered summary statistic selection from the viewpoint of aiming for better inference or better approximation to the full posterior probability [18–21]. ABC makes two approximation steps. First, the full posterior probability is estimated by the partial posterior probability. Second, the partial posterior probability is itself estimated. Recall from Section 2 that some versions of ABC include options to improve the quality of the partial posterior approximation, such as weighting the accepted parameter values in the MCMC [12, 13].
To improve the choice of which partial posterior approximation to use, the notion of approximate statistical sufficiency can be invoked to try to choose more effective summary statistics [18]. Suppose there is a list of candidate summary statistics . A user then wonders whether adding candidate statistic would improve the approximation of the full posterior . In [18], ABC must be performed on and then on . If the calculated ratio is statistically significantly different from 1, include candidate statistic . The framework in [18] is therefore the same framework as for variable selection in fitting any response, so the full arsenal of possibilities in modern data mining is possible. To date, only relatively simple variable selection that is sensitive to the order with which candidate summary statistics are presented has been assessed, only in the few examples in [18]. In [18], the procedure to decide whether is statistically significantly different from 1 involves an auxiliary simulation and calculating the maximum and minimum values of on a userchosen grid of values. An even more computationally demanding option to decide whether is statistically significantly different from 1 could invoke some type of density estimation. The simulation approach in [18] makes no judgment whether including candidate summary statistic leads to a better approximation. Instead, the simulation approach aims to infer whether including has a significant impact on the estimated partial posterior distribution.
Alternatively, to choose effective summary statistics [19] aims to make the selection of summary statistics more “automatic” and less user dependent by requiring the user to run pilot simulations of the model. However, the examples in [19] illustrate the potential for poor ABC performance because the three ABC choices that lead to best performance were shown to vary across examples. The suggested strategy in [19] requires pilot runs of the model in order to improve the user choices, particularly of the summary statistics. The pilot runs require a set of input parameter values to generate data that is similar to the real data . The goal is then for many realizations of the data from parameter values to help the user choose summary statistics. Specifically, for ABC to lead to good estimation of , [19] shows that the estimated posterior means of the parameters based on the pilot runs are effective summary statistics. There are several options described in [19] to estimate the posterior means of model parameters. The simplest one to describe is to fit in turn each individual parameter in using some type of data transformation, such as the actual data and moments of the data. The fitted coefficients from the fit are obtained from the pilot simulation runs and can then be used in subsequent runs to estimate the parameter means. Reference [20] also aimed for better estimation of and also used auxiliary simulations, but, unlike [19], summary statistics were pursued that minimized the entropy (uncertainty) of the estimated full posterior probability. Of course the user might have other criteria, such as for ABC to lead to a good estimation of the full posterior for as in our example in Section 4 which also relies on auxiliary simulations.
To summarize this section, the choice of summary statistics is very important if the partial posterior obtained using ABC is to provide an adequate approximation to the full posterior . A few publications have begun to address the issue of summary statistic selection [18–21]. And, a debate has begun to what extent the partial posterior obtained using ABC is adequate for model selection [21]. Again, summary statistic selection is an important aspect of ABC’s ability to provide adequate model selection capability.
4. Example: Mitochondrial DNA Population Dynamics Model
This section presents an example for which the stochastic computer model is relatively simple so we can generate many observations from the model.
4.1. Example
Neuronal loss in the substantia nigra region of the human brain is associated with Parkinson’s disease [10]. Deletion mutations in the mitochondrial DNA (mtDNA) in the substantia nigra region are observed to accumulate with age. A deletion mutation converts a healthy copy of mtDNA to the mutant (unhealthy) variant. The number of mutant copies in cases with Parkinson’s disease tends to be higher than in controls without Parkinson’s disease. The role that mtDNA deletions play in neuronal loss is not yet fully understood, so better understanding of how mtDNA deletions accumulate is an area of active research. Reference [10] used a simple stochastic model that allowed for any of five reactions, occurring at rates to be estimated. The five reactions are mutation, synthesis, degradation, mutant synthesis, and mutant degradation.
Let denote the number of healthy (1) mtDNA copies and denote the number of unhealthy (2) (mutant) mtDNA copies. Following [10] we assume the following five reactions are possible, with the reaction rates as specified. The lower case and refer to an individual cell of type 1 or 2. So, for example, reaction below depicts a single cell of type 1 mutating to type 2 at a rate . at rate at rate at rate at rate at rate .
The time between reactions is assumed to have an exponential distribution. The sum of the five rates is the total reaction rate, which determines exponential parameter (the average time between reactions). Given that a reaction occurs at a specific time, the relative rates determine the probabilities with which the five reactions occur. To model the harmful effects of mutation from type 1 to type 2 cells, it is assumed that a cell dies if its proportion of mtDNA deletions for some lethal threshold . This simple model can be simulated from exactly using Gillespie’s discrete event simulation [28]. Reference [10] gives more information, including information about measurement error models. To focus on summary statistic selection, we simplify the measurement assumptions and measurement error model used in [10] and assume that measurements of are available at a sequence of times . The real measurement data will be assumed to be of this form, although the measurement details and number of neurons sampled multiple times from each of 15 patients of varying ages make the measurement process used in [10] somewhat more complicated. In particular, the model in [10] did not include a betweenpatient factor, so we simplified the data by aggregating the data over patients and measurements of the same patient at the same age. Figure 1 plots the aggregated real data from Figure 1 of [10] and from one realization of simulated data assuming that cells are measured each day.
(a)
(b)
Note that rates and are assumed to be known multiples of rate , so the inference goal is to estimate . A range of possible values for each of was based in [10] on previous investigations. The prior range for was to per day, for was to per day, and for was 0.5 to 1. All three of these parameters are of interest not just as model calibration parameters, but for their physical implications. For example, it is not yet known whether neurons can survive with very high levels of mtDNA deletions. As with any Bayesian analysis, an evaluation of the sensitivity to the prior distribution for the model parameters should be included, particularly for informative priors. In our example, we used informative priors, uniform over the accepted ranges. A separate simulation confirmed that the estimated posterior is sensitive to the assumed parameter range. An example comparison using two ranges for the uniform priors is given in Section 4.4.
The approach in [10] to estimate is based on approximating the computer model using a Gaussian Process, which is a common approach in calibrating deterministic computer models. Reference [10] mentions the possibility of estimating using ABC. Future work will compare such options. Here, we focus on better understanding of the effect of summary statistic selection on ABC performance.
4.2. ABC Approach
Recall that we assume measurements of are available at a sequence of times . The real data we use is in Table 1 of [10], which for simplicity we aggregate over subjects and measurements within subjects to the data shown in Figure 1 (see Section 4.4). Note that the real data is observed much less frequently than once per simulated time step which is one day in our simulation. For completeness, we first assume real data is available once per day and then assume real data is available much less frequently, such as in Figure 1(a).
In any implementation of ABC the user must specify the distance measure, the acceptance threshold , and the summary statistics. In addition, the user chooses the number of model runs at each value of the parameter vector and the number of values of the parameter vector presented to the ABC algorithm. The statistical programming language R is among the good choices for ABC implementation; here we use the abc function in the abctools package for R [29]. The abc function also requires the user to decide whether to work with transformed parameter values and to select a method to improve estimation of the partial posterior by adjusting the accepted values according to the distance between the summary statistics and the observed summary statistics [4, 13]. The default method is the “unadjusted” method which accepts all values corresponding to without any weighting. Results given in Section 4.4 are for the unadjusted option and for the option that adjusts accepted values.
4.3. Simulation Approach
Our goal for this mDNA example is to illustrate an approach to making good choices for the summary statistics when the user wants the estimated partial posterior distribution for to be well calibrated. Well calibrated in this example context means, for instance, that the true is contained in approximately 95% of repeated constructions of 95% predictive intervals for . That is, the actual coverage is very close to the nominal coverage.
To check our ABC “calibration,” we repeated the following simulation procedure using replications and recorded how often nominal intervals containing 95%, 90%, 80%, 60%, 50%, 40%, 20%, 10%, and 5% of the estimated posterior probability (which serves as an estimate of ) actually contain the true parameter value for the three parameters in .
Simulation Procedure
Step A. Simulate data from the SM at many parameter values . Specifically,(1)select each of from their respective uniform prior distributions (the ranges are given in Section 4.1) for simulations,(2)for each selected value of , simulate up to 100 years of 1day step sizes of the five reaction rates. If at any step, terminate. Some variations of ABC will repeatedly simulate in step (2) for the chosen values in step (1).
Step B. Real data (or simulated, but with the simulated playing the role of real data):(1)Real data: Either use real measurement data or mimic one realization of real measurement data by repeating Step A once. Here we use simulated measurement data to mimic real data, so that we can know the true value of . (2)Using the simulations from Step A, accept the trial values from 100 (10%) of the simulations on the basis of in each of the simulations, resulting in an approximation of the partial posterior probability which serves to estimate the full posterior probability . The accepted trial values can be used “as is” to approximate or adjusted to account for the actual distance , for example, as in [4, 13].
Step C. (1) Use the 100 accepted trial values of in Step B to tally whether the true parameter values are contained within the estimated 95%, 90%, 80%, 60%, 50%, 40%, 20%, 10%, and 5% posterior intervals.
This 3step simulation procedure is repeated for replications. Following [10], each simulation began with cells. We depart slightly from [10] in that each simulation began with mutant cells (rather than 0 mutant cells), so that each run of up to 100 years tended to conclude in a modest number of years from the starting point due to exceeding the lethal maximum , so that run times are shorter; this mimics starting with older subjects, nearly all of which do not live close to 100 years beyond their fictitious starting age defined by having 600 mutant cells at the start of the simulation. Such a choice will impact our inference results, analogous to choosing data ranges in calibration experiments. However, our topic is the choice of summary statistics rather than experimental design for choosing effective data ranges (the data ranges are the subjects’ ages in our example).
Also following [10] we simulated the effects of measurement error, but for simplicity we assumed there was only one measurement method rather than two. To mimic measurement errors due to finite number of observations and the actual measurement process itself, we assume that only 300 of the 1000 cells were observed and that fraction was measured with a relative random error standard deviation of 0.20 on the log_{10} scale. These two effects (observing 300 of 1000 and 0.1% relative error standard deviation on result in a root mean squared error of approximately 0.13 in the measured relative frequency on average across the range of values. In comparison, [10] assumes an absolute random error standard deviation of 0.25 on the log_{2} scale. Because two measurement techniques are combined in [10], which complicated the analysis beyond our needs here, we do not attempt to exactly mimic their approach, but only to use reasonable measurement error assumptions for illustration.
4.3.1. The Summary Statistics
Let denote the measured value of , and denote the measured value of . The first candidate set of summary statistics is the following three: the average rate of change of , coefficients and in a linear model relating the change in (the response) to predictors consisting of the current , and the current ratio . The second candidate set of summary statistics is the same as the first, but also includes the maximum of the observed ratio and the number of steps until cell death. The third candidate set of summary statistics is the same as the first, but also includes coefficients and in a linear model relating the change in (the response) to predictors consisting of the current , and the current ratio . All three candidate sets of summary statistics were computed for sets of simulated data that was observed at each time step (day), and also much less frequently as in the real data. To mimic the real data, we sampled the simulated data at 13 random times over the duration of each simulation.
Concerning the choice of summary statistics, these three candidate sets are arbitrary but reasonable statistics that clearly relate to the SM and so are informative for the SM parameters. For example, the average rate of change of relates directly to parameter .
4.4. Example Results
Here we present results for three candidate sets of summary statistics. Our strategy involves two criteria. First, retain for consideration any set of summary statistics that leads to a wellcalibrated estimate of on the basis of the 3step simulation procedure. Here, the term “well calibrated” means that actual coverage is very close to the nominal coverage. Second, among all sets of such summary statistics, choose the set that has the smallest estimation error for . The second criterion is similar to that suggested in [19, 20]. The strategy in [18] described in Section 3 to decide whether adding an additional statistic will impact the posterior could of course also be used to confirm that the three candidate sets of summary statistics do lead to meaningfully different estimates of the partial posterior distribution.
Figure 2 is a plot of the actual (estimated to within ± 0.03 on the basis of 1000 replications of the simulation approach) coverage versus the nominal coverage for 95%, 90%, 80%, 60%, 50%, 40%, 20%, 10%, and 5% posterior intervals for set one of the three sets of summary statistics, using the ridgebased adjustment of the accepted values in abc or not [4, 13]. Ridgebased adjustment is a form of local ridge regression (a modification of ordinary regression to adjust for collinearity of the predictors) that uses the actual distance rather than the simple rejection criterion. Figure 3 is the same as Figure 2 but for summary statistics set 2. Figure 4 is the same as Figure 2 but for summary statistics set 3. Notice from Figures 2–4 that the unadjusted values lead to better calibration than the adjusted values, with the actual probabilities being closer to the nominal probabilities. Apparently, although it is reasonable to adjust accepted parameter values by using the actual distance [4, 13], whether such adjustment improves the approximation to the posterior depends on the specifics of each data set, including the adequacy of the chosen summary statistics. It is for that reason that available software such as abc allows the user to compute both adjusted or unadjusted values.
(a)
(b)
(a)
(b)
(a)
(b)
To quantify the results shown in Figures 2–4 we compute the root mean squared error (RMSE) between the observed coverage probability and the nominal coverage probability for the nine posterior intervals (95%, 90%, 80%, 60%, 50%, 40%, 20%, 10%, and 5%) for each parameter estimate for each of the three sets of summary statistics, . Informally, we can choose the candidate set of summary statistics that has the smallest . More formally, to determine whether the smallest among the three (or any number of) candidate sets of summary statistics is significantly smaller than the second smallest , we can repeat the entire simulation procedure approximately 100 times and rank the candidate sets of summary statistics on the basis of their values across the 100 repetitions of the 3step simulation. In this example, candidate set 3 has the smallest among the three sets of candidate summary statistics. For any set of candidate summary statistics that are acceptable on the basis of , the second version of the RMSE defined as in estimating , , and should be evaluated. In , is either , , or , and is the corresponding estimate. As the corresponding estimate, we use the mean of the corresponding estimated posterior. The two types of RMSEs for the three sets of candidate summary statistics are listed in Table 1.

There is no guarantee that the “best” set of candidate summary statistics will dominate the other choices of summary statistics. For example, summary statistic set 3 is our choice in this example, but it has higher for than the other two choices. As a reviewer has pointed out, such an outcome requires a user choice, and we suggest “majority rule,” meaning that we choose the summary statistic set that has the smallest and/or (depending on user needs) for the most number of parameters. So, in this case we invoke “majority rule” and choose summary statistic set 3.
Any application of ABC that does not include a simulation evaluation such as this one or similar ones in [18–21] is incomplete. Somewhat unfortunately, this means that the choice of summary statistics is not truly “automatic," because it relies on intensive simulations in addition to those in standard ABC. However, the choice of summary statistics can be regarded as “objective,” because a similar strategy is a necessary part of a complete ABC application.
For completeness here, we also use the real data from Table 1 of [10] in place of the simulated data described in the simulation procedure above. Recall from above that the best results (lowest RMSEs) were obtained using candidate summary statistics choice 3 with no adjustment of the accepted values. However, the real data is observed less frequently than each time step (day), so next we use slightly different summary statistics than described above. Rather than lagone (oneday) changes, we use the actual times between measurements so that approximate rates of changes can be computed. The resulting posterior for the data in Table 1 of [10] is given in Figure 5 for summary statistic choice 3. Additionally, a second set of simulations was done for simulated data observed only approximately 13 times over the simulation (as in the real data in Figure 1(a)). Again, summary statistic choice 3 had the lowest and values (uniformly lowest in this case, even for ).
(a)
(b)
(c)
Finally, any Bayesian analysis should address the issue of whether the posterior is sensitive to the prior. For example, in our ABC context, we first used the uniform priors for each parameter as described in Section 4.1, which are the same as those used in [10]. To evaluate sensitivity to the prior, we modified the parameter ranges for from to per day to to per day, for c_{3} from to per day to to per day, and for from 0.50 to 1 to 0.85 to 1. Using summary statistics set 3, the posterior means for are 0.0007, 0.0001, and 0.90, respectively, for the original prior ranges and are 0.00007, 0.001, and 0.87, respectively, for the modified prior ranges. These posterior means were each calculated twice using 10^{3} simulations and are repeatable to within the number of digits listed. Therefore, the choice of prior does significantly impact the posterior in our example. Reference [10] discusses the physical consequences of various parameter values, particularly for . However, there are no widely accepted values for any of the three parameters, so we cannot use accepted parameter values as another check to compare ABC summary statistic choices. Instead, we assess the quality of the ABCbased approximation to the posterior using auxiliary simulation as illustrated in Figures 2–4 comparing predicted to actual coverage probabilities and using RMSEs as in Table 1.
5. Summary
ABC is becoming the “goto” option when the data and/or parameter dimension is large because it relies on userchosen summary statistics rather than the full data and is therefore computationally feasible. Although ABC is compelling, when the data and/or parameter dimension is large, and is beginning to be used in many application areas, as of 2013, there is no cohesive theory or a consistent strategy for ABC, yet there are many applications in bioinformatics, astronomy, epidemiology, and elsewhere for which a stochastic CM provides an alternative to the likelihood. In addition software to implement ABC is becoming widely available; see [30] for a partial list of currently available ABC software.
One technical challenge with ABC is that the quality of the approximation to the posterior distribution of model parameters depends on the userchosen summary statistics. In this paper, the user requirement to choose effective summary statistics in order to accurately estimate the posterior distribution of model parameters is illustrated by example, using a model and corresponding lab data of mitochondrial DNA population dynamics. The example shows that for some choices of summary statistics, the posterior distribution of model parameters is closely approximated and for other choices of summary statistics, the posterior distribution is not closely approximated.
A strategy to choose effective summary statistics is suggested in cases where the stochastic computer model can be run at many trial parameter settings, as in the example. The strategy is to choose the best results from several candidate sets of summary statistics, such as shown in the Results in Figures 2–4. As in [19, 20], auxiliary simulations that produce data having similar summary statistics as the observed data are needed. Then, the best results are defined on the basis of two criteria. First, those summary statistics that lead to the bestcalibrated estimated posterior probabilities are identified. Second, among those summary statistics that perform well on the first criterion, those summary statistics that lead to the smallest estimation errors for the parameters are preferred. The disadvantage of this approach is that reliance on auxiliary simulations to choose summary statistics adds to the computational burden. However, the ABC algorithm is easily parallelized so modern desktop computers are fully adequate for many problems, such as our example. The user might consider using criteria other than those used in Figures 2–4 and in Table 1 to evaluate the posterior distribution. However, we regard those criteria as necessary for adequate approximation to the posterior in this context.
Future work will consider the acceptance threshold and variations of ABC such as [17] that mimic standard MCMC sampling rather than using the rejection method with adjustments to the accepted trial values as in [4, 13]. Also, because real data almost never obey all the assumptions of any model, even the most elaborate stochastic model, some allowance for model bias should be made as that done with deterministic models [6–8]. Finally, a comparison of this ABC approach with the stochastic model approximator approach in [10] would be valuable.
Supplementary Materials
References
 M. Aitken, Statistical Inference: An Integrated Bayesian/Likelihood Approach, Chapman and Hall, Boca Raton, Fla, USA, 2010.
 S. Tavare, D. Balding, R. Griffiths, and P. Donnelly, “Inferring coalescence times from DNA sequence data,” Genetics, vol. 145, no. 2, pp. 505–518, 1997. View at: Google Scholar
 P. Diggle and R. Gratton, “Monte Carlo methods of inference for implicit statistical models,” Journal of the Royal Statistical Society B, vol. 46, pp. 193–227, 1984. View at: Google Scholar
 M. Beaumont, W. Zhang, and D. Balding, “Approximate Bayesian computation in population genetics,” Genetics, vol. 162, no. 4, pp. 2025–2035, 2002. View at: Google Scholar
 M. Kenneday and A. O’Hagan, “Bayesian calibration of computer models,” Journal of the Royal Statistical Society B, vol. 63, no. 3, pp. 425–464, 2001. View at: Google Scholar
 D. Higdon, J. Gattiker, B. Williams, and M. Rightley, “Computer model calibration using highdimensional output,” Journal of the American Statistical Association, vol. 103, no. 482, pp. 570–583, 2008. View at: Publisher Site  Google Scholar
 M. Bayarri, J. Berger, R. Paulo et al., “A framework for validation of computer models,” Technometrics, vol. 49, no. 2, pp. 138–154, 2007. View at: Publisher Site  Google Scholar
 T. Burr and M. Hamada, “Simultaneous estimation of computer model parameters and model bias,” Applied Radiation and Isotopes, vol. 70, no. 8, pp. 1675–1684, 2012. View at: Publisher Site  Google Scholar
 C. Robert and G. Casella, Monte Carlo Statistical Methods, Springer, New York, NY, USA, 2nd edition, 2004.
 D. Henderson, R. Boys, K. Krishnan, C. Lawless, and D. Wilkinson, “Bayesian emulation and calibration of a stochastic computer model of mitochondrial DNA deletions in substantia nigra neurons,” Journal of the American Statistical Association, vol. 104, no. 485, pp. 76–87, 2009. View at: Publisher Site  Google Scholar
 P. Marjoram, J. Molitor, V. Plagnol, and S. Tavaré, “Markov chain without likelihoods,” Proceedings of the National Academy of Sciences of the United States of America, vol. 100, no. 26, pp. 15324–15328, 2003. View at: Publisher Site  Google Scholar
 K. Csilléry, M. Blum, O. Gaggiotti, and O. François, “Approximate Bayesian computation (ABC) in practice,” Trends in Ecology & Evolution, vol. 25, no. 7, pp. 410–418, 2010. View at: Publisher Site  Google Scholar
 M. Blum, “Approximate Bayesian computation: a nonparametric perspective,” Journal of the American Statistical Association, vol. 105, no. 491, pp. 1178–1187, 2010. View at: Publisher Site  Google Scholar
 M. A. Beaumont, “Approximate Bayesian computation in evolution and ecology,” Annual Review of Ecology, Evolution, and Systematics, vol. 41, pp. 379–406, 2010. View at: Publisher Site  Google Scholar
 T. Toni and M. Stumpf, “Simulationbased model selection for dynamical systems in systems and population biology,” Bioinformatives, vol. 26, no. 1, pp. 104–110, 2010. View at: Google Scholar
 M. Blum, M. Nunes, D. Prangle, and S. Sisson, “A comparative review of dimension reduction methods in approximate Bayesian computation,” Statistical Science, vol. 28, no. 2, pp. 189–208, 2013. View at: Publisher Site  Google Scholar
 D. Wegmann, C. Leuenberger, and L. Excoffier, “Efficient approximate Bayesian computation coupled with Markov chain Monte Carlo without likelihood,” Genetics, vol. 182, no. 4, pp. 1207–1218, 2009. View at: Publisher Site  Google Scholar
 P. Joyce and P. Marjoram, “Approximately sufficient statistics and Bayesian computation,” Statistical Applications in Genetics and Molecular Biology, vol. 7, no. 1, article 26, 2008. View at: Google Scholar
 P. Fearnhead and D. Prangle, “Constructing summary statistics for approximate Bayesian computation: semiautomatic approximate Bayesian computation,” Journal of the Royal Statistical Society B, vol. 74, no. 3, pp. 419–474, 2012. View at: Publisher Site  Google Scholar
 M. Nunes and D. Balding, “On optimal selection of summary statistics for approximate Bayesian computation,” Statistical Applications in Genetics and Molecular Biology, vol. 9, no. 1, article 34, 2010. View at: Publisher Site  Google Scholar
 C. P. Roberta, J.M. Cornuetd, J.M. Marine, and N. S. Pillaif, “Lack of confidence in approximate Bayesian computation model choice,” Proceedings of the National Academy of Sciences of the United States of America, vol. 108, no. 37, pp. 15112–15117, 2011. View at: Publisher Site  Google Scholar
 M. M. Tanaka, A. R. Francis, F. Luciani, and S. A. Sisson, “Using approximate Bayesian computation to estimate tuberculosis transmission parameters from genotype data,” Genetics, vol. 173, no. 3, pp. 1511–1520, 2006. View at: Publisher Site  Google Scholar
 A. Weyant, C. Schafer, and W. WoodVasey, “Likelihoodfree cosmological inference with type Ia supernovae: approximate Bayesian computation for a complete treatment of uncertainty,” The Astrophysical Journal, vol. 764, pp. 116–131, 2013. View at: Google Scholar
 K. Lai, M. J. Robertson, and D. V. Schaffer, “The sonic hedgehog signaling system as a bistable genetic switch,” Biophysical Journal, vol. 86, no. 5, pp. 2748–2757, 2004. View at: Google Scholar
 E. Cameron and A. Pettitt, “Approximate Bayesian computation for astronomical model analysis: a case study in galaxy demographics and morphological transformation at high redshift,” Monthly Notices of the Royal Astronomical Society, vol. 425, no. 1, pp. 44–65, 2012. View at: Publisher Site  Google Scholar
 M. M. Tanaka, A. R. Francis, F. Luciani, and S. A. Sisson, “Using approximate Bayesian computation to estimate tuberculosis transmission parameters from genotype data,” Genetics, vol. 173, no. 3, pp. 1511–1520, 2006. View at: Publisher Site  Google Scholar
 M. Secrier, T. Toni, and M. Stumpf, “The ABC of reverse engineering biological signalling systems,” Molecular BioSystems, vol. 5, no. 12, pp. 1925–1935, 2009. View at: Publisher Site  Google Scholar
 D. T. Gillespie, “Exact stochastic simulation of coupled chemical reactions,” Journal of Physical Chemistry, vol. 81, no. 25, pp. 2340–2361, 1977. View at: Google Scholar
 ABCtools package for Approximate Bayesian computation in R, R Development Core Team. R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing, Vienna, Austria, 2011.
 M. Sunnaker, A. Busetto, E. Numminen et al., “Approximate Bayesian computation,” PLoS Computational Biology, vol. 9, no. 1, Article ID e1002803, 2013. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2013 Tom Burr and Alexei Skurikhin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.