Comment Comment by jmpeax > They typically need to compare many or all points to each other, leading to O(N²) complexity.UMAP is not O(n^2) it is O(n log n). parent jmpeax 10 months ago
UMAP is not O(n^2) it is O(n log n).