NPLDA: A Deep Neural PLDA Model for Speaker Verification
Not on the map. Why?
Abstract (arXiv)
The state-of-art approach for speaker verification consists of a neural network based embedding extractor along with a backend generative model such as the Probabilistic Linear Discriminant Analysis (PLDA). In this work, we propose a neural network approach for backend modeling in speaker recognition. The likelihood ratio score of the generative PLDA model is posed as a discriminative similarity function and the learnable parameters of the score function are optimized using a verification cost. The proposed model, termed as neural PLDA (NPLDA), is initialized using the generative PLDA model parameters. The loss function for the NPLDA model is an approximation of the minimum detection cost function (DCF). The speaker recognition experiments using the NPLDA model are performed on the speaker verificiation task in the VOiCES datasets as well as the SITW challenge dataset. In these experiments, the NPLDA model optimized using the proposed loss function improves significantly over the state-of-art PLDA based speaker verification system.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3.
4 papers.
- 2021Optimized Power Normalized Cepstral Coefficients towards Robust Deep Speaker Verificationcited by 2
- 2022Optimizing Tandem Speaker Verification and Anti-Spoofing Systemscited by 1
- 2022Learnable Nonlinear Compression for Robust Speaker Verificationcited by 0
- 2022I4U System Description for NIST SRE'20 CTS Challengecited by 0
- 2022I4U System Description for NIST SRE'20 CTS Challenge2 Nov 2022
- 2022Learnable Nonlinear Compression for Robust Speaker Verification10 Feb 2022
- 2022Optimizing Tandem Speaker Verification and Anti-Spoofing Systems24 Jan 2022
- 2021Optimized Power Normalized Cepstral Coefficients towards Robust Deep Speaker Verification24 Sep 2021