TCCD: Tree-Guided Continuous Causal Discovery via Collaborative MCTS-Parameter Optimization

Abstract

Learning causal relationships in directed acyclic graphs (DAGs) from multi-type event sequences is a challenging task, especially in large-scale telecommunication networks. Existing methods struggle with the exponentially growing search space and lack global exploration. Gradient-based approaches are limited by their reliance on local information and often fail to generalize. To address these issues, we propose TCCD, a framework that combines Monte Carlo Tree Search (MCTS) with continuous gradient optimization. TCCD balances global exploration and local optimization, overcoming the shortcomings of purely gradient-based methods and enhancing generalization. By unifying various causal structure learning approaches, TCCD offers a scalable and efficient solution for causal inference in complex networks. Extensive experiments validate its superior performance on both synthetic and real-world datasets. Code and Appendix are available at https://github.com/jzephyrl/TCCD.

Cite

Text

Liu et al. "TCCD: Tree-Guided Continuous Causal Discovery via Collaborative MCTS-Parameter Optimization." International Joint Conference on Artificial Intelligence, 2025. doi:10.24963/IJCAI.2025/1030

Markdown

[Liu et al. "TCCD: Tree-Guided Continuous Causal Discovery via Collaborative MCTS-Parameter Optimization." International Joint Conference on Artificial Intelligence, 2025.](https://mlanthology.org/ijcai/2025/liu2025ijcai-tccd/) doi:10.24963/IJCAI.2025/1030

BibTeX

@inproceedings{liu2025ijcai-tccd,
  title     = {{TCCD: Tree-Guided Continuous Causal Discovery via Collaborative MCTS-Parameter Optimization}},
  author    = {Liu, Jingjin and Xiao, Yingkai and Zhuo, Hankz Hankui and Wen, Wushao},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2025},
  pages     = {9268-9276},
  doi       = {10.24963/IJCAI.2025/1030},
  url       = {https://mlanthology.org/ijcai/2025/liu2025ijcai-tccd/}
}