3 ms·
Are you planning to address scaling with colqwen? The current approach is unindexed, and I’d be surprised if it scales beyond 10k pages or so…
by mbridge 2y ago
Are you planning to address scaling with colqwen? The current approach is unindexed, and I’d be surprised if it scales beyond 10k pages or so…
- ArnavAgrawal03 2y agoFor similarity score computation, we employ a hamming distance approximation instead - meaning we can store the individual vectors as just bit-arrays. The search, therefore, has proven to be really scalable in our experience. We're finding the actual embedding process to be more of a bottleneck, and we're exploring options on how to speed that up. Feel free to clarify in case that didn't answer your question!