Similarity search on image embeddings is a common practice for image retrieval in machine learning and pattern recognition systems. Approximate Nearest Neighbors (ANN) methods enable scalable similarity search on large datasets, often approaching sub-linear complexity. Yet, little empirical work has examined how ANN neighborhood geometry differs from that of exact k-nearest neighbors (k-NN) search as the neighborhood size increases under constrained search effort. This study quantifies how approximate neighborhood structure changes relative to exact k-NN search as k increases across three experimental conditions. Using multiple random subsets of 10000 images drawn from the STL-10 dataset, we compute ResNet-50 image embeddings, perform an exact
This project uses a dedicated conda environment for reproducibility.
Follow the steps below to install Miniconda, create the environment, and install all dependencies.
Download the installer for your OS:
https://docs.conda.io/en/latest/miniconda.html
Follow the installation instructions, then restart your terminal.
conda create -n drift-exp python=3.10 -y
conda activate drift-exppip install requirements.txt