Unexpectedness and Bayes’ Rule
| Authors |
|
|---|---|
| Publication date | 2022 |
| Host editors |
|
| Book title | Software Engineering and Formal Methods : SEFM 2021 Collocated Workshops |
| Book subtitle | CIFMA, CoSim-CPS, OpenCERT, ASYDE, virtual event, December 6–10, 2021 : revised selected papers |
| ISBN |
|
| ISBN (electronic) |
|
| Series | Lecture Notes in Computer Science |
| Event | Workshops on CIFMA, CoSim-CPS, OpenCERT, and ASYDE 2021, collocated with the 19th International Conference on Software Engineering and Formal Methods, SEFM 2021 |
| Pages (from-to) | 107-116 |
| Number of pages | 10 |
| Publisher | Cham: Springer |
| Organisations |
|
| Abstract |
A great number of methods and of accounts of rationality consider at their foundations some form of Bayesian inference. Yet, Bayes’ rule, because it relies upon probability theory, requires specific axioms to hold (e.g. a measurable space of events). This short document hypothesizes that Bayes’ rule can be seen as a specific instance of a more general inferential template, that can be expressed also in terms of algorithmic complexities, namely through the measure of unexpectedness proposed by Simplicity Theory. |
| Document type | Conference contribution |
| Language | English |
| Published at | https://doi.org/10.1007/978-3-031-12429-7_8 |
| Other links | https://www.scopus.com/pages/publications/85140429822 |
| Downloads |
978-3-031-12429-7_8
(Final published version)
|
| Permalink to this page | |
