2 11

Sinan Robillard PRO

Ashoka74

Ashoka74

AI & ML interests

None yet

Recent Activity

updated a Space 1 day ago

Ashoka74/RefurnishAI

reacted to lewtun's post with 🔥 7 days ago

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: https://huggingface.co/spaces/HuggingFaceH4/blogpost-scaling-test-time-compute - Code: https://github.com/huggingface/search-and-learn Enjoy!

liked a Space 7 days ago

webml-community/moonshine-web

View all activity

Organizations

Ashoka74's activity

updated a Space 1 day ago

Sleeping

👁

RefurnishAI

Replace furnitures & background

reacted to lewtun's post with 🔥 7 days ago

Post

6442

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!