currently we compute d_i = euclidean_distance(w_i, centre) for some weight w_i in the kernel and then ask all d_i == d_j to share the same weight. We could enforce a tolerance instead such that d_i - d_j < tolerance which could avoid machine precision effects for ==.
currently we compute
d_i = euclidean_distance(w_i, centre)
for some weightw_i
in the kernel and then ask alld_i == d_j
to share the same weight. We could enforce a tolerance instead such thatd_i - d_j < tolerance
which could avoid machine precision effects for==
.