Lewis Tunstall
@lewtun.bsky.social
🤗 LLM whisperer @huggingface
📖 Co-author of "NLP with Transformers" book
💥 Ex-particle physicist
🤘 Occasional guitarist
🇦🇺 in 🇨🇭
📖 Co-author of "NLP with Transformers" book
💥 Ex-particle physicist
🤘 Occasional guitarist
🇦🇺 in 🇨🇭
We outperform Llama 70B with Llama 3B on hard math by scaling test-time compute 🔥
How? By combining step-wise reward models with tree search algorithms :)
We're open sourcing the full recipe and sharing a detailed blog post 👇
How? By combining step-wise reward models with tree search algorithms :)
We're open sourcing the full recipe and sharing a detailed blog post 👇
December 16, 2024 at 5:08 PM
We outperform Llama 70B with Llama 3B on hard math by scaling test-time compute 🔥
How? By combining step-wise reward models with tree search algorithms :)
We're open sourcing the full recipe and sharing a detailed blog post 👇
How? By combining step-wise reward models with tree search algorithms :)
We're open sourcing the full recipe and sharing a detailed blog post 👇
Hey ML peeps, we found a nice extension to beam search at Hugging Face that is far more scalable and produces more diverse candidates
The basic idea is to split your N beams into N/M subtrees and then run greedy node selection in parallel
Does anyone know what this algorithm is called?
December 12, 2024 at 10:15 AM
Hey ML peeps, we found a nice extension to beam search at Hugging Face that is far more scalable and produces more diverse candidates
The basic idea is to split your N beams into N/M subtrees and then run greedy node selection in parallel
Does anyone know what this algorithm is called?