Graph-based Label Propagation for Semi-Supervised Speaker Identification
Authors: Long Chen, Venkatesh Ravichandran, Andreas Stolcke
AI-generated Key Points
- The paper addresses the challenge of speaker identification in the household scenario, specifically for smart speakers.
- Existing methods rely on a limited number of enrollment utterances and a larger set of unlabeled data.
- The authors propose a graph-based semi-supervised learning approach to improve speaker profiles.
- Unlike most existing works, this study emphasizes speaker label inference or scoring rather than speaker-discriminative embeddings.
- A pre-trained embedding extractor is used, and graph-based learning integrates information from labeled and unlabeled utterances.
- Utterances are considered as graph nodes, and pairwise utterance similarity scores are represented as edge weights.
- Graphs are constructed per household, and speaker identities are propagated to unlabeled nodes to optimize global consistency criterion.
- Experiments using the VoxCeleb dataset demonstrate that the proposed method effectively utilizes unlabeled data and improves speaker identification accuracy compared to two state-of-the-art scoring methods.
- The proposed method outperforms semi-supervised variants based on pseudo-labels.
- In conclusion, the paper presents a novel graph-based semi-supervised learning approach for speaker identification in the household scenario.
Abstract: Speaker identification in the household scenario (e.g., for smart speakers) is typically based on only a few enrollment utterances but a much larger set of unlabeled data, suggesting semisupervised learning to improve speaker profiles. We propose a graph-based semi-supervised learning approach for speaker identification in the household scenario, to leverage the unlabeled speech samples. In contrast to most of the works in speaker recognition that focus on speaker-discriminative embeddings, this work focuses on speaker label inference (scoring). Given a pre-trained embedding extractor, graph-based learning allows us to integrate information about both labeled and unlabeled utterances. Considering each utterance as a graph node, we represent pairwise utterance similarity scores as edge weights. Graphs are constructed per household, and speaker identities are propagated to unlabeled nodes to optimize a global consistency criterion. We show in experiments on the VoxCeleb dataset that this approach makes effective use of unlabeled data and improves speaker identification accuracy compared to two state-of-the-art scoring methods as well as their semi-supervised variants based on pseudo-labels.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.