Initial performance tests should be done to get an idea whether currest containers are fast enough. Probably a fast (mutable) container should be developed with basic linear algebra operations on it.

[s1m0000n]

Is your feature request related to a problem? Please describe. I think Haskell's lists are not the most performant solution. I guess there could be speed / memory consumption issues when training & inferencing on reasonable to life-usage datasets.

Describe the solution you'd like

• Performance testing of current solution
• Consider https://wiki.haskell.org/Performance/Arrays, https://livebook.manning.com/book/get-programming-with-haskell/chapter-42/85
• Consider https://stackoverflow.com/questions/5707250/optimizing-numerical-array-performance-in-haskell
• Implement fast linear algebra etc. primitives?

[vsha96]

I'm glad you noticed this. I've been thinking about it from the very beginning, but my tests were primitive (I used TimeIt).

For further performance testing, we should use criterion.