Distributionally robust optimization for recommendation selection

Abstract

Recommender systems play an essential role in online services by providing personalized item lists to support users' decision-making processes. While collaborative filtering methods can achieve high accuracy, it is crucial to consider not only accuracy but also the diversity of recommended items to improve user satisfaction. Although financial portfolio theory has been applied to balance these factors, existing models are often sensitive to estimation errors in rating statistics. To overcome these challenges, we establish a computational framework of distributionally robust optimization (DRO) for recommendation selection. We first formulate a cardinality-constrained DRO model based on moment-based ambiguity sets to select a specified number of items for each user. We then design a penalty alternating direction method (PADM) to efficiently compute high-quality solutions and prove its convergence properties. Computational experiments using three publicly available rating datasets demonstrate that our DRO model generates more diverse recommendations than existing models while maintaining the same level of accuracy. Additionally, our solution method computes these recommendations for each user in just a few seconds, proving its practical effectiveness. This study establishes a DRO framework that has the potential to enhance the recommendation quality of various collaborative filtering methods.

Figures (1)

• Figure 1: Recommendation quality with the number of recommended items $N \in \{3, 5\}$

Theorems & Definitions (13)

• Lemma 1
• proof
• Definition 1
• Lemma 2
• proof
• Proposition 1
• proof
• Theorem 1
• proof
• Proposition 2