Haoran Liu
Author directoryOther people with similar names: Haoran Liu, Haoran Liu
Unverified author pages with similar names: Haoran Liu
2026
From Chains to Graphs: Self-Structured Reasoning for General-Domain LLMs
Yingjian Chen | Haoran Liu | Yinhong Liu | Sherry T. Tong | Aosong Feng | Jinghui Lu | JTzhang | Yusuke Iwasawa | Yutaka Matsuo | Irene Li
Findings of the Association for Computational Linguistics: IJCNLP-AACL 2026
Yingjian Chen | Haoran Liu | Yinhong Liu | Sherry T. Tong | Aosong Feng | Jinghui Lu | JTzhang | Yusuke Iwasawa | Yutaka Matsuo | Irene Li
Findings of the Association for Computational Linguistics: IJCNLP-AACL 2026
Large Language Models (LLMs) have demonstrated strong reasoning ability in open-domain question answering, yet their reasoning is typically expressed through linear textual traces, such as Chain-of-Thought (CoT). While these traces are readable, their sequential form can obscure logical dependencies, making inconsistencies difficult to inspect. Existing graph-based methods introduce structured representations, but they often rely on externally provided graphs, leaving it unclear whether LLMs can autonomously perform graph-structured reasoning. To fill this gap, we explore graph-structured reasoning of LLMs in general-domain question answering. We propose Self-Graph Reasoning (SGR), a framework that enables LLMs to explicitly represent their reasoning process as a structured graph before producing the final answer, improving both consistency and interpretability. We further construct a graph-structured reasoning dataset that merges multiple candidate reasoning graphs into refined graph structures for model training. Experiments on five QA benchmarks across both general and specialized domains show that SGR consistently improves reasoning consistency and provides clearer, more interpretable graph-structured reasoning processes, achieving a 17.74% gain over the base model.
2025
A Survey on LLMs for Story Generation
Maria Teleki | Vedangi Bengali | Xiangjue Dong | Sai Tejas Janjur | Haoran Liu | Tian Liu | Cong Wang | Ting Liu | Yin Zhang | Frank Shipman | James Caverlee
Findings of the Association for Computational Linguistics: EMNLP 2025
Maria Teleki | Vedangi Bengali | Xiangjue Dong | Sai Tejas Janjur | Haoran Liu | Tian Liu | Cong Wang | Ting Liu | Yin Zhang | Frank Shipman | James Caverlee
Findings of the Association for Computational Linguistics: EMNLP 2025
Methods for story generation with Large Language Models (LLMs) have come into the spotlight recently. We create a novel taxonomy of LLMs for story generation consisting of two major paradigms: (i) independent story generation by an LLM, and (ii) author-assistance for story generation – a collaborative approach with LLMs supporting human authors. We compare existing works based on their methodology, datasets, generated story types, evaluation methods, and LLM usage. With a comprehensive survey, we identify potential directions for future work
GraphCheck: Breaking Long-Term Text Barriers with Extracted Knowledge Graph-Powered Fact-Checking
Yingjian Chen | Haoran Liu | Yinhong Liu | Jinxiang Xie | Rui Yang | Han Yuan | Yanran Fu | Peng Yuan Zhou | Qingyu Chen | James Caverlee | Irene Li
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Yingjian Chen | Haoran Liu | Yinhong Liu | Jinxiang Xie | Rui Yang | Han Yuan | Yanran Fu | Peng Yuan Zhou | Qingyu Chen | James Caverlee | Irene Li
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large language models (LLMs) are widely used, but they often generate subtle factual errors, especially in long-form text. These errors are fatal in some specialized domains such as medicine. Existing fact-checking with grounding documents methods face two main challenges: (1) they struggle to understand complex multihop relations in long documents, often overlooking subtle factual errors; (2) most specialized methods rely on pairwise comparisons, requiring multiple model calls, leading to high resource and computational costs. To address these challenges, we propose GraphCheck, a fact-checking framework that uses extracted knowledge graphs to enhance text representation. Graph Neural Networks further process these graphs as a soft prompt, enabling LLMs to incorporate structured knowledge more effectively. Enhanced with graph-based reasoning, GraphCheck captures multihop reasoning chains that are often overlooked by existing methods, enabling precise and efficient fact-checking in a single inference call. Experimental results on seven benchmarks spanning both general and medical domains demonstrate up to a 7.1% overall improvement over baseline models. Notably, GraphCheck outperforms existing specialized fact-checkers and achieves comparable performance with state-of-the-art LLMs, such as DeepSeek-V3 and OpenAI-o1, with significantly fewer parameters.
Search