Order-independent structure learning of multivariate regression chain graphs

From MaRDI portal
Publication:3297816

DOI10.1007/978-3-030-35514-2_24zbMATH Open1440.68217arXiv1910.01067OpenAlexW2996864919MaRDI QIDQ3297816FDOQ3297816


Authors: Mohammad Ali Javidian, Marco Valtorta, Pooyan Jamshidi Edit this on Wikidata


Publication date: 20 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1910.01067




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: Order-independent structure learning of multivariate regression chain graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297816)