Lewis Tunstall

Lewis Tunstall

@lewtun.bsky.social

🤗 LLM whisperer @huggingface 📖 Co-author of "NLP with Transformers" book 💥 Ex-particle physicist 🤘 Occasional guitarist 🇦🇺 in 🇨🇭

592 followers2 following13 posts

Carbon is built with a unique tokenizer: we split sequences in chunks of 6 bases, but during both training and inference we can work with single base resolution. The architecture combined with the tokenizer makes the model 275x faster than the previous SoTA (Evo2) at this size.

We hope the Carbon family of models will enable the broader community of computational biology have access to models that can literally run on your laptop. We are working on fine-tuning scripts that can run on small GPUs too and will share them soon!

View full thread

⏳ Automated filtering: We apply Math Verify to only retain problems with at least one correct answer. We also leverage Llama3.3-70B-Instruct as a judge to retrieve more correct examples (e.g for cases with malformed answers that can’t be verified with a rules-based parser)

View full thread

📀512 H100s running locally: Instead of relying on an API, we leverage vLLM and SGLang to run generations locally on our science cluster, generating 180k reasoning traces per day.

What’s new compared to existing reasoning datasets? ♾ Based on NuminaMath 1.5: we focus on math reasoning traces and generate answers for problems in NuminaMath 1.5, an improved version of the popular NuminaMath-CoT dataset.

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 👇

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?

You are up to date.