Skip to content

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

Aug 2026 · 0 citations · 22 references
Mathematics Computer Science

TL;DR

It is shown that, in the sample limit, I-FLOP recovers a DAG in the same interventional Markov equivalence class as the data-generating DAG, 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\"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.

View source

Similar papers

Preprint Oct 2026

Sign-Constrained Intervention Effects for Domain-Generalizable ICU World Models

Predicting how a patient's vital signs respond to an intervention is a central question in intensive care. World models can do so by learning dynamics as a function of prior actions. However, such models tend to be brittle outside of training data. Clinicians choose drug dosages based on the patient's state, so the ass...

Zheng Xu, Nicholas Konz, Zhen Tan et al. · 0 citations
Preprint Sep 2026

RECaST-Surv: A Calibrated Borrowing Method for Survival Endpoints in Unequal Randomized Trials

RECaST-Surv is proposed, a Bayesian transfer-learning framework for time-to-event outcomes that extends the RECaST method to survival settings and maintains near-nominal Type I error across challenging settings while improving power by roughly 10%--12% over standard analyses.

De-Hua Bi, Arlina Shen, R. V. van Eijk et al. · 0 citations
Review Open access Sep 2026

Earning while learning: How to run batched bandit experiments

Researchers typically collect experimental data sequentially, allowing early outcome observations and adaptive treatment assignment to reduce exposure to inferior treatments. In this article, we review multiarmed bandit adaptive experimental designs that balance exploration and exploitation. Because adaptively collecte...

Jan Kemper, Davud Rostam-Afschar · 1 citation
Open access Sep 2026

Incremental Propensity Score Interventions: A Primer for Pharmacoepidemiologists

ABSTRACT Background In observational pharmacoepidemiology, estimating average treatment effects (ATEs) is often challenging due to a lack of practical positivity. In highly selective clinical settings, certain patients almost always or never receive treatment, causing ATE estimators to rely on unstable extrapolation. I...

Byeong Yeob Choi · 0 citations
#machine learning Preprint Oct 2026

Causal Discovery Under Hard Selection Bias: A New Robust Score-Matching Approach

Selection bias is a difficult yet widespread problem in causal discovery, occurring whenever non-random selection processes lead to data that is not representative of the underlying populations. Due to its practical importance, related works have been proposed to address the problem under local [Versteeg et al., 2022]...

Yi-Wen Qiu, Francesco Montagna, Shimeng Huang et al. · 0 citations
Conference Sep 2026

Hybrid FSIR Model with Parameter Embedding via Machine Learning

Epidemiological model parameters vary in realworld conditions due to seasonality, interventions, and behavioral factors, making static parameterization insufficient. This paper proposes a hybrid FSIR (Fractional SusceptibleInfected-Recovered) model that combines a Caputo fractional derivative core with adaptive data-dr...

Stanislav Pohorielov, O. Akhiiezer, Oleksiy Galuza et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.