mlsanityData to 14 Oct 2026

Transcribe, Then Reason: Two-Pass Decomposition for Multimodal Review

arXiv 2609.18958 ↗First posted 15 Jul 2026cs.MM cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

The natural way to review a long recording or document with a multimodal model is to hand it the raw source and ask for a review in one call. We show that this quietly fails: the model satisfices, dropping roughly a third of the content and embellishing the rest. The failure is not perception--almost all of the dropped content reappears when the same model is simply asked to transcribe the source. The bottleneck is generation under load: a single pass cannot perceive, reason over, and write a long faithful review at the same time, because doing all three competes for one output. We rule out the obvious alternatives. It is not the modality: models read text and an image of the same text equally well. And it is not merely a matter of thinking harder: giving the single pass a far larger reasoning budget does not recover the lost content, because the model spends that budget planning a review rather than writing the source down. What works is to split the labor across two same-weights passes--first transcribe, then review the transcript--so each step gets a full output budget of its own. This transcribe-then-review decomposition improves both faithfulness and coverage across a 21-source suite. The benefit is not uniform: we observe that it helps most where the one-pass baseline is weakest and little where that baseline is already strong, a pattern that also tracks the source's length and modality. Decomposition comes with two failure modes--the review pass running out of room on very long sources, and confabulating from memory once the grounding source is removed.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 36 references that are in the map. First posted on arXiv 15 Jul 2026.

Builds on

26 of 36 references.

References · 26

  1. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  2. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
  3. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  4. 2022Robust Speech Recognition via Large-Scale Weak Supervisioncited by 4,057
  5. 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,455
  6. 2022Least-to-Most Prompting Enables Complex Reasoning in Large Language Modelscited by 1,407
  7. 2023FActScore: Fine-grained Atomic Evaluation of Factual Precision in Long Form Text Generationcited by 1,282
  8. 2020On Faithfulness and Factuality in Abstractive Summarizationcited by 900
  9. 2022Decomposed Prompting: A Modular Approach for Solving Complex Taskscited by 558
  10. 2024Navigating the Digital World as Humans Do: Universal Visual Grounding for GUI Agentscited by 382
  11. 2022RARR: Researching and Revising What Language Models Say, Using Language Modelscited by 287
  12. 2021Measuring Attribution in Natural Language Generation Modelscited by 256
14 more
  1. 2023Nougat: Neural Optical Understanding for Academic Documentscited by 245
  2. 2025UI-TARS-2 Technical Report: Advancing GUI Agent with Multi-Turn Reinforcement Learningcited by 215
  3. 2024ColPali: Efficient Document Retrieval with Vision Language Modelscited by 195
  4. 2017The Consciousness Priorcited by 107
  5. 2025Step-Audio-R1 Technical Reportcited by 36
  6. 2024DocVLM: Make Your VLM an Efficient Readercited by 28
  7. 2025OCR-Reasoning Benchmark: Unveiling the True Capabilities of MLLMs in Complex Text-Rich Image Reasoningcited by 25
  8. 2025Closing the Gap Between Text and Speech Understanding in LLMscited by 17
  9. 2025X-Talk: On the Underestimated Potential of Modular Speech-to-Speech Dialogue Systemcited by 9
  10. 2026VISTA-Bench: Do Vision-Language Models Really Understand Visualized Text as Well as Pure Text?cited by 8
  11. 2026Do Vision-Language Models Truly Perform Vision Reasoning? A Rigorous Study of the Modality Gapcited by 6
  12. 2026The Cascade Equivalence Hypothesis: When Do Speech LLMs Behave Like ASRrightarrowLLM Pipelines?cited by 5
  13. 2025Discrete JEPA: Learning Discrete Token Representations without Reconstructioncited by 2
  14. 2026Fairness of Explanations in Artificial Intelligence (AI): A Unifying Framework, Axioms, and Future Direction toward Responsible AIcited by 1

Built on by

Not cited yet.