Local dimension reduction of summary statistics for likelihood-free inference

被引:0
作者
Jukka Sirén
Samuel Kaski
机构
[1] Aalto University,Department of Computer Science, Helsinki Institute for Information Technology HIIT
来源
Statistics and Computing | 2020年 / 30卷
关键词
Approximate Bayesian computation; Dimension reduction; Likelihood-free inference; Summary statistics;
D O I
暂无
中图分类号
学科分类号
摘要
Approximate Bayesian computation (ABC) and other likelihood-free inference methods have gained popularity in the last decade, as they allow rigorous statistical inference for complex models without analytically tractable likelihood functions. A key component for accurate inference with ABC is the choice of summary statistics, which summarize the information in the data, but at the same time should be low-dimensional for efficiency. Several dimension reduction techniques have been introduced to automatically construct informative and low-dimensional summaries from a possibly large pool of candidate summaries. Projection-based methods, which are based on learning simple functional relationships from the summaries to parameters, are widely used and usually perform well, but might fail when the assumptions behind the transformation are not satisfied. We introduce a localization strategy for any projection-based dimension reduction method, in which the transformation is estimated in the neighborhood of the observed data instead of the whole space. Localization strategies have been suggested before, but the performance of the transformed summaries outside the local neighborhood has not been guaranteed. In our localization approach the transformation is validated and optimized over validation datasets, ensuring reliable performance. We demonstrate the improvement in the estimation accuracy for localized versions of linear regression and partial least squares, for three different models of varying complexity.
引用
收藏
页码:559 / 570
页数:11
相关论文
共 68 条
  • [1] Aeschbacher S(2012)A novel approach for choosing summary statistics in approximate Bayesian computation Genetics 192 1027-1047
  • [2] Beaumont MA(2015)The rate of convergence for approximate Bayesian computation Electron. J. Stat. 9 80-105
  • [3] Futschik A(2002)Approximate Bayesian computation in population genetics Genetics 162 2025-2035
  • [4] Barber S(2010)Non-linear regression models for approximate Bayesian computation Stat. Comput. 20 63-73
  • [5] Voss J(2013)A comparative review of dimension reduction methods in approximate Bayesian computation Stat. Sci. 28 189-208
  • [6] Webster M(2015)Bayesian indirect inference using a parametric auxiliary model Stat. Sci. 30 72-95
  • [7] Beaumont MA(2012)Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation J. R. Stat. Soc. Ser. B (Methodol.) 74 1-28
  • [8] Zhang W(2016)Bayesian optimization for likelihood-free inference of simulator-based statistical models J. Mach. Learn. Res. 17 4256-4302
  • [9] Balding DJ(2018)Likelihood-free inference via classification Stat. Comput. 28 411-425
  • [10] Blum MGB(1997)Robustness of ranking and selection rules using generalised g-and-k distributions J. Stat. Plan. Inference 65 45-66