Large language models (LLMs) provide strong semantic priors that can improve multi-talker automatic speech recognition (MT-ASR), but using an LLM as an autoregressive decoder is computationally expensive and remains fragile under heavy overlap. In this paper, we propose an encoder-only MT-ASR framework that adapts an LLM to multi-talker conditioning and distills its semantic guidance into the encoder during training, while retaining fast CTC-style decoding at inference. Our model employs a post-encoder separator with serialized CTC to produce talker-ordered transcripts, and leverages an adapted LLM-based SOT objective as a multi-talker-aware teacher signal to explicitly regularize mixed-speech representations. To further support variable numbers of talkers, we introduce a Talker-Count Head that predicts the talker count and dynamically selects the appropriate decoding branch. Experiments on LibriMix show that the proposed encoder-only model achieves comparable performance to LLM-based systems in the two-talker condition, while delivering significant improvements in the three-talker condition with significant small RTF.
Figures & tables
Figure 1: Flowchart of the proposed method. LLaMA is used only during training for distillation.
ID
S/V
Model
Encoder
Noisy
Clean
FE
TCH.L.
Enc.L.
Development Set
Evaluation Set
Development Set
Evaluation Set
A.TC
2mix
3mix
A.TC
2mix
3mix
A.TC
2mix
3mix
A.TC
2mix
3mix
1
S
(Baseline) SOT w/ Llama-1B
✓
-
24
-
12.4
39.8
-
11.3
39.1
-
4.6
21.5
-
4.6
21.6
2
✓
-
18
-
17.7
49.2
-
15.5
48.4
-
5.9
30.4
-
6.1
31.7
3
✓
-
12
-
35.8
62.0
-
34.2
62.2
-
25.3
47.7
-
25.1
49.7
4
✓
-
6
-
43.1
65.5
-
41.2
65.4
-
29.6
52.5
-
30.5
54.7
Table 1: Results of the proposed method. “S/V” denotes the talker-count condition used in training: S = single-count (only one talker number), V = varied-count (mixed two-/three-talker). “FE” is the feature extraction module. “TCH” represents the talker-count head. “TCH.L.” represents the number of TCH layers. “Enc.L.” represents the number of each encoder layers for transcription. “A.TC” is the talker-count accuracy (%). Word Error Rate (WER) is used for 2mix and 3mix evaluation.
ID
TCH.L.
Noisy
Clean
Dev.
Eval.
Dev.
Eval.
2mix
3mix
2mix
3mix
2mix
3mix
2mix
3mix
7
-
78.8
81.7
73.4
82.8
90.9
89.0
88.8
87.3
8
6
99.7
77.3
99.9
73.7
95.5
99.9
92.6
9
12
99.0
90.2
98.7
88.7
96.0
99.8
94.1
10
18
99.7
79.7
99.3
76.7
99.9
94.0
99.9
91.7
Table 2: Accuracy of TCH for 2mix and 3mix condition
Model
Libri2Mix
Libri3Mix
CTC
0.0043
0.0106
Llama-1B
0.1150
0.0981
Table 3: Real-time factor (RTF) between the proposed methods and SOT-based LLM methods.
REF
Libri2Mix
Libri3Mix
Dev
Eval
Dev
Eval
N
Without LLMs; with SSL for the speech encoder
Training from Scratch 3 3 3 https://github.com/espnet/espnet/tree/master/egs2/librimix/sot_asr1
19.4
17.1
30.5
28.2
TSE-V-Whisper [ 29 ]
-
12.0
-
-
GEncSep [ 2 ]
17.2
15.0
28.0
25.9
w/o decoder: CTC
16.8
14.6
25.7
23.6
Table 4: Comparison between the proposed method and existing methods on the LibriMix datasets (270 hours for Libri2Mix and 186 hours for Libri3Mix, without any additional data augmentation). Word Error Rate (WER) is used for evaluation. “N/C” represents the noisy or clean condition.
Large language models (LLMs) provide strong linguistic priors for serialized output training (SOT), yet LLM-based multi-talker ASR degrades substantially as the number of overlapping talkers increases. Conventional systems expose acoustic evidence primarily through an initial projected mixture prefix, requiring the decoder to preserve and recover talker-relevant information indirectly throughout autoregressive generation. We first examine whether this limitation can be resolved by enriching the static prefix using discrete connectionist temporal classification (CTC) tokens, hybrid token--acoustic prompts, and continuous talker-specific representations. The results suggest that acoustic content alone does not fully address the conditioning bottleneck. We therefore extend onset-based serialization from the output target to the acoustic-conditioning pathway and introduce persistent decoder-side access to SOT-aligned serialized acoustic memory. Talker-specific representations are organized in utterance-onset order and retained as external acoustic memory, while the conventional mixture prefix provides a complementary global-conditioning path. LLM layers query this memory throughout generation through gated residual cross-attention. We further introduce a second adaptation stage that jointly applies low-rank updates to the acoustic-retrieval pathway and selected LLM self-attention projections. Experiments on LibriMix show consistent improvements over static-prefix prompting. These results indicate that effective LLM-based multi-talker ASR depends not only on providing richer acoustic representations, but also on maintaining persistent access to acoustic evidence structured according to the serialized output.
Hao Shi, Yuan Gao, Xugang Lu +1
Graduate School of Informatics, Kyoto University, Kyoto, Japan · National Institute of Information and Communications Technology, Japan
Audio-encoder-LLM-decoder architectures have become the dominant paradigm for modern automatic speech recognition (ASR), improving transcription quality through large-scale language modeling. However, the cost of autoregressive decoding scales with decoder size, creating a fundamental trade-off between recognition quality and serving latency. We argue this trade-off is not inherent: unlike open-ended text generation, ASR outputs are strongly anchored to the input speech signal, providing a natural inductive bias toward high-parallelism decoding. Building on this, we introduce ParaASR, an ASR system that leverages Multi-Token Prediction (MTP) to let a 4B LLM decoder emit multiple tokens per forward step. Starting from a publicly available audio-language foundation, the model first establishes a robust autoregressive recognizer and then aligns five future-token branches through a staged optimization recipe. At inference, it proposes a six-token continuation per step and admits only the verified prefix into the transcript, preserving the safety of standard autoregressive decoding. The average accepted length reaches 5.0 out of 6 proposed tokens, confirming that the deterministic structure of speech makes ASR an especially natural setting for multi-token decoding. ParaASR further retains a native 32K-context window and transcribes up to 30 minutes of audio in a single pass. Across diverse benchmarks, it attains average error rates of 2.97%, 3.68%, and 3.70% on Chinese, English, and long-form evaluations, respectively, while reaching a real-time factor (RTF) as low as 0.0053. These results show that decoder scaling, low-latency inference, and long-context transcription need not be competing goals when future-token proposals are anchored by the acoustic signal and guarded by autoregressive verification.
Multi-talker speech recognition is often addressed by combining automatic speech recognition (ASR) and speaker diarization in a pipeline system. Recently, LLM-based approaches have shown promise by jointly modeling semantic and speaker information, but they typically require large-scale multi-talker corpora that are costly to annotate. In this paper, we investigate how to efficiently train an LLM-based system with limited real-recorded data while maintaining high accuracy in speaker attribution. We propose several strategies: (1) a dual-encoder architecture to extract semantic and speaker features, (2) a feature interleaving format to merge these features as the inputs to the LLM, (3) a length-aware speaker ID loss to enhance diarization capability, and (4) an adaptive threshold strategy for ASR loss computation to mitigate hallucinations caused by speech overlaps. These strategies balance training between ASR and diarization tasks. Our system outperforms open-source baseline approaches, achieving relative improvements of 18% on the AliMeeting corpus and 24% on the Aishell4 corpus.