This paper deals with multivariate regression chain graphs (MVR CGs), which were introduced by Cox and Wermuth in the nineties to represent linear causal models with correlated errors. We consider the PC-like algorithm for structure learning of MVR CGs, a constraint-based method proposed by Sonntag and Peña in 2012. We show that the PC-like algorithm is order-dependent, because the output can depend on the order in which the variables are given. This order-dependence is a minor issue in low-dimensional settings. However, it can be very pronounced in high-dimensional settings, where it can lead to highly variable results. We propose two modifications of the PC-like algorithm that remove part or all of this order-dependence. Simulations under a variety of settings demonstrate the competitive performance of our algorithms in comparison with the original PC-like algorithm in low-dimensional settings and improved performance in high-dimensional settings.
CITATION STYLE
Javidian, M. A., Valtorta, M., & Jamshidi, P. (2019). Order-Independent Structure Learning of Multivariate Regression Chain Graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11940 LNAI, pp. 324–338). Springer. https://doi.org/10.1007/978-3-030-35514-2_24
Mendeley helps you to discover research relevant for your work.