Intervention efficient algorithms for approximate learning of causal graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3513839 (Why is no real title available?)
- A linear non-Gaussian acyclic model for causal discovery
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
- Ancestral graph Markov models.
- Causal reasoning with ancestral graphs
- Causality. Models, reasoning, and inference
- Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
- Concentration inequalities for sampling without replacement
- Experiment selection for causal discovery
- High-dimensional learning of linear causal networks via inverse covariance estimation
- Improving the performance guarantee for approximate graph coloring
- Interactive proofs and the hardness of approximating cliques
- Introduction to algorithms.
- Learning the structure of linear latent variable models
- Local Graph Partitions for Approximation and Testing
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
- Property testing and its connection to learning and approximation
- Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
- The collected works of Wassily Hoeffding. Ed. by N. I. Fisher and P. K. Sen
- The design of approximation algorithms
- Two optimal strategies for active learning of causal models from interventional data
This page was built for publication: Intervention efficient algorithms for approximate learning of causal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028651)
