Dynamically allocating compute budget to hard set of problems and evolving the sections with Qwen-35B-A3B gets you near GPT-5.4-xHigh on HLE
Summary
A method that dynamically allocates compute budget to hard problems using Qwen-35B-A3B achieves performance near GPT-5.4-xHigh on the HLE benchmark.
Similar Articles
I scaled test-time compute for Qwen-3.6-27B and Gemma-4-31B to surpass Claude Mythos in code optimizations and speedups.
This article describes a scaffold that scales test-time compute on Qwen-3.6-27B and Gemma-4-31B using iterative corrections and branch exploration to surpass Claude Mythos in code optimization. It includes a paper link and GitHub repository.
How accurate do you think this is? Qwen3.5 9B vs GPT-4o
The post questions whether Qwen 3.5 9B running on low-resource systems can outperform GPT-4o, highlighting its small size of less than 7 GB and claimed superior performance.
On a difficult new SWE benchmark, ProgramBench, GPT5.5 high/xhigh solves a task for first time, significantly outperforms Opus 4.7
GPT5.5 achieved the first solve on the difficult ProgramBench SWE benchmark, significantly outperforming Opus 4.7.
Qwen3.8 27B = GPT-5.6 Luna compressed into 27B
The article claims that the Qwen3.8 27B model is equivalent to a compressed version of GPT-5.6 Luna, suggesting significant advancements in model efficiency and performance.
Running Qwen3.6 35b a3b on 8gb vram and 32gb ram ~190k context
The author shares a high-performance local inference configuration for running Qwen3.6 35B A3B on limited hardware (8GB VRAM, 32GB RAM) using a modified llama.cpp with TurboQuant support, achieving ~37-51 tok/sec with ~190k context.