Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.19476 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915262562828288 |
|---|---|
| author | Karzand, Mina Bresler, Guy |
| author_facet | Karzand, Mina Bresler, Guy |
| contents | We consider an online model for recommendation systems, with each user being recommended an item at each time-step and providing 'like' or 'dislike' feedback. A latent variable model specifies the user preferences: both users and items are clustered into types. The model captures structure in both the item and user spaces, as used by item-item and user-user collaborative filtering algorithms. We study the situation in which the type preference matrix has i.i.d. entries. Our main contribution is an algorithm that simultaneously uses both item and user structures, proved to be near-optimal via corresponding information-theoretic lower bounds. In particular, our analysis highlights the sub-optimality of using only one of item or user structure (as is done in most collaborative filtering algorithms). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_19476 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimal Sequential Recommendations: Exploiting User and Item Structure Karzand, Mina Bresler, Guy Machine Learning Information Theory We consider an online model for recommendation systems, with each user being recommended an item at each time-step and providing 'like' or 'dislike' feedback. A latent variable model specifies the user preferences: both users and items are clustered into types. The model captures structure in both the item and user spaces, as used by item-item and user-user collaborative filtering algorithms. We study the situation in which the type preference matrix has i.i.d. entries. Our main contribution is an algorithm that simultaneously uses both item and user structures, proved to be near-optimal via corresponding information-theoretic lower bounds. In particular, our analysis highlights the sub-optimality of using only one of item or user structure (as is done in most collaborative filtering algorithms). |
| title | Optimal Sequential Recommendations: Exploiting User and Item Structure |
| topic | Machine Learning Information Theory |
| url | https://arxiv.org/abs/2504.19476 |