Skip to content
Preprint

Efficient Multilingual Reasoning Transfer via Progressive Code-Switching

Jul 2026 · 1 citation · ⚡ 1 influential · 14 references
Computer Science

TL;DR

Progressive Code-Switching (Progressive Code-Switching) is proposed, a more efficient transfer framework that requires only lightweight translation without any stronger model for distillation or judging for target-language reasoning.

Abstract

Large reasoning models (LRMs) have achieved strong reasoning capabilities in English, yet their performance degrades significantly when required to reason in other languages. A natural solution is to transfer the model's English reasoning ability to target languages. However, existing transfer approaches typically rely on distilled target-language reasoning traces from stronger LRMs or online supervision from external judge models, which are costly and difficult to scale. In this paper, we propose PCS (Progressive Code-Switching), a more efficient transfer framework that requires only lightweight translation without any stronger model for distillation or judging. PCS first constructs code-switched reasoning traces by translating a subset of English reasoning steps into the target language, and uses them to initialize the model's code-switching ability via supervised fine-tuning. It then applies reinforcement learning with a step-level language consistency curriculum, progressively raising the target-language ratio until the model reasons entirely in the target language. This progressive design provides a smooth transfer path that avoids the instability and performance degradation commonly observed when directly enforcing target-language reasoning. Experiments on multiple benchmarks and five typologically diverse languages show that PCS substantially narrows the performance gap between target-language and English reasoning, yielding more language-consistent reasoning while maintaining competitive accuracy.

View source

Similar papers

Preprint Jul 2026

Efficient Chain-of-Modality Reasoning via Progressive Compression for Spoken Language Models

This work proposes Efficient Chain-of-Modality Reasoning (ECoM Reasoning), the first framework to introduce compressed reasoning into SLMs, and proposes Progressive Compression, a curriculum-based strategy that gradually trains the model from full-form reasoning to compressed reasoning.

Pengchao Feng, Chao-Hong Tan, Qian Chen et al. · 0 citations
Preprint Aug 2026

Native Multilingual Chain-of-Thought Reasoning in Low-Resource Southeast Asian Languages

The Onramp-Sequence Cross-Distillation (OSCD) is introduced, a post-training algorithm that projects high-resource reasoning trajectories into low-resource vocabulary subspaces during generative training rollouts via an integrated translator agentic loop, ensuring the stable and efficient translation of dynamically gen...

Sean Gip Lim, William-Chandra Tjhi, Hai Leong Chieu · 0 citations
Jul 2026

Reasoning Before Translation: Enhancing Legal Machine Translation with Structured Reasoning

The results show that the quality of small ``base'' models can be greatly enhanced, and that reinforcement learning with verifiable rewards can be applied to NMT in the legal domain and surpasses the translation quality of supervised fine-tuning.

Aixiu An, Michael Jungo, Eloi Eynard et al. · 0 citations
Jul 2026

Towards Reliable C-to-Rust Translation with Rule-Guided Reasoning and Reinforcement Learning

A Translation fRAmework Via rule-guided reasoning and rEinforcement Learning, namely TRAVEL, consisting of two modules that employs Monte Carlo Tree Search-based reasoning path construction guided by Rust-specific rules, and introduces reinforcement learning that couples execution feedback with reasoning-quality signal...

Feng Luo, Jiachen Liu, Cuiyun Gao et al. · 0 citations
Preprint Aug 2026

When the API Speaks the Wrong Language: Revisiting Post-Training for Multilingual Tool Use

It is found that, in this benchmark, supervised fine-tuning (SFT) provides a strong baseline, substantially improving argument language consistency and end-to-end function call accuracy and, under consistent model selection, SFT achieves performance comparable to, and sometimes exceeding more complex reinforcement lear...

Siddharth Chauhan, Thomas Butler, Abhishek Singhania et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.