Qwen2.5-1M
Collection
The long-context version of Qwen2.5, supporting 1M-token context lengths
•
2 items
•
Updated
•
72
nicolo
nicolollo
AI & ML interests
None yet
Recent Activity
upvoted
a
collection
about 17 hours ago
Qwen2.5-1M
upvoted
a
collection
about 17 hours ago
Qwen2.5-VL
updated
a model
1 day ago
nicolollo/test1-Q4_K_M-GGUF
Organizations
nicolollo's activity
upvoted
2
collections
about 17 hours ago
updated
a
model
1 day ago
published
a
model
1 day ago
updated
a
model
1 day ago
published
a
model
1 day ago
liked
a
model
9 days ago
upvoted
a
collection
16 days ago
reacted to
merve's
post with ❤️🚀🔥
25 days ago
Post
4828
supercharge your LLM apps with smolagents 🔥
however cool your LLM is, without being agentic it can only go so far
enter smolagents: a new agent library by Hugging Face to make the LLM write code, do analysis and automate boring stuff!
Here's our blog for you to get started https://huggingface.co/blog/smolagents
however cool your LLM is, without being agentic it can only go so far
enter smolagents: a new agent library by Hugging Face to make the LLM write code, do analysis and automate boring stuff!
Here's our blog for you to get started https://huggingface.co/blog/smolagents
liked
a
model
25 days ago
liked
3
models
30 days ago
updated
2
models
30 days ago
liked
a
model
about 1 month ago
liked
a
dataset
about 1 month ago
reacted to
lewtun's
post with 👍
about 1 month ago
Post
6789
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