TTS-1 Technical Report
We introduce Inworld TTS-1, a set of two Transformer-based autoregressive text-to-speech (TTS) models. Our largest model, TTS-1-Max, has 8.8B parameters and is designed for utmost quality and expressiveness in demanding applications. TTS-1 is our most efficient model, with 1.6B parameters, built for real-time speech synthesis and on-device use cases. By scaling train-time compute and applying a sequential process of pre-training, fine-tuning, and RL-alignment of the speech-language model (SpeechLM) component, both models achieve state-of-the-art performance on a variety of benchmarks, demonstrating exceptional quality relying purely on in-context learning of the speaker's voice. Inworld TTS-1 and TTS-1-Max can generate high-resolution 48 kHz speech with low latency, and support 11 languages with fine-grained emotional control and non-verbal vocalizations through audio markups. We additionally open-source our training and modeling code under an MIT license.
Code (0)
등록된 구현이 없습니다.
Tasks
Speech SynthesisSimilar Papers 제목 키워드 기반
Spectral Toolkit of Algorithms for Graphs: Technical Report (2)
Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient graph algorithms. This technical report presents the newly implemented component on locality sensitive hashing, kernel density esti…
ClusteringDensity EstimationDuplicate Bug Report Detection With a Combination of Information Retrieval and Topic Modeling
Detecting duplicate bug reports helps reduce triaging efforts and save time for developers in fixing the same issues. Among several automated detection approaches, text-based information retrieval (IR) approaches have be…
DescriptiveInformation RetrievalRetrievalTechnical Report: The effect of Input Parameters on Falsification of Cyber-Physical Systems
The aim of this technical report is to investigate the effect of input parameters on the falsification of cyber-physical systems (CPSs).
Spectral Toolkit of Algorithms for Graphs: Technical Report (1)
Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient spectral graph algorithms, and its development starts in September 2022. We have so far finished the component on local graph clust…
ClusteringGraph ClusteringTechnical Report with Proofs for A Full Picture in Conformance Checking: Efficiently Summarizing All Optimal Alignments
This technical report provides proofs for the claims in the paper "A Full Picture in Conformance Checking: Efficiently Summarizing All Optimal Alignments".
All