Would the memory complexity of `umappp` be bounded by the `num_neighbors` in the KNN step? So `O(num_points * num_neighbors)` or would it be more than that? Plan to measure on my own but curious if we can put a number on the theoretical complexity.
Would the memory complexity of
umapppbe bounded by thenum_neighborsin the KNN step?So
O(num_points * num_neighbors)or would it be more than that?Plan to measure on my own but curious if we can put a number on the theoretical complexity.