AI Memory Breakthrough?
45sThe claim of 4-6x less memory and 8x speedup is shocking and immediately hooks viewers interested in AI.
▶ Play ClipGoogle's new TurboQuant technique promises to dramatically reduce memory and computation costs for AI systems by compressing the KV cache using a combination of quantization and random rotation. This video analyzes the claims, examines independent reproductions, and discusses the controversy surrounding the paper.
Google announced TurboQuant, claiming 4-6x less memory and 8x faster computation for the attention part of neural networks, with no meaningful loss in quality.
It compresses the KV cache (short-term memory) of AI systems like LLMs by quantizing the numerical representations.
Before quantizing (chopping off digits), the data is rotated randomly so that information loss is spread evenly, preserving more information. This is based on the Johnson-Lindenstrauss transform.
Quantization, random rotation, and the JL transform are all decades-old techniques. The innovation is their smart combination.
Other scientists reproduced the technique and benchmarked it. Results show 30-40% reduction in KV cache memory and 40% speedup in prompt processing.
The claimed 4-6x memory reduction is idealized; real-world gains are more modest (30-40%). Still, it's a significant improvement for long-context AI tasks.
Some researchers note overlaps with prior techniques and feel concerns were not fully addressed. The paper was accepted but not all agree.
TurboQuant is a promising technique that combines old ideas to achieve meaningful memory and speed improvements for AI, though media claims are exaggerated. Independent benchmarks confirm its value, especially for long-context applications.
"Title is hyperbolic but the technique is genuinely impressive, though not as mind-breaking as claimed."
What does TurboQuant compress in AI systems?
The KV cache (short-term memory) of large language models.
01:22
What is the Johnson-Lindenstrauss transform used for in TurboQuant?
To randomly rotate data before quantization, preserving distances and reducing information loss.
03:34
According to independent benchmarks, how much does TurboQuant reduce KV cache memory?
30-40%.
04:59
How much does TurboQuant speed up prompt processing?
About 40%.
05:32
What is the main controversy surrounding the TurboQuant paper?
Some researchers claim it overlaps with prior techniques and that concerns were not fully addressed.
07:27
Random Rotation Before Quantization
Explains a counterintuitive but effective technique to preserve information when rounding numbers.
02:06Old Ideas Combined
Highlights that innovation often comes from combining existing methods, not inventing new ones.
04:04Simultaneous Memory Reduction and Speedup
Rare to achieve both improvements without tradeoffs; this is a significant result.
05:32Media Hype vs Reality
Important reminder to temper exaggerated claims and rely on independent benchmarks.
06:04[00:00] Google made a huge announcement about their new method that lets us run AI techniques cheaper. The news took the world by storm. This came at the best possible time, because we have a worldwide memory shortage. So the prices for capable
[00:16] laptops and GPUs and anything that can run these AI systems is up by…insane amounts. And this work would make them much cheaper to run. They call it TurboQuant.
[00:29] Roughly speaking, they claim 4 to 6 times less memory, that is insane. And 8 times faster computation for a part of the neural network called attention.
[00:41] No meaningful loss in output quality. And it works on top of existing models as is. If true, that is a total game changer. The news was so huge it even moved the
[00:56] stock price of huge semiconductor companies. Because of that, I did not want to publish an early video on the huge sensation. No. I really wanted to wait a bit, and find out whether it actually works in practice. I’ll tell you
[01:10] about that. And I’ll also tell you that not everyone is happy about it. So, three questions. What does it do? Does it work? What is the controversy about?
[01:22] Dear Fellow Scholars, this is Two Minute Papers with Dr. Károly Zsolnai-Fehér. It feels so good to do it like this. Well, this compresses the KV cache of AI systems,
[01:35] like large language models. This is the short-term memory of an AI assistant. If you would look into that, you would see tons and tons of numbers. These numbers relate to what you are currently talking about. Movies, a bunch of documents or a huge codebase.
[01:51] Now, personally, I am a research scientist, what caught my eye was not the media hype, but this. Oh! A formal mathematical proof that it works. Now we’re talking. Okay, one, so what does this do?
[02:06] And these numbers have lots of digits. Scientists propose that we chop off the end of the numbers to save memory. Is that a new idea? No. Is that a good idea? No, unless you are very
[02:21] careful. Because you can lose a lot of information and your neural network might output nonsense. So, how do you do that? Well, imagine a vector, this is like an arrow pointing somewhere.
[02:35] Sometimes that arrow points mostly along one axis. So most of its "energy" is in one direction, and a little in other directions. When you chop that information off,
[02:49] it snaps on to the grid, you basically lose everything except that one direction. That is not useful. Now here’s a brilliant idea: before chopping it off, rotate the arrow in
[03:02] a random direction. Now the energy spreads more evenly across all directions. So when you round off parts of it, you lose a little from everywhere instead of everything from most places.
[03:16] The result? Much less information lost. Is this idea new? No. This is a very old idea. Johnson–Lindenstrauss Transform to compress the data. What is that?
[03:34] Remember, we have a bunch of numbers, representing arrow directions. And we want fewer numbers to describe these directions. But very carefully. You do this in a way that guarantees that the distances between these arrows is roughly
[03:51] the same after squishing. If you want to sound really cool, just call it the JL transform. Is that new? Not really. 40-year old technique. And I think that is the
[04:04] key. Everyone loves to invent shiny new stuff. But here, quantization is not new, rotating things around is not new. This transform is not new. These are three
[04:19] age old ideas combined together to great effect. Sometimes you don’t need to invent grand new theories. Sometimes you need a smart combination of existing methods.
[04:31] I wanted to see other scientists reproduce the technique and benchmark it for themselves. This is why this video appears later than most others, but I think it makes it more truthful.
[04:47] So were other scientists able to reproduce this technique? Yes. Did they also benchmark it? Yes. Does this technique help? Yes.
[04:59] But, not so fast! The first tests reveal that it decreased the memory cost of the KV cache, short term memory by 30-40%. That is fantastic. I would have been very happy with this. But it
[05:16] doesn’t end there. Typically you have a tradeoff where you decrease memory usage at the cost of something. So something needs to slow down. Now hold on to your papers Fellow Scholars,
[05:32] because it also sped up processing the prompts by about 40% as well. What? That is…my brain crashed. We get faster AI assistants that need less memory at
[05:47] almost zero cost. That is insane. In a world where it’s harder and harder to own things, this is a blessing. Thank you so much! It is also remarkable that the paper has barely been out for a week and some of
[06:04] you Fellow Scholars already coded it up. Nice work. Link is in the description. So, it’s not quite like the media says. Based on the results, we cannot conclude
[06:16] that every AI machine suddenly needs 6 times less ram. No. That is a bit idealistic and only true for some corner cases. You know when you see an official benchmark of a phone
[06:29] battery or electric car mileage with somewhat idealized conditions? It is a bit like that. So careful with the media hype. Experienced Fellow Scholars like you know that in your mind,
[06:43] you have to tone these numbers down a little. This is why we wait for more data and analyze experiments here, to get the highest quality information for you. But it’s still good. Really good! It helps most people who run AI
[06:59] systems with very long contexts. When you chuck in a huge pdf document, or a movie, or a huge codebase for an AI to analyze. Yes, you will be able to do that cheaper, with
[07:12] meaningfully less memory. Often a few gigabytes less. And I think that is absolutely amazing news. Third, I will note that other researchers point out that the paper overlaps with previous
[07:27] techniques. They felt that it has similarities that should be discussed more thoroughly. There was more. Eventually, the paper was accepted for publication, though not all researchers agree the concerns were fully addressed. I put the links to all of these in the video description.
[07:43] But this proves that even in modern AI, there are still basic things we haven’t invented yet. And that makes this a very exciting area to be in. What a time to be alive!
[07:56] please consider subscribing and hitting the bell icon.
⚡ Saved you 0h 08m reading this? Transcribe any YouTube video for free — no signup needed.