The Tile Encoder - Exploring ANN algorithms Part 2.2

In this blog post, an alternative encoding technique called Tile encoder is presented as a distribution-based encoder for compressing vectors in memory. Unlike KMeans, which requires fitting data to centroids and calculating distances to all centroids, the Tile encoder leverages the known underlying distribution of the data beforehand. Results show that recall results are very similar when using KMeans vs Tile encoder, with significant improvements in fitting and encoding times for the latter. The Tile encoder also allows for quick compressing without downtime, making it a promising alternative to KMeans for vector compression tasks.