The author addresses the potential benefits of immutability and laziness in a note on cover trees[0]. Last time I checked, this is still the world's fastest NN algorithm.
Haskell could shine in numerical computing. I think the key is polymorphism: a vector is a matrix is a tensor is a number, and they can all be multiplied in the same way, once you define what multiply is.
Poor support is more about the lack of haskell coders doing ML. It's hard to compete without the numbers that other platforms enjoy.
Haskell could shine in numerical computing. I think the key is polymorphism: a vector is a matrix is a tensor is a number, and they can all be multiplied in the same way, once you define what multiply is.
Poor support is more about the lack of haskell coders doing ML. It's hard to compete without the numbers that other platforms enjoy.
[0] https://izbicki.me/blog/fast-nearest-neighbor-queries-in-has...