Order-Independent Structure Learning of Multivariate Regression Chain Graphs
Abstract
This paper deals with multivariate regression chain graphs (MVR CGs), which were introduced by Cox and Wermuth [3,4] to represent linear causal models with correlated errors. We consider the PC-like algorithm for structure learning of MVR CGs, which is a constraint-based method proposed by Sonntag and Pe\~{n}a in [18]. We show that the PC-like algorithm is order-dependent, in the sense that 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.
Keywords
Cite
@article{arxiv.1910.01067,
title = {Order-Independent Structure Learning of Multivariate Regression Chain Graphs},
author = {Mohammad Ali Javidian and Marco Valtorta and Pooyan Jamshidi},
journal= {arXiv preprint arXiv:1910.01067},
year = {2019}
}
Comments
This paper is an extended version of the accepted paper for SUM 2019 that will appear in the proceedings published by Springer in the Lecture Notes in Artificial Intelligence (LNAI) series