| ▲ | Tensor Is the Might(zserge.com) |
| 30 points by eatonphil 3 hours ago | 14 comments |
| |
|
| ▲ | hasteg 18 minutes ago | parent | next [-] |
| I just recently watched some (not all) of this video "coding a machine learning library in c from scratch" and seems like he's going through a similar process in this blog as this video. I would recommend watching the video to get an idea of what the fundamentals of a ML library look like. From someone who has recently been getting interested in actually writing ML code and trying to make sense of it myself (from the perspective of just a typical backend engineer) it was very interesting to see. Previously my experience with ML libs (PyTorch specific) was writing my own Mini-GPT and training it on a small dataset using my own GPU (5090). Cool to see the behind the scenes and took away some o the handwaveyness... https://www.youtube.com/watch?v=hL_n_GljC0I |
|
| ▲ | srean 2 hours ago | parent | prev | next [-] |
| If one wants to add the capability to reason about shape and shape compatibility, Barry Jay's FiSh would be an interesting detour. https://web.archive.org/web/20111015133833/http://www-staff.... This was used in his shape aware language FiSh, for dealing with multidimensional arrays. Shape compatibilities were statically type checked, if I recall correctly. Shapes were also used to optimize the loops. [Programming in FISh] https://link.springer.com/article/10.1007/s100090050037 [Towards Dynamic Shaping] https://www.researchgate.net/publication/265975794_Towards_D... |
| |
| ▲ | zserge 2 hours ago | parent [-] | | I wish we used something else but Python as the default ML language, so that some advanced type system would work for us to ensure tensor shapes and compatibility. | | |
| ▲ | ux266478 33 minutes ago | parent | next [-] | | Haskell is actually really good for that. Hasktorch[1] is high quality, batteries included, and leverages Haskell's GADTs for some cute stuff like gradual tensor shape checking. There's also just a grain to Haskell that feels really good for the machine learning domain. It doesn't just alleviate whole classes of bugs and a lot of annoying background noise reasoning, but it's also a much more natural-feeling expression. The "gotcha" is that Haskell is heavy duty machinery, and getting up to speed with it if your background lacks solid type-theory can be really daunting. For that reason alone, it could never be the default. Sometimes I like to think about how much of a disservice academia has done to itself by training mathematicians without giving them the foundational knowledge they need to utilize the nuclear-grade tooling they themselves have the most potential to benefit from. For a number theorist? Sure makes sense. But the fact that machine learning courses don't have rigorous undergraduate prerequisites in learning the foundation of computation is pure absurdity. [1] - http://hasktorch.org/ | |
| ▲ | bssrdf an hour ago | parent | prev | next [-] | | I found [ggml] is really easy, educational and fun to use. It is written in C and the backbone for llama.cpp. [ggml]https://github.com/ggml-org/ggml | |
| ▲ | churchsub1 an hour ago | parent | prev | next [-] | | Here's a Python library for static type checking of tensor shapes: https://pypie.dev/ | | | |
| ▲ | srean 2 hours ago | parent | prev [-] | | Honestly, I quite like Python most of the time. The times when I don't, argghh type errors. The worst I have had in a while is when I was dealing with a sparse array data type and getting some processing done in a C function to speed things up. Infuriatingly enough, the index type used to change after initialising the array. It would check if Int32 could accomodate the size of the array. If it could it would downgrade to Int32 at runtime. My C counterpart had no clue. That was so not fun to debug because the errors were intermittent (depending on the fill factor of the sparse array) |
|
|
|
| ▲ | srean 2 hours ago | parent | prev | next [-] |
| > A tensor is nothing but a flat array of numbers, plus some metadata telling you how to interpret those numbers as a multi-dimensional object. Erm... many would disagree. I think what he means is just a multidimensional array. |
| |
| ▲ | zserge 2 hours ago | parent [-] | | Not in a general mathematical sense, of course. Rather carthesian tensors. Seems like for most libraries it's `numpy.ndarray`: https://docs.tinygrad.org/tensor/ or https://docs.pytorch.org/docs/main/tensors.html | | |
| ▲ | srean 2 hours ago | parent [-] | | To add to the confusion, Mathematicians and Physicists often disagree on what that word means. A Physicist's tensor is often a mathematicians tensor field. An appropriate tensor can certainly be represented by a multidimensional array but not all multidimensional arrays are tensors. It depends on how that multidimensional array participates with others. For example, (lat, long) is not a 2d vector although it can be represented as a 2 dimensional array. |
|
|
|
| ▲ | reerdna 37 minutes ago | parent | prev | next [-] |
| Cool, but I find rather than just shapes and indexes, tensors with labels are much easier to use and reason about. E.g.: {
{user:bob, movie:"Heat"}:0.1,
{user:alice, movie:"Frozen"}:0.9,
{user:carol, movie:"Top Gun"}:0.3,
}
https://docs.vespa.ai/en/ranking/tensor-user-guide.html |
|
| ▲ | khalic an hour ago | parent | prev [-] |
| Why does does the diagram say tensors are 3D? |
| |
| ▲ | zserge an hour ago | parent [-] | | I guess I miscommunicated it. I meant I'd call everything a tensor but for some smaller dimensions we have specific names. Of course, 1D can still be a tensor and so is 6D or nD. |
|
