mlsanityData to 7 Oct 2026

Revision or Re-Solving? Decomposing Second-Pass Gains in Multi-LLM Pipelines

arXiv 2604.01029 ↗First posted 1 Apr 2026cs.SE cs.AI cs.CLcited by 7

Not on the map. Why?

Abstract (arXiv)

Multi-LLM revision pipelines, in which a second model reviews and improves a draft produced by a first, are widely assumed to derive their gains from genuine error correction. We question this assumption with a controlled decomposition experiment that uses four matched conditions to separate second-pass gains into three additive components: re-solving, scaffold, and content. We evaluate this design across two model pairs on three benchmarks spanning knowledge-intensive MCQ and competitive programming. Our results show that the gains of multi-LLM revision are not monolithic, but depend on task structure, draft quality, and the type of draft information. On MCQ tasks, where the answer space is constrained and drafts provide little structural guidance, most gains are consistent with stronger-model re-solving, and directly routing queries to the stronger model can be more effective than revising a weak draft. On code generation tasks, however, two-stage prompting remains useful because even semantically null drafts can provide substantial structural scaffolding, while weak draft content can be harmful. Finally, role-reversed experiments show that strong drafts clearly benefit weak reviewers. Ultimately, our findings demonstrate that the utility of multi-LLM revision is dynamically bottlenecked by task structure and draft quality, necessitating more targeted pipeline designs rather than blanket revision strategies.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 22 of its 33 references that are in the map. First posted on arXiv 1 Apr 2026.

Builds on

22 of 33 references.

References · 22

  1. 2023Reflexion: Language Agents with Verbal Reinforcement Learningcited by 4,064
  2. 2023Self-Refine: Iterative Refinement with Self-Feedbackcited by 3,317
  3. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
  4. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 1,906
  5. 2023Improving Factuality and Reasoning in Language Models through Multiagent Debatecited by 1,739
  6. 2023Encouraging Divergent Thinking in Large Language Models through Multi-Agent Debatecited by 995
  7. 2023Large Language Models Cannot Self-Correct Reasoning Yetcited by 965
  8. 2023Teaching Large Language Models to Self-Debugcited by 963
  9. 2023CRITIC: Large Language Models Can Self-Correct with Tool-Interactive Critiquingcited by 751
  10. 2023Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervisioncited by 445
  11. 2024When Can LLMs Actually Correct Their Own Mistakes? A Critical Survey of Self-Correction of LLMscited by 230
  12. 2023REFINER: Reasoning Feedback on Intermediate Representationscited by 203
10 more
  1. 2023Is Self-Repair a Silver Bullet for Code Generation?cited by 191
  2. 2023GPT-4 Doesn't Know It's Wrong: An Analysis of Iterative Prompting for Reasoning Problemscited by 88
  3. 2025Debate or Vote: Which Yields Better Decisions in Multi-Agent Large Language Models?cited by 74
  4. 2024Confidence Matters: Revisiting Intrinsic Self-Correction Capabilities of Large Language Modelscited by 47
  5. 2024LLM Self-Correction with DeCRIM: Decompose, Critique, and Refine for Enhanced Following of Instructions with Multiple Constraintscited by 34
  6. 2023SCREWS: A Modular Framework for Reasoning with Revisionscited by 16
  7. 2025SSR: Socratic Self-Refine for Large Language Model Reasoningcited by 6
  8. 2026Re2: Unlocking LLM Reasoning via Reinforcement Learning with Re-solvingcited by 6
  9. 2025Less LLM, More Documents: Searching for Improved RAGcited by 4
  10. 2026Agentic Search in the Wild: Intents and Trajectory Dynamics from 14M+ Real Search Requestscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 7.

7 papers.