Algorithmic Collective Action in Recommender Systems: Promoting Songs by Reordering Playlists

• URL: http://arxiv.org/abs/2404.04269v1
• Date: Tue, 19 Mar 2024 23:27:15 GMT
• Title: Algorithmic Collective Action in Recommender Systems: Promoting Songs by Reordering Playlists
• Authors: Joachim Baumann, Celestine Mendler-Dünner,
• Abstract summary: We investigate algorithmic collective action in transformer-based recommender systems. Our use case is a collective of fans aiming to promote the visibility of an artist by strategically placing one of their songs in the existing playlists they control. We introduce two easily implementable strategies towards this goal and test their efficacy on a publicly available recommender system model released by a major music streaming platform.
• Score: 10.681288493631978
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate algorithmic collective action in transformer-based recommender systems. Our use case is a collective of fans aiming to promote the visibility of an artist by strategically placing one of their songs in the existing playlists they control. The success of the collective is measured by the increase in test-time recommendations of the targeted song. We introduce two easily implementable strategies towards this goal and test their efficacy on a publicly available recommender system model released by a major music streaming platform. Our findings reveal that even small collectives (controlling less than 0.01% of the training data) can achieve up 25x amplification of recommendations by strategically choosing the position at which to insert the song. We then focus on investigating the externalities of the strategy. We find that the performance loss for the platform is negligible, and the recommendations of other songs are largely preserved, minimally impairing the user experience of participants. Moreover, the costs are evenly distributed among other artists. Taken together, our findings demonstrate how collective action strategies can be effective while not necessarily being adversarial, raising new questions around incentives, social dynamics, and equilibria in recommender systems.

Related papers

• It's Not You, It's Me: The Impact of Choice Models and Ranking Strategies on Gender Imbalance in Music Recommendation [7.94306624344211]
  We investigate the effects of ranking strategies and user choice models on gender fairness metrics. We find re-ranking strategies have a greater effect than user choice models on recommendation fairness over time.
  arXiv  Detail & Related papers  (2024-08-22T11:44:46Z)
• How to Diversify any Personalized Recommender? [0.0]
  We introduce a novel approach to improve the diversity of Top-N recommendations while maintaining accuracy. Our approach employs a user-centric pre-processing strategy aimed at exposing users to a wide array of content categories and topics. Using pre-processed data for training leads to recommender systems achieving performance levels comparable to, and in some cases, better than those trained on original, unmodified data.
  arXiv  Detail & Related papers  (2024-05-03T15:02:55Z)
• Reinforcement Learning Jazz Improvisation: When Music Meets Game Theory [0.24578723416255752]
  We introduce a novel mathematical game theory model for jazz improvisation. We use reinforcement learning to explore diverse improvisational strategies and their paired performance. Our work lays the foundation for promising applications beyond jazz.
  arXiv  Detail & Related papers  (2024-02-25T16:46:15Z)
• Fast Peer Adaptation with Context-aware Exploration [63.08444527039578]
  We propose a peer identification reward for learning agents in multi-agent games. This reward motivates the agent to learn a context-aware policy for effective exploration and fast adaptation. We evaluate our method on diverse testbeds that involve competitive (Kuhn Poker), cooperative (PO-Overcooked), or mixed (Predator-Prey-W) games with peer agents.
  arXiv  Detail & Related papers  (2024-02-04T13:02:27Z)
• Fairness Through Domain Awareness: Mitigating Popularity Bias For Music Discovery [56.77435520571752]
  We explore the intrinsic relationship between music discovery and popularity bias. We propose a domain-aware, individual fairness-based approach which addresses popularity bias in graph neural network (GNNs) based recommender systems. Our approach uses individual fairness to reflect a ground truth listening experience, i.e., if two songs sound similar, this similarity should be reflected in their representations.
  arXiv  Detail & Related papers  (2023-08-28T14:12:25Z)
• Improving Recommendation System Serendipity Through Lexicase Selection [53.57498970940369]
  We propose a new serendipity metric to measure the presence of echo chambers and homophily in recommendation systems. We then attempt to improve the diversity-preservation qualities of well known recommendation techniques by adopting a parent selection algorithm known as lexicase selection. Our results show that lexicase selection, or a mixture of lexicase selection and ranking, outperforms its purely ranked counterparts in terms of personalization, coverage and our specifically designed serendipity benchmark.
  arXiv  Detail & Related papers  (2023-05-18T15:37:38Z)
• Two-Stage Constrained Actor-Critic for Short Video Recommendation [23.12631658373264]
  We formulate the problem of short video recommendation as a Constrained Markov Decision Process (CMDP) We propose a novel two-stage constrained actor-critic method to optimize each auxiliary signal. Our method significantly outperforms other baselines in terms of both watch time and interactions.
  arXiv  Detail & Related papers  (2023-02-03T12:02:54Z)
• Incentive-Aware Recommender Systems in Two-Sided Markets [49.692453629365204]
  We propose a novel recommender system that aligns with agents' incentives while achieving myopically optimal performance. Our framework models this incentive-aware system as a multi-agent bandit problem in two-sided markets. Both algorithms satisfy an ex-post fairness criterion, which protects agents from over-exploitation.
  arXiv  Detail & Related papers  (2022-11-23T22:20:12Z)
• Exploiting Negative Preference in Content-based Music Recommendation with Contrastive Learning [16.728976424372362]
  We analyze the role of negative preference in users' music tastes by comparing music recommendation models with contrastive learning exploiting preference (CLEP) Our experimental results show that CLEP-N outperforms the other two in accuracy and false positive rate.
  arXiv  Detail & Related papers  (2022-07-28T07:02:48Z)
• PipAttack: Poisoning Federated Recommender Systems forManipulating Item Promotion [58.870444954499014]
  A common practice is to subsume recommender systems under the decentralized federated learning paradigm. We present a systematic approach to backdooring federated recommender systems for targeted item promotion.
  arXiv  Detail & Related papers  (2021-10-21T06:48:35Z)
• Incentivizing Exploration with Selective Data Disclosure [70.11902902106014]
  We propose and design recommendation systems that incentivize efficient exploration. Agents arrive sequentially, choose actions and receive rewards, drawn from fixed but unknown action-specific distributions. We attain optimal regret rate for exploration using a flexible frequentist behavioral model.
  arXiv  Detail & Related papers  (2018-11-14T19:29:16Z)

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.