Generalized Domain Adaptation Framework For Parametric Back-end In Speaker Recognition

Abstract

State-of-the-art speaker recognition systems comprise a speaker embedding front-end followed by a probabilistic linear discriminant analysis (PLDA) back-end. The effectiveness of these components relies on the availability of a large amount of labeled training data. In practice, it is common for domains (e.g., language, channel, demographic) in which a system is deployed to differ from that in which a system has been trained. To close the resulting gap, domain adaptation is often essential for PLDA models. Among two of its variants are Heavy-tailed PLDA (HT-PLDA) and Gaussian PLDA (G-PLDA). Though the former better fits real feature spaces than does the latter, its popularity has been severely limited by its computational complexity and, especially, by the difficulty, it presents in domain adaptation, which results from its non-Gaussian property. Various domain adaptation methods have been proposed for G-PLDA. This paper proposes a generalized framework for domain adaptation that can b

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keywang2023generalized

Related papers

• A Generalized Framework For Domain Adaptation Of PLDA In Speaker Recognition (2020)7.50
• Domain Adaptation Based Speaker Recognition On Short Utterances (2016)0.00
• The CORAL+ Algorithm For Unsupervised Domain Adaptation Of PLDA (2018)13.11
• Bayesian Learning For Deep Neural Network Adaptation (2020)9.76
• Large-scale Learning Of Generalised Representations For Speaker Recognition (2022)0.00
• Adversarial Training For Multi-domain Speaker Recognition (2020)6.77
• Vae-based Domain Adaptation For Speaker Verification (2019)7.50
• Multi-domain Adaptation By Self-supervised Learning For Speaker Verification (2023)0.00