MLLGMar 28, 2022

Probabilistic Spherical Discriminant Analysis: An Alternative to PLDA for length-normalized embeddings

arXiv:2203.14893v16 citationsh-index: 30
Originality Incremental advance
AI Analysis

This work addresses a specific bottleneck in speaker recognition systems for applications like verification and diarization, offering an incremental improvement over existing methods.

The authors tackled the mismatch between length-normalized embeddings and PLDA assumptions in speaker recognition by proposing PSDA, a probabilistic model using Von Mises-Fisher distributions on the hypersphere, which achieved competitive performance as a drop-in replacement for PLDA.

In speaker recognition, where speech segments are mapped to embeddings on the unit hypersphere, two scoring backends are commonly used, namely cosine scoring or PLDA. Both have advantages and disadvantages, depending on the context. Cosine scoring follows naturally from the spherical geometry, but for PLDA the blessing is mixed -- length normalization Gaussianizes the between-speaker distribution, but violates the assumption of a speaker-independent within-speaker distribution. We propose PSDA, an analogue to PLDA that uses Von Mises-Fisher distributions on the hypersphere for both within and between-class distributions. We show how the self-conjugacy of this distribution gives closed-form likelihood-ratio scores, making it a drop-in replacement for PLDA at scoring time. All kinds of trials can be scored, including single-enroll and multi-enroll verification, as well as more complex likelihood-ratios that could be used in clustering and diarization. Learning is done via an EM-algorithm with closed-form updates. We explain the model and present some first experiments.

Code Implementations3 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes