mlsanityData to 7 Oct 2026

Online Learning for Recommendations at Grubhub

arXiv 2107.07106 ↗First posted 15 Jul 2021cs.IR cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

We propose a method to easily modify existing offline Recommender Systems to run online using Transfer Learning. Online Learning for Recommender Systems has two main advantages: quality and scale. Like many Machine Learning algorithms in production if not regularly retrained will suffer from Concept Drift. A policy that is updated frequently online can adapt to drift faster than a batch system. This is especially true for user-interaction systems like recommenders where the underlying distribution can shift drastically to follow user behaviour. As a platform grows rapidly like Grubhub, the cost of running batch training jobs becomes material. A shift from stateless batch learning offline to stateful incremental learning online can recover, for example, at Grubhub, up to a 45x cost savings and a +20% metrics increase. There are a few challenges to overcome with the transition to online stateful learning, namely convergence, non-stationary embeddings and off-policy evaluation, which we explore from our experiences running this system in production.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 2 of its 4 references that are in the map. First posted on arXiv 15 Jul 2021.

Builds on

2 of 4 references.

References · 2

  1. 2020Model Size Reduction Using Frequency Based Double Hashing for Recommender Systemscited by 33
  2. 2020Deep Bayesian Bandits: Exploring in Online Personalized Recommendationscited by 23

Built on by

Cited by year (2026 to 7 Oct)

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

7 papers.