Collaborative Filtering with Low Regret
© 2016 ACM. There is much empirical evidence that item-item collaborative filtering works well in practice. Motivated to understand this, we provide a framework to design and analyze various recommendation algorithms. The setup amounts to online binary matrix completion, where at each time a random...
Main Authors: | Bresler, Guy (Author), Shah, Devavrat (Author), Voloch, Luis Filipe (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Institute for Data, Systems, and Society (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2021-11-04T19:03:28Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Collaborative filtering with low regret
by: Voloch, Luis F
Published: (2015) -
Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering
by: Bresler, Guy, et al.
Published: (2021) -
Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering
by: Bresler, Guy, et al.
Published: (2022) -
A Latent Source Model for Online Collaborative Filtering
by: Bresler, Guy, et al.
Published: (2014) -
Matrix Estimation, Latent Variable Model and Collaborative Filtering
by: Shah, Devavrat
Published: (2021)