We address network structure learning from zero-inflated count data by casting each node as a zero-inflated generalized linear model and optimizing a smooth, score-based objective under a directed acyclic graph constraint. Our Zero-Inflated Continuous Optimization (ZICO) approach uses node-wise likelihoods with canonical links and enforces acyclicity through a differentiable surrogate constraint combined with sparsity regularization. ZICO achieves superior performance with faster runtimes on simulated data. It also performs comparably to or better than common algorithms for reverse engineering gene regulatory networks. ZICO is fully vectorized and mini-batched, enabling learning on larger variable sets with practical runtimes in a wide range of domains.
翻译:本文通过将每个节点建模为零膨胀广义线性模型,并在有向无环图约束下优化平滑的基于评分的目标函数,解决了从零膨胀计数数据中学习网络结构的问题。我们提出的零膨胀连续优化方法采用具有规范链接的节点似然函数,并通过可微代理约束结合稀疏正则化来保证无环性。在模拟数据上,该方法实现了更优的性能和更快的运行时间。在基因调控网络逆向工程任务中,其表现与常用算法相当或更优。该方法完全向量化并支持小批量处理,能够在更广泛的领域中处理更大规模的变量集,并保持实际可行的运行时间。