Metraipolis › archive › dc_4ba3a970ac92

Provable Guarantees and Efficient Learning of Structural Equation Models with Latent Confounders — arXiv:2609.18535

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.18535
License (as archived)
CC0-1.0
Archived
2026-10-15T15:04:45.647Z
SHA-256 of the archived text
cc333064cc55e9b5a76b446ac7aec573b7623f2b863c07d79d7ec272afb660fd
Stable URL of this page
https://metraipolis.com/documento/dc_4ba3a970ac92

How to cite

Provable Guarantees and Efficient Learning of Structural Equation Models with Latent Confounders — arXiv:2609.18535 — arXiv (en), https://arxiv.org/abs/2609.18535 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4ba3a970ac92 (Metraipolis archive dc_4ba3a970ac92, sha256 cc333064cc55e9b5a76b446ac7aec573b7623f2b863c07d79d7ec272afb660fd)
BibTeX
@misc{dc4ba3a970ac92,
  title = {Provable Guarantees and Efficient Learning of Structural Equation Models with Latent Confounders — arXiv:2609.18535},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18535},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4ba3a970ac92; sha256 cc333064cc55e9b5a76b446ac7aec573b7623f2b863c07d79d7ec272afb660fd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18535. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Causal discovery aims to recover causal relationships from observed data. In various fields, exploring causal relationships among variables remains an important topic, but this task becomes challenging due to the existence of latent confounders. Ignoring such confounders can lead to false associations and incorrect edge directions. In this paper, we study the linear structural equation model with latent confounders. We propose an algorithm that iteratively identifies terminal (observed) nodes and reconstructs the directed acyclic graph of the observed variables. To do this, we recover the precision matrix of the observed variables as a sparse plus low-rank matrix: a sparse matrix captures the conditional dependencies among observed variables, while a low-rank matrix captures the combined influence of a few latent confounders. We establish that for $p$ observed variables, $r$ latent confounders and $s$ edges, our procedure correctly identifies the directed causal relationship among observed variables, for $n \gtrsim \max\{s\log p,\ r p\}$ samples. Experimental results validate our theoretical contributions.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-17 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.18535 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T14:08:19.127Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).