• Aucun résultat trouvé

Challenges and Limitations in the Offline and Online Evaluation of Recommender Systems: A Netflix Case Study

N/A
N/A
Protected

Academic year: 2022

Partager "Challenges and Limitations in the Offline and Online Evaluation of Recommender Systems: A Netflix Case Study"

Copied!
1
0
0

Texte intégral

(1)

1

Challenges and Limitations in the Offline and Online Evaluation of Recommender Systems:

A Netflix Case Study

Carlos Gomez-Uribe

Netflix, USA

[email protected]

ABSTRACT

The typical use case of recommendation systems is suggesting items such as videos, songs or articles to users. Evaluating a recommender system is critical to the process of improving it. In theory the best judges of the quality and effectiveness of a recommender system are the users themselves, e.g., ideal metrics can describe the intensity and frequency of a user's interaction with the system over the long term. In practice, however, despite the wide adoption of consumer science based on online A/B testing for the evaluation and comparison of differ- ent recommender systems, user-derived measurements are often noisy, slow, non-repeatable, and sensitive to a myriad of potential con- founders. Furthermore, conducting large-scale user experiments for researchers in academia is often impossible. A complementary offline approach can be used to quickly evaluate and optimize new recommender systems on historical user-generated data. Yet these offline measurements need not translate directly onto the sought-after online results, such as increases in user engagement. This talk will describe the blend of offline and online experimentation we use at Netflix to improve upon our recommendation systems, and will discuss some key challenges and limitations of these approaches that are broadly relevant to the recommender systems field.

Références

Documents relatifs

The pro- gram RLGO, based on a linear combination of binary features and using the T D(0) algorithm, has learned the strongest known value function for 9 × 9 Go that doesn’t

Another help to solve the cold start problem in learning comes from the ontologies, knowledge spaces and/or knowledge graphs. These structures organize content

Dans ce contexte, on se propose de construire un système d'information sous réseau local pour avoir une meilleure gestion des informations, minimiser au maximum le temps et l’effort

Offline testing search for DNN prediction errors based on test datasets obtained independently from the DNNs under test, while online testing focuses on detecting safety violations of

From a theoretical perspective, we considered the following problems and developed efficient polynomial algorithms for them: (1) centralized online and batch data

In this conclusion, I make four arguments: first, I show the role of sectarianism and Islamic sects in the formation Muslim identities of my participants; second, I consider

The CLEF NewsREEL challenge allows researchers to evaluate news recommendation algorithms both online (NewsREEL Live) and offline (News- REEL Replay).. Compared with the previous

We examine the classic game of Cops and Robbers played on dynamic graphs, that is, graphs evolving over discrete time steps.. At each time step, a graph instance is generated as