Загрузка видео...

Не удалось загрузить видео

На главную

We distilled clef-flash into a 0.6B model and supporting ANE option. 1,000 support tickets triaged on a M5 pro in 57 s: team, urgency and refund for each, 48 ms per ticket. Within a few points of the 9B on classification. 🤗 💻

32,227 просмотров • 22 дней назад •via X (Twitter)

Комментарии: 17

Фото профиля Jatin Garg
Jatin Garg22 дней назад

@ClementDelangue multi-modal search feels underrated. text-only RAG breaks the moment someone asks about a chart or diagram buried in page 47 of a PDF.

Фото профиля Naman Arora
Naman Arora22 дней назад

Opensource?

Фото профиля Alex
Alex19 дней назад

yes

Фото профиля Naman Arora
Naman Arora19 дней назад

can i dm you man if you allow me ?

Фото профиля Harry
Harry22 дней назад

Fire!

Фото профиля Raul Guillen
Raul Guillen22 дней назад

how does the 0.6B compare on urgent tickets and refund requests separately? overall accuracy can hide the expensive misses in those two labels

Фото профиля Alex
Alex19 дней назад

thats a good point, i will do that as a follow up when d4 is released

Фото профиля Kevin Tabet
Kevin Tabet21 дней назад

If precision is still good that would be a real deal

Фото профиля Josh Jackson | AI agent security
Josh Jackson | AI agent security21 дней назад

The ANE option gets more interesting with a local LLM already using the GPU. Would love to see ticket latency with both running, rather than each benchmarked alone.

Фото профиля gwrefgwerf ewfrewf
gwrefgwerf ewfrewf21 дней назад

Nobody cares about saving 10 dollars bro

Фото профиля Jatin Garg
Jatin Garg22 дней назад

@ClementDelangue 0.6B triaging 1000 tickets in 57s is impressive, but what did accuracy look like compared to the original model? curious where the distillation trade-off landed

Фото профиля Raymond Weitekamp
Raymond Weitekamp21 дней назад

omni next? asking for a friend.

Фото профиля Alex
Alex21 дней назад

unfortunately it doesn't fit on my m5 pro ram

Фото профиля Albert
Albert22 дней назад

Looks promising, any detailed blogpost on particular examples anytime soon?

Фото профиля Alex
Alex22 дней назад

not at the moment but if this post gages enough traction i might do a follow up blog

Фото профиля Albert
Albert22 дней назад

crazy good, follow up blogpost on csv example please, with customers like tickets, let's say, from customer service of ecommerce website and how your model solves it at scale.

Фото профиля Alex
Alex19 дней назад

i will do that when d4 is released

Похожие видео

Big win for local LLM inference! This new inference engine runs LLMs 4x faster than llama.cpp: I ran Qwen3.5 9B on a base M5 MacBook Pro with three engines: - llama.cpp: 22.0 tokens/s - MLX: 25.1 tokens/s - uzu: 92.1 tokens/s The video below shows all three runs side by side. The first two numbers don't mean llama.cpp or MLX are badly built. But both are sitting right under a hard limit of local decoding. When an LLM generates text, every new token needs one full pass through the model, and that pass reads all of the model's weights from memory. A base M5 reads memory at about 153 GB/s. A 4-bit 9B model weighs about 5.2 GB. So at one token per pass, the ceiling is roughly 153 ÷ 5.2 ≈ 29 tokens/s, however fast the GPU computes. uzu gets past that ceiling by producing several tokens per pass instead of one: ↳ A small drafter (DFlash) proposes candidates for the next 16 positions at once. ↳ A tiny adapter (Weaver, 56.7M params) picks among them left to right, so the guesses form coherent text, and keeps a few alternative branches as a tree. ↳ The 9B model checks the whole tree in a single pass and keeps the longest path it agrees with. The main model still decides every token that ends up in the output. GitHub repo: (don't forget to star it 🌟) In my run, each pass of the 9B model produced 7.5 tokens on average. Ordinary decoding produces exactly 1. The weights and kernels are designed around this too. uzu ships its own 4-bit checkpoints, and on M5 chips it runs the verification step on the GPU's int8 matrix path. uzu is an open-source inference engine by Mirai Labs, written in Rust with Metal kernels. It has Swift, Python, TypeScript and Rust bindings, so the same engine runs inside a Mac or iOS app. I shared the GitHub repo above. If you want to dive deeper, my co-founder wrote a detailed breakdown of why local inference is memory-bound and how uzu's speculative decoding gets past it. Read it below.

Avi Chawla

125,660 просмотров • 6 дней назад