Decoding Order Matters in Autoregressive Speech Synthesis
Minghui Zhao, Anton Ragni
TL;DR
This work investigates decoding order as a modelling choice in autoregressive speech synthesis and shows that left-to-right generation is not universally optimal. It introduces a Masked Diffusion Model (MDM) that enables arbitrary decoding orders and develops order-agnostic training and several adaptive decoding strategies, including Top-$K$ and duration-guided decoding, as well as a quantisation scheme for discrete inputs. The experiments on LJSpeech demonstrate that adaptive decoding often outperforms fixed orders, with duration-based strategies delivering strong objective and perceptual scores, while partial randomness can balance spectral fidelity and pitch. The study also reveals that speech can be effectively synthesised from discrete Mel representations, even at very low bit-depth, when paired with a robust vocoder like HiFi-GAN, highlighting practical avenues for efficient, flexible TTS systems.
Abstract
Autoregressive speech synthesis often adopts a left-to-right order, yet generation order is a modelling choice. We investigate decoding order through masked diffusion framework, which progressively unmasks positions and allows arbitrary decoding orders during training and inference. By interpolating between identity and random permutations, we show that randomness in decoding order affects speech quality. We further compare fixed strategies, such as \texttt{l2r} and \texttt{r2l} with adaptive ones, such as Top-$K$, finding that fixed-order decoding, including the dominating left-to-right approach, is suboptimal, while adaptive decoding yields better performance. Finally, since masked diffusion requires discrete inputs, we quantise acoustic representations and find that even 1-bit quantisation can support reasonably high-quality speech.
