Prompt-Based Monte Carlo Tree Search for Mitigating Hallucinations in Large Models

Zhihua Duan, Jialin Wang
1/17/2025
cs.AI

No confident code implementation found for this paper.

Abstract

With the rapid development of large models in the field of artificial intelligence, how to enhance their application capabilities in handling complex problems in the field of scientific research remains a challenging problem to be solved. This study proposes an improved Monte Carlo Tree Search (MCTS) method based on prompt words. In the simulation search stage, it introduces dynamic adjustment of exploration parameters and adaptive selection strategies, which can better balance exploration and exploitation, thereby reducing the hallucination phenomenon. This paper takes the four subsets of the SciEval dataset as the test objects, and compares the Glm-4-flash+Improved MCTS method with the methods of several existing models. The results show that the Improved MCTS method performs better, providing new ideas and methods for the application of large models in the field of scientific research.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{duan2025promptbased,
  title  = {Prompt-Based Monte Carlo Tree Search for Mitigating Hallucinations in Large Models},
  author = {Zhihua Duan and Jialin Wang},
  year   = {2025},
  eprint = {2501.13942},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.13942v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.13942.svg)](https://codeofpaper.com/paper/2501.13942)

Discussion