Universal Assisted Generation: Faster Decoding with Any Assistant Model
•
51
Lewis Tunstall PRO
lewtun
AI & ML interests
LLMs, LLMs, LLMs
Recent Activity
liked
a Space
4 days ago
data-agents/jupyter-agent
liked
a model
5 days ago
answerdotai/ModernBERT-large
Articles
Organizations
lewtun's activity
liked
a
Space
4 days ago
upvoted
a
paper
5 days ago
liked
2
models
5 days ago
upvoted
a
collection
5 days ago
liked
a
dataset
6 days ago
liked
a
Space
9 days ago
posted
an
update
9 days ago
Post
6430
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 show that smol models can match or exceed the performance of their much larger siblings when given enough "time to think"
We're open sourcing the full recipe and sharing a detailed blog post.
In our blog post we cover:
📈 Compute-optimal scaling: How we implemented DeepMind's recipe to boost the mathematical capabilities of open models at test-time.
🎄 Diverse Verifier Tree Search (DVTS): An unpublished extension we developed to the verifier-guided tree search technique. This simple yet effective method improves diversity and delivers better performance, particularly at large test-time compute budgets.
🧭 Search and Learn: A lightweight toolkit for implementing search strategies with LLMs and built for speed with vLLM
Here's the links:
- Blog post: HuggingFaceH4/blogpost-scaling-test-time-compute
- Code: https://github.com/huggingface/search-and-learn
Enjoy!
How? By combining step-wise reward models with tree search algorithms :)
We show that smol models can match or exceed the performance of their much larger siblings when given enough "time to think"
We're open sourcing the full recipe and sharing a detailed blog post.
In our blog post we cover:
📈 Compute-optimal scaling: How we implemented DeepMind's recipe to boost the mathematical capabilities of open models at test-time.
🎄 Diverse Verifier Tree Search (DVTS): An unpublished extension we developed to the verifier-guided tree search technique. This simple yet effective method improves diversity and delivers better performance, particularly at large test-time compute budgets.
🧭 Search and Learn: A lightweight toolkit for implementing search strategies with LLMs and built for speed with vLLM
Here's the links:
- Blog post: HuggingFaceH4/blogpost-scaling-test-time-compute
- Code: https://github.com/huggingface/search-and-learn
Enjoy!
- 2 replies
Use HF papers
1
#2 opened 9 days ago
by
qgallouedec
Update app/src/index.html
1
#1 opened 9 days ago
by
qgallouedec
updated
a
Space
9 days ago
updated
a
dataset
9 days ago
upvoted
a
paper
9 days ago