▲Surpassing vLLM with a Generated Inference Stack(infinity.inc)
42 points by lukebechtel 19 hours ago | 7 comments
▲hoerzu 9 minutes ago
What's the jitter what's the std? What about 1:1 output equality?

What's the post request latency of this part? What the ftt?

▲ntonozzi 16 hours ago
Why do they need to run benchmarks to confirm performance? Can't they run an example prompt and verify they get the exact same output token probabilities for all prompts? The fact that they are not doing this makes me suspicious that they are in fact not doing the exact same thing as vLLM.

It is also a bit weird that they are not incorporating speculative decoding, that seems like a critical performance optimization, especially for decode heavy workloads.

▲lukebechtel 15 hours ago
Yes, speculative decoding will make both us and VLLM faster, but we believe it would be a relatively even bump on both sides, so we didn't include it in this comparison. Worth another test!
▲jeeeb 1 hour ago
> It is also a bit weird that they are not incorporating speculative decoding

Wouldn’t speculative decoding decrease overall throughput, but optimise (perceived) responsiveness?

▲YetAnotherNick 1 hour ago
For compute bound region(high batch size) yes, but for low batch size it could improve the throughput.
▲2001zhaozhao 4 hours ago
Every example like this makes it obvious that you can now use ML-like optimization approaches on well-specified, very-well-tested software problems with a clear optimization goal. Keep if it improves the objective while maintaining correctness, discard if it doesn't. AI-descent strikes again.

Maybe I should learn more about ML to have a better instinct on optimization methods in general, so I can actually build AI optimizers like these.

▲storus 13 hours ago
Does it support paged attention like vLLM though? Without that they will run into memory fragmentation quickly.
▲lukebechtel 13 hours ago
Yes, great question!

The system started without paged attention, and recreated its own paged attention implementation automatically once it realized it was a bottleneck.

Pretty cool!

▲ 2 hours ago
▲rfw300 15 hours ago
OK... we need way more information than this to validate this claim! I can run Qwen-8B at 1 billion tokens per second if you don't check the model's output quality. No information is given about the source code, correctness, batching, benchmark results, quantization, etc. etc. etc.
▲lukebechtel 15 hours ago
We validate with MMLU and Hellaswag presently, and are getting this independently verified by a 3rd party.

We have considered open-sourcing some of our optimized inference libraries in the future, but have not yet come to a decision on this.

Also if you need a rough intuition as to why this is possible: it's because this entire inference stack was built for exactly one model, and thus we can really tune the entire framework accordingly.

▲rfw300 10 hours ago
I've no problem with the intuition. But I would hope for a lot more focus in the marketing materials on proving the (statistical) correctness of the implementation. 15% better inference speed is not worth it to use a completely unknown inference engine not tested across a wide range of generation scenarios.
▲lukebechtel 7 hours ago
This is a fair critique! We plan to use our system to generate many more inference libraries of this nature, and I'll make it a point to release better, broader correctness measures when we do so.
▲acuozzo 14 hours ago
Luke: Do you have benchmarks for BF16?
▲lukebechtel 14 hours ago
Unfortunately, not at present; we went for FP8 because we believed it was generally the best tradeoff of quality and speed. Allowed faster iteration as well.

We believe our improvements would hold on BF16, but let me check.

▲cermicelli 10 hours ago
[flagged]