Automatic Kernel Selection for Gaussian Processes Regression with Approximate Bayesian Computation and Sequential Monte Carlo

Approximate Bayesian Computation for infectious disease modelling

The Gaussian process (GP) has gained much attention in cosmology due to its ability to reconstruct cosmological data in a model-independent manner. In this study, we compare two methods for GP kernel selection: approximate Bayesian computation (ABC) rejection and nested sampling. We analyze three types of data: cosmic chronometer data, type Ia supernovae data, and gamma-ray burst data, using five kernel functions. To evaluate the differences between kernel functions, we assess the strength of evidence using Bayes factors. Our results show that, for ABC rejection, the Matérn kernel with ν = 5/2 (M52 kernel) outperformes the commonly used radial basis function (RBF) kernel in approximating all three data sets. Bayes factors indicate that the M52 kernel typically supports the observed data better than the RBF kernel but with no clear advantage over other alternatives. However, nested sampling gives different results, with the M52 kernel losing its advantage. Nevertheless, Bayes factors indicate no significant dependence of the data on each kernel.

We estimate the parameters of a stochastic process model for a macroparasite population within a host using approximate Bayesian computation (ABC). The immunity of the host is an unobserved model variable and only mature macroparasites at sacrifice of the host are counted. With very limited data, process rates are inferred reasonably precisely. Modeling involves a three variable Markov process for which the observed data likelihood is computationally intractable. ABC methods are particularly useful when the likelihood is analytically or computationally intractable. The ABC algorithm we present is based on sequential Monte Carlo, is adaptive in nature, and overcomes some drawbacks of previous approaches to ABC. The algorithm is validated on a test example involving simulated data from an autologistic model before being used to infer parameters of the Markov process model for experimental data. The fitted model explains the observed extra-binomial variation in terms of a zero-one immunity variable, which has a short-lived presence in the host.

Event Abstract Back to Event Statistical uncertainty and sensitivity analysis of intracellular signaling models - through approximate Bayesian computation and variance based global sensitivity analysis Olivia Eriksson1, 2*, Alexandra Jauhiainen1, 3, Sara Maad Sasane4, Anu G Nair5, Carolina Sartorius4 and Jeanette Hellgren Kotaleski2, 5, 6 1 Contributed equally to this work, Sweden 2 Stockholm University, Department of Numerical Analysis and Computer Science, Sweden 3 AstraZeneca AB R&D, Early Clinical Biometrics, Sweden 4 Lund University, Centre for Mathematical Sciences, Sweden 5 KTH Royal Institute of Technology, School of Computer Science and Communication, Sweden 6 Karolinska Institute, Department of Neuroscience, Sweden Computational dynamical models describing intracellular signaling pathways of nerve cells are increasing in size and complexity as more information is obtained from experiments. Models describing protein interactions within neurons can contain over hundred protein reactions [1, 2]. These models are built from knowledge about the interaction topology, inferred from e.g. gene knock-out experiments, as well as from experimental quantitative data describing the input-output relationship of the observed system. The quantitative data are often sparse as compared to the size of the system, and translating the experimental information into dynamical models often results in large uncertainties in the parameter (e.g reaction rates) values. This uncertainty is partly due to the sparseness in experimental time series data (practical unidentifiability), but it is also an intrinsic feature of the modeled system (structural unidentifiability) and could reflect the possibility for biological variation [3]; in many biological systems the same function can be achieved in partly different ways due to degeneracy and redundancy. Here we investigate the extent of this parameter uncertainty, in a model describing calcium (Ca)-dependent activation of Calmodulin (CaM), Protein phosphatase 2B (PP2B) and Ca/CaM-dependent protein kinase II (CamKII) [4], which is an intracellular pathway of importance to synaptic plasticity. We presume that the structure of the model is correct and then characterize the uncertainty in the parameters based on data. This is done by sampling the subspace of parameter values which has an equally good fit to data (corresponding to the “viable space” in [5]), through a statistical approach known as Approximate Bayesian Computation (ABC) with Markov Chain Monte Carlo (MCMC) [6]. ABC has been proposed for parameter estimation in system biology models previously, albeit in slightly different settings, e.g. [7, 8], and can be applied to a wide range of problems. In order to characterize the viable space efficiently with several experimental datasets, we employ multivariate probability distributions called copulas as a part of the ABC sampling. The result is a multivariate posterior distribution for the parameters, which represents how much they are constrained by the data (i.e. the uncertainty) as illustrated in Figure 1 (pairwise plots of viable space for four parameters indicating constraints and dependencies before and after calibration to data). The next step is to look into how the parameter uncertainty is translated to uncertainty of the predictions made from the model. We also investigate the role and importance of different parameters, with respect to different model outputs including the predictions, by means of global sensitivity analysis [9]. Figure 2 illustrates the sensitivity of one of the outputs calculated by a method based on the decomposition of the variance [10, 11, 12], showing different types of sensitivity measures. Finally, we explore how the sensitivity of different subsets of parameters change as different parts of the viable space are investigated, which is shown in Figure 3, where sensitivity profiles are clustered into groups with different sensitivity characteristics. Figure 1 Figure 2 Figure 3 Acknowledgements This research was supported by funding from the Swedish e-Science Research Centre and the Human Brain Project References [1] Gutierrez-Arenas O, Eriksson O, Hellgren Kotaleski J (2014) Segregation and Crosstalk of D1 Receptor-Mediated Activation of ERK in Striatal Medium Spiny Neurons upon Acute Administration of Psychostimulants. PLoS Comput Biol 10, e1003445. [2] Nair AG, Gutierrez-Arenas O, Eriksson O, Vincent P, and Hellgren Kotaleski J (2015) Sensing Positive versus Negative Reward Signals through Adenylyl Cyclase-Coupled GPCRs in Direct and Indirect Pathway Striatal Medium Spiny Neurons. J. Neuroscience 35, 14017-14030. [3] Marder E, Goeritz ML, Otopalik AG (2015) Robust circuit rhythms in small circuits arise from variable circuit components and mechanisms. Curr Opin Neurobiol 31, 156-163. [4] Nair AG, Gutierrez-Arenas O, Eriksson O, Jauhiainen A, Blackwell KT and Kotaleski, JH (2014). Modeling intracellular signaling underlying striatal function in health and disease. Progress in molecular biology and translational science, 123, 277 [5] Zamora-Sillero E, Hafner M, Ibig A, Stelling J, and Wagner, A. (2011). Efficient characterization of high-dimensional parameter spaces for systems biology. BMC systems biology 5, 142. [6] Marjoram P, Molitor J, Plagnol V, and Tavare S (2003) Markov chain Monte Carlo without likelihoods. Proc. Natl. Acad. Sci. U.S.A. 100, 15324–15328. [7] Toni T, Welch D, Strelkowa N, Ipsen A, and Stumpf MP. Approximate Bayesian computation scheme for parameter inference and model selection in dynamical systems. J R Soc Interface, 6, 187–202. [8] Liepe J, Kirk P, Filippi S, Toni T, Barnes CP, and Stumpf MP. A framework for parameter estimation and model selection from experimental data in systems biology using approximate Bayesian computation. Nat Protoc, 9, 439–456. [9] Saltelli A, Ratto M, Andres T, Campolongo F, Cariboni J, Gatelli D, Saisana M, Tarantola S Global sensitivity analysis: the primer. In Wiley 2008 New York, NY:Wiley. [10] Sobol IM (2001) Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates, Math. Comput. Simul. 55, 271–280. [11] Saltelli A (2002) Making best use of model evaluations to compute sensitivity indices. Comp Phys Comm 145, 280 – 297. [12] Halnes G, Ulfhielm E Ljunggren EE, Kotaleski JH and Rospars JP (2009) Modelling and sensitivity analysis of the reactions involving receptor, G-protein and effector in vertebrate olfactory receptor neurons. Journal of computational neuroscience 27, 471-491. Keywords: sensitivity analysis, Approximate Bayesian Computation, copulas, intracellular signalling, Dynamical Modeling, global sensitivity analysis, Markov chain Monte Carlo, variance decomposition Conference: Neuroinformatics 2016, Reading, United Kingdom, 3 Sep - 4 Sep, 2016. Presentation Type: Investigator presentations Topic: Computational neuroscience Citation: Eriksson O, Jauhiainen A, Maad Sasane S, Nair A, Sartorius C and Hellgren Kotaleski J (2016). Statistical uncertainty and sensitivity analysis of intracellular signaling models - through approximate Bayesian computation and variance based global sensitivity analysis. Front. Neuroinform. Conference Abstract: Neuroinformatics 2016. doi: 10.3389/conf.fninf.2016.20.00014 Copyright: The abstracts in this collection have not been subject to any Frontiers peer review or checks, and are not endorsed by Frontiers. They are made available through the Frontiers publishing platform as a service to conference organizers and presenters. The copyright in the individual abstracts is owned by the author of each abstract or his/her employer unless otherwise stated. Each abstract, as well as the collection of abstracts, are published under a Creative Commons CC-BY 4.0 (attribution) licence (https://creativecommons.org/licenses/by/4.0/) and may thus be reproduced, translated, adapted and be the subject of derivative works provided the authors and Frontiers are attributed. For Frontiers’ terms and conditions please see https://www.frontiersin.org/legal/terms-and-conditions. Received: 31 May 2016; Published Online: 18 Jul 2016. * Correspondence: PhD. Olivia Eriksson, Contributed equally to this work, Stockholm, Sweden, olivia@kth.se Login Required This action requires you to be registered with Frontiers and logged in. To register or login click here. Abstract Info Abstract The Authors in Frontiers Olivia Eriksson Alexandra Jauhiainen Sara Maad Sasane Anu G Nair Carolina Sartorius Jeanette Hellgren Kotaleski Google Olivia Eriksson Alexandra Jauhiainen Sara Maad Sasane Anu G Nair Carolina Sartorius Jeanette Hellgren Kotaleski Google Scholar Olivia Eriksson Alexandra Jauhiainen Sara Maad Sasane Anu G Nair Carolina Sartorius Jeanette Hellgren Kotaleski PubMed Olivia Eriksson Alexandra Jauhiainen Sara Maad Sasane Anu G Nair Carolina Sartorius Jeanette Hellgren Kotaleski Related Article in Frontiers Google Scholar PubMed Abstract Close Back to top Javascript is disabled. Please enable Javascript in your browser settings in order to see all the content on this page.

Gibbs random fields (GRF) are polymorphous statistical models that can be used to analyse different types of dependence, in particular for spatially correlated data. However, when those models are faced with the challenge of selecting a dependence structure from many, the use of standard model choice methods is hampered by the unavailability of the normalising constant in the Gibbs likelihood. In particular, from a Bayesian perspective, the computation of the posterior probabilities of the models under competition requires special likelihood-free simulation techniques like the Approximate Bayesian Computation (ABC) algorithm that is intensively used in population genetics. We show in this paper how to implement an ABC algorithm geared towards model choice in the general setting of Gibbs random fields, demonstrating in particular that there exists a sufficient statistic across models. The accuracy of the approximation to the posterior probabilities can be further improved by importance sampling on the distribution of the models. The practical aspects of the method are detailed through two applications, the test of an iid Bernoulli model versus a first-order Markov chain, and the choice of a folding structure for two proteins.

Cancer is one of the most fatal diseases in the world. Governments and researchers from various areas have continuously concentrated efforts to better understand the disease and propose diagnostic and treatment techniques. The use of mathematical models of tumor growth is of great importance for the development of such techniques. Due to the variety of models nowadays available in the literature, the problems of model selection and parameter estimation come into picture, aiming at suitably predicting the patient’s status of the disease. As the available data on dependent variables of existing models might not justify the use of common likelihood functions, approximate Bayesian computation (ABC) becomes a very attractive tool for model selection and model calibration (parameter estimation) in tumor growth models. In the present study, a Monte Carlo approximate Bayesian computation (ABC) algorithm is applied to select among competing models of tumor growth, with and without chemotherapy treatment. Simulated measurements are used in this work. The results obtained show that the algorithm correctly selects the model and estimates the parameters used to generate the simulated measurements.

In vitro studies and mathematical models are now being widely used to study the underlying mechanisms driving the expansion of cell colonies. This can improve our understanding of cancer formation and progression. Although much progress has been made in terms of developing and analysing mathematical models, far less progress has been made in terms of understanding how to estimate model parameters using experimental in vitro image-based data. To address this issue, a new approximate Bayesian computation (ABC) algorithm is proposed to estimate key parameters governing the expansion of melanoma cell (MM127) colonies, including cell diffusivity, D, cell proliferation rate, λ, and cell-to-cell adhesion, q, in two experimental scenarios, namely with and without a chemical treatment to suppress cell proliferation. Even when little prior biological knowledge about the parameters is assumed, all parameters are precisely inferred with a small posterior coefficient of variation, approximately 2–12%. The ABC analyses reveal that the posterior distributions of D and q depend on the experimental elapsed time, whereas the posterior distribution of λ does not. The posterior mean values of D and q are in the ranges 226–268 µm2h−1, 311–351 µm2h−1 and 0.23–0.39, 0.32–0.61 for the experimental periods of 0–24 h and 24–48 h, respectively. Furthermore, we found that the posterior distribution of q also depends on the initial cell density, whereas the posterior distributions of D and λ do not. The ABC approach also enables information from the two experiments to be combined, resulting in greater precision for all estimates of D and λ.

Adaptive approximate Bayesian computation by subset simulation for structural model calibration

As newer and more reliable ways of construction were developed, civilization began to spread out further and retain functional infrastructure for longer periods of time.[...]

Approximate Bayesian computation (ABC) has become one of the major tools of likelihood-free statistical inference in complex mathematical models. Simultaneously, stochastic differential equations (SDEs) have developed to an established tool for modelling time-dependent, real-world phenomena with underlying random effects. When applying ABC to stochastic models, two major difficulties arise: First, the derivation of effective summary statistics and proper distances is particularly challenging, since simulations from the stochastic process under the same parameter configuration result in different trajectories. Second, exact simulation schemes to generate trajectories from the stochastic model are rarely available, requiring the derivation of suitable numerical methods for the synthetic data generation. To obtain summaries that are less sensitive to the intrinsic stochasticity of the model, we propose to build up the statistical method (e.g. the choice of the summary statistics) on the underlying structural properties of the model. Here, we focus on the existence of an invariant measure and we map the data to their estimated invariant density and invariant spectral density. Then, to ensure that these model properties are kept in the synthetic data generation, we adopt measure-preserving numerical splitting schemes. The derived property-based and measure-preserving ABC method is illustrated on the broad class of partially observed Hamiltonian type SDEs, both with simulated data and with real electroencephalography data. The derived summaries are particularly robust to the model simulation, and this fact, combined with the proposed reliable numerical scheme, yields accurate ABC inference. In contrast, the inference returned using standard numerical methods (Euler–Maruyama discretisation) fails. The proposed ingredients can be incorporated into any type of ABC algorithm and directly applied to all SDEs that are characterised by an invariant distribution and for which a measure-preserving numerical method can be derived.

Approximate Bayesian computation (ABC) is widely used to infer demographic history of populations and species using DNA markers. Genomic markers can now be developed for nonmodel species using reduced representation library (RRL) sequencing methods that select a fraction of the genome using targeted sequence capture or restriction enzymes (genotyping-by-sequencing, GBS). We explored the influence of marker number and length, knowledge of gametic phase, and tradeoffs between sample size and sequencing depth on the quality of demographic inferences performed with ABC. We focused on two-population models of recent spatial expansion with varying numbers of unknown parameters. Performing ABC on simulated data sets with known parameter values, we found that the timing of a recent spatial expansion event could be precisely estimated in a three-parameter model. Taking into account uncertainty in parameters such as initial population size and migration rate collectively decreased the precision of inferences dramatically. Phasing haplotypes did not improve results, regardless of sequence length. Numerous short sequences were as valuable as fewer, longer sequences, and performed best when a large sample size was sequenced at low individual depth, even when sequencing errors were added. ABC results were similar to results obtained with an alternative method based on the site frequency spectrum (SFS) when performed with unphased GBS-type markers. We conclude that unphased GBS-type data sets can be sufficient to precisely infer simple demographic models, and discuss possible improvements for the use of ABC with genomic data.

Analytically or computationally intractable likelihood functions can arise in complex statistical inferential problems making them inaccessible to standard Bayesian inferential methods. Approximate Bayesian computation (ABC) methods address such inferential problems by replacing direct likelihood evaluations with repeated sampling from the model. ABC methods have been predominantly applied to parameter estimation problems and less to model choice problems due to the added difficulty of handling multiple model spaces. The ABC algorithm proposed here addresses model choice problems by extending Fearnhead and Prangle (2012, Journal of the Royal Statistical Society, Series B 74, 1-28) where the posterior mean of the model parameters estimated through regression formed the summary statistics used in the discrepancy measure. An additional stepwise multinomial logistic regression is performed on the model indicator variable in the regression step and the estimated model probabilities are incorporated into the set of summary statistics for model choice purposes. A reversible jump Markov chain Monte Carlo step is also included in the algorithm to increase model diversity for thorough exploration of the model space. This algorithm was applied to a validating example to demonstrate the robustness of the algorithm across a wide range of true model probabilities. Its subsequent use in three pathogen transmission examples of varying complexity illustrates the utility of the algorithm in inferring preference of particular transmission models for the pathogens.

<strong class="journal-contentHeaderColor">Abstract.</strong> The Approximate Bayesian computation (ABC) methods provide a powerful tool for sampling from Bayesian posteriors for cases where we can simulate samples, but we have no access to an explicit expression of the likelihood function. The Simulated Annealing ABC (SABC) algorithm has been proposed to achieve a fast convergence to an unbiased approximation to the posterior by adaptively decreasing an initially coarse tolerance value. However, this algorithm uses a rather simplistic random walk Metropolis (RWM) sampler to generate trial moves in a Markov chain and always requires an excessive number of model evaluations for approximating the posterior, which inevitably lowers the sampling efficiency and limits its applications in more complex hydrologic modelling practices. Inspired by the advances made in Markov Chain Monte Carlo (MCMC) methods, we incorporated an adaptive Differential Evolution scheme to enhance the efficiency of SABC sampling. This scheme has its roots within Differential Evolution Markov Chains (DE-MC), and additionally utilizes a self-adaptive randomized subspace sampling strategy to optimally select the dimensions of parameters to be updated each time a proposal is generated. The superiority of the modified SABC (mSABC) over the original SABC algorithm was demonstrated through a SAC-SMA application to the Danjiangkou Reservoir region (DRR). The case study results showed that mSABC was far more efficient with lower computation costs and higher acceptance rates, and achieved higher numerical accuracy than the original SABC algorithm. mSABC also resulted in a better overall prediction of streamflow time series and signatures. The introduction of more advanced MCMC sampler into SABC helps to speed up convergence to the approximate posterior while achieving better model performance, which significantly widens the applicability of SABC to complex posterior exploration problems.

Approximate Bayesian Computation (ABC) methods have a lot of success to accomplish Bayesian inference on the parameters of models for which the calculation of the likelihood is intractable. These algorithms consists in comparing the observed dataset to many simulated datasets. These ones can be generated in different ways. Typically, the rejection ABC scheme consists first of simulating parameters using independent calls to the prior distribution and then, given these values, generating the datasets using independent calls to the model. For such a method, the computation time needed to get a suitable approximation of the posterior distribution can be very long. Also, there exist some sequential Monte Carlo methods replacing simulations from the prior by using successive approximations to the posterior distribution. Here, we recall a sequential simulation algorithm and we compare different parallelization strategies. We notably shown that the parallelization of the sequential ABC sampler is useless when using more than four threads per instance of the program and that the standard rejection ABC sampler has to be used when facing a large number of cores. Indeed, in such a case, the cost of the sequential ABC sampler's parallelization prohibits its use.

We consider the application of approximate Bayesian Computation (ABC) in the context of medical imaging data. We consider the parameter estimation of compartmental models in PET imaging analysis, and provide a simple ABC algorithm for its estimation. We demonstrate the utility of the proposed estimation methods on a neurotransmitter response model, and compare our approach to existing methods.