Backend
NOTREKS: Marginal Independence in Score-based Structure Learning
arXiv stat.ML0 views
arXiv:2611.24015v1 Announce Type: new 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.
Source:https://arxiv.org/abs/2611.24015PreviousHow Reward Gain Imbalance Shapes Ranking: Rethinking Rubric-Based Reward AggregationNextRare-Tail Statistics For Learning Biased Gaussian Halfspaces with Label Noise
Related posts
Ask HN: Does AI slop require more marketing in the future?
0Hacker News Ask
Persistent incrementality in Rust
0Lobsters
Process vs Thread in OS: PCB, States, fork()
0dev.to
nginx2root: AI Found Five Critical nginx Flaws — Patch to 1.30.7 or 1.31.9 Before Attackers Do
0dev.to
Restarting Tailscale silently isolated a k3s node: fixing a flannel VXLAN bug upstream
0dev.to
Eclipse Enclave 1.0 Puts Your AI Coding Agent in a Sandbox
0dev.to