用潜在语音块提升语音文本模型效率,让语音与文本对齐更顺畅。
Latent Speech-Text Transformer
- 将语音标记聚合成高层潜在块,缩小语音与文本序列粒度差异。
- 在计算受限下语音HellaSwag提升6.5%,文本性能也同步改善。
- 适合追求高效跨模态建模和降低语音生成推理成本的研究者。
自回归语音-文本模型在交错的文本标记与离散语音标记上预训练,展现出强大的语音理解与生成能力,但其计算效率仍远低于文本大模型,部分原因在于语音标记序列远长于文本。这种模态不平衡使预训练与推理计算资源过度倾斜至语音,可能阻碍有效的跨模态对齐,并使性能扩展速度下降数个数量级。我们提出潜语音-文本变换器(LST),将语音标记聚合为潜在语音块,作为更高层级的自回归单元。该设计在语音与文本间实现序列建模粒度对齐,同时提升计算效率。生成的块可与文本单元对齐,促进跨模态知识迁移,并紧凑捕捉如静音等重复声学模式。在计算控制与数据控制两种设置下的故事续写基准测试中,LST持续提升语音准确率,同时改善文本表现,计算受限训练下语音HellaSwag最高提升6.5%(数据受限下+5.3%)。在从420M到1.8B参数的计算最优范式下进行扩展时,增益随规模增长,且在固定标记预算下7B参数仍保持优势。这些收益延伸至下游任务:LST稳定了语音识别适应过程,减少语音识别与语音合成推理中的有效自回归序列长度,降低计算成本而不损害重建质量。代码已开源。
原文摘要 · Abstract (English)
Auto-regressive speech-text models pre-trained on interleaved text tokens and discretized speech tokens demonstrate strong speech understanding and generation, yet remain substantially less compute-efficient than text LLMs, partly due to the much longer sequences of speech tokens relative to text. This modality imbalance disproportionately allocates pre-training and inference compute to speech, potentially hindering effective cross-modal alignment and slowing performance scaling by orders of magnitude. We introduce the Latent Speech-Text Transformer (LST), which aggregates speech tokens into latent speech patches that serve as higher-level autoregressive units. This design aligns the sequence-modeling granularity between speech and text while improving computational efficiency. The resulting patches can align with textual units to facilitate cross-modal knowledge transfer and compactly capture recurring acoustic patterns such as silence. Across story-completion benchmarks under both compute-controlled and data-controlled settings, LST consistently improves speech accuracy while also improving text performance, achieving up to +6.5% absolute gain on speech HellaSwag in compute-controlled training (+5.3% in data-controlled training). Under compute-controlled scaling from 420M to 1.8B parameters in a near compute-optimal regime, gains grow with scale, and improvements persist up to 7B parameters under fixed-token budgets. These benefits extend to downstream tasks: LST stabilizes ASR adaptation and reduces the effective autoregressive sequence length during ASR and TTS inference, lowering computational cost without degrading reconstruction quality. The code is available at https://github.com/facebookresearch/lst.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。