Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2109.13993 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915708153102336 |
|---|---|
| author | Shahbazinia, Amirhossein Salehkaleybar, Saber Hashemi, Matin |
| author_facet | Shahbazinia, Amirhossein Salehkaleybar, Saber Hashemi, Matin |
| contents | One of the key objectives in many fields in machine learning is to discover causal relationships among a set of variables from observational data. In linear non-Gaussian acyclic models (LiNGAM), it can be shown that the true underlying causal structure can be identified uniquely from merely observational data. DirectLiNGAM algorithm is a well-known solution to learn the true causal structure in high dimensional setting. DirectLiNGAM algorithm executes in a sequence of iterations and it performs a set of comparisons between pairs of variables in each iteration. Unfortunately, the runtime of this algorithm grows significantly as the number of variables increases. In this paper, we propose a parallel algorithm, called ParaLiNGAM, to learn casual structures based on DirectLiNGAM algorithm. We propose a threshold mechanism that can reduce the number of comparisons remarkably compared with the sequential solution. Moreover, in order to further reduce runtime, we employ a messaging mechanism between workers and derive some mathematical formulations to simplify the execution of comparisons. We also present an implementation of ParaLiNGAM on GPU, considering hardware constraints. Experimental results on synthetic and real data show that the implementation of proposed algorithm on GPU can outperform DirectLiNGAM by a factor up to 4600 X. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_13993 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | ParaLiNGAM: Parallel Causal Structure Learning for Linear non-Gaussian Acyclic Models Shahbazinia, Amirhossein Salehkaleybar, Saber Hashemi, Matin Distributed, Parallel, and Cluster Computing One of the key objectives in many fields in machine learning is to discover causal relationships among a set of variables from observational data. In linear non-Gaussian acyclic models (LiNGAM), it can be shown that the true underlying causal structure can be identified uniquely from merely observational data. DirectLiNGAM algorithm is a well-known solution to learn the true causal structure in high dimensional setting. DirectLiNGAM algorithm executes in a sequence of iterations and it performs a set of comparisons between pairs of variables in each iteration. Unfortunately, the runtime of this algorithm grows significantly as the number of variables increases. In this paper, we propose a parallel algorithm, called ParaLiNGAM, to learn casual structures based on DirectLiNGAM algorithm. We propose a threshold mechanism that can reduce the number of comparisons remarkably compared with the sequential solution. Moreover, in order to further reduce runtime, we employ a messaging mechanism between workers and derive some mathematical formulations to simplify the execution of comparisons. We also present an implementation of ParaLiNGAM on GPU, considering hardware constraints. Experimental results on synthetic and real data show that the implementation of proposed algorithm on GPU can outperform DirectLiNGAM by a factor up to 4600 X. |
| title | ParaLiNGAM: Parallel Causal Structure Learning for Linear non-Gaussian Acyclic Models |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2109.13993 |