You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Related
Experiments have shown kmeans clustering to be rather slow. The main issue is the calcualtion of the distance matrix, which is currently done via dimension expansion and 3D Difference calculation. However, we suspect this to cause cache misses, and substantial overhead to the caculation, thus slowing it down
Feature functionality
Torch offers a cdist(X,Y) function to calculate pairwise distances between all samples (rows) from two vectors. There is also some alternative approaches being discussed.
Related
Experiments have shown kmeans clustering to be rather slow. The main issue is the calcualtion of the distance matrix, which is currently done via dimension expansion and 3D Difference calculation. However, we suspect this to cause cache misses, and substantial overhead to the caculation, thus slowing it down
Feature functionality
Torch offers a cdist(X,Y) function to calculate pairwise distances between all samples (rows) from two vectors. There is also some alternative approaches being discussed.
Additional context
pytorch/pytorch#15253
https://discuss.pytorch.org/t/efficient-distance-matrix-computation/9065
The text was updated successfully, but these errors were encountered: