Learning functions and approximate Bayesian computation design: ABCD (Q296301): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Werner G. Müller / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Henry P. Wynn / rank | |||
Normal rank | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 62F15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 62K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94A17 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6593582 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
learning | |||
Property / zbMATH Keywords: learning / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Shannon information | |||
Property / zbMATH Keywords: Shannon information / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
majorization | |||
Property / zbMATH Keywords: majorization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
optimum experimental design | |||
Property / zbMATH Keywords: optimum experimental design / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
approximate Bayesian computation | |||
Property / zbMATH Keywords: approximate Bayesian computation / rank | |||
Normal rank |
Revision as of 20:55, 27 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Learning functions and approximate Bayesian computation design: ABCD |
scientific article |
Statements
Learning functions and approximate Bayesian computation design: ABCD (English)
0 references
15 June 2016
0 references
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.
0 references
learning
0 references
Shannon information
0 references
majorization
0 references
optimum experimental design
0 references
approximate Bayesian computation
0 references