Knowledge-Informed Local Causal Discovery of Optimal Adjustment Sets

• URL: http://arxiv.org/abs/2607.04447v1
• Date: Sun, 05 Jul 2026 18:18:42 GMT
• Title: Knowledge-Informed Local Causal Discovery of Optimal Adjustment Sets
• Abstract summary: Local causal discovery is a scalable alternative to global structure learning.<n>We propose b-LOAD, a knowledge-informed extension of the LOAD algorithm for local discovery of optimal adjustment sets.<n>Results on real-world biological networks show that locally targeted prior knowledge provides the largest gains.
• Score: 40.628201358330976
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Local causal discovery is a scalable alternative to global structure learning. However, it can struggle to identify valid adjustment sets in data-scarce settings because of finite-sample uncertainty, incomplete local neighborhoods, and unresolved Markov equivalence. Although many application domains provide structured background knowledge, its integration into local causal discovery remains limited. We propose b-LOAD, a knowledge-informed extension of the LOAD algorithm for local discovery of optimal adjustment sets. b-LOAD incorporates prior edge constraints directly into the local structure-learning procedure and uses Meek's rules to expand the discovery frontier dynamically, yielding a knowledge-constrained partially directed graph over the relevant local subgraph. This strategy helps prevent structurally relevant nodes introduced by prior knowledge from being excluded by local search. We prove that, under sound background knowledge, the procedure monotonically refines the admissible equivalence class and can enlarge the set of identifiable causal queries, enabling recovery of optimal adjustment sets that are not identifiable from observational conditional-independence information alone. Empirically, b-LOAD improves downstream causal effect estimation relative to purely data-driven and standard knowledge-augmented baselines, particularly in data-scarce and structurally complex regimes. Results on real-world biological networks show that locally targeted prior knowledge provides the largest gains and remains beneficial under moderate structural noise. These findings position b-LOAD as a scalable approach for converting fragmented domain knowledge into more reliable causal-effect estimation.

Related papers

• Topology-Aware Neighborhood Learning for Source-Free Cross-Scene Hyperspectral Image Classification [11.354716471312239]
  Domain adaptation has advanced cross-scene hyperspectral image classification, significantly improving discriminative capability in complex scenarios.<n>Conventional domain adaptation methods become impractical, severely restricting their utility in realistic remote sensing scenarios.<n>We propose a topology-aware source-free learning framework to achieve robust and accurate classification without source data.
  arXiv  Detail & Related papers  (2026-08-06T12:40:06Z)
• Local Causal Structure Learning in the Presence of Latent Variables and Selection Bias [37.612552288675616]
  We study local causal structure learning in the presence of latent variables and selection bias.<n>We propose LoCaLS, a local causal structure learning algorithm that is sound and complete under standard assumptions.
  arXiv  Detail & Related papers  (2026-07-22T07:54:02Z)
• Causal Ensemble Agent: Hierarchical Causal Discovery with LLM-guided Expert Reweighting [95.24017293537025]
  Causal Ensemble Agent (CEA) is a novel framework that aggregates structural insights from statistical discovery experts across different graph levels.<n>CEA achieves the strongest overall performance across a wide range of causal discovery methods.
  arXiv  Detail & Related papers  (2026-06-09T09:09:07Z)
• ADKO: Agentic Decentralized Knowledge Optimization [21.537388090124196]
  Agentic Decentralized Knowledge Optimization (ADKO) is a framework for collaborative black-box optimization across autonomous agents.<n>Each agent maintains a private Gaussian Process (GP) surrogate trained on local data and communicates only through knowledge tokens.<n>We provide the first formal analysis of dual information loss: token compression, quantified via mutual-information-based fidelity, and LM approximation, decomposed into bias and noise.
  arXiv  Detail & Related papers  (2026-05-08T15:23:53Z)
• Use What You Know: Causal Foundation Models with Partial Graphs [97.91863420927866]
  Recently proposed Causal Foundation Models (CFMs) promise a more unified approach by amortising causal discovery and inference in a single step.<n>We bridge this gap by introducing methods to condition CFMs on causal information, such as the causal graph or more readily available ancestral information.
  arXiv  Detail & Related papers  (2026-02-16T17:56:37Z)
• On Transportability for Structural Causal Bandits [12.969694382964052]
  The structural causal bandit framework provides a graphical characterization for identifying actions that are unable to maximize rewards.<n>We show how priors from the source environments are fused to enhance learning in the deployment setting.<n>The resulting bandit algorithm achieves a sub-linear regret bound with an explicit dependence on informativeness of prior data.
  arXiv  Detail & Related papers  (2025-11-22T07:38:11Z)
• Local Causal Discovery for Statistically Efficient Causal Inference [7.856998585396421]
  Causal discovery methods can identify valid adjustment sets for causal effect estimation for a pair of target variables.<n>Global causal discovery methods focus on learning the whole causal graph and enable the recovery of optimal adjustment sets.<n>Local causal discovery methods offer a more scalable alternative by focusing on the local neighborhood of the target variables.
  arXiv  Detail & Related papers  (2025-10-16T11:39:02Z)
• EReLiFM: Evidential Reliability-Aware Residual Flow Meta-Learning for Open-Set Domain Generalization under Noisy Labels [85.78886153628663]
  Open-Set Domain Generalization aims to enable deep learning models to recognize unseen categories in new domains.<n>Label noise hinders open-set domain generalization by corrupting source-domain knowledge.<n>We propose Evidential Reliability-Aware Residual Flow Meta-Learning (EReLiFM) to bridge domain gaps.
  arXiv  Detail & Related papers  (2025-10-14T16:23:11Z)
• Structural Entropy Guided Agent for Detecting and Repairing Knowledge Deficiencies in LLMs [11.724887822269528]
  Large language models (LLMs) have achieved unprecedented performance by leveraging vast pretraining corpora.<n>Their performance remains suboptimal in knowledge-intensive domains such as medicine and scientific research.<n>We propose a novel Structural Entropy-guided Knowledge Navigator (SENATOR) framework that addresses the intrinsic knowledge deficiencies of LLMs.
  arXiv  Detail & Related papers  (2025-05-12T02:21:36Z)
• Trust your Good Friends: Source-free Domain Adaptation by Reciprocal Neighborhood Clustering [50.46892302138662]
  We address the source-free domain adaptation problem, where the source pretrained model is adapted to the target domain in the absence of source data. Our method is based on the observation that target data, which might not align with the source domain classifier, still forms clear clusters. We demonstrate that this local structure can be efficiently captured by considering the local neighbors, the reciprocal neighbors, and the expanded neighborhood.
  arXiv  Detail & Related papers  (2023-09-01T15:31:18Z)
• Relation Matters: Foreground-aware Graph-based Relational Reasoning for Domain Adaptive Object Detection [81.07378219410182]
  We propose a new and general framework for DomainD, named Foreground-aware Graph-based Reasoning (FGRR) FGRR incorporates graph structures into the detection pipeline to explicitly model the intra- and inter-domain foreground object relations. Empirical results demonstrate that the proposed FGRR exceeds the state-of-the-art on four DomainD benchmarks.
  arXiv  Detail & Related papers  (2022-06-06T05:12:48Z)

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.