<abstract xmlns="http://www.w3.org/1999/xhtml">

Causal laws are defined in terms of concepts and the causal relations between them. Following Kemp et al. (2010), we investigate the performance of the hierarchical Bayesian model, in which causal systems are represented by directed acyclic graphs (DAGs) with nodes divided into distinct categories. This paper presents two non-reversible search and score algorithms (<italic>Q</italic>1 and <italic>Q</italic>2) and their application to the causal learning system. The algorithms run through the pairs of class-assignment vectors and graph structures and choose the one which maximizes the probability of given observations. The model discovers latent classes in relational data and the number of these classes and predicts relations between objects belonging to them. We evaluate its performance on prediction tasks from the behavioural experiment about human cognition. Within the discussed approach, we solve a simplified prediction problem when object classification is known in advance. Finally, we describe the experimental procedure allowing in-depth analysis of the efficiency and scalability of both search and score algorithms.
</abstract>

Causal laws are defined in terms of concepts and the causal relations between them. Following Kemp et al. (2010), we investigate the performance of the hierarchical Bayesian model, in which causal systems are represented by directed acyclic graphs (DAGs) with nodes divided into distinct categories. This paper presents two non-reversible search and score algorithms (Q1 and Q2) and their application to the causal learning system. The algorithms run through the pairs of class-assignment vectors and graph structures and choose the one which maximizes the probability of given observations. The model discovers latent classes in relational data and the number of these classes and predicts relations between objects belonging to them. We evaluate its performance on prediction tasks from the behavioural experiment about human cognition. Within the discussed approach, we solve a simplified prediction problem when object classification is known in advance. Finally, we describe the experimental procedure allowing in-depth analysis of the efficiency and scalability of both search and score algorithms.

Learning causal theories with non-reversible MCMC methods

Control and Cybernetics

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Learning causal theories with non-reversible MCMC methods"}

Causal laws are defined in terms of concepts and the causal relations between them. Following Kemp et al. (2010), we investigate the performance of the...

Learning causal theories with non-reversible MCMC methods

Data publikacji: 27 cze 2022

Zakres stron: 323 - 361

Otrzymano: 01 maj 2021

Przyjęty: 01 lip 2021

DOI: https://doi.org/10.2478/candc-2021-0021

Słowa kluczowe
Bayesian inference, causal systems, directed acyclic graph, MCMC, non-reversible Markov processes, search and score methods

© 2021 Antonina Krajewska, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Learning causal theories with non-reversible MCMC methods

Data publikacji: 27 cze 2022

Zakres stron: 323 - 361

Otrzymano: 01 maj 2021

Przyjęty: 01 lip 2021

DOI: https://doi.org/10.2478/candc-2021-0021

Słowa kluczoweBayesian inference, causal systems, directed acyclic graph, MCMC, non-reversible Markov processes, search and score methods

© 2021 Antonina Krajewska, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Słowa kluczowe
Bayesian inference, causal systems, directed acyclic graph, MCMC, non-reversible Markov processes, search and score methods