← Back to all news
arXiv Machine Learning By Loong Kuan Lee, Ragavi Krishnamoorthy, Nico Piatkowski

High-Order Markov Blanket Discovery via a k-Order Relaxation of the Faithfulness Assumption

Read the original on arXiv Machine Learning →

arXiv:2607. 26357v1 Announce Type: new Abstract: The problem of learning the graphical Markov blanket (MB) of a variable from data has applications in many areas such as structure learning for Bayesian networks and Markov random fields, causal discovery, and feature selection.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Sep 22

Decoupled Causal Discovery

arXiv:2609.23535v1 Announce Type: new Abstract: Causal discovery from observational data is a fundamental yet challenging task in scientific research. While existing approaches are primarily based on...

By Zhengkang Guan, Fei Wu, Kun Kuang
More like this →
arXiv Machine Learning
Sep 11

The observational partial order of causal structures with latent variables

The paper studies observational dominance among causal structures with latent variables, defining one structure as dominating another if it can realize all distributions that the other can over the same visible variables. It provides a full characterization of this dominance partial order for three visible variables and a partial one for four, and shows that many equivalence classes are distinguished by nontrivial inequality constraints similar to Bell or instrumental inequalities. The authors also demonstrate that constraint‑based causal discovery algorithms relying only on conditional independence are much less powerful than those incorporating nested Markov and inequality constraints.

By Marina Maciel Ansanelli, Elie Wolfe, Robert W. Spekkens
More like this →