In defence of metric learning for speaker recognition

• Published in: arXiv.org
• Main Authors: Joon Son Chung, Huh, Jaesung, Mun, Seongkyu, Lee, Minjae, Heo, Hee Soo, Choe, Soyeon, Ham, Chiheon, Jung, Sunghwan, Bong-Jin, Lee, Han, Icksang
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 24.04.2020
• Subjects: Classification; Computer Science - Sound; Learning; Speech recognition
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.2003.11982

The objective of this paper is 'open-set' speaker recognition of unseen speakers, where ideal embeddings should be able to condense information into a compact utterance-level representation that has small intra-speaker and large inter-speaker distance. A popular belief in speaker recognition is that networks trained with classification objectives outperform metric learning methods. In this paper, we present an extensive evaluation of most popular loss functions for speaker recognition on the VoxCeleb dataset. We demonstrate that the vanilla triplet loss shows competitive performance compared to classification-based losses, and those trained with our proposed metric learning objective outperform state-of-the-art methods.