Adversarial Mahalanobis Distance-based Attentive Song Recommender for Automatic Playlist Continuation

Thanh Tran, Renee Sweeney, Kyumin Lee

TL;DR

This paper introduces a novel approach to Automatic Playlist Continuation (APC) by moving away from traditional dot-product similarity in favor of Mahalanobis distance. By combining user-specific preferences with playlist-specific themes through a "memory metric-based" attention mechanism and adversarial training, the authors achieved a significant performance leap—improving recommendation accuracy by over 27% compared to previous state-of-the-art models.

What Problem Does This Paper Address?

The goal of Automatic Playlist Continuation is simple: given a few songs in a playlist, what should come next?

Current systems usually struggle with two things:

  1. Mathematical Limitations: Most recommenders use the "dot product" to measure how well a song fits a user. However, the dot product isn't a true "metric"—it doesn't satisfy the triangle inequality, meaning it struggles to capture complex, relative relationships between users, playlists, and songs.
  2. Context vs. Preference: A good recommendation needs to satisfy the user's general taste (e.g., "I like Jazz") and the specific vibe of the playlist (e.g., "This is my high-energy workout mix"). Many models focus on one and neglect the other.

Methods

The authors propose three nested deep learning models that utilize the Mahalanobis distance (essentially a "weighted" Euclidean distance that accounts for different scales in data dimensions):

  • MDR (Mahalanobis Distance Based Recommender): This model calculates two distances: one between the user and the target song, and one between the playlist and the target song. It then combines them to ensure the song fits both the person and the specific collection.
  • MASS (Mahalanobis distance-based Attentive Song Similarity): This looks at the "local" neighborhood. It compares the candidate song to every song already in the playlist. Crucially, it uses a memory metric-based attention mechanism to decide which existing songs are most important. For example, if you're adding to a "90s Grunge" playlist, the model might pay more attention to the Nirvana tracks than a random filler track when deciding if a Soundgarden song fits.
  • MASR (Mahalanobis distance based Attentive Song Recommender): This is the "final boss" model that fuses MDR and MASS into a single unified architecture.

Finally, they apply Adversarial Personalized Ranking (APR). During training, they intentionally add small, calculated "noise" to the model's parameters. This forces the model to become more robust and prevents it from overfitting to the quirks of the training data.

Datasets

The models were evaluated on two large-scale, real-world datasets:

  • 30Music: A collection of playlists retrieved from Last.fm (approx. 12k users, 32k playlists, 276k songs).
  • AOTM (Art of the Mix): A long-running playlist database (approx. 16k users, 100k playlists, 504k songs).

Both datasets were preprocessed to ensure a "k-core" of at least 5 songs per playlist to provide enough context for continuation.

Key Insights and Ideas

  • Metric Learning > Dot Product: The "aha moment" here is that by treating recommendation as a distance-minimization problem in a transformed space (Mahalanobis), the model can pull similar items together and push dissimilar ones away much more effectively than simple vector multiplication.
  • Personalized Search Queries: The attention mechanism effectively turns the user and the candidate song into a "search query." This query then scans the existing playlist to find the most relevant "anchor" songs, making the recommendation feel much more tailored.
  • Flexible Noise: Unlike previous adversarial methods that used a fixed amount of noise, this paper uses "flexible noise magnitude" based on the standard deviation of the parameters. This prevents the adversarial training from "breaking" the model while still providing the benefits of robustness.

Key Results

The proposed AMASR (the adversarial version of the fused model) dominated the competition:

  • Accuracy: It outperformed eight state-of-the-art baselines (including NeuMF++ and CML). On the 30Music dataset, it showed a 26% improvement in Hit Ratio (hit@10) and a 31% improvement in NDCG@10 (a measure of ranking quality) over the best baseline.
  • Robustness: Adding the adversarial training (APR) consistently boosted performance across all three proposed models, proving that "training against an opponent" makes for a better recommender.
  • Efficiency: Despite the complexity, the models are computationally efficient. MDR, for instance, was one of the fastest models tested, taking only 39 seconds per epoch on the 30Music dataset.

Limitations and Future Work

  • Sequential Information: The authors noted that their datasets lacked timestamps for when songs were added. Consequently, they shuffled the playlists and treated them as sets rather than sequences. Future work could incorporate the order of songs to capture "flow."
  • Side Information: This model relies purely on interaction data (who added what). The authors suggest that incorporating metadata like lyrics, audio features, or artist genres could further refine the Mahalanobis distance calculations.
  • Cold Start: The paper focuses on continuing existing playlists; it doesn't explicitly address how to recommend songs for a brand-new user or a completely empty playlist.

Summary updated

Abstract

In this paper, we aim to solve the automatic playlist continuation (APC) problem by modeling complex interactions among users, playlists, and songs using only their interaction data. Prior methods mainly rely on dot product to account for similarities, which is not ideal as dot product is not metric learning, so it does not convey the important inequality property. Based on this observation, we propose three novel deep learning approaches that utilize Mahalanobis distance. Our first approach uses user-playlist-song interactions, and combines Mahalanobis distance scores between (i) a target user and a target song, and (ii) between a target playlist and the target song to account for both the user's preference and the playlist's theme. Our second approach measures song-song similarities by considering Mahalanobis distance scores between the target song and each member song (i.e., existing song) in the target playlist. The contribution of each distance score is measured by our proposed memory metric-based attention mechanism. In the third approach, we fuse the two previous models into a unified model to further enhance their performance. In addition, we adopt and customize Adversarial Personalized Ranking (APR) for our three approaches to further improve their robustness and predictive capabilities. Through extensive experiments, we show that our proposed models outperform eight state-of-the-art models in two large-scale real-world datasets.
BibTeX
@inproceedings{tran2019adversarial,
  author = {Thanh Tran and Renee Sweeney and Kyumin Lee},
  title = {{Adversarial Mahalanobis Distance-based Attentive Song Recommender for Automatic Playlist Continuation}},
  booktitle = {International ACM SIGIR Conference on Research and Development in Information Retrieval},
  year = {2019},
  url = {https://openreview.net/forum?id=TxMMY0muH1},
}

Loading related content...

Figure