Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2409.14517 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929509796675584 |
|---|---|
| author | Joshi, Swanand Feng, Yesu Hsiao, Ko-Jen Zhang, Zhe Lamkhede, Sudarshan |
| author_facet | Joshi, Swanand Feng, Yesu Hsiao, Ko-Jen Zhang, Zhe Lamkhede, Sudarshan |
| contents | Long-lived recommender systems (RecSys) often encounter lengthy user-item interaction histories that span many years. To effectively learn long term user preferences, Large RecSys foundation models (FM) need to encode this information in pretraining. Usually, this is done by either generating a long enough sequence length to take all history sequences as input at the cost of large model input dimension or by dropping some parts of the user history to accommodate model size and latency requirements on the production serving side. In this paper, we introduce a sliding window training technique to incorporate long user history sequences during training time without increasing the model input dimension. We show the quantitative & qualitative improvements this technique brings to the RecSys FM in learning user long term preferences. We additionally show that the average quality of items in the catalog learnt in pretraining also improves. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_14517 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Sliding Window Training -- Utilizing Historical Recommender Systems Data for Foundation Models Joshi, Swanand Feng, Yesu Hsiao, Ko-Jen Zhang, Zhe Lamkhede, Sudarshan Information Retrieval Machine Learning Long-lived recommender systems (RecSys) often encounter lengthy user-item interaction histories that span many years. To effectively learn long term user preferences, Large RecSys foundation models (FM) need to encode this information in pretraining. Usually, this is done by either generating a long enough sequence length to take all history sequences as input at the cost of large model input dimension or by dropping some parts of the user history to accommodate model size and latency requirements on the production serving side. In this paper, we introduce a sliding window training technique to incorporate long user history sequences during training time without increasing the model input dimension. We show the quantitative & qualitative improvements this technique brings to the RecSys FM in learning user long term preferences. We additionally show that the average quality of items in the catalog learnt in pretraining also improves. |
| title | Sliding Window Training -- Utilizing Historical Recommender Systems Data for Foundation Models |
| topic | Information Retrieval Machine Learning |
| url | https://arxiv.org/abs/2409.14517 |