Researchers propose physics-inspired method to prune large language models by removing transformer blocks
A new approach reformulates block removal as an Ising optimization problem, enabling efficient search for high-quality pruned configurations without exhaustive benchmarking.
1 source · cross-referenced
- A new paper proposes treating transformer block removal as an Ising optimization problem to improve LLM pruning efficiency and quality.
- The method maps block selection to a constrained binary optimization problem, enabling reuse of classical and quantum-inspired solvers.
- At 50% compression on Llama-3.3-70B-Instruct, the approach gains nearly 23 percentage points on MMLU over the best competing block-removal method.
- The energy of the Ising system serves as a strong proxy for downstream benchmark performance, reducing the need for costly evaluations.
A new paper from researchers at Multiverse Computing and collaborators proposes reformulating the problem of removing transformer blocks from large language models (LLMs) as an Ising optimization problem, enabling more efficient and higher-quality pruning than existing heuristics.
The approach treats each block as a binary variable—keep or remove—mapping the selection task to a constrained binary optimization (CBO) problem equivalent to finding low-energy states of an Ising glass. The energy of the resulting spin system serves as a strong proxy for downstream benchmark performance, allowing the authors to rank candidate configurations without running full evaluations.
The method computes a Hessian matrix from forward and backward passes on a small calibration dataset, capturing both individual block importance and pairwise interactions. This one-time computation enables cheap energy evaluations for any candidate configuration, and the same Hessian can be reused across different compression targets.
For tractable cases, the authors brute-force search billions of configurations on a single GPU; for larger cases, they leverage classical and quantum-inspired solvers (e.g., tabu search, quantum annealing, QAOA) to efficiently find low-energy states. The authors note that finding good low-energy states, rather than the absolute ground state, is sufficient for practical pruning quality.
Empirically, the method achieves substantial gains over prior block-removal approaches. At 50% compression on Llama-3.3-70B-Instruct, the approach improves MMLU performance by nearly 23 percentage points over the best competing block-removal baseline.
The paper argues that existing block-removal methods often rely on mean-field heuristics that ignore interactions between blocks, limiting quality especially at high compression rates. By explicitly modeling these interactions via the Ising formulation, the method generalizes beyond dense transformers and can be applied to heterogeneous architectures.
- Oct 13, 2026 · Google DeepMind — Blog
Google DeepMind details safety guardrails for Gemini 4 Argon’s cyberdefense and biology capabilities
Trust76 - Oct 13, 2026 · Google DeepMind — Blog
Google DeepMind unveils Gemini 4 Argon for robotics with 87% score on Embodied Reasoning benchmark
Trust78 - Oct 13, 2026 · arXiv cs.CL
Researchers propose Elastic Latent Recurrence to unify recurrent and non-recurrent language models without inference-time trade-offs
Trust79