Generalizing Metropolis-Hastings for DAG Sampling
This work advances Markov chain Monte Carlo algorithms by introducing novel moves that simultaneously resample the parents for multiple nodes of the DAG by introducing duet sampling, a new generalization of the Metropolis-Hastings algorithm.
Daniele Nikzad, Mikko Koivisto
· 0 citations