Pg_vectorsearch: An index that is faster than pgvector's IVFFlat and HNSW
Article URL: https://github.com/timescale/pg_vectorsearch Comments URL: https://news.ycombinator.com/item?id=50086165 Points: 102 # Comments: 33
Hacker News5 min read
hnsw
4 stories
Sliced Wasserstein embeddings + HNSW for color-scheme search over 48k paintings [P]
Palette Atlas (https://itzik123.github.io/PaletteAtlas/) searches public-domain paintings by color scheme. Each image is reduced to 128 colors of equal weight, so the natural distance is the Earth Mover's Distance, which is too slow for nearest-neighbor search over 48,695 items (about 6 ms per…
Reddit - r/ML2 min read
GPU-Accelerated HNSW Indexing
GPU-Accelerated HNSW Indexing in Qdrant Time: 45 min Level: Intermediate Output: GitHub Since Qdrant v1.13, Qdrant has supported GPU-accelerated Hierarchical Navigable Small World (HNSW) indexing on self-hosted instances.
Qdrant12 min read
Filtered Vector Search: What ACORN Fixes, and What Fixes ACORN
Filtered vector search breaks when metadata filters turn a healthy nearest-neighbor graph into scattered islands. HNSW’s m parameter controls how many links each point gets. At Qdrant’s default m=16, the one-million-point collection benchmarked below averaged about 21 links per node on layer 0.
Qdrant10 min read
Showing 4 of 4 stories
You're all caught up.
AiByts Weekly Brief
Get the top AI news and tools straight to your inbox every week.
Weekly · AI news
Join 15,000+ AI enthusiasts