正在加载视频...
视频加载失败
We achieved a breakthrough at BTL. AI models are very linear. They think in one direction at a time, and when they're wrong they scramble and start again. For something meant to replace humans, that's way too human. We changed that. We made LLM reasoning and execution work more... show more
173,138 次观看 • 19 天前 •via X (Twitter)
44 条评论

The speed difference is insane. Our new architecture solves each problem in 5ms vs 21s for the actual model (qwen)

Repo: Paper:

We are raising. We’re appreciate any warm intros or anything to sponsor our work

Sounds beautiful and amazing. Is this a solution that applies to a specific model, a model type (eg dense vs MoE), the inference engine or the model encoding - or many among these? Please make it Open Source and Free!!! We're caught captive by the consumer GPU mafia :_(

Done

Can u add mtp on top of it for even speed? I guess this is that qwen 3.5 right ? It will be even faster I guess Also will this be open source? Anyway happy to see such interesting work!’congrats!

Just tried this and it worked perfectly

Ok..when open source,if ever!

Open sourced it. Check the replies

Thank u!

But the inference search architecture would still require a lot of token usage to run the multiple different paths, right?

No. It’s fast and costs less tokens than the normal linear way llms function.

@SKaleworks hey, so what are basically the flaws of this new architecture?

@SKaleworks I’m going to be honest here. We haven’t even explored it a lot. It’s so new that I’m sure there would be flaws, we just haven’t seen one yet. All these experiments was ran on a Mac without gpu so yeah. Open sourcing it to see what the community does with it and more improvements

Tree of Thought right? Old news

Beautiful work

@grok how is this done at transformers level

@Pashmori look bro that's a good step in the right direction

seems like a.. good theory.

So just to understand that, is that "thinking" in CoT or within the "weights"? If so doesn't that have the implication of not CoT monitorability?

Neither, the thinking sits in the explicit search trace

Why are you anon

@grok fast check slop ou pas, ils touchent au CoT ou ca devient un diffusion model?

Im waiting for the 2 bit quant for qwen 🙂

Two paths can disagree while carrying independent information; and can agree because they're degenerate. Ten apparently separate trajectories can secretly occupy essentially the same direction. A branch with low weight can be precisely the direction that preserves future rank.

is this related with space bunny ? i was thinking if it uses a tech like this

Is this related in any way to MultiStream LLMs?

It looks similar to dream rsi

Interesting i'll review your paper

holy shit

This sounds neat. Can't wait to see more!

Jev?

Tradeoffs?

5ms vs 21s is the number that matters

Great idea - seems I even don't need your details: decode can work with a few subsequences at the time and the speed will be almost the same. The prefix is common - not too many extra memory is required. Then just compare and unite the ideas - it is cheap. I should try that!

so.... it's grpo but for inference?

Is this not q*

I read the paper in your repo it was all I needed to verify this is dogshit slop, thanks for wasting my time

Can’t wait to read about the details? Is this basically running 30 prompts in parallel? I really hope theres something deeper going on lmao. This is pretty interesting for coding decisions as well

That super interesting I tried hard on meta-learnig with a novel approach based on the human brain in stealth 🥷 mode, model was able to learn but we are struggle to find metalearning your approach is fascinating 🧐 love to hear more about your breakthrough a link to full paper

Sounds like... sub-agents parallelization but at the weights / inference level (in a loop) CC: @grok your take? Also, is this a "breakthrough" in your view?

Jev works in similar way. Parallel execution.

how is it not subagents?

Super exciting news! Can’t wait to learn more

