Hidden Language Consistency Phenomena in Reasoning LLMs
Muhammad Ali Shafique, Kelly Marchisio
cs.CL, cs.AI
Submitted: 2026-08-22
Updated: 2026-08-25
License: http://creativecommons.org/licenses/by/4.0/
The gist: Multilingual reasoning models are commonly evaluated by whether they arrive at the correct answer, but not by whether they preserve the intended language while reasoning and responding.
Terminology
Abstract
Multilingual reasoning models are commonly evaluated by whether they arrive at the correct answer, but not by whether they preserve the intended language while reasoning and responding. This omission conceals important multilingual behaviors that emerge as tasks become harder. In this paper, we study task difficulty, task accuracy, thinking-language consistency (TC), and answer-language consistency (AC) across reasoning models using PolyMath benchmark in eight languages and four difficulty levels. We uncover four findings: (1) language consistency exhibits four difficulty-dependent behaviors: output-language consistency remains aligned with input, remains misaligned, degrades gradually, or collapses abruptly. (2) We identify the language consistency breakdown effect, where increasing difficulty can cause a sudden drop in output-language consistency, especially in less strongly represented and non-Latin-script languages. (3) Due to this breakdown effect, accuracy can be preserved or even improved at a harder difficulty level as the model shifts to its internal dominant language. (4) Quantization can improve or degrade output-language consistency independently of its effect on accuracy, with GPTQ and AWQ often outperforming AutoRound under tolerance-based voting with epsilon = 1.0. These results show that multilingual capability cannot be characterized by accuracy alone; reliable evaluation should jointly consider task accuracy, language consistency, and task difficulty for multilingual benchmarks.
Sources
- Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs
- Training Verifiers to Solve Math Word Problems
- Phi-4-reasoning Technical Report
- GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers
- The Pile: An 800GB Dataset of Diverse Text for Language Modeling
- DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
- Quantization Hurts Reasoning? An Empirical Study on Quantized Reasoning Models
- OpenAI o1 System Card
- Olmo 3
- From One to Many: Expanding the Scope of Toxicity Mitigation in Language Models
- GPQA: A Graduate-Level Google-Proof Q&A Benchmark
- Gemma 3 Technical Report
- Kimi k1.5: Scaling Reinforcement Learning with LLMs
- No Language Left Behind: Scaling Human-Centered Machine Translation
- Qwen3 Technical Report
- Qwen2.5 Technical Report
Related papers
- Exploring Solution Divergence and Its Effect on Large Language Model Problem Solving
- Ishigaki-IDS-Bench: A Benchmark for Generating Information Delivery Specification from BIM Information Requirements
- Subliminal Steering: Stronger Encoding of Hidden Signals
- MedStruct-S: A Benchmark for Key Discovery, Key-Conditioned QA and Semi-Structured Extraction from OCR Clinical Reports
- The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architectures
- Untangling the Mechanisms of Misleading Context in Medical Question Answering