@inproceedings{liu-etal-2025-montrose,
    title = "{MONTROSE}: {LLM}-driven {M}onte {C}arlo Tree Search Self-Refinement for Cross-Domain Rumor Detection",
    author = "Liu, Shanshan  and
      Lu, Menglong  and
      Huang, Zhen  and
      He, Zejiang  and
      Liu, Liu  and
      Sun, Zhigang  and
      Li, Dongsheng",
    editor = "Che, Wanxiang  and
      Nabende, Joyce  and
      Shutova, Ekaterina  and
      Pilehvar, Mohammad Taher",
    booktitle = "Findings of the Association for Computational Linguistics: ACL 2025",
    month = jul,
    year = "2025",
    address = "Vienna, Austria",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/corrections-2025-08/2025.findings-acl.1106/",
    doi = "10.18653/v1/2025.findings-acl.1106",
    pages = "21475--21487",
    ISBN = "979-8-89176-256-5",
    abstract = "With the emergence of new topics on social media as sources of rumor dissemination, addressing the distribution shifts between source and target domains remains a crucial task in cross-domain rumor detection. Existing feature alignment methods, which aim to reduce the discrepancies between domains, are often susceptible to task interference during training. Additionally, data distribution alignment methods, which rely on existing data to synthesize new training samples, inherently introduce noise. To deal with these challenges, a new cross-domain rumor detection method, MONTROSE, is proposed. It combines LLM-driven Monte Carlo Tree Search (MCTS) data synthesis to generate high-quality synthetic data for the target domain and a domain-sharpness-aware (DSAM) self-refinement approach to train rumor detection models with these synthetic data effectively. Experiments demonstrate the superior performance of MONTROSE in cross-domain rumor detection."
}