Currently, we construct a new function-space hash function along the lines of
hashfn = MonteCarloHash(ℓ2, μ, args...; kws...)
This isn't very intuitive; it would make more sense to use L2 instead of ℓ2 since the former is a distance on a function space and the latter works over discrete vectors. ChebHash and MonteCarloHash should be modified so that they accept the function-space similarity that they are using rather than the corresponding discrete-space similarity.
Currently, we construct a new function-space hash function along the lines of
This isn't very intuitive; it would make more sense to use
L2instead ofℓ2since the former is a distance on a function space and the latter works over discrete vectors.ChebHashandMonteCarloHashshould be modified so that they accept the function-space similarity that they are using rather than the corresponding discrete-space similarity.