Relevance vector machines with empirical likelihood-ratio kernels for PLDA speaker verification

Previous works have shown the benefits of empirical likelihood ratio (LR) kernels for i-vector/PLDA speaker verification. The method not only utilizes the multiple enrollment utterances of target speakers effectively, but also opens up opportunity for adopting sparse kernel machines for PLDA-based speaker verification systems. This paper proposes taking the advantages of the empirical LR kernels by incorporating them into relevance vector machines (RVMs). Results on NIST 2012 SRE demonstrate that the performance of RVM regression equipped with empirical LR kernels is slightly better than that of the support vector machines after performing utterance partitioning.