Disentangled Multidimensional Metric Learning for Music Similarity

• URL: http://arxiv.org/abs/2008.03720v2
• Date: Wed, 12 Aug 2020 21:54:00 GMT
• Title: Disentangled Multidimensional Metric Learning for Music Similarity
• Authors: Jongpil Lee, Nicholas J. Bryan, Justin Salamon, Zeyu Jin, Juhan Nam
• Abstract summary: Music similarity search is useful for replacing one music recording with another recording with a similar "feel" Music similarity is hard to define and depends on multiple simultaneous notions of similarity. We introduce the concept of multidimensional similarity and unify both global and specialized similarity metrics into a single metric.
• Score: 36.74680586571013
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Music similarity search is useful for a variety of creative tasks such as replacing one music recording with another recording with a similar "feel", a common task in video editing. For this task, it is typically necessary to define a similarity metric to compare one recording to another. Music similarity, however, is hard to define and depends on multiple simultaneous notions of similarity (i.e. genre, mood, instrument, tempo). While prior work ignore this issue, we embrace this idea and introduce the concept of multidimensional similarity and unify both global and specialized similarity metrics into a single, semantically disentangled multidimensional similarity metric. To do so, we adapt a variant of deep metric learning called conditional similarity networks to the audio domain and extend it using track-based information to control the specificity of our model. We evaluate our method and show that our single, multidimensional model outperforms both specialized similarity spaces and alternative baselines. We also run a user-study and show that our approach is favored by human annotators as well.

Related papers

• GSSF: Generalized Structural Sparse Function for Deep Cross-modal Metric Learning [51.677086019209554]
  We propose a Generalized Structural Sparse to capture powerful relationships across modalities for pair-wise similarity learning. The distance metric delicately encapsulates two formats of diagonal and block-diagonal terms. Experiments on cross-modal and two extra uni-modal retrieval tasks have validated its superiority and flexibility.
  arXiv  Detail & Related papers  (2024-10-20T03:45:50Z)
• Towards Universality: Studying Mechanistic Similarity Across Language Model Architectures [49.24097977047392]
  We investigate two mainstream architectures for language modeling, namely Transformers and Mambas, to explore the extent of their mechanistic similarity. We propose to use Sparse Autoencoders (SAEs) to isolate interpretable features from these models and show that most features are similar in these two models.
  arXiv  Detail & Related papers  (2024-10-09T08:28:53Z)
• A Computational Analysis of Lyric Similarity Perception [1.1510009152620668]
  We conduct a comparative analysis of computational methods for modeling lyric similarity with human perception. Results indicated that computational models based on similarities between embeddings from pre-trained BERT-based models, the audio from which the lyrics are derived, and phonetic components are indicative of perceptual lyric similarity.
  arXiv  Detail & Related papers  (2024-04-02T22:31:38Z)
• Self-Supervised Representation Learning With MUlti-Segmental Informational Coding (MUSIC) [6.693379403133435]
  Self-supervised representation learning maps high-dimensional data into a meaningful embedding space. We propose MUlti-Segmental Informational Coding (MUSIC) for self-supervised representation learning.
  arXiv  Detail & Related papers  (2022-06-13T20:37:48Z)
• Attributable Visual Similarity Learning [90.69718495533144]
  This paper proposes an attributable visual similarity learning (AVSL) framework for a more accurate and explainable similarity measure between images. Motivated by the human semantic similarity cognition, we propose a generalized similarity learning paradigm to represent the similarity between two images with a graph. Experiments on the CUB-200-2011, Cars196, and Stanford Online Products datasets demonstrate significant improvements over existing deep similarity learning methods.
  arXiv  Detail & Related papers  (2022-03-28T17:35:31Z)
• Generalized quantum similarity learning [0.0]
  We propose using quantum networks (GQSim) for learning task-dependent (a)symmetric similarity between data that need not have the same dimensionality. We demonstrate that the similarity measure derived using this technique is $(epsilon,gamma,tau)$-good, resulting in theoretically guaranteed performance.
  arXiv  Detail & Related papers  (2022-01-07T03:28:19Z)
• MNet-Sim: A Multi-layered Semantic Similarity Network to Evaluate Sentence Similarity [0.0]
  Similarity is a comparative-subjective measure that varies with the domain within which it is considered. This paper presents a multi-layered semantic similarity network model built upon multiple similarity measures. It is shown to have demonstrated better performance scores in assessing sentence similarity.
  arXiv  Detail & Related papers  (2021-11-09T20:43:18Z)
• A framework to compare music generative models using automatic evaluation metrics extended to rhythm [69.2737664640826]
  This paper takes the framework proposed in a previous research that did not consider rhythm to make a series of design decisions, then, rhythm support is added to evaluate the performance of two RNN memory cells in the creation of monophonic music. The model considers the handling of music transposition and the framework evaluates the quality of the generated pieces using automatic quantitative metrics based on geometry which have rhythm support added as well.
  arXiv  Detail & Related papers  (2021-01-19T15:04:46Z)
• Few-shot Visual Reasoning with Meta-analogical Contrastive Learning [141.2562447971]
  We propose to solve a few-shot (or low-shot) visual reasoning problem, by resorting to analogical reasoning. We extract structural relationships between elements in both domains, and enforce them to be as similar as possible with analogical learning. We validate our method on RAVEN dataset, on which it outperforms state-of-the-art method, with larger gains when the training data is scarce.
  arXiv  Detail & Related papers  (2020-07-23T14:00:34Z)

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.