arXiv:2309.12711
The Mathematical Game
원문 초록
Monte Carlo Tree Search can be used for automated theorem proving. Holophrasm is a neural theorem prover using MCTS combined with neural networks for the policy and the evaluation. In this paper we propose to improve the performance of the Holophrasm theorem prover using other game tree search algorithms.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
CriticLean: Critic-Guided Reinforcement Learning for Mathematical Formalization
Safe: Enhancing Mathematical Reasoning in Large Language Models via Retrospective Step-aware Formal Verification
LeanExplore: A search engine for Lean 4 declarations
Autoformalization in the Era of Large Language Models: A Survey
DeepTheorem: Advancing LLM Reasoning for Theorem Proving Through Natural Language and Reinforcement Learning
Enumerate-Conjecture-Prove: Formally Solving Answer-Construction Problems in Math Competitions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.