aiqbench analysis
This research advances explainable AI by proposing efficient, approximate algorithms capable of identifying actual causes in specific contexts rather than just general tendencies. By decomposing complex causality problems into manageable sub-instances, the study offers practical solutions for non-Boolean and stochastic models where exact computation is currently infeasible. The work bridges a critical gap between formal causal theory and real-world applicability, addressing the NP-completeness barrier that has limited existing XAI tools.
Searching for Actual Causes: Approximate Algorithms with Adjustable Precision
arXiv:2507.07857v2 Announce Type: replace Abstract: Causality has gained increasing attention in recent years, notably for improving the interpretability of machine learning models. Yet the field of explainable artificial intelligence (XAI) has been criticized for emphasizing general tendencies rather than the situation-specific facts, which users typically expect as explanations. These expectations align with the notion of actual causes, which identify what made the observed outcome happen, in the specific context at hand. Halpern and Pearl provided a formal basis for actual causation, but identifying actual causes is NP-complete. Practical identification algorithms are extremely scarce, restricted to narrow classes of models, and typically identify only the shortest cause. We address this gap between the formal theory and its applicability through two main contributions. First, we introduce a baseline approximate polynomial-time algorithm with adjustable precision, together with two complementary algorithms that improve its efficiency. Second, we provide a theoretical result showing that the actual-cause identification problem can be decomposed into smaller sub-instances that preserve the set of solutions. This result directly motivates one of the complementary algorithms. Our experiments demonstrate that the baseline method can approximate the set of actual causes, notably for non-Boolean and stochastic models, and that the complementary algorithms further improve its performance in most cases.
Abstract:Causality has gained increasing attention in recent years, notably for improving the interpretability of machine learning models. Yet the field of explainable artificial intelligence (XAI) has been criticized for emphasizing general tendencies rather than the situation-specific facts, which users typically expect as explanations. These expectations align with the notion of actual causes, which identify what made the observed outcome happen, in the specific context at hand. Halpern and Pearl provided a formal basis for actual causation, but identifying actual causes is NP-complete. Practical identification algorithms are extremely scarce, restricted to narrow classes of models, and typically identify only the shortest cause. We address this gap between the formal theory and its applicability through two main contributions. First, we introduce a baseline approximate polynomial-time algorithm with adjustable precision, together with two complementary algorithms that improve its efficiency. Second, we provide a theoretical result showing that the actual-cause identification problem can be decomposed into smaller sub-instances that preserve the set of solutions. This result directly motivates one of the complementary algorithms. Our experiments demonstrate that the baseline method can approximate the set of actual causes, notably for non-Boolean and stochastic models, and that the complementary algorithms further improve its performance in most cases.
Published in Transactions on Machine Learning Research (09/2026). OpenReview: this https URL. Code: this https URL
Artificial Intelligence (cs.AI)
arXiv:2507.07857 [cs.AI]
(or arXiv:2507.07857v2 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2507.07857 Focus to learn more arXiv-issued DOI via DataCite
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 · 309 words
Related coverage

How can LLM RL Work Despite Information-Theoretic Inefficiency
LessWrong · Oct 16, 2026

Edward Farhi, The Physicist Behind QAOA
Quantum Zeitgeist · Aug 30, 2026

NISQ, What Noisy Intermediate-Scale Quantum Means
Quantum Zeitgeist · Aug 30, 2026

Frontier AI Risk Report (February–March 2026)
METR · May 19, 2026