Repository navigation
mlxVS 0.9.1
mlxVS 0.9.1: deterministic ties in brute_force_knn.
pip install -U mlxvsbrute_force_knn(and every exact k-NN built on it): when more candidates tie with the k-th score than are
kept, the ones of lowest id are kept. Before, the threads that arrived first decided, so ties (frequent with
float32 distances of data far from the origin) could give different neighbors from run to run. scikit-learn's
check_fit_idempotentcaught it through the sklearn-ann transformer.