<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>MuRS</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Towards Leveraging Contrastively Pretrained Neural Audio Embeddings for Recommender Tasks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Florian Grötschla</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luca Strässle</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luca A. Lanzendörfer</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roger Wattenhofer</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ETH Zurich</institution>
          ,
          <country country="CH">Switzerland</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <volume>2</volume>
      <fpage>0009</fpage>
      <lpage>0009</lpage>
      <abstract>
        <p>Music recommender systems frequently utilize network-based models to capture relationships between music pieces, artists, and users. Although these relationships provide valuable insights for predictions, new music pieces or artists often face the cold-start problem due to insuficient initial information. To address this, one can extract content-based information directly from the music to enhance collaborative-filtering-based methods. While previous approaches have relied on hand-crafted audio features for this purpose, we explore the use of contrastively pretrained neural audio embedding models, which ofer a richer and more nuanced representation of music. Our experiments demonstrate that neural embeddings, particularly those generated with the Contrastive Language-Audio Pretraining (CLAP) model, present a promising approach to enhancing music recommendation tasks within graph-based frameworks.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Music recommendation</kwd>
        <kwd>graph neural network</kwd>
        <kwd>contrastive learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Music and artist recommendations have become a cornerstone of streaming services, profoundly
inlfuencing how users discover and engage with music. Algorithmically generated playlists, tailored to
individual tastes, are integral to the listening experience, enabling users to find music that suits their
mood and environment, as well as discover new artists. For artists, inclusion in these playlists can
significantly boost their listener base, while exclusion poses challenges for discovery. Music
recommendation systems can be broadly categorized into collaborative filtering-based approaches [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and
content-based approaches [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Collaborative filtering leverages relational data, capturing relationships
between artists or tracks from manually curated similarities, tags, and user listening behavior.
Contentbased approaches utilize descriptive data to encapsulate the essence of an artist’s music, representing
attributes like melody, harmony, and rhythm. Hybrid recommender systems [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ] combine both types
of data to enhance recommendation quality. In recent years, contrastive learning approaches have
gained traction for their efectiveness in representing various types of data [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ]. One such model,
Contrastive Language-Audio Pretraining (CLAP) [7], maps text and audio into a joint multi-modal space,
ofering a novel method for representing music. Our work explores the utility of CLAP representations
as descriptive data in music recommendation systems.
      </p>
      <p>As a proof-of-concept, we examine a graph-based artist-relationship prediction task, where additional
musical information has previously enhanced model performance [8]. The goal is to predict relationships
between previously unseen artists using the attached information. By varying this information and
incorporating CLAP embeddings, we evaluate its utility in a controlled environment and benchmark
the efectiveness of diferent representations.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>Artist Similarity with Graph Neural Networks. Graph Neural Networks (GNNs) [9] extend deep
learning techniques to graph-structured data, addressing the limitations of traditional neural networks
that require structured inputs. GNNs operate on graphs defined by nodes and edges, leveraging message
passing to aggregate and update node information based on their neighbors. This approach has shown
success in tasks such as node classification, edge prediction, and graph classification [ 10]. GNNs lend
themselves to music recommender tasks as they can encode the structural, relational information
together with additional features [11, 12].</p>
      <p>The study by Korzeniowski et al. [8] introduces the OLGA dataset, which includes artist relations
from AllMusic1 and audio features from AcousticBrainz [13]. Their GNN architecture combines graph
convolution layers with fully connected layers and was trained with a triplet loss. Performance
evaluations on an artist similarity task demonstrated that incorporating graph layers and meaningful
artist features significantly improved prediction accuracy over using deep neural networks alone.
Neural Embeddings for Recommender Tasks. Various methods have been explored for music
similarity detection. Previous approaches used a graph autoencoder to learn latent representations in an
artist graph [14], or leveraging a Siamese DCNN model for feature extraction and genre classification [ 15].
Oramas et al. [16] use CNNs to extract music information, which, in contrast to our work, can not
benefit from contrastive pertaining. Furthermore, hybrid recommendation systems using GNNs have
been applied in other domains, such as predicting anime recommendations by combining user-anime
interaction graphs with BERT embeddings [17].</p>
      <p>Contrastive Language-Audio Pretraining (CLAP) [7] learns the (dis)similarity between audio and
text through contrastive learning, mapping both modalities into a joint multimodal space. Through
the contrastive learning approach, even the audio embeddings alone maintain semantic information,
making it suitable for tasks such as music recommendation and artist similarity.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Neural Audio Embeddings for Artist Relationships</title>
      <p>We investigate an established artist similarity task similar to the OLGA dataset to evaluate the
efectiveness of neural audio embeddings over classical audio features in music recommendation tasks. This
dataset comprises a large graph of artists, and the performance of our model is assessed based on its
ability to predict new relationships between previously unseen artists, represented as nodes within
the graph. Each node is annotated with features extracted from the music produced by the respective
artist. Previous research demonstrated that incorporating musical information significantly improves
model performance [8]. We extend this analysis by extracting CLAP embeddings from the music and
comparing their efectiveness against other feature sets. Our goal is to determine if CLAP embeddings
provide better representations.</p>
      <sec id="sec-3-1">
        <title>3.1. Experimental Setup</title>
        <p>Our setup is inspired by the approach of Korzeniowski et al. [8] on OLGA, where artists are represented
as connected nodes based on their relationships described in AllMusic. Following the same methodology,
we create an updated version of the original dataset. This allows us to ensure that the song for which we
extract features from AcousticBrainz is consistent with the song for which we create CLAP embeddings.
We start with the same set of artists and collect additional information during preprocessing, specifically
the categorical features for moods and themes of an artist, which we use during evaluation. Low-level
music features for songs were retrieved from AcousticBrainz, and CLAP embeddings were computed
using the LAION CLAP model from tracks on YouTube. In contrast to the original OLGA dataset, we
only use one song per artist and do not aggregate the features over multiple songs. Due to constantly
0.40
0.35
0.30
000.25
2
G@0.20
C
ND0.15
0.10
0.05 0.02
0.00
changing information on AllMusic, some artists without connections to other artists or missing matches
on MusicBrainz or AcousticBrainz had to be dropped. Overall, this reduced the total number of artists
from 17,673 in the original to 16,864 in our version. We reuse the split allocation of the OLGA dataset,
which is possible since every artist in our dataset is present in the OLGA dataset as well. This resulted in
13,489 artists in the training, 1,679 artists in the validation, and 1,696 artists in the test split. We utilize
the same loss functions and GNN backbone as proposed by Korzeniowski et al. [8], but with a uniform
sampling based on triplets instead of distance-weighted sampling. More specifically, we employed the
triplet loss, finding that using both endpoints as anchors performed better than randomly selecting
one endpoint. Euclidean distance was used for the loss, and the Normalized Discounted Cumulative
Gain (NDCG) serves for the evaluation. For the graph neural network layers, we experimented with
SAGE [18], GatedGCN [19], and GIN [20], with SAGE demonstrating the best performance.</p>
        <p>We vary two primary aspects in our experiments: the number of graph layers and the node features.
The number of graph layers ranges from zero to four and is varied to assess the contribution that the
graph topology can make to the task. With zero graph layers, the architecture only utilizes an MLP
to make predictions and does not consider the graph topology, thus serving as a baseline for models
that use GNN layers. As the number of graph layers increases, nodes can aggregate information from
a larger neighborhood, enhancing the model’s capacity to learn from the graph structure. For node
features, we use random features as a baseline and experimented with AcousticBrainz features, CLAP
features, and Moods-Themes features. We also test combinations of these non-random features.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Results</title>
        <p>tiveness. Our analysis in Figure 1b reveals that for lower layer numbers, the combination of features
can greatly increase performance in comparison to single features (as depicted in Figure 1a). For more
layers, the tested feature combinations approach the performance of the model that only uses CLAP
features. This could mean that the other features do not provide much additional value for the task or
that the information gained from the graph topology is suficient to compensate for it. Overall, feature
combinations that include CLAP perform better, while we can see a clear increase of AcousticBrainz +
Moods-Themes over the single feature baselines.</p>
        <p>Limitations Our experimental evaluation has two main limitations: the potential for model
architecture improvements and the limited representation of artists using only one song.</p>
        <p>First, regarding model architecture, there is room for enhancement through more advanced techniques,
such as distance-weighted sampling, more sophisticated GNN layers, or Graph Transformers. We
anticipate these improvements would likely lead to better overall performance. However, our conclusions
primarily focus on the relative performance gains of diferent feature sets. We believe these relative
diferences would remain consistent even with improved models and training techniques, though
absolute performance might increase.</p>
        <p>Second, we only use a single song to represent each artist. This approach could introduce variability
based on the choice of the song, potentially afecting the performance of the features. A more
comprehensive representation involving multiple songs per artist could provide a more robust understanding,
but this would require careful consideration of how to aggregate these song embeddings. Additionally,
there is potential for exploring diferent versions of CLAP or other audio embedding models.
Nevertheless, the fact that we achieved consistent performance gains even with just one song per artist
demonstrates the efectiveness of CLAP embeddings as a viable approach for music recommendation,
which was the primary objective of this study.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>In this work, we explored the use of CLAP embeddings as descriptive data for music recommendation
systems. Our experiments focused on a graph-based artist-relationship prediction task, comparing the
efectiveness of various feature representations, including AcousticBrainz, CLAP, and a combination of
both. Our results indicate that models incorporating CLAP embeddings significantly outperform those
using traditional features, particularly as the number of graph convolutional layers increases. This
highlights the potential of CLAP embeddings to capture rich and relevant information about music,
thereby enhancing the performance of music recommendation systems.
J. Clark, et al., Learning transferable visual models from natural language supervision, in:
International conference on machine learning, PMLR, 2021, pp. 8748–8763.
[7] Y. Wu, K. Chen, T. Zhang, Y. Hui, T. Berg-Kirkpatrick, S. Dubnov, Large-scale contrastive
languageaudio pretraining with feature fusion and keyword-to-caption augmentation, in: ICASSP 2023-2023
IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, 2023,
pp. 1–5.
[8] F. Korzeniowski, S. Oramas, F. Gouyon, Artist similarity with graph neural networks, arXiv
preprint arXiv:2107.14541 (2021).
[9] F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, G. Monfardini, The graph neural network
model, IEEE transactions on neural networks 20 (2008) 61–80.
[10] Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, S. Y. Philip, A comprehensive survey on graph neural
networks, IEEE transactions on neural networks and learning systems 32 (2020) 4–24.
[11] S. Oramas, V. C. Ostuni, T. D. Noia, X. Serra, E. D. Sciascio, Sound and music recommendation
with knowledge graphs, ACM Transactions on Intelligent Systems and Technology (TIST) 8 (2016)
1–21.
[12] H. Weng, J. Chen, D. Wang, X. Zhang, D. Yu, Graph-based attentive sequential model with metadata
for music recommendation, IEEE Access 10 (2022) 108226–108240.
[13] D. Bogdanov, A. Porter, H. Schreiber, J. Urbano, S. Oramas, The acousticbrainz genre dataset:
Multi-source, multi-level, multi-label, and large-scale, in: Proceedings of the 20th Conference
of the International Society for Music Information Retrieval (ISMIR 2019): 2019 Nov 4-8; Delft,
The Netherlands.[Canada]: ISMIR; 2019., International Society for Music Information Retrieval
(ISMIR), 2019.
[14] G. Salha-Galvan, R. Hennequin, B. Chapus, V.-A. Tran, M. Vazirgiannis, Cold start similar artists
ranking with gravity-inspired graph autoencoders, in: Proceedings of the 15th ACM Conference
on Recommender Systems, 2021, pp. 443–452.
[15] J. Park, J. Lee, J. Park, J.-W. Ha, J. Nam, Representation learning of music using artist labels, arXiv
preprint arXiv:1710.06648 (2017).
[16] S. Oramas, O. Nieto, M. Sordo, X. Serra, A deep multimodal approach for cold-start music
recommendation, in: Proceedings of the 2nd workshop on deep learning for recommender
systems, 2017, pp. 32–37.
[17] S. R. Javaji, K. Sarode, Hybrid recommendation system using graph neural network and bert
embeddings, arXiv preprint arXiv:2310.04878 (2023).
[18] W. Hamilton, Z. Ying, J. Leskovec, Inductive representation learning on large graphs, Advances in
neural information processing systems 30 (2017).
[19] V. P. Dwivedi, C. K. Joshi, A. T. Luu, T. Laurent, Y. Bengio, X. Bresson, Benchmarking graph neural
networks, Journal of Machine Learning Research 24 (2023) 1–48.
[20] K. Xu, W. Hu, J. Leskovec, S. Jegelka, How powerful are graph neural networks?, arXiv preprint
arXiv:1810.00826 (2018).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>B.</given-names>
            <surname>Sarwar</surname>
          </string-name>
          , G. Karypis,
          <string-name>
            <given-names>J.</given-names>
            <surname>Konstan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Riedl</surname>
          </string-name>
          ,
          <article-title>Item-based collaborative filtering recommendation algorithms</article-title>
          ,
          <source>in: Proceedings of the 10th international conference on World Wide Web</source>
          ,
          <year>2001</year>
          , pp.
          <fpage>285</fpage>
          -
          <lpage>295</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M. J.</given-names>
            <surname>Pazzani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Billsus</surname>
          </string-name>
          ,
          <article-title>Content-based recommendation systems, in: The adaptive web: methods and strategies of web personalization</article-title>
          , Springer,
          <year>2007</year>
          , pp.
          <fpage>325</fpage>
          -
          <lpage>341</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R.</given-names>
            <surname>Burke</surname>
          </string-name>
          ,
          <article-title>Hybrid recommender systems: Survey and experiments, User modeling and user-adapted interaction 12 (</article-title>
          <year>2002</year>
          )
          <fpage>331</fpage>
          -
          <lpage>370</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>G.</given-names>
            <surname>Adomavicius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tuzhilin</surname>
          </string-name>
          ,
          <article-title>Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions</article-title>
          ,
          <source>IEEE transactions on knowledge and data engineering 17</source>
          (
          <year>2005</year>
          )
          <fpage>734</fpage>
          -
          <lpage>749</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>T.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kornblith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Norouzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Hinton</surname>
          </string-name>
          ,
          <article-title>A simple framework for contrastive learning of visual representations</article-title>
          ,
          <source>in: International conference on machine learning, PMLR</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>1597</fpage>
          -
          <lpage>1607</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hallacy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ramesh</surname>
          </string-name>
          , G. Goh,
          <string-name>
            <given-names>S.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          , P. Mishkin,
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>