Metraipolis › archive › dc_ec74dccd7ae7
Mixed-Integer Programming for Causal Discovery with Unknown Hard-Intervention Targets — arXiv:2611.01267
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01267
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:31:41.426Z
- SHA-256 of the archived text
ba5819e1e8c4be76cc2b00da57f41c371dd90f88b02d5c7ccc8f09e100276e67- Stable URL of this page
https://metraipolis.com/documento/dc_ec74dccd7ae7
How to cite
Mixed-Integer Programming for Causal Discovery with Unknown Hard-Intervention Targets — arXiv:2611.01267 — arXiv (en), https://arxiv.org/abs/2611.01267 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ec74dccd7ae7 (Metraipolis archive dc_ec74dccd7ae7, sha256 ba5819e1e8c4be76cc2b00da57f41c371dd90f88b02d5c7ccc8f09e100276e67)
BibTeX
@misc{dcec74dccd7ae7,
title = {Mixed-Integer Programming for Causal Discovery with Unknown Hard-Intervention Targets — arXiv:2611.01267},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01267},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ec74dccd7ae7; sha256 ba5819e1e8c4be76cc2b00da57f41c371dd90f88b02d5c7ccc8f09e100276e67},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01267. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
When intervention targets are uncertain, learning causal relationships and identifying directly perturbed variables become a joint task. We develop an exact mixed-integer program based on optimized parent-set scores (PS-MIP) for joint graph and intervention-target estimation in linear Gaussian structural equation models under stochastic hard interventions. The method can incorporate candidate-edge restrictions and partial target knowledge when available. For each random variable, PS-MIP evaluates candidate sets of direct causes, or parent sets, by optimizing the likelihood parameters and compatible target patterns, retaining both the score and a minimizing target pattern. A global mixed-integer program then selects parent sets subject to acyclicity. Under stated conditions, this reduction preserves the joint objective and reconstructs the graph, targets, and likelihood parameters. Because the local scores are precomputed, PS-MIP replaces a direct large bilinear mixed-integer program with a linear selection problem; empirically it certifies global optimality on far more instances than the direct formulation (126 of 180 versus 34) and is often orders of magnitude faster. On synthetic data, PS-MIP achieves favorable false-discovery--true-discovery trade-offs relative to several benchmark algorithms for causal discovery with unknown intervention targets, along with strong intervention-target recovery in denser settings. An exploratory study on real data from a controlled physical system further demonstrates recovery beyond simulation. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2611.01267 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T11:04:22.225Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).