Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox

"Recommendation": models, code, and papers

TransRev: Modeling Reviews as Translations from Users to Items

Apr 18, 2018
Alberto Garcia-Duran, Roberto Gonzalez, Daniel Onoro-Rubio, Mathias Niepert, Hui Li

The text of a review expresses the sentiment a customer has towards a particular product. This is exploited in sentiment analysis where machine learning models are used to predict the review score from the text of the review. Furthermore, the products costumers have purchased in the past are indicative of the products they will purchase in the future. This is what recommender systems exploit by learning models from purchase information to predict the items a customer might be interested in. We propose TransRev, an approach to the product recommendation problem that integrates ideas from recommender systems, sentiment analysis, and multi-relational learning into a joint learning objective. TransRev learns vector representations for users, items, and reviews. The embedding of a review is learned such that (a) it performs well as input feature of a regression model for sentiment prediction; and (b) it always translates the reviewer embedding to the embedding of the reviewed items. This allows TransRev to approximate a review embedding at test time as the difference of the embedding of each item and the user embedding. The approximated review embedding is then used with the regression model to predict the review score for each item. TransRev outperforms state of the art recommender systems on a large number of benchmark data sets. Moreover, it is able to retrieve, for each user and item, the review text from the training set whose embedding is most similar to the approximated review embedding.


  Access Paper or Ask Questions

Quick Lists: Enriched Playlist Embeddings for Future Playlist Recommendation

Jun 17, 2020
Brett Vintch

Recommending playlists to users in the context of a digital music service is a difficult task because a playlist is often more than the mere sum of its parts. We present a novel method for generating playlist embeddings that are invariant to playlist length and sensitive to local and global track ordering. The embeddings also capture information about playlist sequencing, and are enriched with side information about the playlist user. We show that these embeddings are useful for generating next-best playlist recommendations, and that side information can be used for the cold start problem.


  Access Paper or Ask Questions

Split-door criterion: Identification of causal effects through auxiliary outcomes

Jun 14, 2018
Amit Sharma, Jake M. Hofman, Duncan J. Watts

We present a method for estimating causal effects in time series data when fine-grained information about the outcome of interest is available. Specifically, we examine what we call the split-door setting, where the outcome variable can be split into two parts: one that is potentially affected by the cause being studied and another that is independent of it, with both parts sharing the same (unobserved) confounders. We show that under these conditions, the problem of identification reduces to that of testing for independence among observed variables, and present a method that uses this approach to automatically find subsets of the data that are causally identified. We demonstrate the method by estimating the causal impact of Amazon's recommender system on traffic to product pages, finding thousands of examples within the dataset that satisfy the split-door criterion. Unlike past studies based on natural experiments that were limited to a single product category, our method applies to a large and representative sample of products viewed on the site. In line with previous work, we find that the widely-used click-through rate (CTR) metric overestimates the causal impact of recommender systems; depending on the product category, we estimate that 50-80\% of the traffic attributed to recommender systems would have happened even without any recommendations. We conclude with guidelines for using the split-door criterion as well as a discussion of other contexts where the method can be applied.


  Access Paper or Ask Questions

Citation network applications in a scientific co-authorship recommender system

Nov 22, 2021
Vladislav Tishin, Artyom Sosedka, Peter Ibragimov, Vadim Porvatov

The problem of co-authors selection in the area of scientific collaborations might be a daunting one. In this paper, we propose a new pipeline that effectively utilizes citation data in the link prediction task on the co-authorship network. In particular, we explore the capabilities of a recommender system based on data aggregation strategies on different graphs. Since graph neural networks proved their efficiency on a wide range of tasks related to recommendation systems, we leverage them as a relevant method for the forecasting of potential collaborations in the scientific community.

* 7 pages 

  Access Paper or Ask Questions

History-Augmented Collaborative Filtering for Financial Recommendations

Feb 26, 2021
Baptiste Barreau, Laurent Carlier

In many businesses, and particularly in finance, the behavior of a client might drastically change over time. It is consequently crucial for recommender systems used in such environments to be able to adapt to these changes. In this study, we propose a novel collaborative filtering algorithm that captures the temporal context of a user-item interaction through the users' and items' recent interaction histories to provide dynamic recommendations. The algorithm, designed with issues specific to the financial world in mind, uses a custom neural network architecture that tackles the non-stationarity of users' and items' behaviors. The performance and properties of the algorithm are monitored in a series of experiments on a G10 bond request for quotation proprietary database from BNP Paribas Corporate and Institutional Banking.

* RecSys '20: Fourteenth ACM Conference on Recommender Systems, Sep 2020, Virtual Event, Brazil. pp.492-497 

  Access Paper or Ask Questions

Eliminating Bias in Recommender Systems via Pseudo-Labeling

Oct 04, 2019
Yuta Saito

Addressing the non-uniform missing mechanism of rating feedback is critical to recommending items users prefer from biased real-world datasets. To tackle the challenging issue, we first define an ideal loss function that should be optimized to achieve the goal of recommendation. Then, we derive the generalization error bound of the ideal loss that alleviates the variance and the misspecification problems of the previous causal-based methods. We further propose a meta-learning method minimizing the bound. Empirical evaluation using real-world datasets validates the theoretical findings and demonstrates the practical advantages of the proposed method.


  Access Paper or Ask Questions

Sequential Relevance Maximization with Binary Feedback

Mar 06, 2015
Vijay Kamble, Nadia Fawaz, Fernando Silveira

Motivated by online settings where users can provide explicit feedback about the relevance of products that are sequentially presented to them, we look at the recommendation process as a problem of dynamically optimizing this relevance feedback. Such an algorithm optimizes the fine tradeoff between presenting the products that are most likely to be relevant, and learning the preferences of the user so that more relevant recommendations can be made in the future. We assume a standard predictive model inspired by collaborative filtering, in which a user is sampled from a distribution over a set of possible types. For every product category, each type has an associated relevance feedback that is assumed to be binary: the category is either relevant or irrelevant. Assuming that the user stays for each additional recommendation opportunity with probability $\beta$ independent of the past, the problem is to find a policy that maximizes the expected number of recommendations that are deemed relevant in a session. We analyze this problem and prove key structural properties of the optimal policy. Based on these properties, we first present an algorithm that strikes a balance between recursion and dynamic programming to compute this policy. We further propose and analyze two heuristic policies: a `farsighted' greedy policy that attains at least $1-\beta$ factor of the optimal payoff, and a naive greedy policy that attains at least $\frac{1-\beta}{1+\beta}$ factor of the optimal payoff in the worst case. Extensive simulations show that these heuristics are very close to optimal in practice.


  Access Paper or Ask Questions

Multi-Perspective Neural Architecture for Recommendation System

Jul 12, 2018
Han Xiao, Yidong Chen, Xiaodong Shi

Currently, there starts a research trend to leverage neural architecture for recommendation systems. Though several deep recommender models are proposed, most methods are too simple to characterize users' complex preference. In this paper, for a fine-grain analysis, users' ratings are explained from multiple perspectives, based on which, we propose our neural architecture. Specifically, our model employs several sequential stages to encode the user and item into hidden representations. In one stage, the user and item are represented from multiple perspectives and in each perspective, the representations of user and item put attentions to each other. Last, we metric the output representations of final stage to approach the users' rating. Extensive experiments demonstrate that our method achieves substantial improvements against baselines.


  Access Paper or Ask Questions

Contrastive Learning for Debiased Candidate Generation at Scale

May 20, 2020
Chang Zhou, Jianxin Ma, Jianwei Zhang, Jingren Zhou, Hongxia Yang

Deep candidate generation has become an increasingly popular choice deployed in many industrial search, recommendation and ads systems. Standard deep candidate generation models rely on sophisticated sampling techniques to approximately conduct maximum likelihood estimation of user-item interactions, following the advances in the language modeling community. However, it is unclear whether these sampling strategies are the best choice for candidate generation in recommender system, where we face severe selection bias in the training data with an extremely large candidate set and rich features of various types. In this paper, we propose CLRec, a Contrastive Learning paradigm for large scale candidate generation in Recommender systems. CLRec employs a queue based buffer to hold previous examples or representations as negative labels, within which a contrastive loss is optimized. This framework achieves better performance while requiring no explicit sampling, providing great efficiency in encoding rich types of features on the label side. We analyze both theoretically and empirically that CLRec can in fact alleviate the selection bias, leading to a more diversified and fairer recommendation. We deploy CLRec in Taobao and conduct online A/B test on a traffic-intensive scenario, showing a large margin improvement on both performance and efficiency, as well as a dramatic reduction on the rich-get-richer phenomenon.


  Access Paper or Ask Questions

RecSim: A Configurable Simulation Platform for Recommender Systems

Sep 26, 2019
Eugene Ie, Chih-wei Hsu, Martin Mladenov, Vihan Jain, Sanmit Narvekar, Jing Wang, Rui Wu, Craig Boutilier

We propose RecSim, a configurable platform for authoring simulation environments for recommender systems (RSs) that naturally supports sequential interaction with users. RecSim allows the creation of new environments that reflect particular aspects of user behavior and item structure at a level of abstraction well-suited to pushing the limits of current reinforcement learning (RL) and RS techniques in sequential interactive recommendation problems. Environments can be easily configured that vary assumptions about: user preferences and item familiarity; user latent state and its dynamics; and choice models and other user response behavior. We outline how RecSim offers value to RL and RS researchers and practitioners, and how it can serve as a vehicle for academic-industrial collaboration.


  Access Paper or Ask Questions

<<
159
160
161
162
163
164
165
166
167
168
169
170
171
>>