Metraipolis › archive › dc_de5e96ef3bb4

Causal Heteroscedastic Structure Learning From Incomplete Temporal data — arXiv:2611.10668

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.10668
License (as archived)
CC0-1.0
Archived
2026-11-10T18:42:42.103Z
SHA-256 of the archived text
c8fa3d7584a9ed2314d34b0dc64f5ba5060a5c71fc00bccb32f3ccdd10a51ece
Stable URL of this page
https://metraipolis.com/documento/dc_de5e96ef3bb4

How to cite

Causal Heteroscedastic Structure Learning From Incomplete Temporal data — arXiv:2611.10668 — arXiv (en), https://arxiv.org/abs/2611.10668 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_de5e96ef3bb4 (Metraipolis archive dc_de5e96ef3bb4, sha256 c8fa3d7584a9ed2314d34b0dc64f5ba5060a5c71fc00bccb32f3ccdd10a51ece)
BibTeX
@misc{dcde5e96ef3bb4,
  title = {Causal Heteroscedastic Structure Learning From Incomplete Temporal data — arXiv:2611.10668},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.10668},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_de5e96ef3bb4; sha256 c8fa3d7584a9ed2314d34b0dc64f5ba5060a5c71fc00bccb32f3ccdd10a51ece},
  year = {2026}
}

Archived text

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

Discovering causal structures in multivariate time series (MTS) is critical in domains such as finance and neuroscience, yet remains challenging in practice due to three distinct obstacles. First, MTS are routinely corrupted by missing values, where naive impute-then-discover pipelines distort the underlying data distribution and yield spurious causal graphs. Second, identifying instantaneous effects is difficult even on complete data, and missingness further entangles imputation with graph recovery. Third, real-world data frequently exhibits heteroscedastic noise with variance driven by both instantaneous and lagged causes, violating the core assumptions of standard discovery methods. Existing approaches fail to address these challenges concurrently, typically presuming complete data, homoscedastic noise, or strictly time-lagged relationships. Crucially, we show through ablation studies that resolving these issues sequentially, rather than jointly, leads to a substantial degradation in performance. To overcome this, we introduce Cheesefill, an optimal transport framework for causal structure learning under missingness and heteroscedastic noise. Cheesefill parameterizes causal mechanisms using conditional normalizing flows and jointly learns a stochastic correction map that refines naive imputations into trajectories consistent with the inferred causal mechanisms. Theoretically, we prove that optimizing over stochastic correction maps is equivalent to a conditional kernel reformulation of the Kantorovich problem, from which our neural parameterization yields a tractable objective. Extensive experiments on synthetic and real-world benchmarks demonstrate that Cheesefill consistently outperforms existing baselines across diverse missingness regimes.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2611.10668 — 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-11-10T18:37:37.599Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).