Papers
Topics
Authors
Recent
Search
2000 character limit reached

High-Dimensional Poisson DAG Model Learning Using ℓ1\ell_1-Regularized Regression

Published 5 Oct 2018 in stat.ML and cs.LG | (1810.02501v3)

Abstract: In this paper, we develop a new approach to learning high-dimensional Poisson directed acyclic graphical (DAG) models from only observational data without strong assumptions such as faithfulness and strong sparsity. A key component of our method is to decouple the ordering estimation or parent search where the problems can be efficiently addressed using ℓ1\ell_1-regularized regression and the mean-variance relationship. We show that sample size n=Ω(d2log⁡9p)n = \Omega( d^{2} \log^{9} p) is sufficient for our polynomial time Mean-variance Ratio Scoring (MRS) algorithm to recover the true directed graph, where pp is the number of nodes and dd is the maximum indegree. We verify through simulations that our algorithm is statistically consistent in the high-dimensional p>np>n setting, and performs well compared to state-of-the-art ODS, GES, and MMHC algorithms. We also demonstrate through multivariate real count data that our MRS algorithm is well-suited to estimating DAG models for multivariate count data in comparison to other methods used for discrete data.

Authors (2)
Citations (17)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.