arXiv:2504.07921math.STcs.AI2025-04被引 2
提出在含环的聚类图中识别总效应的新方法
Note on the identification of total effect in Cluster-DAGs with cycles
- 限定每个聚类最多四个节点，简化复杂结构
- 引入改进的d-分离概念，解决环状依赖问题
- 适合因果推断与结构学习研究者参考
本文研究允许聚类图内部存在环路但整体无环的簇-有向无环图（cluster-DAG）中总效应的可识别性问题。提出两个关键结果：其一，将聚类规模限制在每簇最多四个节点；其二，对d-分离概念进行适应性调整。基于此，构建了一个新的图形判别准则，用于判断总效应是否可识别。
原文摘要 · Abstract (English)
In this note, we discuss the identifiability of a total effect in cluster-DAGs, allowing for cycles within the cluster-DAG (while still assuming the associated underlying DAG to be acyclic). This is presented into two key results: first, restricting the cluster-DAG to clusters containing at most four nodes; second, adapting the notion of d-separation. We provide a graphical criterion to address the identifiability problem.
因果推断图模型可识别性
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。