0 views collected around this technical thread.
This article explains the challenges of large‑scale vector retrieval, compares Faiss index types such as brute‑force, graph‑based and product quantization, and details how product quantization works, its memory‑speed trade‑offs, hierarchical quantization, and practical hyper‑parameter tuning.
The article reviews how high‑dimensional vector representations in deep‑learning applications require efficient approximate nearest‑neighbor search, comparing K‑d trees, hierarchical k‑means trees, locality‑sensitive hashing, product quantization, and HNSW graphs, and discusses practical FAISS implementations and how algorithm choice depends on data size, recall, latency, and resources.
This article presents JD's end‑to‑end semantic search recall pipeline, covering multi‑stage recall, a dual‑tower embedding model with multi‑head attention, a heterogeneous graph neural network (SearchGCN), a transformer‑based synonym generation system, and a joint index‑training approach that integrates product quantization to improve recall accuracy and efficiency.
The talk presents JD's end‑to‑end semantic search recall pipeline, covering multi‑stage retrieval, a dual‑tower embedding model with multi‑head attention, a heterogeneous graph neural network for low‑frequency items, automatic synonym generation via transformer models, and a joint training approach that integrates product quantization directly into the model to improve accuracy and efficiency.
This article introduces the concept of vector retrieval, outlines its diverse application scenarios, explains common distance metrics for both floating‑point and binary vectors, and surveys fundamental approximate nearest‑neighbor algorithms including tree‑based, graph‑based, quantization, and hashing methods.
This article explains how deep learning transforms unstructured data into dense vectors, defines vector retrieval, outlines its many use cases such as product, video, and text search, discusses challenges in learning effective embeddings, and reviews high‑performance algorithms like LSH, neighbor graphs, and product quantization.