Recommender Systems
Build systems that suggest the right content, products, or matches to users • 54 papers
Collaborative Filtering & Matrix Factorization
Recommend based on similar user preferences
Matrix Factorization Techniques for Recommender Systems
The definitive Netflix Prize paper establishing matrix factorization as the dominant CF paradigm.
Collaborative Filtering for Implicit Feedback Datasets
Foundational paper for implicit feedback (clicks, views); introduces confidence-weighted MF with ALS optimization.
BPR: Bayesian Personalized Ranking from Implicit Feedback
Standard pairwise ranking loss for implicit feedback; BPR-OPT criterion ubiquitous in modern training.
Factorization Meets the Neighborhood
Combines neighborhood and latent factor models; integrates user/item biases; essential for blending approaches.
Probabilistic Matrix Factorization
Introduced probabilistic treatment of MF that scales linearly with observations; handles Netflix-scale sparsity with automatic regularization via adaptive priors.
Factorization Machines
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
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
Seminal industry paper establishing two-stage deep learning (candidate generation + ranking) at billion-scale.
Embedding-based Retrieval in Facebook Search
Comprehensive industry paper on two-tower embedding models; covers hard negative mining, ANN indexing, production deployment.
Self-Attentive Sequential Recommendation (SASRec)
Applies self-attention to sequential recommendations; the Transformer foundation inspiring BERT4Rec and modern sequential models.
BERT4Rec: Sequential Recommendation with BERT
Adapts BERT's bidirectional self-attention with Cloze task for sequential predictions.
Neural Collaborative Filtering
Replaces inner product with neural networks; introduces GMF+MLP framework (NeuMF); highly cited baseline.
Wide & Deep Learning for Recommender Systems
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
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
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
Foundational paper applying causal inference to recommenders; introduces IPS-based unbiased estimators.
Unbiased Learning-to-Rank with Biased Feedback
Addresses position bias in click data; propensity-weighted ranking SVM; essential for implicit feedback.
The Self-Normalized Estimator for Counterfactual Learning
Introduces SNIPS reducing IPS variance without bias; widely used in production.
Counterfactual Learning and Evaluation for Recommender Systems
Comprehensive tutorial covering IPS, SNIPS, Doubly Robust estimators with implementation guidance.
Doubly Robust Joint Learning for Recommendation on Data Missing Not at Random
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
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
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
Pioneering paper on balancing accuracy with diversity; introduces intra-list diversity metrics.
Exploring the Filter Bubble
First rigorous longitudinal study measuring filter bubble effects at individual level using MovieLens.
Blockbuster Culture's Next Rise or Fall
Analyzes how recommenders affect aggregate sales diversity (long tail vs. blockbusters).
Explore, Exploit, and Explain
Spotify's production system combining contextual bandits for exploration with explainable recommendations.
A Contextual-Bandit Approach to Personalized News Article Recommendation
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
Comprehensive evaluation across display advertising and news recommendation demonstrating Thompson Sampling achieves state-of-the-art results; reignited practical interest in TS.
Calibrated Recommendations
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
Uses dropout to force reliance on content features when collaborative signals unavailable; practical and widely adopted.
A Meta-Learning Perspective on Cold-Start Recommendations
Applies meta-learning to item cold-start; learns to adapt quickly from user history.
Collaborative Deep Learning for Recommender Systems
Combines deep learning for content (stacked denoising autoencoders) with CF; influential hybrid approach.
MeLU: Meta-Learned User Preference Estimator
Applies MAML framework to user cold-start; learns initialization that quickly adapts to new users.
From Zero-Shot Learning to Cold-Start Recommendation
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
Critical analysis showing many neural approaches don't outperform well-tuned baselines; emphasizes reproducibility and rigorous evaluation methodology. Essential for experimental design.