Learning functions and approximate Bayesian computation design: ABCD

From MaRDI portal





Summary: A general approach to Bayesian learning revisits some classical results, which study which functionals on a prior distribution are expected to increase, in a preposterior sense. The results are applied to information functionals of the Shannon type and to a class of functionals based on expected distance. A close connection is made between the latter and a metric embedding theory due to Schoenberg and others. For the Shannon type, there is a connection to majorization theory for distributions. A computational method is described to solve generalized optimal experimental design problems arising from the learning framework based on a version of the well-known approximate Bayesian computation (ABC) method for carrying out the Bayesian analysis based on Monte Carlo simulation. Some simple examples are given.











This page was built for publication: Learning functions and approximate Bayesian computation design: ABCD

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296301)