Skip to content
DraconiticResearch
Search Sources API
194,230 studies31 sourcesUpdated 10 min ago
PreprintCC BY-NC-SA 4.0arXiv

A Parameter-Free Few-Shot Evaluation for Elephant Vocalisation Classification

Abstract

We present a parameter-free episodic evaluation of nearest-centroid classification of elephant vocalisations on fixed pretrained embeddings, for the Elephant Voices (EV) and Linguistic Data Consortium (LDC) datasets. We ask not which embedding yields the best classifier trained on all labelled data, but how the simplest classifier performs as the number of exemplars per class varies. There are no learnable parameters, because each class is modelled as the mean of its support embeddings and each query is assigned to the nearest centroid under squared Euclidean distance. Evaluation covers the fixed Perch (ver. 1), Perch (ver. 2) and HuBERT (base, layer 2) embeddings, alongside mel frequency cepstral coefficient (MFCC) features, N-way k-shot, under the same stratified K-fold cross-validation protocol as the trained classifiers. None of these embedding models was trained to distinguish elephant call types. On the smaller EV dataset the centroid classifier is markedly data-efficient. Using Perch (ver. 1) or Perch (ver. 2) embeddings it overtakes in mean average precision (mAP) the fully-trained logistic regression (LR) baseline from one or two exemplars and the recurrent baseline from two. Over the reduced set of call types on which the strongly-supervised end-to-end baseline was trained, the centroid classifier using Perch (ver. 2) embeddings overtakes that baseline in mAP as well, from two exemplars. On the larger LDC dataset the recurrent baselines retain their advantage for all considered values of k. Only LR is overtaken, and only in mAP. Nearest-centroid classification is therefore preferable precisely when exemplars are few and the fixed embedding already separates the call types.

Related

  1. A training protocol for human classification of Asian elephant images from trail cameras
    F. Daecher, S. Venkatesh, A. Ayan +5
    bioRxivPreprintCC BY-NC-NDFull textEcologybioRxiv
  2. MI-PEFT: Mixture-of-Experts Integrated Parameter-Efficient Fine-Tuning Protein Language Models Improves Acidophilic Proteins Classification
    Honghan Shen
    arXivPreprintCC BY 4.0Full textBioinformatics & computational biologyarXiv
  3. Advancing sustainable agriculture through multi-parameter fuzzy soft set–based plant disease classification
    D. Rajalakshmi, K. Kannan, A. Menaga +2
    Scientific ReportsPeer-reviewedCC BYFull textPlant biologyDOAJ
  4. PSAFM: A parameter-free spatial attention fusion module
    Guangjun Liu, Xiaoping Xu, Bingkun Zhou +2
    PLOS OnePeer-reviewedCC BY 4.0Full textNeurosciencePLOS
  5. Comparing attenuation parameter and liver stiffness measurement using Hepatus and Fibroscan for the evaluation of steatosis and fibrosis in patients with chronic liver disease: A prospective study
    Cain-En Lim, Ram Prasad Sinnanaidu, Xin Tong Ng +4
    PLOS OnePeer-reviewedCC BY 4.0Developmental biologyPhysiologyPLOS
BibTeX
@misc{geldenhuys2026parameterfree,
  title = {{A Parameter-Free Few-Shot Evaluation for Elephant Vocalisation Classification}},
  author = {Christiaan M. Geldenhuys and Thomas R. Niesler},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2608.14824},
  eprint = {2608.14824},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.14824},
  note = {CC BY-NC-SA 4.0},
}
RIS
TY  - UNPB
TI  - A Parameter-Free Few-Shot Evaluation for Elephant Vocalisation Classification
AU  - Christiaan M. Geldenhuys
AU  - Thomas R. Niesler
PY  - 2026
DA  - 2026/09/23
PB  - arXiv
DO  - 10.48550/arxiv.2608.14824
UR  - https://arxiv.org/abs/2608.14824
AB  - We present a parameter-free episodic evaluation of nearest-centroid classification of elephant vocalisations on fixed pretrained embeddings, for the Elephant Voices (EV) and Linguistic Data Consortium (LDC) datasets. We ask not which embedding yields the best classifier trained on all labelled data, but how the simplest classifier performs as the number of exemplars per class varies. There are no learnable parameters, because each class is modelled as the mean of its support embeddings and each query is assigned to the nearest centroid under squared Euclidean distance. Evaluation covers the fixed Perch (ver. 1), Perch (ver. 2) and HuBERT (base, layer 2) embeddings, alongside mel frequency cepstral coefficient (MFCC) features, N-way k-shot, under the same stratified K-fold cross-validation protocol as the trained classifiers. None of these embedding models was trained to distinguish elephant call types. On the smaller EV dataset the centroid classifier is markedly data-efficient. Using Perch (ver. 1) or Perch (ver. 2) embeddings it overtakes in mean average precision (mAP) the fully-trained logistic regression (LR) baseline from one or two exemplars and the recurrent baseline from two. Over the reduced set of call types on which the strongly-supervised end-to-end baseline was trained, the centroid classifier using Perch (ver. 2) embeddings overtakes that baseline in mAP as well, from two exemplars. On the larger LDC dataset the recurrent baselines retain their advantage for all considered values of k. Only LR is overtaken, and only in mAP. Nearest-centroid classification is therefore preferable precisely when exemplars are few and the fixed embedding already separates the call types.
ER  -