Ran Xin
Ran Xin has 2 papers in our library, in 2025, most of them on Reasoning; often with Xia Xiao, Chenguang Xi, Feng Chen.
OpenAlex · ORCID · h-index 13 · 52 works · 1,399 citations OpenAlex, 2026-10-14
📄 2 works in our library · 🔗 Cited 53 times in our library · ⭐ Paper Stars ranking: #9540
Affiliations
🎓Carnegie Mellon UniversityPittsburgh ·
United States2019–2023 · 16 papers🎓Shanghai Maritime UniversityShanghai ·
China2009–2016 · 14 papers🎓Tufts UniversityMedford ·
United States2018–2020 · 5 papers🎓Shanghai Jiao Tong UniversityShanghai ·
China2004–2006 · 2 papers
Fields, topics and concepts
📚 Shelves 3The field of science this work belongs to (OpenAlex fields).Computer Science · 2 worksArtificial Intelligence · 2 worksComputational Theory and Mathematics · 2 works
🧭 Topics 1Research subjects and languages the work is about.Reasoning · 2 works
Works by year
2020s
Papers
- BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem Proving (2025 · 49 citations)
Proof search in Lean4 involves a huge space of possible tactics, so automated provers have mostly relied on MCTS and learned value (critic) models. - Scaling up Multi-Turn Off-Policy RL and Multi-Agent Tree Search for LLM Step-Provers (2025 · 7 citations)
The paper tackles two linked bottlenecks in LLM-based theorem proving for Lean4. In training, reinforcement learning tends to stall after early gains. At inference, the space of possible tactics grows explosively. The authors present BFS-Prover-V2, an open-source step-level prover that treats proving as a Markov…
Co-authors here
Venues
Cited by
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/authors/ran-xin/