Reinforcement Learning for Data-Efficient Code-Switched ASR
This paper proposes a reinforcement learning approach for adapting audio-language models to code-switched speech using group relative policy optimization and verifiable rewards.
Introduced RLVR for data-efficient code-switched ASR adaptation using group relative policy optimization and verifiable rewards.
Before reading this…
Applications
- →Speech recognition in multilingual communities
To understand this paper, make sure you know these concepts first:
- Understanding of reinforcement learningfind papers →
- Familiarity with audio-language modelsfind papers →
Abstract
More Like ThisAudio-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 the full dataset, with the largest gains on typologically distant pairs. The error rate reward eliminates translation errors while the script fidelity reward separately reduces script contamination without degradation. These gains transfer zero-shot to a human-recorded code-switching corpus.