Revisiting Bayesian network learning with small vertex cover
J Harviainen, M Koivisto - Uncertainty in Artificial Intelligence, 2023 - proceedings.mlr.press
The problem of structure learning in Bayesian networks asks for a directed acyclic graph
(DAG) that maximizes a given scoring function. Since the problem is NP-hard, research effort …
(DAG) that maximizes a given scoring function. Since the problem is NP-hard, research effort …
Faster Perfect Sampling of Bayesian Network Structures
J Harviainen, M Koivisto - The 40th Conference on Uncertainty in …, 2024 - openreview.net
Bayesian inference of a Bayesian network structure amounts to averaging over directed
acyclic graphs (DAGs) on a given set of $ n $ variables, each DAG weighted by its posterior …
acyclic graphs (DAGs) on a given set of $ n $ variables, each DAG weighted by its posterior …
[PDF][PDF] Advances in Sampling and Counting Bipartite Matchings and Directed Acyclic Graphs
J Harviainen - 2024 - helda.helsinki.fi
When enumerating all objects of some set is computationally infeasible, sampling a subset
of them provides a method for both analyzing their properties and approximating their total …
of them provides a method for both analyzing their properties and approximating their total …