Papers › Probabilistic embeddings for speaker diarization

Probabilistic embeddings for speaker diarization

6 Apr 2020arXiv:2004.04096archive 2025-07-28

Anna Silnova, Niko Brümmer, Johan Rohdin, Themos Stafylakis, Lukáš Burget

Speaker embeddings (x-vectors) extracted from very short segments of speech have recently been shown to give competitive performance in speaker diarization. We generalize this recipe by extracting from each speech segment, in parallel with the x-vector, also a diagonal precision matrix, thus providing a path for the propagation of information about the quality of the speech segment into a PLDA scoring backend. These precisions quantify the uncertainty about what the values of the embeddings might have been if they had been extracted from high quality speech segments. The proposed probabilistic embeddings (x-vectors with precisions) are interfaced with the PLDA model by treating the x-vectors as hidden variables and marginalizing them out. We apply the proposed probabilistic embeddings as input to an agglomerative hierarchical clustering (AHC) algorithm to do diarization in the DIHARD'19 evaluation set. We compute the full PLDA likelihood 'by the book' for each clustering hypothesis that is considered by AHC. We do joint discriminative training of the PLDA parameters and of the probabilistic x-vector extractor. We demonstrate accuracy gains relative to a baseline AHC algorithm, applied to traditional xvectors (without uncertainty), and which uses averaging of binary log-likelihood-ratios, rather than by-the-book scoring.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2004.04096")

Code

Syntology Ran 0 of 21 code samples harvested from 1 repository linked to this paper; 21 have no recorded run.

By repository: official repository: 21 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

bsxfan/probabilistic_embeddings officialmentioned in papermentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

21 samples harvested; 0 ran; 0 honoured the contract we drafted; 21 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

21unverified

Licence: 0 of the 21 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from bsxfan/probabilistic_embeddings. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

PartitionsAsBlocklabels bsxfan/probabilistic_embeddings/lib/combin/partitions.py official repository unverified MIT (permissive) · 84e5da8d52aeb6f6 · report
blocklabels_to_flagvector bsxfan/probabilistic_embeddings/lib/combin/partitions.py official repository unverified MIT (permissive) · ff70ee27c442a857 · report
cs bsxfan/probabilistic_embeddings/lib/deriv/adtools.py official repository unverified MIT (permissive) · 2f2a728ee2342d83 · report
cs_erfinv bsxfan/probabilistic_embeddings/lib/special/erf_tools.py official repository unverified MIT (permissive) · 1968757262788202 · report
erf bsxfan/probabilistic_embeddings/lib/special/erf_tools.py official repository unverified MIT (permissive) · d504382c533f0747 · report
erf_and_logderiv bsxfan/probabilistic_embeddings/lib/special/erf_tools.py official repository unverified MIT (permissive) · 3305ad9c04c0c4ba · report
k012e bsxfan/probabilistic_embeddings/lib/special/besselk.py official repository unverified MIT (permissive) · 43809375625a7a32 · report
k0e bsxfan/probabilistic_embeddings/lib/special/besselk.py official repository unverified MIT (permissive) · df374dee154cb865 · report
k1e bsxfan/probabilistic_embeddings/lib/special/besselk.py official repository unverified MIT (permissive) · 9ef74bb813161dd7 · report
labels_to_1hotmatrix bsxfan/probabilistic_embeddings/lib/combin/partitions.py official repository unverified MIT (permissive) · 5d6e193b04f14b0a · report
logprob_alpha bsxfan/probabilistic_embeddings/lib/prob/crp.py official repository unverified MIT (permissive) · b89ae8ae46f97e4e · report
logprob_alpha_beta bsxfan/probabilistic_embeddings/lib/prob/crp.py official repository unverified MIT (permissive) · 1d37d674cf3f39f3 · report
logprob_beta bsxfan/probabilistic_embeddings/lib/prob/crp.py official repository unverified MIT (permissive) · a6571a54ed4fb4d9 · report
logsumexp bsxfan/probabilistic_embeddings/lib/deriv/adfunctions.py official repository unverified MIT (permissive) · f64ca25c9836a19a · report
raug bsxfan/probabilistic_embeddings/lib/deriv/adtools.py official repository unverified MIT (permissive) · 8f2cd7ed3c038987 · report
rdot bsxfan/probabilistic_embeddings/lib/deriv/adtools.py official repository unverified MIT (permissive) · 4d6df300e2ac88a3 · report
softplus bsxfan/probabilistic_embeddings/lib/special/softplus.py official repository unverified MIT (permissive) · d82cc22f6cca675b · report
softplusinv bsxfan/probabilistic_embeddings/lib/special/softplus.py official repository unverified MIT (permissive) · e4239541a6ea39c3 · report
squeeze bsxfan/probabilistic_embeddings/lib/deriv/adfunctions.py official repository unverified MIT (permissive) · e56c64810abf04fe · report
sum2sh bsxfan/probabilistic_embeddings/lib/deriv/broadcast_adtools.py official repository unverified MIT (permissive) · 3bcb697e90534a24 · report
sum2shape bsxfan/probabilistic_embeddings/lib/deriv/broadcast_adtools.py official repository unverified MIT (permissive) · f606a62d87466fd7 · report

Tasks

ClusteringSpeaker Diarizationspeaker-diarization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections