
LocalLLaMA
I scaled test-time compute for Qwen-3.6-27B and Gemma-4-31B to surpass Claude Mythos in code optimizations and speedups.
The scaffold uses ~25-40x more compute on the original baseline model to attempt the same problem. I put it into max mode by setting the branches exploration breadth to 5, iterative corrections loop depth to 10 and 6 branch aware selective hypothesis that are revised after every 2 iterations. These hypotheses tests various claims, local speedups or completely different algorithmic designs independently and are selectively injected in a specific branch context. The most useful component of this e...
Read the full discussion on Reddit
This article was aggregated from Reddit. Click to join the conversation.
View on Reddit