Root Cause Analysis of Outliers in Unknown Cyclic Graphs

• URL: http://arxiv.org/abs/2510.06995v1
• Date: Wed, 08 Oct 2025 13:19:01 GMT
• Title: Root Cause Analysis of Outliers in Unknown Cyclic Graphs
• Abstract summary: We show that it is possible to identify a short list of potential root causes provided that the perturbation is sufficiently strong.<n>This shortlist consists of the true root causes together with those of its parents lying on a cycle with the root cause.
• Score: 7.33673561186158
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the propagation of outliers in cyclic causal graphs with linear structural equations, tracing them back to one or several "root cause" nodes. We show that it is possible to identify a short list of potential root causes provided that the perturbation is sufficiently strong and propagates according to the same structural equations as in the normal mode. This shortlist consists of the true root causes together with those of its parents lying on a cycle with the root cause. Notably, our method does not require prior knowledge of the causal graph.

Related papers

• Formalizing and falsifying causal pathways of rare events [7.33673561186158]
  We propose a formal definition of a causal pathway and discuss its testable implications.<n>We identify conditions under which these implications depend only on a causal abstraction defined by the pathway of rare events.
  arXiv  Detail & Related papers  (2026-05-29T12:50:47Z)
• Circular Reasoning: Understanding Self-Reinforcing Loops in Large Reasoning Models [66.11277323593475]
  Circular Reasoning is a self-reinforcing trap where generated content acts as a logical premise for its own recurrence.<n>Mechanistically, we characterize circular reasoning as a state collapse exhibiting distinct boundaries.<n>We reveal that reasoning impasses trigger the loop onset, which subsequently persists as an inescapable cycle driven by a self-reinforcing V-shaped attention mechanism.
  arXiv  Detail & Related papers  (2026-01-09T10:23:55Z)
• Root Cause Analysis of Outliers with Missing Structural Knowledge [13.152501863685478]
  We propose simplified, efficient methods of root cause analysis when the task is to identify a unique root cause instead of quantitative contribution analysis. Our proposed methods run in linear order of SCM nodes and they require only the causal DAG without counterfactuals. We prove that anomalies with small scores are unlikely to cause those with large scores and show upper bounds for the likelihood of causal pathways with non-monotonic anomaly scores.
  arXiv  Detail & Related papers  (2024-06-07T15:24:38Z)
• Causal Layering via Conditional Entropy [85.01590667411956]
  Causal discovery aims to recover information about an unobserved causal graph from the observable data it generates. We provide ways to recover layerings of a graph by accessing the data via a conditional entropy oracle.
  arXiv  Detail & Related papers  (2024-01-19T05:18:28Z)
• Root Cause Explanation of Outliers under Noisy Mechanisms [50.59446568076628]
  Causal processes are often modelled as graphs with entities being nodes and their paths/interconnections as edge. Existing work only consider the contribution of nodes in the generative process. We consider both individual edge and node of each mechanism when identifying the root causes.
  arXiv  Detail & Related papers  (2023-12-19T03:24:26Z)
• Root Cause Identification for Collective Anomalies in Time Series given an Acyclic Summary Causal Graph with Loops [1.8416014644193066]
  The paper first shows how the problem of root cause identification can be divided into many independent subproblems. Under this setting, some root causes can be found directly from the graph and from the time of appearance of anomalies. The rest of the root causes can be found by comparing direct effects in the normal and in the anomalous regime.
  arXiv  Detail & Related papers  (2023-03-07T16:47:35Z)
• DynGFN: Towards Bayesian Inference of Gene Regulatory Networks with GFlowNets [81.75973217676986]
  Gene regulatory networks (GRN) describe interactions between genes and their products that control gene expression and cellular function. Existing methods either focus on challenge (1), identifying cyclic structure from dynamics, or on challenge (2) learning complex Bayesian posteriors over DAGs, but not both. In this paper we leverage the fact that it is possible to estimate the "velocity" of gene expression with RNA velocity techniques to develop an approach that addresses both challenges.
  arXiv  Detail & Related papers  (2023-02-08T16:36:40Z)
• Hierarchical Graph Neural Networks for Causal Discovery and Root Cause Localization [52.72490784720227]
  REASON consists of Topological Causal Discovery and Individual Causal Discovery. The Topological Causal Discovery component aims to model the fault propagation in order to trace back to the root causes. The Individual Causal Discovery component focuses on capturing abrupt change patterns of a single system entity.
  arXiv  Detail & Related papers  (2023-02-03T20:17:45Z)
• Causal Inference Using Tractable Circuits [11.358487655918676]
  We show that probabilistic inference in the presence of unknown causal mechanisms can be tractable for models that have traditionally been viewed as intractable. This has been enabled by a new technique that can exploit causal mechanisms computationally but without needing to know their identities. Our goal is to provide a causality-oriented exposure to these new results and to speculate on how they may potentially contribute to more scalable and versatile causal inference.
  arXiv  Detail & Related papers  (2022-02-07T00:09:39Z)
• Typing assumptions improve identification in causal discovery [123.06886784834471]
  Causal discovery from observational data is a challenging task to which an exact solution cannot always be identified. We propose a new set of assumptions that constrain possible causal relationships based on the nature of the variables.
  arXiv  Detail & Related papers  (2021-07-22T14:23:08Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• Structure Learning for Cyclic Linear Causal Models [5.567377163246147]
  We consider the problem of structure learning for linear causal models based on observational data. We treat models given by possibly cyclic mixed graphs, which allow for feedback loops and effects of latent confounders.
  arXiv  Detail & Related papers  (2020-06-10T17:47:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.