I’m doubtful this is a meaningful result. Kernel contains a lot of legacy code and generalizations to support different hardware etc.; removing that would result in a speedup. Next are all the mitigations for hardware vulnerabilities and attacks. If removed would give a nice speedup as well at the cost of security. And then finally, just specializing the Kernel in whatever the benchmark is measuring, making it useless as a general piece of software would also make it fast.
Qwen3.7-Max Ran for 35 Hours on Unknown Hardware and Achieved a 10× Speedup
31–33 of 33 posts
Re: Qwen3.7-Max Ran for 35 Hours on Unknown Hardware and Achieved a 10× Speedup
#32The article gives no mention of what exactly was done to achieve the speedup and whether or not the kernel is still able to perform the same function as before. I’m doubtful this is a meaningful result. Kernel contains a lot of legacy code and generalizations to support different hardware etc.; removing that would result in a speedup. Next are all the mitigations for hardware vulnerabilities and attacks. If removed w…
Re: Qwen3.7-Max Ran for 35 Hours on Unknown Hardware and Achieved a 10× Speedup
#33Earlier quoted context omitted.
I got nerd-sniped wrt the genetic algorithm. Technically birdshot from a shotgun is also randomly distributed (passing through a cone). This actually improves the chance of hitting the clay pigeon, because the birdshot spreads out and each individual ball has a chance to hit. Genetic algo is similar. it's an optimizer that - in order to avoid local optima - will 'shotgun' an area around its current best guess.
Yeah, but you shoot in the direction of the clay pigeon, you don't pick randomly a direction in space where to point your gun at.
So instead of just sampling in a close 'circle' around your current point looking for a 'down', how about we spread that out a bit? You could use a 'circle' in a regular pattern, but what does that even look like in high dimensional space? Seems it's best to use some random distribution centered on your current position.
(LLMs actually have a 'temperature' setting which introduces noise for this exact reason.)
Some of GA's claims to fame are A) it uses purely just this distribution to descend. B) It can find multiple optima.
The way I think of it is that the simplest GA is basically greedy optimization with spread.
Greedy is like shooting a rifle , which is great for sniping, but you'll miss if the target is moving fast or doing things you can't quite keep up with.
A GA -like a shotgun- introduces spread: multiple chances to hit, multiple chances to escape local optima and rough patches in the landscape.
(A really good -if slightly morbid- modern example in the wild is COVID; which managed to outwit human civilization rather handily. "Not bad for a bit of encapsulated RNA" you'd think - until you realize it was running trillions of attempts in parallel. Really, the poor governments had no chance. )