A vector search function can return plausible document IDs while still being wrong: a chunk offset is missing, scores are sorted along the wrong axis, or a CPU fallback hides a broken GPU environment. Before connecting search to an application, give it a fixture with answers you can check.
We will use Python and PyTorch to find five cosine neighbors for each query, stream the corpus through a rented GPU in blocks, and validate the answers against a separate CPU calculation. The complete example creates its own numerical data, so there is no model download, external dataset, or service credential to reproduce.
I work on CloudGPU.
1. Define a small, checkable retrieval task
The fixture contains 8,192 vectors, each with 128 components. We normalize every vector to unit length. For normalized vectors, cosine similarity is their dot product; larger values mean a closer direction.
The 32 queries are copies of known corpus rows. Their nearest neighbor should therefore be the copied row itself.…