Sign inGet started
Paper · arXiv

Reinforcement Learning for Data-Efficient Code-Switched ASR

Audio-language models can be prompted for code-switched speech, but their decoding is not optimized for code-switching and often fails at language boundaries. We propose a practical reinforcement learning with verifiable rewards recipe for data-efficient adaptation of audio-language models to code-switched ASR using group relative policy optimization, combining an error rate reward with a script fidelity reward that penalizes wrong writing systems and a two-pass draft-and-refinement procedure. Using Qwen2-Audio as a reproducible testbed across 10 language pairs, training on only TTS code-switched speech, we show that RLVR with 10% of the data matches LoRA supervised fine-tuning trained on...

AuthorsZiwei Ye, Peter Vickers
Primary categorycs.CL
Published2 July 2026
Last updated at source2 July 2026
cs.CLcs.SD
Embed this entry
<iframe src="https://silytics.si/embed/item/dcc9bfee-3ac4-417d-b772-5d4791bf3afe" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.