Contrastive Information Maximization Clustering for Self-Supervised Speaker Recognition
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Pseudo-labels (PLs) generated through clustering are extensively employed to optimize speaker embedding (SE) networks and to train self-supervised speaker verification (SV) systems. However, the effectiveness of PL-based self-supervised training is contingent on the quality of the PLs, and achieving high clustering performance often requires time-consuming and resource-intensive data augmentation regularization. In this paper, we introduce an efficient, general-purpose multi-objective clustering algorithm that outperforms all other baseline methods for clustering SEs. Our approach, named Contrastive Information Maximization Clustering (CIMC), circumvents the need for explicit data augmentation, enabling rapid training with minimal memory and computational resource usage. CIMC is founded on three key principles: (1) Self-Augmented Training, which ensures representation invariance and maximizes the information-theoretic dependency between samples and their predicted PLs (2) Virtual Mixup Training, which enforces local-Lipschitzness and upholds the cluster assumption (3) Supervised contrastive learning, which fosters the learning of more discriminative features and enhances robustness to natural corruptions by bringing together samples of the same class while separating those of different clusters. We present a comprehensive comparative analysis of our clustering method against baselines using various clustering metrics, conduct an ablation study to assess the contribution of each component, and demonstrate that our multi-objective approach provides beneficial complementary information. Furthermore, utilizing the generated PLs to train our SE system enables us to achieve high SV performance.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it