Recommender Systems

Build systems that suggest the right content, products, or matches to users • 54 papers

10 subtopics

Collaborative Filtering & Matrix Factorization

Recommend based on similar user preferences

Matrix Factorization Techniques for Recommender Systems Yehuda Koren, Robert Bell, Chris Volinsky The definitive Netflix Prize paper establishing matrix factorization as the dominant CF paradigm.
2009 11142 cited

Matrix Factorization Techniques for Recommender Systems

Yehuda Koren, Robert Bell, Chris Volinsky

The definitive Netflix Prize paper establishing matrix factorization as the dominant CF paradigm.

Collaborative Filtering for Implicit Feedback Datasets Yifan Hu, Yehuda Koren, Chris Volinsky Foundational paper for implicit feedback (clicks, views); introduces confidence-weighted MF with ALS optimization.
2008 3154 cited

Collaborative Filtering for Implicit Feedback Datasets

Yifan Hu, Yehuda Koren, Chris Volinsky

Foundational paper for implicit feedback (clicks, views); introduces confidence-weighted MF with ALS optimization.

BPR: Bayesian Personalized Ranking from Implicit Feedback Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, Lars Schmidt-Thieme Standard pairwise ranking loss for implicit feedback; BPR-OPT criterion ubiquitous in modern training.
2009 4304 cited

BPR: Bayesian Personalized Ranking from Implicit Feedback

Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, Lars Schmidt-Thieme

Standard pairwise ranking loss for implicit feedback; BPR-OPT criterion ubiquitous in modern training.

Factorization Meets the Neighborhood Yehuda Koren Combines neighborhood and latent factor models; integrates user/item biases; essential for blending approaches.
2008 3863 cited

Factorization Meets the Neighborhood

Yehuda Koren

Combines neighborhood and latent factor models; integrates user/item biases; essential for blending approaches.

Probabilistic Matrix Factorization Ruslan Salakhutdinov, Andriy Mnih Introduced probabilistic treatment of MF that scales linearly with observations; handles Netflix-scale sparsity with automatic regularization via adaptive priors.
2007 3565 cited

Probabilistic Matrix Factorization

Ruslan Salakhutdinov, Andriy Mnih

Introduced probabilistic treatment of MF that scales linearly with observations; handles Netflix-scale sparsity with automatic regularization via adaptive priors.

Factorization Machines Steffen Rendle General predictor combining SVM flexibility with factorization model power; models all pairwise feature interactions in linear time. Subsumes SVD++, PITF, and specialized models.
2010 2956 cited

Factorization Machines

Steffen Rendle

General predictor combining SVM flexibility with factorization model power; models all pairwise feature interactions in linear time. Subsumes SVD++, PITF, and specialized models.

Collaborative Filtering with Temporal Dynamics Yehuda Koren TimeSVD++ explicitly models drifting user preferences, item popularity evolution, and time-varying biases. Core component of Netflix Prize winning solution.
2009 1164 cited

Collaborative Filtering with Temporal Dynamics

Yehuda Koren

TimeSVD++ explicitly models drifting user preferences, item popularity evolution, and time-varying biases. Core component of Netflix Prize winning solution.

Deep Recommenders

Build neural network-based recommendation models

Deep Neural Networks for YouTube Recommendations Paul Covington, Jay Adams, Emre Sargin Seminal industry paper establishing two-stage deep learning (candidate generation + ranking) at billion-scale.
2016 3182 cited

Deep Neural Networks for YouTube Recommendations

Paul Covington, Jay Adams, Emre Sargin

Seminal industry paper establishing two-stage deep learning (candidate generation + ranking) at billion-scale.

Embedding-based Retrieval in Facebook Search Jui-Ting Huang, et al. Comprehensive industry paper on two-tower embedding models; covers hard negative mining, ANN indexing, production deployment.
2020 230 cited

Embedding-based Retrieval in Facebook Search

Jui-Ting Huang, et al.

Comprehensive industry paper on two-tower embedding models; covers hard negative mining, ANN indexing, production deployment.

Self-Attentive Sequential Recommendation (SASRec) Wang-Cheng Kang, Julian McAuley Applies self-attention to sequential recommendations; the Transformer foundation inspiring BERT4Rec and modern sequential models.
2018 12 cited

Self-Attentive Sequential Recommendation (SASRec)

Wang-Cheng Kang, Julian McAuley

Applies self-attention to sequential recommendations; the Transformer foundation inspiring BERT4Rec and modern sequential models.

BERT4Rec: Sequential Recommendation with BERT Fei Sun, et al. (Alibaba) Adapts BERT's bidirectional self-attention with Cloze task for sequential predictions.
2019 228 cited

BERT4Rec: Sequential Recommendation with BERT

Fei Sun, et al. (Alibaba)

Adapts BERT's bidirectional self-attention with Cloze task for sequential predictions.

Neural Collaborative Filtering Xiangnan He, et al. Replaces inner product with neural networks; introduces GMF+MLP framework (NeuMF); highly cited baseline.
2017 6183 cited

Neural Collaborative Filtering

Xiangnan He, et al.

Replaces inner product with neural networks; introduces GMF+MLP framework (NeuMF); highly cited baseline.

Wide & Deep Learning for Recommender Systems Heng-Tze Cheng, Levent Koc, Jeremiah Harmsen, Tal Shaked, Tushar Chandra, Hrishi Aradhye, Glen Anderson, Greg Corrado, Wei Chai, Mustafa Ispir, Rohan Anil, Zakaria Haque, Lichan Hong, Vihan Jain, Xiaobing Liu, Hemal Shah Jointly trains wide linear models (memorization) with deep networks (generalization) using shared embeddings. Productionized on Google Play for 1B+ users; seminal industry paper establishing wide+deep paradigm.
2016 3197 cited

Wide & Deep Learning for Recommender Systems

Heng-Tze Cheng, Levent Koc, Jeremiah Harmsen, Tal Shaked, Tushar Chandra, Hrishi Aradhye, Glen Anderson, Greg Corrado, Wei Chai, Mustafa Ispir, Rohan Anil, Zakaria Haque, Lichan Hong, Vihan Jain, Xiaobing Liu, Hemal Shah

Jointly trains wide linear models (memorization) with deep networks (generalization) using shared embeddings. Productionized on Google Play for 1B+ users; seminal industry paper establishing wide+deep paradigm.

DeepFM: A Factorization-Machine based Neural Network for CTR Prediction Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, Xiuqiang He Combines FM component (low-order interactions) with deep component (high-order) via shared embeddings. Unlike Wide&Deep, requires no manual feature engineering. End-to-end training.
2017 2132 cited

DeepFM: A Factorization-Machine based Neural Network for CTR Prediction

Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, Xiuqiang He

Combines FM component (low-order interactions) with deep component (high-order) via shared embeddings. Unlike Wide&Deep, requires no manual feature engineering. End-to-end training.

Deep Interest Network for Click-Through Rate Prediction Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, Kun Gai Attention mechanism adaptively learns user interest representations from behavioral history relative to candidate items—solving fixed-length embedding bottleneck. Deployed on Alibaba main traffic.
2018 1902 cited

Deep Interest Network for Click-Through Rate Prediction

Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, Kun Gai

Attention mechanism adaptively learns user interest representations from behavioral history relative to candidate items—solving fixed-length embedding bottleneck. Deployed on Alibaba main traffic.

Causal Recommendations & Debiasing

Make fair recommendations despite biased data

Recommendations as Treatments: Debiasing Learning and Evaluation Tobias Schnabel, Adith Swaminathan, Ashudeep Singh, Navin Chandak, Thorsten Joachims Foundational paper applying causal inference to recommenders; introduces IPS-based unbiased estimators.
2016 142 cited

Recommendations as Treatments: Debiasing Learning and Evaluation

Tobias Schnabel, Adith Swaminathan, Ashudeep Singh, Navin Chandak, Thorsten Joachims

Foundational paper applying causal inference to recommenders; introduces IPS-based unbiased estimators.

Unbiased Learning-to-Rank with Biased Feedback Thorsten Joachims, Adith Swaminathan, Tobias Schnabel Addresses position bias in click data; propensity-weighted ranking SVM; essential for implicit feedback.
2017 495 cited

Unbiased Learning-to-Rank with Biased Feedback

Thorsten Joachims, Adith Swaminathan, Tobias Schnabel

Addresses position bias in click data; propensity-weighted ranking SVM; essential for implicit feedback.

The Self-Normalized Estimator for Counterfactual Learning Adith Swaminathan, Thorsten Joachims Introduces SNIPS reducing IPS variance without bias; widely used in production.
2015 200 cited

The Self-Normalized Estimator for Counterfactual Learning

Adith Swaminathan, Thorsten Joachims

Introduces SNIPS reducing IPS variance without bias; widely used in production.

Counterfactual Learning and Evaluation for Recommender Systems Yuta Saito, Thorsten Joachims Comprehensive tutorial covering IPS, SNIPS, Doubly Robust estimators with implementation guidance.
2021 46 cited

Counterfactual Learning and Evaluation for Recommender Systems

Yuta Saito, Thorsten Joachims

Comprehensive tutorial covering IPS, SNIPS, Doubly Robust estimators with implementation guidance.

Doubly Robust Joint Learning for Recommendation on Data Missing Not at Random Xiaojie Wang, Rui Zhang, Yu Sun, Jianzhong Qi Combines imputation models with propensity scoring for unbiased performance estimation; theoretically principled doubly robust framework specifically for recommender systems with MNAR data.
2019 102 cited

Doubly Robust Joint Learning for Recommendation on Data Missing Not at Random

Xiaojie Wang, Rui Zhang, Yu Sun, Jianzhong Qi

Combines imputation models with propensity scoring for unbiased performance estimation; theoretically principled doubly robust framework specifically for recommender systems with MNAR data.

Causal Embeddings for Recommendation Stephen Bonner, Flavian Vasile CausE optimizes recommendation policy for causal treatment effects (not just prediction) using domain adaptation to handle biased logged data. RecSys Best Paper Award.
2018 208 cited

Causal Embeddings for Recommendation

Stephen Bonner, Flavian Vasile

CausE optimizes recommendation policy for causal treatment effects (not just prediction) using domain adaptation to handle biased logged data. RecSys Best Paper Award.

The Deconfounded Recommender: A Causal Inference Approach to Recommendation Yixin Wang, Dawen Liang, Laurent Charlin, David Blei Two-stage approach using substitute confounders from exposure modeling; addresses unobserved confounding in observational recommendation data from principled causal perspective.
2020 43 cited

The Deconfounded Recommender: A Causal Inference Approach to Recommendation

Yixin Wang, Dawen Liang, Laurent Charlin, David Blei

Two-stage approach using substitute confounders from exposure modeling; addresses unobserved confounding in observational recommendation data from principled causal perspective.

Exploration & Diversity

Balance showing what users like vs. new discoveries

Topic Diversification for Recommendation Lists Cai-Nicolas Ziegler, Sean McNee, Joseph Konstan, Georg Lausen Pioneering paper on balancing accuracy with diversity; introduces intra-list diversity metrics.
2005 1834 cited

Topic Diversification for Recommendation Lists

Cai-Nicolas Ziegler, Sean McNee, Joseph Konstan, Georg Lausen

Pioneering paper on balancing accuracy with diversity; introduces intra-list diversity metrics.

Exploring the Filter Bubble Tien Nguyen, Pik-Mai Hui, F. Maxwell Harper, Loren Terveen, Joseph Konstan First rigorous longitudinal study measuring filter bubble effects at individual level using MovieLens.
2014 393 cited

Exploring the Filter Bubble

Tien Nguyen, Pik-Mai Hui, F. Maxwell Harper, Loren Terveen, Joseph Konstan

First rigorous longitudinal study measuring filter bubble effects at individual level using MovieLens.

Blockbuster Culture's Next Rise or Fall Daniel Fleder, Kartik Hosanagar Analyzes how recommenders affect aggregate sales diversity (long tail vs. blockbusters).
2009 1 cited

Blockbuster Culture's Next Rise or Fall

Daniel Fleder, Kartik Hosanagar

Analyzes how recommenders affect aggregate sales diversity (long tail vs. blockbusters).

Explore, Exploit, and Explain James McInerney, et al. (Spotify) Spotify's production system combining contextual bandits for exploration with explainable recommendations.
2018 143 cited

Explore, Exploit, and Explain

James McInerney, et al. (Spotify)

Spotify's production system combining contextual bandits for exploration with explainable recommendations.

A Contextual-Bandit Approach to Personalized News Article Recommendation Lihong Li, Wei Chu, John Langford, Robert Schapire Introduces LinUCB algorithm for contextual bandits; 12.5% CTR lift over context-free bandits on 33M+ Yahoo events. Foundational paper for bandit-based recommendations.
2010 2403 cited

A Contextual-Bandit Approach to Personalized News Article Recommendation

Lihong Li, Wei Chu, John Langford, Robert Schapire

Introduces LinUCB algorithm for contextual bandits; 12.5% CTR lift over context-free bandits on 33M+ Yahoo events. Foundational paper for bandit-based recommendations.

An Empirical Evaluation of Thompson Sampling Olivier Chapelle, Lihong Li Comprehensive evaluation across display advertising and news recommendation demonstrating Thompson Sampling achieves state-of-the-art results; reignited practical interest in TS.
2011 998 cited

An Empirical Evaluation of Thompson Sampling

Olivier Chapelle, Lihong Li

Comprehensive evaluation across display advertising and news recommendation demonstrating Thompson Sampling achieves state-of-the-art results; reignited practical interest in TS.

Calibrated Recommendations Harald Steck Shows accuracy-optimized recommenders crowd out users' lesser interests; proposes KL-divergence calibration metrics and efficient greedy re-ranking. Netflix research, RecSys Best Paper Nominee.
2018 259 cited

Calibrated Recommendations

Harald Steck

Shows accuracy-optimized recommenders crowd out users' lesser interests; proposes KL-divergence calibration metrics and efficient greedy re-ranking. Netflix research, RecSys Best Paper Nominee.

Cold Start

Recommend to new users or items with no history

DropoutNet: Addressing Cold Start in Recommender Systems Maksims Volkovs, Guangwei Yu, Tomi Poutanen Uses dropout to force reliance on content features when collaborative signals unavailable; practical and widely adopted.
2017 154 cited

DropoutNet: Addressing Cold Start in Recommender Systems

Maksims Volkovs, Guangwei Yu, Tomi Poutanen

Uses dropout to force reliance on content features when collaborative signals unavailable; practical and widely adopted.

A Meta-Learning Perspective on Cold-Start Recommendations Manasi Vartak, et al. (Twitter) Applies meta-learning to item cold-start; learns to adapt quickly from user history.
2017 148 cited

A Meta-Learning Perspective on Cold-Start Recommendations

Manasi Vartak, et al. (Twitter)

Applies meta-learning to item cold-start; learns to adapt quickly from user history.

Collaborative Deep Learning for Recommender Systems Hao Wang, Naiyan Wang, Dit-Yan Yeung Combines deep learning for content (stacked denoising autoencoders) with CF; influential hybrid approach.
2015 1613 cited

Collaborative Deep Learning for Recommender Systems

Hao Wang, Naiyan Wang, Dit-Yan Yeung

Combines deep learning for content (stacked denoising autoencoders) with CF; influential hybrid approach.

MeLU: Meta-Learned User Preference Estimator Hoyeop Lee, et al. Applies MAML framework to user cold-start; learns initialization that quickly adapts to new users.
2019 321 cited

MeLU: Meta-Learned User Preference Estimator

Hoyeop Lee, et al.

Applies MAML framework to user cold-start; learns initialization that quickly adapts to new users.

From Zero-Shot Learning to Cold-Start Recommendation Jingjing Li, Mengmeng Jing, Ke Lu, Zhengming Zhu, Lei Zhu, Yang Huang First paper framing cold-start as zero-shot learning problem; proposes Low-rank Linear Auto-Encoder (LLAE) addressing domain shift and spurious correlations. Novel theoretical connection enabling attribute-based recommendations for entirely new users.
2019 143 cited

From Zero-Shot Learning to Cold-Start Recommendation

Jingjing Li, Mengmeng Jing, Ke Lu, Zhengming Zhu, Lei Zhu, Yang Huang

First paper framing cold-start as zero-shot learning problem; proposes Low-rank Linear Auto-Encoder (LLAE) addressing domain shift and spurious correlations. Novel theoretical connection enabling attribute-based recommendations for entirely new users.

Transfer-Meta Framework for Cross-domain Recommendation to Cold-Start Users Yongchun Zhu, Kaikai Ge, Fuzhen Zhuang, Ruobing Xie, Dongbo Xi, Xu Zhang, Leyu Lin, Hui Xiong State-of-the-art combining transfer learning and meta-learning for cross-domain cold start; uses source domain to warm-start target domain predictions for zero-interaction users.
2021 70 cited

Transfer-Meta Framework for Cross-domain Recommendation to Cold-Start Users

Yongchun Zhu, Kaikai Ge, Fuzhen Zhuang, Ruobing Xie, Dongbo Xi, Xu Zhang, Leyu Lin, Hui Xiong

State-of-the-art combining transfer learning and meta-learning for cross-domain cold start; uses source domain to warm-start target domain predictions for zero-interaction users.

Graph Neural Networks for Recommendations

Leverage network structure for better recommendations

PinSage: Graph Convolutional Neural Networks for Web-Scale Recommender Systems Rex Ying, Ruining He, Kaifeng Chen, Pong Eksombatchai, William Hamilton, Jure Leskovec First billion-scale GCN deployment. Random-walk neighborhood sampling, curriculum training with hard negatives, MapReduce inference for Pinterest's 3B node graph. Seminal industrial GNN paper.
2018 2562 cited

PinSage: Graph Convolutional Neural Networks for Web-Scale Recommender Systems

Rex Ying, Ruining He, Kaifeng Chen, Pong Eksombatchai, William Hamilton, Jure Leskovec

First billion-scale GCN deployment. Random-walk neighborhood sampling, curriculum training with hard negatives, MapReduce inference for Pinterest's 3B node graph. Seminal industrial GNN paper.

Neural Graph Collaborative Filtering Xiang Wang, Xiangnan He, Meng Wang, Fuli Feng, Tat-Seng Chua First to explicitly encode collaborative signal via high-order connectivity on user-item bipartite graphs through embedding propagation. Foundational theoretical framework for GNN-based CF.
2019 2737 cited

Neural Graph Collaborative Filtering

Xiang Wang, Xiangnan He, Meng Wang, Fuli Feng, Tat-Seng Chua

First to explicitly encode collaborative signal via high-order connectivity on user-item bipartite graphs through embedding propagation. Foundational theoretical framework for GNN-based CF.

LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation Xiangnan He, Kuan Deng, Xiang Wang, Yan Li, Yongdong Zhang, Meng Wang Demonstrates feature transformation and nonlinear activation contribute little to CF; proposes simplified GCN using only neighborhood aggregation—16% improvement over NGCF with simpler architecture.
2020 3523 cited

LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation

Xiangnan He, Kuan Deng, Xiang Wang, Yan Li, Yongdong Zhang, Meng Wang

Demonstrates feature transformation and nonlinear activation contribute little to CF; proposes simplified GCN using only neighborhood aggregation—16% improvement over NGCF with simpler architecture.

KGAT: Knowledge Graph Attention Network for Recommendation Xiang Wang, Xiangnan He, Yixin Cao, Meng Liu, Tat-Seng Chua Unifies user-item interaction graphs with knowledge graphs via attention-based neighbor discrimination; enables more accurate, diverse, and explainable recommendations.
2019 1899 cited

KGAT: Knowledge Graph Attention Network for Recommendation

Xiang Wang, Xiangnan He, Yixin Cao, Meng Liu, Tat-Seng Chua

Unifies user-item interaction graphs with knowledge graphs via attention-based neighbor discrimination; enables more accurate, diverse, and explainable recommendations.

Multi-Task & Multi-Objective Learning

Optimize multiple recommendation goals together

Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts Jiaqi Ma, Zhe Zhao, Xinyang Yi, Jilin Chen, Lichan Hong, Ed Chi Task-specific gating networks over shared expert submodels; explicitly learns task relationships from data. Deployed at Google; widely adopted at Pinterest, LinkedIn, Meta.
2018 987 cited

Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts

Jiaqi Ma, Zhe Zhao, Xinyang Yi, Jilin Chen, Lichan Hong, Ed Chi

Task-specific gating networks over shared expert submodels; explicitly learns task relationships from data. Deployed at Google; widely adopted at Pinterest, LinkedIn, Meta.

Progressive Layered Extraction (PLE): A Novel Multi-Task Learning Model for Personalized Recommendations Hongyan Tang, Junning Liu, Ming Zhao, Xudong Gong Addresses 'seesaw phenomenon' where improving one task hurts others; explicitly separates shared/task-specific experts with progressive routing. Achieved 2.23% lift at Tencent.
2020 496 cited

Progressive Layered Extraction (PLE): A Novel Multi-Task Learning Model for Personalized Recommendations

Hongyan Tang, Junning Liu, Ming Zhao, Xudong Gong

Addresses 'seesaw phenomenon' where improving one task hurts others; explicitly separates shared/task-specific experts with progressive routing. Achieved 2.23% lift at Tencent.

Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate Xiao Ma, Liqin Zhao, Guan Huang, Zhi Wang, Zelin Hu, Xiaoqiang Zhu, Kun Gai Models CVR over entire impression space (not just clicks) to eliminate sample selection bias; jointly trains CTR and CTCVR with shared embeddings. Alibaba/Taobao deployment.
2018 335 cited

Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate

Xiao Ma, Liqin Zhao, Guan Huang, Zhi Wang, Zelin Hu, Xiaoqiang Zhu, Kun Gai

Models CVR over entire impression space (not just clicks) to eliminate sample selection bias; jointly trains CTR and CTCVR with shared embeddings. Alibaba/Taobao deployment.

A Pareto-Efficient Algorithm for Multiple Objective Optimization in E-Commerce Recommendation Yao Lin, Dongjin Chen, Mingsheng Shang, Youfang Lin, Shenghua Bao, Wei Xiao, Tat-Seng Chua PE-LTR framework using coordinate descent with theoretical Pareto efficiency guarantees for balancing CTR and GMV. Alibaba e-commerce production system.
2019 97 cited

A Pareto-Efficient Algorithm for Multiple Objective Optimization in E-Commerce Recommendation

Yao Lin, Dongjin Chen, Mingsheng Shang, Youfang Lin, Shenghua Bao, Wei Xiao, Tat-Seng Chua

PE-LTR framework using coordinate descent with theoretical Pareto efficiency guarantees for balancing CTR and GMV. Alibaba e-commerce production system.

Reinforcement Learning for Recommendations

Optimize for long-term user satisfaction

Top-K Off-Policy Correction for a REINFORCE Recommender System Minmin Chen, Alex Beutel, Paul Covington, Sagar Jain, Francois Belletti, Ed Chi Scales REINFORCE to YouTube production with millions of items; introduces top-K off-policy correction for learning from biased logged feedback. Seminal industry RL paper.
2019 366 cited

Top-K Off-Policy Correction for a REINFORCE Recommender System

Minmin Chen, Alex Beutel, Paul Covington, Sagar Jain, Francois Belletti, Ed Chi

Scales REINFORCE to YouTube production with millions of items; introduces top-K off-policy correction for learning from biased logged feedback. Seminal industry RL paper.

SlateQ: A Tractable Decomposition for Reinforcement Learning with Recommendation Sets Eugene Ie, Vihan Jain, Jing Wang, Sanmit Narvekar, Ritesh Agarwal, Rui Wu, Heng-Tze Cheng, Tushar Chandra, Craig Boutilier Value-based RL decomposition for slate recommendations; long-term slate value decomposes into tractable item-wise LTVs. YouTube production deployment solving combinatorial slate optimization.
2019 110 cited

SlateQ: A Tractable Decomposition for Reinforcement Learning with Recommendation Sets

Eugene Ie, Vihan Jain, Jing Wang, Sanmit Narvekar, Ritesh Agarwal, Rui Wu, Heng-Tze Cheng, Tushar Chandra, Craig Boutilier

Value-based RL decomposition for slate recommendations; long-term slate value decomposes into tractable item-wise LTVs. YouTube production deployment solving combinatorial slate optimization.

Deep Reinforcement Learning for List-wise Recommendations Xiangyu Zhao, Liang Zhang, Zhuoye Ding, Long Xia, Jiliang Tang, Dawei Yin Actor-Critic framework capturing inter-item relationships in list recommendations; addresses sequential decision-making for e-commerce. JD.com application.
2018 389 cited

Deep Reinforcement Learning for List-wise Recommendations

Xiangyu Zhao, Liang Zhang, Zhuoye Ding, Long Xia, Jiliang Tang, Dawei Yin

Actor-Critic framework capturing inter-item relationships in list recommendations; addresses sequential decision-making for e-commerce. JD.com application.

Pseudo Dyna-Q: A Reinforcement Learning Framework for Interactive Recommendation Lixin Zou, Long Xia, Zhuoye Ding, Dawei Yin, Jiaxing Song, Weidong Liu, Yongjun Bao Model-based RL using world models for recommendation; addresses data efficiency challenge of learning from limited online interactions.
2020 103 cited

Pseudo Dyna-Q: A Reinforcement Learning Framework for Interactive Recommendation

Lixin Zou, Long Xia, Zhuoye Ding, Dawei Yin, Jiaxing Song, Weidong Liu, Yongjun Bao

Model-based RL using world models for recommendation; addresses data efficiency challenge of learning from limited online interactions.

Fairness & Responsible Recommendations

Ensure fair exposure for creators and sellers

Fairness of Exposure in Rankings Ashudeep Singh, Thorsten Joachims Foundational framework for exposure-based fairness; develops efficient algorithms maximizing user utility while satisfying fairness constraints on content provider exposure. Applicable to job platforms, e-commerce, any two-sided marketplace.
2018 524 cited

Fairness of Exposure in Rankings

Ashudeep Singh, Thorsten Joachims

Foundational framework for exposure-based fairness; develops efficient algorithms maximizing user utility while satisfying fairness constraints on content provider exposure. Applicable to job platforms, e-commerce, any two-sided marketplace.

Towards a Fair Marketplace: Counterfactual Evaluation of the Trade-off between Relevance, Fairness & Satisfaction Rishabh Mehrotra, James McInerney, Hugues Bouchard, Mounia Lalmas, Fernando Diaz Studies relevance-fairness trade-offs in two-sided marketplaces; proposes counterfactual evaluation for balancing consumer and supplier objectives. Spotify production research.
2018 264 cited

Towards a Fair Marketplace: Counterfactual Evaluation of the Trade-off between Relevance, Fairness & Satisfaction

Rishabh Mehrotra, James McInerney, Hugues Bouchard, Mounia Lalmas, Fernando Diaz

Studies relevance-fairness trade-offs in two-sided marketplaces; proposes counterfactual evaluation for balancing consumer and supplier objectives. Spotify production research.

Controlling Fairness and Bias in Dynamic Learning-to-Rank Marco Morik, Ashudeep Singh, Jessica Hong, Thorsten Joachims Learning-to-rank enforcing merit-based fairness guarantees to item groups while accounting for selection bias in implicit feedback. Addresses fairness maintenance over time.
2020 193 cited

Controlling Fairness and Bias in Dynamic Learning-to-Rank

Marco Morik, Ashudeep Singh, Jessica Hong, Thorsten Joachims

Learning-to-rank enforcing merit-based fairness guarantees to item groups while accounting for selection bias in implicit feedback. Addresses fairness maintenance over time.

Recommendations and Their Impact on the Provider Side Rishabh Mehrotra, James McInerney, Hugues Bouchard, Mounia Lalmas Comprehensive study of how recommendations affect content providers; examines supplier-side impacts and multi-stakeholder trade-offs. Spotify research.
2019 45 cited

Recommendations and Their Impact on the Provider Side

Rishabh Mehrotra, James McInerney, Hugues Bouchard, Mounia Lalmas

Comprehensive study of how recommendations affect content providers; examines supplier-side impacts and multi-stakeholder trade-offs. Spotify research.

Evaluation Methodology

Measure recommendation quality beyond clicks

Offline A/B Testing for Recommender Systems Alexandre Gilotte, Clément Calauzènes, Thomas Nedelec, Alexandre Abraham, Simon Dollé Counterfactual estimators for offline evaluation correlating with online A/B tests; addresses bias-variance tradeoffs in off-policy evaluation. Criteo production system enabling faster iteration.
2018 123 cited

Offline A/B Testing for Recommender Systems

Alexandre Gilotte, Clément Calauzènes, Thomas Nedelec, Alexandre Abraham, Simon Dollé

Counterfactual estimators for offline evaluation correlating with online A/B tests; addresses bias-variance tradeoffs in off-policy evaluation. Criteo production system enabling faster iteration.

Performance of Recommender Algorithms on Top-N Recommendation Tasks Paolo Cremonesi, Yehuda Koren, Roberto Turrin Demonstrates RMSE optimization doesn't translate to top-N accuracy; establishes methodology for evaluating recommendation quality beyond prediction error metrics. Netflix context.
2010 1406 cited

Performance of Recommender Algorithms on Top-N Recommendation Tasks

Paolo Cremonesi, Yehuda Koren, Roberto Turrin

Demonstrates RMSE optimization doesn't translate to top-N accuracy; establishes methodology for evaluating recommendation quality beyond prediction error metrics. Netflix context.

Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches Maurizio Ferrari Dacrema, Paolo Cremonesi, Dietmar Jannach Critical analysis showing many neural approaches don't outperform well-tuned baselines; emphasizes reproducibility and rigorous evaluation methodology. Essential for experimental design.
2019 373 cited

Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches

Maurizio Ferrari Dacrema, Paolo Cremonesi, Dietmar Jannach

Critical analysis showing many neural approaches don't outperform well-tuned baselines; emphasizes reproducibility and rigorous evaluation methodology. Essential for experimental design.

Must-read papers for tech economists and applied researchers