MCTS enhancements such as MAST, NST, GRAVE, Score Bounded MCTS, and PN-MCTS can provide extra, knowledge-free data for explaining MCTS decisions, illustrated with examples in the Ludii system.
Combining LLMs with Logic-Based Framework to Explain MCTS
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In response to the lack of trust in Artificial Intelligence (AI) for sequential planning, we design a Computational Tree Logic-guided large language model (LLM)-based natural language explanation framework designed for the Monte Carlo Tree Search (MCTS) algorithm. MCTS is often considered challenging to interpret due to the complexity of its search trees, but our framework is flexible enough to handle a wide range of free-form post-hoc queries and knowledge-based inquiries centered around MCTS and the Markov Decision Process (MDP) of the application domain. By transforming user queries into logic and variable statements, our framework ensures that the evidence obtained from the search tree remains factually consistent with the underlying environmental dynamics and any constraints in the actual stochastic control process. We evaluate the framework rigorously through quantitative assessments, where it demonstrates strong performance in terms of accuracy and factual consistency.
citation-role summary
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements
MCTS enhancements such as MAST, NST, GRAVE, Score Bounded MCTS, and PN-MCTS can provide extra, knowledge-free data for explaining MCTS decisions, illustrated with examples in the Ludii system.