mlsanityData to 7 Oct 2026

Measurement Dependence Inducing Latent Causal Models

arXiv 1910.08778 ↗First posted 19 Oct 2019stat.ML cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

We consider the task of causal structure learning over measurement dependence inducing latent (MeDIL) causal models. We show that this task can be framed in terms of the graph theoretic problem of finding edge clique covers,resulting in an algorithm for returning minimal MeDIL causal models (minMCMs). This algorithm is non-parametric, requiring no assumptions about linearity or Gaussianity. Furthermore, despite rather weak assumptions aboutthe class of MeDIL causal models, we show that minimality in minMCMs implies some rather specific and interesting properties. By establishing MeDIL causal models as a semantics for edge clique covers, we also provide a starting point for future work further connecting causal structure learning to developments in graph theory and network science.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Oct 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 2; 2024: 0; 2025: 4; 2026: 4.

14 papers.

Sort: