arXiv · 1911.00081
Scaling structural learning with NO-BEARS to infer causal transcriptome networks
Abstract
Constructing gene regulatory networks is a critical step in revealing disease mechanisms from transcriptomic data. In this work, we present NO-BEARS, a novel algorithm for estimating gene regulatory networks. The NO-BEARS algorithm is built on the basis of the NOTEARS algorithm with two improvements. First, we propose a new constraint and its fast approximation to reduce the computational cost of the NO-TEARS algorithm. Next, we introduce a polynomial regression loss to handle non-linearity in gene expressions. Our implementation utilizes modern GPU computation that can decrease the time of hours-long CPU computation to seconds. Using synthetic data, we demonstrate improved performance, both in processing time and accuracy, on inferring gene regulatory networks from gene expression data.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hao-Chih Lee, Matteo Danieletto, Riccardo Miotto, Sarah T. Cherng, Joel T. Dudley. 2019-10-31. Scaling structural learning with NO-BEARS to infer causal transcriptome networks. https://arxiv.org/abs/1911.00081
Cite the original work for its findings. Save a collection to share your selection of sources.