Tight Bound on Vertex Cut Sparsifiers in Directed Acyclic Graphs.
Zhiyang HeJason LiPublished in: CoRR (2020)
Keyphrases
- directed acyclic graph
- lower bound
- undirected graph
- upper bound
- directed graph
- worst case
- vertex set
- equivalence class
- random variables
- conditional independence
- generalization error bounds
- causal models
- equivalence classes
- random walk
- bayesian network structure
- structural learning
- causal discovery
- np hard
- approximation algorithms
- causal reasoning
- structural equation models
- optimal solution
- markov models
- markov property
- higher order