In our recent work, we developed a novel dynamic programming algorithm to find optimal Bayesian networks with parent set constraints. This ‘generational orderings’ based dynamic programming algorithm—
For large n, the CSS initialization is generally close to a maximum, causing the default initialization to converge quicker than random initializations.
For large n, the CSS initialization is generally close to a maximum, causing the default initialization to converge quicker than random initializations.