Rabbit Holes and Taste Distortion: Distribution-Aware Recommendation with Evolving Interests

To mitigate the rabbit hole effect in recommendations, conventional distribution-aware recommendation systems aim to ensure that a user’s prior interest areas are reflected in the recommendations that the system makes. For example, a user who historically prefers comedies to dramas by 2:1 should see a similar ratio in recommended movies. Such approaches have proven to be an important building block for recommendation tasks. However, existing distribution-aware approaches enforce that the target taste distribution should exactly match a user’s prior interests (typically revealed through training data), based on the assumption that users’ taste distribution is fundamentally static. This assumption can lead to large estimation errors. We empirically identify this taste distortion problem through a data-driven study over multiple datasets. We show how taste preferences dynamically shift and how the design of a calibration mechanism should be designed with these shifts in mind. We further demonstrate how to incorporate these shifts into a taste enhanced calibrated recommender system, which results in simultaneously mitigated both the rabbit hole effect and taste distortion problem.

[1]  Sean M. McNee,et al.  Improving recommendation lists through topic diversification , 2005, WWW '05.

[2]  Woo-Sung Jung,et al.  Quantitative and empirical demonstration of the Matthew effect in a study of career longevity , 2008, Proceedings of the National Academy of Sciences.

[3]  Derek Greene,et al.  Down the (White) Rabbit Hole: The Extreme Right and Online Recommender Systems , 2015 .

[4]  Craig MacDonald,et al.  Exploiting query reformulations for web search result diversification , 2010, WWW '10.

[5]  Hanning Zhou,et al.  Improving the Diversity of Top-N Recommendation via Determinantal Point Process , 2017, ArXiv.

[6]  Charles L. A. Clarke,et al.  Novelty and diversity in information retrieval evaluation , 2008, SIGIR '08.

[7]  Yusuke Shinohara A submodular optimization approach to sentence set selection , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[8]  Xiangnan He,et al.  Future Data Helps Training: Modeling Future Contexts for Session-based Recommendation , 2020, WWW.

[9]  Nathan Srebro,et al.  Learning Non-Discriminatory Predictors , 2017, COLT.

[10]  Alexandros Karatzoglou,et al.  Session-based Recommendations with Recurrent Neural Networks , 2015, ICLR.

[11]  Yoshua Bengio,et al.  Learning Phrase Representations using RNN Encoder–Decoder for Statistical Machine Translation , 2014, EMNLP.

[12]  Harald Steck,et al.  Calibrated recommendations , 2018, RecSys.

[13]  Ulrich Paquet,et al.  Bayesian Low-Rank Determinantal Point Processes , 2016, RecSys.

[14]  Bianca Zadrozny,et al.  Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers , 2001, ICML.

[15]  Xing Zhao,et al.  Addressing the Target Customer Distortion Problem in Recommender Systems , 2020, WWW.

[16]  Lars Schmidt-Thieme,et al.  BPR: Bayesian Personalized Ranking from Implicit Feedback , 2009, UAI.

[17]  Yi-Hsuan Yang,et al.  Query-based Music Recommendations via Preference Embedding , 2016, RecSys.

[18]  Jürgen Schmidhuber,et al.  Recurrent nets that time and count , 2000, Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks. IJCNN 2000. Neural Computing: New Challenges and Perspectives for the New Millennium.

[19]  Julian J. McAuley,et al.  Self-Attentive Sequential Recommendation , 2018, 2018 IEEE International Conference on Data Mining (ICDM).

[20]  Joemon M. Jose,et al.  A Simple Convolutional Generative Network for Next Item Recommendation , 2018, WSDM.

[21]  Jun Guo,et al.  Personalized fairness-aware re-ranking for microlending , 2019, RecSys.

[22]  Evaggelia Pitoura,et al.  Bias Disparity in Recommendation Systems , 2018, RMSE@RecSys.

[23]  Jimmy Ba,et al.  Adam: A Method for Stochastic Optimization , 2014, ICLR.

[24]  Jürgen Schmidhuber,et al.  LSTM recurrent networks learn simple context-free and context-sensitive languages , 2001, IEEE Trans. Neural Networks.

[25]  Jon M. Kleinberg,et al.  Inherent Trade-Offs in the Fair Determination of Risk Scores , 2016, ITCS.

[26]  Saul Vargas,et al.  Intent-oriented diversity in recommender systems , 2011, SIGIR.

[27]  Jeffrey L. Elman,et al.  Finding Structure in Time , 1990, Cogn. Sci..

[28]  Peng Jiang,et al.  BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformer , 2019, CIKM.

[29]  Jürgen Ziegler,et al.  Sequential User-based Recurrent Neural Network Recommendations , 2017, RecSys.

[30]  Neil J. Hurley,et al.  Intent-Aware Diversification Using a Constrained PLSA , 2016, RecSys.

[31]  Craig MacDonald,et al.  On the role of novelty for search result diversification , 2011, Information Retrieval.

[32]  Neil J. Hurley,et al.  Novelty and Diversity in Top-N Recommendation -- Analysis and Evaluation , 2011, TOIT.

[33]  Xing Zhao,et al.  Improving the Estimation of Tail Ratings in Recommender System with Multi-Latent Representations , 2020, WSDM.

[34]  Alexandros Karatzoglou,et al.  Recurrent Neural Networks with Top-k Gains for Session-based Recommendations , 2017, CIKM.

[35]  Alex Beutel,et al.  Recurrent Recommender Networks , 2017, WSDM.

[36]  David A. McAllester,et al.  Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence , 2009, UAI 2009.

[37]  Derek Bridge,et al.  Accurate and Diverse Recommendations Using Item-Based SubProfiles , 2018, FLAIRS Conference.

[38]  Robin Burke,et al.  The Unfairness of Popularity Bias in Recommendation , 2019, RMSE@RecSys.

[39]  Jürgen Schmidhuber,et al.  Learning to Forget: Continual Prediction with LSTM , 2000, Neural Computation.

[40]  Julian J. McAuley,et al.  Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation , 2016, 2016 IEEE 16th International Conference on Data Mining (ICDM).

[41]  Nathan Srebro,et al.  Equality of Opportunity in Supervised Learning , 2016, NIPS.

[42]  Chang Zhou,et al.  Disentangled Self-Supervision in Sequential Recommenders , 2020, KDD.

[43]  Derek Bridge,et al.  A comparison of calibrated and intent-aware recommendations , 2019, RecSys.

[44]  James Caverlee,et al.  Fairness-Aware Tensor-Based Recommendation , 2018, CIKM.

[45]  Konrad P. Körding,et al.  Science Concierge: A Fast Content-Based Recommendation System for Scientific Publications , 2016, PloS one.

[46]  Toon De Pessemier,et al.  MovieTweetings: a movie rating dataset collected from twitter , 2013, RecSys 2013.

[47]  Jürgen Schmidhuber,et al.  Applying LSTM to Time Series Predictable through Time-Window Approaches , 2000, ICANN.

[48]  Zheng Wen,et al.  Diversified Utility Maximization for Recommendations , 2014, RecSys Posters.

[49]  Derek Bridge,et al.  Subprofile-aware diversification of recommendations , 2019, User Modeling and User-Adapted Interaction.

[50]  Huaiyu Zhu On Information and Sufficiency , 1997 .

[51]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[52]  Aditya Bhaskara,et al.  Linear Relaxations for Finding Diverse Elements in Metric Spaces , 2016, NIPS.

[53]  F. Maxwell Harper,et al.  The MovieLens Datasets: History and Context , 2016, TIIS.