SSPS: Self-Supervised Positive Sampling for Robust Self-Supervised Speaker Verification

Theo Lepage, Reda Dehak
5/20/2025
eess.AScs.AIcs.LG

No official code found. Best implementation: theolepage/sslsv (41 stars, MIT, PyTorch, last commit 2026-02-12).

Abstract

Self-Supervised Learning (SSL) has led to considerable progress in Speaker Verification (SV). The standard framework uses same-utterance positive sampling and data-augmentation to generate anchor-positive pairs of the same speaker. This is a major limitation, as this strategy primarily encodes channel information from the recording condition, shared by the anchor and positive. We propose a new positive sampling technique to address this bottleneck: Self-Supervised Positive Sampling (SSPS). For a given anchor, SSPS aims to find an appropriate positive, i.e., of the same speaker identity but a different recording condition, in the latent space using clustering assignments and a memory queue of positive embeddings. SSPS improves SV performance for both SimCLR and DINO, reaching 2.57% and 2.53% EER, outperforming SOTA SSL methods on VoxCeleb1-O. In particular, SimCLR-SSPS achieves a 58% EER reduction by lowering intra-speaker variance, providing comparable performance to DINO-SSPS.

View on arXivView PDF

Code Implementations(1)

theolepage/sslsvCommunity100%
PyTorchMIT

Toolkit for training and evaluating Self-Supervised Learning (SSL) frameworks for Speaker Verification (SV).

419Shell, PythonJun 23, 20228 months agoMIT
barlowtwinsbyolcpcdeep-learningdeepcluster+15 more

Similar Papers

Cite this paper

@article{lepage2025ssps,
  title  = {SSPS: Self-Supervised Positive Sampling for Robust Self-Supervised Speaker Verification},
  author = {Theo Lepage and Reda Dehak},
  year   = {2025},
  eprint = {2505.14561},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.14561v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.14561.svg)](https://codeofpaper.com/paper/2505.14561)

Discussion