Tiesunlong Shen
2026
Prompt-R1: Collaborative Automatic Prompting Framework via End-to-end Reinforcement Learning
Wenjin Liu | Haoran Luo | Xueyuan Lin | Haoming Liu | Tiesunlong Shen | Jiapu Wang | Rui Mao | Erik Cambria
Findings of the Association for Computational Linguistics: ACL 2026
Wenjin Liu | Haoran Luo | Xueyuan Lin | Haoming Liu | Tiesunlong Shen | Jiapu Wang | Rui Mao | Erik Cambria
Findings of the Association for Computational Linguistics: ACL 2026
Recently, various excellent and powerful large language models (LLMs) have been utilized to solve a wide range of human problems. However, when faced with complex problems, most users are often unable to provide accurate and effective prompts to interact with LLMs, thus limiting their performance. To address this challenge, we propose Prompt-R1, an end-to-end reinforcement learning framework that utilizes a small-scale LLM (as agent) to collaborate with large-scale LLMs (as environment), replacing users to interact better. This collaboration is presented as a multi-turn interaction, where the small-scale LLM thinks and generates prompts, and the large-scale LLM performs complex reasoning. A double-constrained reward is designed to optimize correctness and quality of generation. Prompt-R1 provides a plug-and-play framework that supports both inference and training with various large-scale LLMs. Experimental results on twelve datasets show that Prompt-R1 significantly outperforms baseline LLMs across various tasks.Our code is available at https://github.com/QwenQKing/Prompt-R1.
2025
Reasoning with Trees: Faithful Question Answering over Knowledge Graph
Tiesunlong Shen | Jin Wang | Xuejie Zhang | Erik Cambria
Proceedings of the 31st International Conference on Computational Linguistics
Tiesunlong Shen | Jin Wang | Xuejie Zhang | Erik Cambria
Proceedings of the 31st International Conference on Computational Linguistics
Recent advancements in large language models (LLMs) have shown remarkable progress in reasoning capabilities, yet they still face challenges in complex, multi-step reasoning tasks. This study introduces Reasoning with Trees (RwT), a novel framework that synergistically integrates LLMs with knowledge graphs (KGs) to enhance reasoning performance and interpretability. RwT reformulates knowledge graph question answering (KGQA) as a discrete decision-making problem, leveraging Monte Carlo Tree Search (MCTS) to iteratively refine reasoning paths. This approach mirrors human-like reasoning by dynamically integrating the LLM’s internal knowledge with external KG information. We propose a real-data guided iteration technique to train an evaluation model that assesses action values, improving the efficiency of the MCTS process. Experimental results on two benchmark KGQA datasets demonstrate that RwT significantly outperforms existing state-of-the-art methods, with an average performance improvement of 9.81%. Notably, RwT achieves these improvements without requiring complete retraining of the LLM, offering a more efficient and adaptable approach to enhancing LLM reasoning capabilities.