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
Can You Really Pentest Any Site with ARTEX AI?
0dev.to
Keeping n8n maintainable as a small team: sub-workflows, naming and a few house rules
0dev.to

Claude Jira: Built for Tickets, Slow at Team Metrics
0dev.to
Rent, License or Build a Multi-Asset Trading Terminal: What the Company Owns and When to Switch
0dev.to
The AI Verification Gap: Review AI Code Without Rubber-Stamping It
0dev.to
Why Your Next.js App Overflows PostgreSQL Connections (And How to Fix It)
0dev.to