Pith. sign in

REVIEW

Recency Dropout for Recurrent Recommender Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.11016 v1 pith:4XXPH4MF submitted 2022-01-26 cs.IR cs.LG

classification cs.IRcs.LG
keywords recencyrecommenderrecurrentsystemsdropoutbiasexperimentslong-term
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recurrent recommender systems have been successful in capturing the temporal dynamics in users' activity trajectories. However, recurrent neural networks (RNNs) are known to have difficulty learning long-term dependencies. As a consequence, RNN-based recommender systems tend to overly focus on short-term user interests. This is referred to as the recency bias, which could negatively affect the long-term user experience as well as the health of the ecosystem. In this paper, we introduce the recency dropout technique, a simple yet effective data augmentation technique to alleviate the recency bias in recurrent recommender systems. We demonstrate the effectiveness of recency dropout in various experimental settings including a simulation study, offline experiments, as well as live experiments on a large-scale industrial recommendation platform.

Discussion (0). Continue with ORCID to comment.

Pith tools