Unsupervised keyword spotting using bounded generalized Gaussian mixture model with ICA
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
In this paper, bounded generalized Gaussian mixture model (BGGMM) using independent component analysis (ICA) is proposed and applied to an existing unsupervised keyword spotting setting for the generation of posteriorgrams. The ICA mixture model is trained without any transcription information to generate the posteriorgrams which further labels the speech frames of the keyword example(s) and test data. For the detection of occurrence of a specific keyword in the test data, the posteriorgrams of one or more keyword examples are compared with the posteriorgrams of test utterances using the segmental dynamic time warping (DTW). A score fusion method is used to obtain the result of the keyword detection by ranking the distortion scores of all the test utterances. The TIMIT speech corpus is used for the evaluation of this unsupervised keyword spotting setting. The keyword detection results demonstrate the viability and effectiveness of the proposed algorithm in unsupervised keyword spotting framework.
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.001 | 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