Skip to content

Listen to the Latents: Self-Correcting Speech Recognition in Large Audio Language Models Through Hidden-State Interactions

Aug 2026 · 0 citations · 44 references
Computer Science

TL;DR

This work refine warm-initialized LLM-based ASR models by leveraging their own pre-adaptation base LLMs by leveraging their own pre-adaptation base LLMs, focusing on LoRA-adapted settings where the base LLM is preserved.

Abstract

Recent automatic speech recognition (ASR) systems increasingly integrate large language models (LLMs) to leverage their semantic knowledge, either externally through logit fusion or internally through warm initialization. However, how to effectively combine these two strategies remains underexplored. In this work, we refine warm-initialized LLM-based ASR models by leveraging their own pre-adaptation base LLMs, focusing on LoRA-adapted settings where the base LLM is preserved. To achieve this, we propose Hybrid Search, a targeted correction strategy motivated by two observations. First, interaction features that characterize the relationship between LLM-based ASR hidden states and base-LLM hidden states provide informative signals about a token's degree of semantic dependence. Second, selectively refining targeted tokens with high semantic dependence improves ASR performance far beyond naive global LLM-correction methods including rescoring and late fusion. Our analysis suggests that, even after semantic knowledge transfer through warm initialization, LLM-based ASR models can still leverage their base LLM to further improve inference-time performance.

View source

Similar papers

Preprint Sep 2026

Beyond Encoder Fusion: Multi-View Discrete Token Augmentation for LLM-Based ASR

Discrete speech tokens provide a compact interface between speech encoders and large language models for automatic speech recognition, but single-tokenization systems remain sensitive to the chosen encoder. We propose multi-view discrete token augmentation, a simple strategy that augments each training utterance by gen...

Paul Moïse Gangbadja, Mickael Rouvier, Fabrice Lefèvre · 0 citations
#natural language process... Preprint Oct 2026

DirectSpeech2LLM: A Simple End-to-End Framework to Mitigate Prompt Overfitting in Speech-LLMs

Speech-LLMs often exhibit prompt overfitting, where models solely trained on automatic speech recognition (ASR) instruction fail to generalize to new instructions such as speech translation and continue to behave primarily as ASR system. We propose DirectSpeech2LLM, a simple end-to-end framework that preserves the inst...

Hemant Yadav, Sunayana Sitaram, R. Zimmermann et al. · 0 citations
Preprint Oct 2026

Teaching LLMs to Hear Who Spoke What: Metadata-Supervised Pretraining for Encoder-Free Speech-LLMs

Encoder-based speech large language models (Speech-LLMs) commonly employ pretrained speech encoders that prioritize linguistic content but may discard fine-grained acoustic cues essential for speaker discrimination and paralinguistic understanding. Encoder-free Speech-LLMs instead map Mel-spectrogram features directly...

Mo-Han Shi, Ru-Chao Fan, S. Sivasankaran et al. · 0 citations
#natural language process... Preprint Sep 2026

Merging the Knowledge of LLMs for Automatic Speech Recognition

This method integrates the LMs directly into the parameters of an LLM-based ASR model, requiring no additional computational cost at inference, and consistently improved the ASR performance in the target domains, without degrading inference speed or memory footprint.

Hayato Futami, Tatsuya Kawahara · 0 citations
Preprint Aug 2026

Likelihood-Constrained Acoustic Reranking for Training-Free Hallucination Mitigation in LLM-Based ASR

Likelihood-Constrained Acoustic Reranking (LCAR), a training-free decoding method that improves acoustic grounding while preserving support from the base model, is proposed and evaluated on four LLM-based ASR systems using human-audited TTS and open-source speech challenge suites.

Ji-Shen Kuang, Lin-Ru Zheng, Hong-Jin Song et al. · 0 citations
Preprint Aug 2026

Cached LLM Probability Retrieval for Speech Recognition

Context length analysis indicates that benefits peak at a context length of 8, suggesting that cached probability retrieval is an effective and lightweight ASR adaptation method, in contrast to the heavy training required for Generative Error Correction (GER) or knowledge distillation (KD).

Sheng Li, Takahiro Shinozaki, Tatsuya Kawahara · 0 citations

Related blog posts

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