mlsanityData to 7 Oct 2026

Squeeze Evolve: Unified Multi-Model Orchestration for Verifier-Free Evolution

arXiv 2604.07725 ↗First posted 9 Apr 2026cs.AI cs.CLcited by 6

Not on the map. Why?

Abstract (arXiv)

We show that verifier-free evolution is bottlenecked by both diversity and efficiency: without external correction, repeated evolution accelerates collapse toward narrow modes, while the uniform use of a high-cost model wastes compute and quickly becomes economically impractical. We introduce Squeeze Evolve, a unified multi-model orchestration framework for verifier-free evolutionary inference. Our approach is guided by a simple principle: allocate model capability where it has the highest marginal utility. Stronger models are reserved for high-impact stages, while cheaper models handle the other stages at much lower costs. This principle addresses diversity and cost-efficiency jointly while remaining lightweight. Squeeze Evolve naturally supports open-source, closed-source, and mixed-model deployments. Across AIME 2025, HMMT 2025, LiveCodeBench V6, GPQA-Diamond, ARC-AGI-V2, and multimodal vision benchmarks, such as MMMU-Pro and BabyVision, Squeeze Evolve consistently improves the cost-capability frontier over single-model evolution and achieves new state-of-the-art results on several tasks. Empirically, Squeeze Evolve reduces API cost by up to ~3× and increases fixed-budget serving throughput by up to ~10×. Moreover, on discovery tasks, Squeeze Evolve is the first verifier-free evolutionary method to match, and in some cases exceed, the performance of verifier-based evolutionary methods.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 19 of its 40 references that are in the map. First posted on arXiv 9 Apr 2026.

Builds on

19 of 40 references.

References · 19

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
  3. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  4. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
  5. 2023Tree of Thoughts: Deliberate Problem Solving with Large Language Modelscited by 3,155
  6. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
  7. 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,928
  8. 2025s1: Simple test-time scalingcited by 1,311
  9. 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 946
  10. 2024Generative Verifiers: Reward Modeling as Next-Token Predictioncited by 465
  11. 2024Mixture-of-Agents Enhances Large Language Model Capabilitiescited by 420
  12. 2025ARC-AGI-2: A New Challenge for Frontier AI Reasoning Systemscited by 171
7 more
  1. 2024Accessing GPT-4 level Mathematical Olympiad Solutions via Monte Carlo Tree Self-refine with LLaMa-3 8Bcited by 156
  2. 2025Scaling Test-Time Compute Without Verification or RL is Suboptimalcited by 82
  3. 2024Smaller, Weaker, Yet Better: Training LLM Reasoners via Compute-Optimal Samplingcited by 60
  4. 2025LLMs Can Generate a Better Answer by Aggregating Their Own Responsescited by 27
  5. 2025When Does Verification Pay Off? A Closer Look at LLMs as Solution Verifierscited by 11
  6. 2025C3PO: Optimized Large Language Model Cascades with Probabilistic Cost Constraints for Reasoningcited by 8
  7. 2025Arbitrage: Efficient Reasoning via Advantage-Aware Speculationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 6.

6 papers.