
How do you organize billions of numerical representations of images and text? We explore e-means, a faster approach to k-means clustering from Meta and academic collaborators. Small batches and moving averages let cluster centers adapt smoothly, while a revival mechanism gives unused groups another chance.
In the researchers’ tests, this recipe reached lower clustering error with far fewer passes through the data, scaling to a ten-billion-vector benchmark. It is a story about improving a familiar algorithm—and making the hidden work behind search, compression and data organization more efficient.
Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
Fler avsnitt från "Intellectually Curious"



Missa inte ett avsnitt av “Intellectually Curious” och prenumerera på det i GetPodcast-appen.








