
FB
Fabian Bleile, Sarah Lumpp, Mathias Drton
· 1 min read
ResearcharXiv cs.LG
NOTREKS: Marginal Independence in Score-based Structure Learning
arXiv:2611.24015v1 Announce Type: cross
Abstract: Score-based structure learning estimates causal graphs by optimizing a data-dependent objective over structural equation models. We study how prior knowledge that selected pairs of variables are marginally independent can be incorporated into such causal discovery methods. Under faithfulness, marginally independent pairs cannot be connected by a trek, so the knowledge becomes a graphical no-trek constraint, which we call NOTREKS information. We introduce a power-series trek (PSTrek) penalty for gradient-based optimization and a trek constraint for order-based search, and we analyze why such information helps in finite samples and how it restricts the search space. Our numerical experiments illustrate to what extent NOTREKS information helps in causal discovery. In particular, using synthetic benchmarks with oracle NOTREKS information, we show that these constraints can improve both structural recovery and adjustment-based effect identification.
Original source
This story was published by arXiv cs.LG and written by Fabian Bleile, Sarah Lumpp, Mathias Drton. SyncAI.news shows a preview; the complete article is on the publisher's site.
Read the full story on arxiv.org


