Tree-Ising Repairs LLM Reasoning Loops With Bit-Level Ising/QUBO Edits, No Gradients Needed
Hadi Salloum · hf · 2026-11-11
Researchers from QDeep (Riyadh) and ITMO University's LEAD lab propose Tree-Ising, a gradient-free method for repairing reasoning loops in LLM weights. It solves sparse Ising/QUBO optimization problems over BF16 parameters at the bit level, improving math benchmark accuracy with fewer weight edits — using only forward passes, no gradients and no LLM-token cost.
More from Research
- Laser-as-a-sensor: monolithic VCSEL oxygen detector shrinks sampling volume to subnanoliter — jwt0625 · 2026-11-11
- AI×Antibodies hackathon in Oslo offers JapanFold, Anthropic credits, $20K lab validation — DavidBennett__ · 2026-11-11
- Which benchmarks do humans still win against frontier AI? Reddit debates AGI criteria — ImproveOurWorld · 2026-11-11
- EarthRecord benchmark tests 12 multimodal agents on four decades of raw satellite imagery — AIEyesTech · 2026-11-11
- WaveGen: codec-free end-to-end diffusion hits SOTA text-to-speech via Spectral Forcing — Ajou · 2026-11-11
- Berkeley's Social Humanoid teaches Unitree G1 socially responsive interaction — berkeley_ai · 2026-11-11