LLM Verified with Monte Carlo Tree Search
LLM Verified with Monte Carlo Tree Search
This is a weekend hack that I'd like to further develop as it's working surprisingly well. Using MCTS, we can explore a space of possible verified programs with an LLM. We check the partial programs at each step, and so steer towards programs that pass the verifier. https://github.com/namin/llm-verified-with-monte-carlo-tree-...
Share cardActual performance
Launch Intel predictions
Analyze your own launch →Incorrect prediction on native model
Similar products
Exploring the tree of LLM generations [video]
Angular 2 AoT Compilation and Tree Shaking Example
Implementation of a 3-pointer AVL Tree
Visualizing Binary Tree
Ldd as a Tree and Much More
Toy LISP compiler in C# (LINQ) expression tree
Tree Dangler
I ported Tree-sitter to Go
KD-tree recommender system in Literate Coffeescript
Emetgate – a verification gate between an LLM and your source tree