Fiducial Matching for the Approximate Posterior: F-ABC
Yannis G. Yatracos

TL;DR
F-ABC introduces a novel approach using universal sufficient statistics for approximate Bayesian computation, avoiding kernel artifacts and providing better asymptotic properties, with practical guidelines for tolerance selection.
Contribution
It presents F-ABC, a new ABC method leveraging universal sufficient statistics, improving accuracy and robustness over previous kernel-based approaches.
Findings
F-ABC avoids artifacts caused by kernels in ABC.
Asymptotic analysis supports the method's validity.
Simulation results demonstrate improved performance.
Abstract
F-ABC is introduced, using universal sufficient statistics, unlike previous ABC papers, e.g. Bernton et al. (2019), and avoiding in the approximate posterior artifacts due to a Kernel. The nature of matching tolerance is examined and indications for determining its values are presented. F-ABC does not face concerns associated with ABC. Asymptotics and simulation results are also presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Statistical Methods and Inference · Nuclear reactor physics and engineering
