Federated Heterogeneous Language Model Optimization for Hybrid Automatic Speech Recognition
Authors: Mengze Hong, Yi Gu, Di Jiang, Hanlin Gu, Chen Jason Zhang, Lu Wang, Zhiyang Su
Organizations: Hong Kong Polytechnic University · Ant Group · Shanghai Jiao Tong University · Hong Kong University of Science and Technology · Shenzhen University
Training automatic speech recognition (ASR) models increasingly relies on decentralized federated learning to ensure data privacy and accessibility, producing multiple local models that require effective merging. In hybrid ASR systems, while acoustic models can be merged using established methods, the language model (LM) for rescoring the N-best speech recognition list faces challenges due to the heterogeneity of non-neural n-gram models and neural network models. This paper proposes a heterogeneous LM optimization task and introduces a match-and-merge paradigm with two algorithms: the Genetic Match-and-Merge Algorithm (GMMA), using genetic operations to evolve and pair LMs, and the Reinforced Match-and-Merge Algorithm (RMMA), leveraging reinforcement learning for efficient convergence. Experiments on seven OpenSLR datasets show RMMA achieves the lowest average Character Error Rate and better generalization than baselines, converging up to seven times faster than GMMA, highlighting the paradigm's potential for scalable, privacy-preserving ASR systems.
Figures & tables
Figure 1: The optimization of heterogeneous language model (LM) pairs in ASR involves (1) local training of source model pairs by curators using private data, and (2) merging multiple models to form a superior target model pair. The values of m and k may differ due to differences in data distribution across curators.
Figure 2: Overview of the Genetic Match-and-Merge Algorithm (GMMA). Heterogeneous language models (n-gram and neural LMs) are treated as separate populations and evolved via type-specific genetic operations. The top- k candidates from each population are then paired, and LM combinations with the highest matching fitness are selected for reproduction and merging.
Figure 3: Overview of Reinforced Match-and-Merge Algorithm. The merging problem is formulated as a sequential decision-making process, where a reinforcement learning agent selects actions to maximize rewards and enhance model quality.
Dataset
Name
Data Statistics
no.wav
hours
SLR18
THCHS-30
13388
34.0
SLR33
Aishell
141525
179.3
SLR38
Free ST Mandarin
102600
109.5
SLR47
Primewords
50384
98.8
SLR62
aidatatang
237265
200.3
Table 1: Dataset statistics (sample size and duration) and evaluation results, reported as the mean over 5 random seeds. Lower CER indicates better performance; the best results among merged models are shown in bold .
Figure 4: Convergence behavior on training data. The secondary axis (right) corresponds to GMMA due to its larger variance.
Experiment
2 Models
3 Models
4 Models
5 Models
Average
Direct Avg
13.58
12.64
9.47
8.53
RMMA
9.56
9.23
8.91
8.03
SLR18
Direct Avg
21.54
19.57
15.23
14.98
RMMA
15.59
14.63
13.97
13.68
Table 2: Performance evaluation (CER) of target models optimized on different numbers of source models.
Automatic speech recognition (ASR) systems, trained on paired speech-text data, have been improved by leveraging language models (LMs) trained on text-only data. LM fusion methods such as shallow fusion and density ratio are well-established methods that incorporate external LMs during ASR decoding. However, they incur additional computational costs due to LM inference, which is particularly problematic for recent larger LMs. In this study, we propose incorporating external LMs via model merging. This method integrates the LMs directly into the parameters of an LLM-based ASR model, requiring no additional computational cost at inference. We formulate domain extension and transfer via arithmetic operations on LoRA parameters. Experimental evaluations were conducted for the domain adaptation of LLM-based ASR trained on CSJ and LibriSpeech. We show that our LM merging consistently improved the ASR performance in the target domains, without degrading inference speed or memory footprint.
Hayato Futami, Tatsuya Kawahara
Graduate School of Informatics, Kyoto University, Japan
Federated learning (FL) enables privacy-preserving training of automatic speech recognition (ASR) systems across distributed data sources, yet its application to large-scale speech language models (SpeechLLMs) remains unexplored. This paper presents the first systematic study of federated training for SpeechLLM-based end-to-end ASR systems. We design a communication-efficient federated optimization strategy tailored to the unique challenges of SpeechLLM architectures, addressing high-dimensional parameter spaces, gradient communication overhead, and computational constraints in distributed settings. Through extensive empirical evaluation on monolingual ASR tasks in English and Italian, we demonstrate the effectiveness and stability of our federated approach compared to centralized training baselines across diverse acoustic conditions and speaking styles. Additionally, we conduct a comprehensive ablation study analyzing the impact of different speech encoder architectures on monolingual English ASR performance within the federated framework, providing insights into optimal model configurations for decentralized training. Our results achieve competitive word error rates while reducing communication costs, establishing practical foundations for federated SpeechLLM deployment in real-world multilingual scenarios.
We present a comprehensive benchmark of Federated Learning (FL) for multilingual Automatic Speech Recognition (ASR), evaluating four Speech-LLM architectures on the Multilingual LibriSpeech dataset. We compare FedAvg and FedProx across frozen and unfrozen encoder configurations, demonstrating that optimized learning rates are critical for performance. Specifically, independently tuning the learning rates for the speech encoder, connector, and decoder yields the lowest error rates, with full three-component adaptation (LoRA for encoder and decoder, full training for the connector) producing the best FL results. We observe that FedProx efficacy is architecture-dependent, providing notable advantages in multilingual pre-trained architectures (e.g., EuroLLM over TinyLlama when keeping the encoder fixed); this indicates that LLM backbone capacity plays a key role in mediating resilience to heterogeneous data distributions. These findings offer concrete design guidance for deploying multilingual Speech-LLMs in privacy-sensitive, distributed environments.
Jordi Luque, Aleix Sant, Fernando López
Telefónica Innovación Digital, Scientific Research