Skip to content
Licensed Unlicensed Requires Authentication Published by De Gruyter October 22, 2013

Kernel approximate Bayesian computation in population genetic inferences

  • Shigeki Nakagome , Kenji Fukumizu and Shuhei Mano EMAIL logo

Abstract

Approximate Bayesian computation (ABC) is a likelihood-free approach for Bayesian inferences based on a rejection algorithm method that applies a tolerance of dissimilarity between summary statistics from observed and simulated data. Although several improvements to the algorithm have been proposed, none of these improvements avoid the following two sources of approximation: 1) lack of sufficient statistics: sampling is not from the true posterior density given data but from an approximate posterior density given summary statistics; and 2) non-zero tolerance: sampling from the posterior density given summary statistics is achieved only in the limit of zero tolerance. The first source of approximation can be improved by adding a summary statistic, but an increase in the number of summary statistics could introduce additional variance caused by the low acceptance rate. Consequently, many researchers have attempted to develop techniques to choose informative summary statistics. The present study evaluated the utility of a kernel-based ABC method [Fukumizu, K., L. Song and A. Gretton (2010): “Kernel Bayes’ rule: Bayesian inference with positive definite kernels,” arXiv, 1009.5736 and Fukumizu, K., L. Song and A. Gretton (2011): “Kernel Bayes’ rule. Advances in Neural Information Processing Systems 24.” In: J. Shawe-Taylor and R. S. Zemel and P. Bartlett and F. Pereira and K. Q. Weinberger, (Eds.), pp. 1549–1557., NIPS 24: 1549–1557] for complex problems that demand many summary statistics. Specifically, kernel ABC was applied to population genetic inference. We demonstrate that, in contrast to conventional ABCs, kernel ABC can incorporate a large number of summary statistics while maintaining high performance of the inference.


Corresponding author: Shuhei Mano, Department of Mathematical Analysis and Statistical Inference, The Institute of Statistical Mathematics, 10-3 Midori-cho, Tachikawa, Tokyo 190-8562, Japan; and Japan Science and Technology Agency, 4-1-8, Honcho, Kawaguchi-shi, Saitama 332-0012, Japan, e-mail:

We thank Mark Beaumont and Kevin Dawson for helpful discussions and comments. We also thank anonymous referees for helpful comments and the proposal of Example in the text. S.N. was supported in part by a Grant-in-Aid for the Japan Society for the Promotion of Science (JSPS) Research fellow (24-3234). K.F. was supported in part by JSPS KAKENHI (B) 22300098.

Appendix: proof of theorem

This proof is similar to the proof of Theorem 6.1 in Fukumizu et al. (2010). Denote variance and covariance operators by Css and Cθs, respectively, and the empirical estimators of them by

and
respectively. We have (Fukumizu et al. 2010, 2011)

We want to establish

First we show

The left hand side is upper bounded by

By the decomposition

with
(Baker, 1973), we have

With the
consistency of the variance operator, we see that the second term of (4) is
In a similar argument gives that the first term of (4) is O((n)1/2).

Therefore we have (3). Then, we show

The left hand side is upper bounded by

By the eigendecomposition Cssiλiϕiϕi,‧〉, where {λi} are the eigenvalues and {ϕi} are the corresponding unit eigenvectors, we have a expansion

Where

Therefore we have (5). Then, (2) follows from (3) and (5).    ■

References

Baker, C. R. (1973): “Joint measures and cross-covariance operators,” T. Am. Math. Soc., 186, 273–289.Search in Google Scholar

Beaumont, M. A., J. M. Cornuet, J. M. Marin and C. P. Robert (2009): “Adaptive approximate Bayesian computation,” Biometrika, 96, 983–990.10.1093/biomet/asp052Search in Google Scholar

Beaumont, M. A., W. Zhang and D. J. Balding (2002): “Approximate Bayesian computation in population genetics,” Genetics, 162, 2025–2035.10.1093/genetics/162.4.2025Search in Google Scholar PubMed PubMed Central

Blum, M. G. B. and O. Francois (2010): “Non-linear regression models for Approximate Bayesian Computation,” Stat. Comput., 20, 63–73.Search in Google Scholar

Caponnetto, A. and E. De Vito (2007): “Optimal rates for the regularized least-squares algorithm,” Found Comput. Math., 7, 331–368.Search in Google Scholar

Casella, G. and R. L. Berger (2002): “Statistical inference,” 2nd Ed. Duxbury, California.Search in Google Scholar

Drovandi, C. C. and A. N. Pettitt (2011): “Estimation of parameters for macroparasite population evolution using approximate Bayesian computation,” Biometrics, 67, 225–233.10.1111/j.1541-0420.2010.01410.xSearch in Google Scholar PubMed

Fearnhead, P. and D. Prangle (2012): “Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation.” J. R. Stat. Soc. B., 74, 419–474.Search in Google Scholar

Fine, S. and K. Scheinberg (2002): “Efficient SVM training using low-rank kernel representations,” J. Mach. Learn. Res., 2, 243–264.Search in Google Scholar

Fu, Y. X. and W. H. Li (1997): “Estimating the age of the common ancestor of a sample of DNA sequences,” Mol. Biol. Evol. 14, 195–199.Search in Google Scholar

Fukumizu, K., L. Song and A. Gretton (2010): “Kernel Bayes’ rule: Bayesian inference with positive definite kernels,” arXiv, 1009.5736.Search in Google Scholar

Fukumizu, K., L. Song and A. Gretton (2011): “Kernel Bayes’ rule. Advances in Neural Information Processing Systems 24.” In: J. Shawe-Taylor and R. S. Zemel and P. Bartlett and F. Pereira and K. Q. Weinberger, (Eds.), pp. 1549–1557.Search in Google Scholar

Griffiths, R. C. (2007): GENETREE version 9.0. Available at: http://www.stats.ox.ac.uk/~griff/software.html.Search in Google Scholar

Griffiths, R. C. and S. Tavaré (1994): “Sampling Theory for Neutral Alleles in a Varying Environment,” Philos. T. Roy. Soc. B., 344, 403–410.Search in Google Scholar

Hastie, T., R. Tibshirani and J. Friedman (2009): The Elements of Statistical Learning. Springer-Verlag, New York.10.1007/978-0-387-84858-7Search in Google Scholar

Hofmann, T., B. Scholkopf and A. J. Smola (2008): “Kernel methods in machine learning,” Ann. Stat. 36, 1171–1220.Search in Google Scholar

Hudson, R. R. (2002): “Generating samples under a Wright-Fisher neutral model of genetic variation,” Bioinformatics, 18, 337–338.10.1093/bioinformatics/18.2.337Search in Google Scholar PubMed

Joyce, P. and P. Marjoram (2008): “Approximately sufficient statistics and Bayesian computation,” Stat. Appl. Genet. Mol., 7, article 26.Search in Google Scholar

Kimura, M. (1969): “The number of heterozygous nucleotide sites maintained in a finite population due to steady flux of mutations,” Genetics, 61, 893–903.10.1093/genetics/61.4.893Search in Google Scholar PubMed PubMed Central

Loader, C. (1999): Local Regression and Likelihood. Springer-Verlag, New York.10.1007/b98858Search in Google Scholar

Marjoram, P., J. Molitor, V. Plagnol and S. Tavare (2003): “Markov chain Monte Carlo without likelihoods,” P. Natl. Acad. Sci. USA., 100, 15324–15328.Search in Google Scholar

Nei, M. and W. H. Li (1979): “Mathematical-model for studying genetic-variation in terms of restriction endonucleases,” P. Natl. Acad. Sci. USA., 76, 5269–5273.Search in Google Scholar

Nunes, M. A. and D. J. Balding (2010): “On optimal selection of summary statistics for approximate Bayesian computation,” Stat. Appl. Genet. Mol. 9, article 34.Search in Google Scholar

Pritchard, J. K., M. T. Seielstad, A. Perez-Lezaun and M. W. Feldman (1999): “Population growth of human Y chromosomes: A study of Y chromosome microsatellites,” Mol. Biol. Evol. 16, 1791–1798.Search in Google Scholar

Sisson, S. A., Y. Fan and M. M. Tanaka (2007): “Sequential Monte Carlo without likelihoods,” P. Natl. Acad. Sci. USA., 104, 1760–1765.Search in Google Scholar

Smola, A., A. Gretton, L. Song and B. Scholkopf (2007): “Hilbert space embedding for distributions,” Algorithmic Learning Theory, Lecture Notes in Computer Science, 4754, 13–31.10.1007/978-3-540-75225-7_5Search in Google Scholar

Song, L., J. Huang, A. Smola and K. Fukumizu (2009): “Hilbert space embeddings of conditional distributions with applications to dynamics systems,” In Proceedings of the 26th International Conference on Machine Learning, pp. 961–968.Search in Google Scholar

Tajima, F. (1989): “Statistical-method for testing the neutral mutation hypothesis by DNA polymorphism,” Genetics, 123, 585–595.10.1093/genetics/123.3.585Search in Google Scholar PubMed PubMed Central

Tavaré, S., D. J. Balding, R. C. Griffiths and P. Donnelly (1997): “Inferring coalescence time from DNA sequence data,” Genetics, 145, 505–518.10.1093/genetics/145.2.505Search in Google Scholar PubMed PubMed Central

Watterson, G. A. (1975): “On the number of segregating sites in genetical models without recombination,” Theor. Popul. Biol. 7, 256–276.Search in Google Scholar

Wegmann, D., C. Leuenberger and L. Excoffier (2009): “Efficient approximate Bayesian computation coupled with markov chain monte carlo without likelihood,” Genetics, 182, 1207–1218.10.1534/genetics.109.102509Search in Google Scholar PubMed PubMed Central

Weiss, G. and A. von Haeseler (1998): “Inference of population history using a likelihood approach,” Genetics, 149, 1539–1546.10.1093/genetics/149.3.1539Search in Google Scholar PubMed PubMed Central

Published Online: 2013-10-22
Published in Print: 2013-12-01

©2013 by Walter de Gruyter Berlin Boston

Downloaded on 22.5.2024 from https://www.degruyter.com/document/doi/10.1515/sagmb-2012-0050/html
Scroll to top button