Adaptive Quality-Diversity Trade-offs for Large-Scale Batch Recommendation
Cl\'emence R\'eda (IBENS), Tomas Rigaux, Hiba Bederina (SODA), Koh Takeuchi, Hisashi Kashima, Jill-J\^enn Vie (SODA)

TL;DR
This paper introduces B-DivRec, an efficient algorithm for personalized batch recommendations that balances relevance and diversity, adapting to user feedback to enhance engagement and reduce churn.
Contribution
The paper presents a novel algorithm combining determinantal point processes and fuzzy denuding for quality-diversity trade-offs, with adaptive tuning based on user feedback.
Findings
B-DivRec effectively balances relevance and diversity in recommendations.
Adaptive adjustment improves user engagement and reduces churn.
Validated on synthetic and real-world datasets for movies and drug repurposing.
Abstract
A core research question in recommender systems is to propose batches of highly relevant and diverse items, that is, items personalized to the user's preferences, but which also might get the user out of their comfort zone. This diversity might induce properties of serendipidity and novelty which might increase user engagement or revenue. However, many real-life problems arise in that case: e.g., avoiding to recommend distinct but too similar items to reduce the churn risk, and computational cost for large item libraries, up to millions of items. First, we consider the case when the user feedback model is perfectly observed and known in advance, and introduce an efficient algorithm called B-DivRec combining determinantal point processes and a fuzzy denuding procedure to adjust the degree of item diversity. This helps enforcing a quality-diversity trade-off throughout the user history.…
Peer Reviews
Decision·Submitted to ICLR 2026
1. This paper addresses a highly complex yet practical problem: incorporating diversity in a setting where the item set/batch is recommended sequentially to a user. 2. This paper provides comprehensive discussions covering both theory and implementation.
1. The experimental results lack persuasiveness. Specifically, the paucity of comparisons regarding execution time with existing methods undermines the paper's main claim of scalability. 2. Although the paper uses theoretical notation, its theoretical contribution is limited. For example, it mentions regret but does not discuss an algorithmic regret bound or similar rigorous analysis. 3. The assumption of noiseless feedback (Assumption 3.4) appears highly unrealistic. In the context of recommend
- The paper presents a unified DPP-based formulation with an explicit trade-off parameter $\lambda$, providing a clear theoretical foundation that encompasses several existing diversity-aware recommendation methods such as conditional DPP and MMR. - The proposed B-DivRec approach combines a denuding operation in feature space with Nystrom approximation, achieving linear scalability and enabling large-scale batch recommendation with explicit control over both global and local diversity. - The
* Despite its theoretical elegance, the paper does not demonstrate consistent empirical superiority of the proposed method. On the MovieLens benchmark, MMR achieves higher relevance scores than B-DivRec; the explanation (history-vector collinearity) is qualitative and lacks deeper quantitative analysis. * The overall effectiveness of B-DivRec appears dataset-dependent, strong on PREDICT but weaker on MovieLens, raising questions about robustness and generality across domains with different diver
* B-DivRec targets both individual- and aggregate-level diversity in sequential recommendation. * Authors provide well-packaged experimental code for reproducibility.
* The paper is hard to follow. For instance, the problem definition is scattered across the Notation and Metric sections, and the proposed method is mixed with existing works, making it difficult to clearly distinguish the contributions. * Problem definition is unclear. I assume that the problem is to maximize both individual and aggregate diversity while maintaining accuracy by post-processing an existing model for a series of users where they provide feedbacks for each item in the recommendati
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Advanced Bandit Algorithms Research · Mobile Crowdsensing and Crowdsourcing
