Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research extends the FLOP algorithm to interventional data, leveraging iterative Cholesky-based score updates to efficiently recover causal structures from BIC scores. The proposed I-FLOP method demonstrates superior performance and runtime compared to existing algorithms on both simulated and real datasets, advancing the field of causal structure learning.
Sources coveringarXiv, Fortune
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

I-FLOP: Fast Learning of Order and Parents from Interventional Data

arXiv2 min read

arXiv:2608.28245v1 Announce Type: cross Abstract: We extend the FLOP (fast learning of order and parents) algorithm recently proposed by Wien\"obst et al. (2026) from observational to interventional data. In particular, we use the interventional BIC score of Hauser and B\"uhlmann (2012), adapting it to be used with the iterative Cholesky-based score updates that are partly responsible for FLOP's speed. We show that, in the sample limit, I-FLOP recovers a DAG in the same interventional Markov equivalence class as the data-generating DAG. We compare I-FLOP to existing causal structure learning algorithms on real and simulated interventional data, where it performs favorably in terms of both performance and run time.

Abstract:We extend the FLOP (fast learning of order and parents) algorithm recently proposed by Wienöbst et al. (2026) from observational to interventional data. In particular, we use the interventional BIC score of Hauser and Bühlmann (2012), adapting it to be used with the iterative Cholesky-based score updates that are partly responsible for FLOP's speed. We show that, in the sample limit, I-FLOP recovers a DAG in the same interventional Markov equivalence class as the data-generating DAG. We compare I-FLOP to existing causal structure learning algorithms on real and simulated interventional data, where it performs favorably in terms of both performance and run time.

Machine Learning (stat.ML); Machine Learning (cs.LG)

arXiv:2608.28245 [stat.ML]

(or arXiv:2608.28245v1 [stat.ML] for this version)

https://doi.org/10.48550/arXiv.2608.28245 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 200 words

Related coverage