I went a little overboard. I figured we could spare a few extra dimensions.
We're computing linear, sin, cos and tan of each pixel's position in space. We're also computing a hilbert transformation mapping for all 1x1-30x30 and storing a library of them, to transform back and forth easily.
Finally, added one hot encodings for each of the positions. So that's 60.
If it goes well, can reduce that using quadtree or some other spatial indexing method that is closer to log n than n^2
Also fixed padding and added a of tests to make sure things are lining up.
New positional embedding system.
I went a little overboard. I figured we could spare a few extra dimensions.
We're computing linear, sin, cos and tan of each pixel's position in space. We're also computing a hilbert transformation mapping for all 1x1-30x30 and storing a library of them, to transform back and forth easily.
Finally, added one hot encodings for each of the positions. So that's 60.
If it goes well, can reduce that using quadtree or some other spatial indexing method that is closer to log n than n^2
Also fixed padding and added a of tests to make sure things are lining up.