Session: Diversity and Novelty

Date: Tuesday September 20, 2:00 PM – 3:30 PM (PDT)

  • INRecommending for a Multi-Sided Marketplace with Heterogeneous Contents
    by Yuyan Wang (Uber Tech. Inc, United States), Long Tao (Uber Tech. Inc, United States), Xian Xing Zhang (Uber Tech. Inc, United States)

    Many online personalization platforms today are recommending heterogeneous contents in a multi-sided marketplace consisting of consumers, merchants and other partners. For a recommender system to be successful in these contexts, it faces two main challenges. First, each side in the marketplace has different and potentially conflicting utilities. Recommending for a multi-sided marketplace therefore entails jointly optimizing multiple objectives with trade-offs. Second, the off-the-shelf recommendation algorithms are not applicable to the heterogeneous content space, where a recommendation item could be an aggregation of other recommendation items. In this work, we develop a general framework for recommender systems in a multi-sided marketplace with heterogeneous and hierarchical contents. We propose a constrained optimization framework with machine learning models for each conflicting objective as inputs, and a probabilistic structural model for users’ engagement patterns on heterogeneous contents. Our proposed structural modeling approach ensures consistent user experience across different levels of aggregation of the contents, and provides levels of transparency to the merchants and content providers. We further develop an efficient optimization solution for ranking and recommendation in large-scale online systems in real time. We implement the framework at one of the largest online food delivery platforms in the world, which is a three-sided marketplace consisting of eaters, restaurant partners and delivery partners. Online experiments demonstrate the effectiveness of our framework in ranking heterogeneous contents and optimizing for the three sides in the marketplace. Our framework has been deployed globally as the main recommendation algorithm for the homepage of the platform.

    Full text in ACM Digital Library

  • PASolving Diversity-Aware Maximum Inner Product Search Efficiently and Effectively
    by Kohei Hirata (Osaka University, Japan), Daichi Amagata (Osaka University, Japan), Sumio Fujita (Yahoo Japan Corporation, Japan), Takahiro Hara (Osaka University, Japan)

    Maximum inner product search (or 𝑘-MIPS) is a fundamental operation in recommender systems that infer preferable items for users. To support large-scale recommender systems, existing studies designed scalable 𝑘-MIPS algorithms. However, these studies do not consider diversity, although recommending diverse items is important to improve user satisfaction. We therefore formulate a new problem, namely diversity-aware 𝑘-MIPS. In this problem, users can control the degree of diversity in their recommendation lists through a parameter. However, exactly solving this problem is unfortunately NP-hard, so it is challenging to devise an efficient, effective, and practical algorithm for the diversity-aware 𝑘-MIPS problem. This paper overcomes this challenge and proposes IP-Greedy, which incorporates new early termination and skipping techniques into a greedy algorithm. We conduct extensive experiments on real datasets, and the results demonstrate the efficiency and effectiveness of our algorithm. Also, we conduct a case study of the diversity-aware 𝑘-MIPS problem on a real dataset. We confirm that this problem can make recommendation lists diverse while preserving high inner products of user and item vectors in the lists.

    Full text in ACM Digital Library

  • PAExploiting Negative Preference in Content-based Music Recommendation with Contrastive Learning
    by Minju Park (Seoul National University, Korea, Republic of), Kyogu Lee (Seoul National University, Korea, Republic of)

    Music recommendation systems are in advance nowadays, along with the development of machine learning. At the same time, however, more complex models are being used for music recommendation and they are bringing difficulties of transparency and explainability. In order to give explainability to music recommendation systems, a certain understanding of users’ music tastes must be based on. Meanwhile, there are several studies related to music recommendation systems exploiting negative preference. They have shown improvements in performance, but there was a lack of explanation why negative preference led to better recommendations. In this work, we analyze the role of negative preference in users’ music tastes by comparing music recommendation models with a contrastive objective but with three different training strategies – exploiting preferences of both positive and negative, positive only, and negative only. We evaluate the effectiveness of the negative preference by validating each system with a small amount of personalized data obtained via survey and furthermore propose a method of utilizing them for music recommendation. Our experimental results show that the model exploiting negative preference outperform the other two in terms of accuracy and false positive rate. Furthermore, the proposed training strategies produced a consistent tendency regardless of different types of front-end musical feature extractors, proving the stability of the proposed method.

    Full text in ACM Digital Library

Diamond Supporter
Platinum Supporters
Gold Supporters
Challenge Sponsor
Special Supporters