Tree Bandits for Generative Bayes
生成式贝叶斯推断中的树型多臂老虎机方法
In generative models with intractable likelihood, Approximate Bayesian Computation (ABC) is often the tool of last resort for inference. However, ABC demands many prior parameter proposals to keep only the small fraction of them that meet the acceptance criterion. To accelerate ABC rejection sampling, this paper develops a self-aware framework that learns from past proposals: both acceptances and rejections. We apply recursive partitioning classifiers on the ABC lookup table…