Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2509.25454
Cited By
v1
v2
v3 (latest)
DeepSearch: Overcome the Bottleneck of Reinforcement Learning with Verifiable Rewards via Monte Carlo Tree Search
29 September 2025
Fang Wu
Weihao Xuan
Heli Qi
Ximing Lu
Aaron Tu
Li Erran Li
Yejin Choi
OOD
LRM
Re-assign community
ArXiv (abs)
PDF
HTML
HuggingFace (115 upvotes)
Github (16★)
Papers citing
"DeepSearch: Overcome the Bottleneck of Reinforcement Learning with Verifiable Rewards via Monte Carlo Tree Search"
0 / 0 papers shown
No papers found
