It’s explained in detail here:

https://kolinko.github.io/effort/equations.html

Long story short - I kind of sort them and pick only the top % that would give a highest result.

One part is choosing them though - I think this was done before in some papers. But the second part was an implementation of multiplication that is efficient on both gpus and cpus when choosing weights almost at will.

All explained on the site, but I just got feedback that it may not be easy enough to read, so I’ll push it through gpt for grmamar fixes soon :) It’s also a bit complicated as an algorithm.