mlsanityData to 13 Oct 2026

Variation Control and Evaluation for Generative SlateRecommendations

arXiv 2102.13302 ↗First posted 26 Feb 2021cs.IR cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Slate recommendation generates a list of items as a whole instead of ranking each item individually, so as to better model the intra-list positional biases and item relations. In order to deal with the enormous combinatorial space of slates, recent work considers a generative solution so that a slate distribution can be directly modeled. However, we observe that such approaches -- despite their proved effectiveness in computer vision -- suffer from a trade-off dilemma in recommender systems: when focusing on reconstruction, they easily over-fit the data and hardly generate satisfactory recommendations; on the other hand, when focusing on satisfying the user interests, they get trapped in a few items and fail to cover the item variation in slates. In this paper, we propose to enhance the accuracy-based evaluation with slate variation metrics to estimate the stochastic behavior of generative models. We illustrate that instead of reaching to one of the two undesirable extreme cases in the dilemma, a valid generative solution resides in a narrow "elbow" region in between. And we show that item perturbation can enforce slate variation and mitigate the over-concentration of generated slates, which expand the "elbow" performance to an easy-to-find region. We further propose to separate a pivot selection phase from the generation process so that the model can apply perturbation before generation. Empirical results show that this simple modification can provide even better variance with the same level of accuracy compared to post-generation perturbation methods.

Key facts. Cited by 10 papers in the map (data through 13 Oct 2026). Builds on 23 of its 49 references that are in the map. First posted on arXiv 26 Feb 2021.

Builds on

23 of 49 references.

References · 23

  1. 2013Auto-Encoding Variational Bayescited by 4,024
  2. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,467
  3. 2017Neural Collaborative Filteringcited by 1,110
  4. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 958
  5. 2015Session-based Recommendations with Recurrent Neural Networkscited by 688
  6. 2015Generating Sentences from a Continuous Spacecited by 609
  7. 2018Variational Autoencoders for Collaborative Filteringcited by 309
  8. 2016Off-policy evaluation for slate recommendationcited by 102
  9. 2019RecSim: A Configurable Simulation Platform for Recommender Systemscited by 92
  10. 2017Causal Embeddings for Recommendationcited by 79
  11. 2021Towards Long-term Fairness in Recommendationcited by 77
  12. 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
11 more
  1. 2018Learning a Deep Listwise Context Model for Ranking Refinementcited by 62
  2. 2018Seq2Slate: Re-ranking and Slate Optimization with RNNscited by 39
  3. 2020Neural Logic Reasoningcited by 38
  4. 2020Neural Collaborative Reasoningcited by 37
  5. 2020Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactionscited by 35
  6. 2019Reinforcement Learning for Slate-based Recommender Systems: A Tractable Decomposition and Practical Methodologycited by 27
  7. 2020CAFE: Coarse-to-Fine Neural Symbolic Reasoning for Explainable Recommendationcited by 26
  8. 2018Beyond Greedy Ranking: Slate Optimization via List-CVAEcited by 21
  9. 2019Exact-K Recommendation via Maximal Clique Optimizationcited by 14
  10. 2020Generator and Critic: A Deep Reinforcement Learning Approach for Slate Re-ranking in E-commercecited by 7
  11. 2020Learning Personalized Risk Preferences for Recommendationcited by 5

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2023: 3; 2024: 2; 2025: 2; 2026: 3.

10 papers.