Pseudo-Autoregressive Neural Codec Language Models for Efficient Zero-Shot Text-to-Speech Synthesis

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Yang, Yifan, Liu, Shujie, Li, Jinyu, Hu, Yuxuan, Wu, Haibin, Wang, Hui, Yu, Jianwei, Meng, Lingwei, Sun, Haiyang, Liu, Yanqing, Lu, Yan, Yu, Kai, Chen, Xie
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866912520439070720
author Yang, Yifan
Liu, Shujie
Li, Jinyu
Hu, Yuxuan
Wu, Haibin
Wang, Hui
Yu, Jianwei
Meng, Lingwei
Sun, Haiyang
Liu, Yanqing
Lu, Yan
Yu, Kai
Chen, Xie
author_facet Yang, Yifan
Liu, Shujie
Li, Jinyu
Hu, Yuxuan
Wu, Haibin
Wang, Hui
Yu, Jianwei
Meng, Lingwei
Sun, Haiyang
Liu, Yanqing
Lu, Yan
Yu, Kai
Chen, Xie
contents Recent zero-shot text-to-speech (TTS) systems face a common dilemma: autoregressive (AR) models suffer from slow generation and lack duration controllability, while non-autoregressive (NAR) models lack temporal modeling and typically require complex designs. In this paper, we introduce a novel pseudo-autoregressive (PAR) codec language modeling approach that unifies AR and NAR modeling. Combining explicit temporal modeling from AR with parallel generation from NAR, PAR generates dynamic-length spans at fixed time steps. Building on PAR, we propose PALLE, a two-stage TTS system that leverages PAR for initial generation followed by NAR refinement. In the first stage, PAR progressively generates speech tokens along the time dimension, with each step predicting all positions in parallel but only retaining the left-most span. In the second stage, low-confidence tokens are iteratively refined in parallel, leveraging the global contextual information. Experiments demonstrate that PALLE, trained on LibriTTS, outperforms state-of-the-art systems trained on large-scale data, including F5-TTS, E2-TTS, and MaskGCT, on the LibriSpeech test-clean set in terms of speech quality, speaker similarity, and intelligibility, while achieving up to ten times faster inference speed. Audio samples are available at https://microsoft.com/research/project/vall-e-x/palle.
format Preprint
id arxiv_https___arxiv_org_abs_2504_10352
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Pseudo-Autoregressive Neural Codec Language Models for Efficient Zero-Shot Text-to-Speech Synthesis
Yang, Yifan
Liu, Shujie
Li, Jinyu
Hu, Yuxuan
Wu, Haibin
Wang, Hui
Yu, Jianwei
Meng, Lingwei
Sun, Haiyang
Liu, Yanqing
Lu, Yan
Yu, Kai
Chen, Xie
Audio and Speech Processing
Computation and Language
Recent zero-shot text-to-speech (TTS) systems face a common dilemma: autoregressive (AR) models suffer from slow generation and lack duration controllability, while non-autoregressive (NAR) models lack temporal modeling and typically require complex designs. In this paper, we introduce a novel pseudo-autoregressive (PAR) codec language modeling approach that unifies AR and NAR modeling. Combining explicit temporal modeling from AR with parallel generation from NAR, PAR generates dynamic-length spans at fixed time steps. Building on PAR, we propose PALLE, a two-stage TTS system that leverages PAR for initial generation followed by NAR refinement. In the first stage, PAR progressively generates speech tokens along the time dimension, with each step predicting all positions in parallel but only retaining the left-most span. In the second stage, low-confidence tokens are iteratively refined in parallel, leveraging the global contextual information. Experiments demonstrate that PALLE, trained on LibriTTS, outperforms state-of-the-art systems trained on large-scale data, including F5-TTS, E2-TTS, and MaskGCT, on the LibriSpeech test-clean set in terms of speech quality, speaker similarity, and intelligibility, while achieving up to ten times faster inference speed. Audio samples are available at https://microsoft.com/research/project/vall-e-x/palle.
title Pseudo-Autoregressive Neural Codec Language Models for Efficient Zero-Shot Text-to-Speech Synthesis
topic Audio and Speech Processing
Computation and Language
url https://arxiv.org/abs/2504.10352