Unsupervised Evaluation of Deep Audio Embeddings for Music Structure Analysis

• URL: http://arxiv.org/abs/2603.27218v1
• Date: Sat, 28 Mar 2026 10:18:54 GMT
• Title: Unsupervised Evaluation of Deep Audio Embeddings for Music Structure Analysis
• Abstract summary: Music Structure Analysis (MSA) aims to uncover the high-level organization of musical pieces.<n>We propose an unsupervised evaluation of nine open-source, generic pre-trained deep audio models, on MSA.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Music Structure Analysis (MSA) aims to uncover the high-level organization of musical pieces. State-of-the-art methods are often based on supervised deep learning, but these methods are bottlenecked by the need for heavily annotated data and inherent structural ambiguities. In this paper, we propose an unsupervised evaluation of nine open-source, generic pre-trained deep audio models, on MSA. For each model, we extract barwise embeddings and segment them using three unsupervised segmentation algorithms (Foote's checkerboard kernels, spectral clustering, and Correlation Block-Matching (CBM)), focusing exclusively on boundary retrieval. Our results demonstrate that modern, generic deep embeddings generally outperform traditional spectrogram-based baselines, but not systematically. Furthermore, our unsupervised boundary estimation methodology generally yields stronger performance than recent linear probing baselines. Among the evaluated techniques, the CBM algorithm consistently emerges as the most effective downstream segmentation method. Finally, we highlight the artificial inflation of standard evaluation metrics and advocate for the systematic adoption of ``trimming'', or even ``double trimming'' annotations to establish more rigorous MSA evaluation standards.

Related papers

• TaxCE : A Framework for Automated Taxonomy Construction and Evaluation at Scale [0.992650024444822]
  TaxCE is a fully automated framework for organizing unstructured feedback text into hierarchical taxonomy.<n>We introduce three corpus-grounded evaluation metrics, Exclusivity, Exhaustivity, and Granularity (EEG), and integrate them into a metrics-in-the-loop iterative refinement mechanism.
  arXiv  Detail & Related papers  (2026-08-31T11:25:25Z)
• Bridging Classification and Reconstruction: Cooperative Time Series Anomaly Detection [10.243033517009184]
  Time series anomaly detection (TSAD) has long been a hot research topic in data mining.<n>Recent studies challenge the effectiveness of popular deep learning methods for TSAD.<n>This paper proposes a novel framework, CoAD, which unifies the two paradigms to leverage their complementary strengths.
  arXiv  Detail & Related papers  (2026-05-25T15:19:17Z)
• Beyond the Academic Monoculture: A Unified Framework and Industrial Perspective for Attributed Graph Clustering [75.50670592447219]
  Attributed Graph Clustering (AGC) is a fundamental unsupervised task that partitions nodes into cohesive groups by jointly modeling structural topology and node attributes.<n>This survey provides a comprehensive, industrially grounded review of AGC from three complementary perspectives.
  arXiv  Detail & Related papers  (2026-03-21T14:15:34Z)
• Generalizing Abstention for Noise-Robust Learning in Medical Image Segmentation [2.597921446818458]
  abstention mechanism has proven effective in classification tasks by enhancing the capabilities of Cross Entropy.<n>We introduce a universal and modular abstention framework capable of enhancing the noise-robustness of a diverse range of loss functions.<n>Our framework improves upon prior work with two key components: an informed regularization term to guide abstention behaviour, and a more flexible power-law-based auto-tuning algorithm for the abstention penalty.
  arXiv  Detail & Related papers  (2026-01-20T14:57:56Z)
• EReLiFM: Evidential Reliability-Aware Residual Flow Meta-Learning for Open-Set Domain Generalization under Noisy Labels [85.78886153628663]
  Open-Set Domain Generalization aims to enable deep learning models to recognize unseen categories in new domains.<n>Label noise hinders open-set domain generalization by corrupting source-domain knowledge.<n>We propose Evidential Reliability-Aware Residual Flow Meta-Learning (EReLiFM) to bridge domain gaps.
  arXiv  Detail & Related papers  (2025-10-14T16:23:11Z)
• Instance-Aware Robust Consistency Regularization for Semi-Supervised Nuclei Instance Segmentation [53.94176748542936]
  We propose an Instance-Aware Robust Consistency Regularization Network (IRCR-Net) for accurate instance-level nuclei segmentation.<n>We incorporate morphological prior knowledge of nuclei in pathological images and utilize these priors to assess the quality of pseudo-labels generated from unlabeled data.
  arXiv  Detail & Related papers  (2025-10-10T12:32:32Z)
• Rethinking Metrics and Benchmarks of Video Anomaly Detection [58.37571339811799]
  Video Anomaly Detection (VAD) aims to detect anomalies that deviate from expectation.<n>Existing VAD metrics are influenced by single annotation bias.<n>Existing benchmarks lack the capability to evaluate scene overfitting of fully/weakly-supervised algorithms.
  arXiv  Detail & Related papers  (2025-05-25T08:09:42Z)
• CSAD: Unsupervised Component Segmentation for Logical Anomaly Detection [10.716585855033347]
  We develop an unsupervised component segmentation technique that generates training labels for a lightweight segmentation network without human labeling. We achieve a detection AUROC of 95.3% in the MVTec LOCO AD dataset, which surpasses previous SOTA methods.
  arXiv  Detail & Related papers  (2024-08-28T08:27:41Z)
• Unifying Unsupervised Graph-Level Anomaly Detection and Out-of-Distribution Detection: A Benchmark [73.58840254552656]
  Unsupervised graph-level anomaly detection (GLAD) and unsupervised graph-level out-of-distribution (OOD) detection have received significant attention in recent years.<n>We present a underlinetextbfUnified underlinetextbfBenchmark for unsupervised underlinetextbfGraph-level underlinetextbfOOD and anomaunderlinetextbfLy underlinetextbfDetection (ourmethod)<n>Our benchmark encompasses 35 datasets
  arXiv  Detail & Related papers  (2024-06-21T04:07:43Z)
• Revisiting 3D Medical Scribble Supervision: Benchmarking Beyond Cardiac Segmentation [1.2238508261277228]
  Scribble supervision has emerged as a promising approach for reducing annotation costs in medical 3D segmentation.<n>This work aims to steer scribble supervision toward more practical, robust, and general methodologies for medical image segmentation.
  arXiv  Detail & Related papers  (2024-03-19T15:41:16Z)
• On Leave-One-Out Conditional Mutual Information For Generalization [122.2734338600665]
  We derive information theoretic generalization bounds for supervised learning algorithms based on a new measure of leave-one-out conditional mutual information (loo-CMI) Contrary to other CMI bounds, our loo-CMI bounds can be computed easily and can be interpreted in connection to other notions such as classical leave-one-out cross-validation. We empirically validate the quality of the bound by evaluating its predicted generalization gap in scenarios for deep learning.
  arXiv  Detail & Related papers  (2022-07-01T17:58:29Z)
• Unsupervised learning of disentangled representations in deep restricted kernel machines with orthogonality constraints [15.296955630621566]
  Constr-DRKM is a deep kernel method for the unsupervised learning of disentangled data representations. We quantitatively evaluate the proposed method's effectiveness in disentangled feature learning.
  arXiv  Detail & Related papers  (2020-11-25T11:40:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.