# Localised Natural Causal Learning Algorithms for Weak Consistency Conditions

arXiv: https://arxiv.org/abs/2402.14775 · HTML: https://mlsanity.com/paper/2402.14775/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 22 Feb 2024.

## Built on by (most cited first, 1 of 1)

- [A General Framework on Conditions for Constraint-based Causal Learning](https://mlsanity.com/paper/2408.07575/) (2024)

## Abstract (arXiv)

By relaxing conditions for natural structure learning algorithms, a family of constraint-based algorithms containing all exact structure learning algorithms under the faithfulness assumption, we define localised natural structure learning algorithms (LoNS). We also provide a set of necessary and sufficient assumptions for consistency of LoNS, which can be thought of as a strict relaxation of the restricted faithfulness assumption. We provide a practical LoNS algorithm that runs in exponential time, which is then compared with related existing structure learning algorithms, namely PC/SGS and the relatively recent sparsest permutation algorithm. Simulation studies are also provided.