5 appearances on the backlist front page in the last 30 days.
A browser CAD system can now switch between CPU WASM and GPU WebGPU execution for dual contouring and marching cubes, giving interactive geometry tools a major local performance path
The performance win is pretty huge. Even for really simple shapes, just being able to run dual contouring in a massively parallel environment gives like a ~3x speed improvement.
We want to move the LP closer to the ILP. We find some cut (constraint) that is violated by the LP solution but wouldn't be violated by any integer solution. We then solve the new LP and iterate. Our LP lower bound increases, and the rounde
The setup is this: we have some integer linear program that represents the optimal tokenizer problem. We relax it to a continuous linear program so we can solve it fast. The solution will typically have fractional values, so we don't direct
I was nerdsniped over the weekend by this paper. I tried extending it by using various cutting plane strategies to train a provably optimal tokenizer. I made some progress, but it's still quite far from solved.