Trendoday

Tree-Ising: Repairing Language Models with Bit-Level Ising Edits

Weight-space programming, introduced in recent MIT work by Takehi et al., enables a frontier LLM agent to read a network's weights and write a repair. Their GPT-6 Astra agent corrected the reasoning l

  • Upvotes7
–Rank now
#1Peak rank
3Days on list
484Score · 7d
Nov 11, 2026First seen
Rank · 7 days

About this paper

Tree-Ising repairs reasoning loops in LLM weights by solving sparse Ising/QUBO problems over BF16 parameters, improving math benchmark accuracy with fewer weight edits and no gradient or LLM-token cost.

Weight-space programming, introduced in recent MIT work by Takehi et al., enables a frontier LLM agent to read a network's weights and write a repair. Their GPT-6 Astra agent corrected the reasoning loops of Qwen3.5-0.8B without gradients, using 158 agent turns, 89.7 million tokens, and 50 forward-pass requests. Our method, Tree-Ising, casts this repair as a sparse discrete optimization problem over the model's own BF16 weights. Forward statistics define an objective that weakens a loop direction, strengthens a concluding direction, and preserves the layer's output on productive tokens. Within a state-tree representation, where lossless BF16 storage acts as a special case, the admissible…

weight-space programmingfrontier LLM agentGPT-6 Astra agentQwen3.5-0.8Breasoning loopsgradientsBF16 weightsforward statisticsloop directionconcluding direction
Upvotes
7
Authors
2
Published
Nov 10, 2026

Summary and abstract excerpt via Hugging Face Papers ↗ · arXiv.

Trending history

Tree-Ising: Repairing Language Models with Bit-Level Ising Edits was first seen on Hugging Face · Daily papers on Nov 11, 2026. Since then it has appeared in 22 checks on 3 different days. Its best position was #1 of 30, reached on Nov 11, 15:28 UTC. It dropped off the list after Nov 13, 03:28 UTC.

Rank history

Position on Hugging Face · Daily papers at every check (lower is better).

#1#11#20#30 09:2819:5806:2816:5803:28 Nov 11, 09:28 UTC · #21Nov 11, 11:28 UTC · #6Nov 11, 13:28 UTC · #3Nov 11, 15:28 UTC · #1Nov 11, 17:28 UTC · #1Nov 11, 19:28 UTC · #1Nov 11, 21:28 UTC · #1Nov 11, 23:28 UTC · #1Nov 12, 01:28 UTC · #1Nov 12, 03:28 UTC · #1Nov 12, 05:28 UTC · #2Nov 12, 07:28 UTC · #2Nov 12, 09:28 UTC · #1Nov 12, 11:28 UTC · #1Nov 12, 13:28 UTC · #1Nov 12, 15:28 UTC · #2Nov 12, 17:28 UTC · #2Nov 12, 19:28 UTC · #2Nov 12, 21:28 UTC · #2Nov 12, 23:28 UTC · #2Nov 13, 01:28 UTC · #2Nov 13, 03:28 UTC · #2

Last 14 days

Best rank per day (UTC).

Nov 3today

Metric history

Platform metric as reported by Hugging Face.

0285786 09:2819:5806:2816:5803:28 Nov 11, 09:28 UTC · 6Nov 11, 11:28 UTC · 28Nov 11, 13:28 UTC · 41Nov 11, 15:28 UTC · 58Nov 11, 17:28 UTC · 60Nov 11, 19:28 UTC · 71Nov 11, 21:28 UTC · 71Nov 11, 23:28 UTC · 71Nov 12, 01:28 UTC · 75Nov 12, 03:28 UTC · 77Nov 12, 05:28 UTC · 77Nov 12, 07:28 UTC · 81Nov 12, 09:28 UTC · 84Nov 12, 11:28 UTC · 85Nov 12, 13:28 UTC · 86Nov 12, 15:28 UTC · 50Nov 12, 17:28 UTC · 51Nov 12, 19:28 UTC · 62Nov 12, 21:28 UTC · 62Nov 12, 23:28 UTC · 62Nov 13, 01:28 UTC · 62Nov 13, 03:28 UTC · 63

Questions

Is Tree-Ising: Repairing Language Models with Bit-Level Ising Edits trending on HF Daily Papers right now?

Not at the moment. It was last on the list on Nov 13, 03:28 UTC, after 3 days of trending.

What is the highest rank Tree-Ising: Repairing Language Models with Bit-Level Ising Edits reached?

#1 on Hugging Face · Daily papers, on Nov 11, 15:28 UTC. Trendoday checks this list every 120 minutes.

How long has Tree-Ising: Repairing Language Models with Bit-Level Ising Edits been trending?

It was first seen on Nov 11, 2026 and has been on the list on 3 days (22 checks) since.