Skip to Main content Skip to Navigation
Conference papers

Online Reciprocal Recommendation with Theoretical Performance Guarantees

Abstract : A reciprocal recommendation problem is one where the goal of learning is not just to predict a user's preference towards a passive item (e.g., a book), but to recommend the targeted user on one side another user from the other side such that a mutual interest between the two exists. The problem thus is sharply different from the more traditional items-to-users recommendation, since a good match requires meeting the preferences at both sides. We initiate a rigorous theoretical investigation of the reciprocal recommendation task in a specific framework of sequential learning. We point out general limitations, formulate reasonable assumptions enabling effective learning and, under these assumptions, we design and analyze a computationally efficient algorithm that uncovers mutual likes at a pace comparable to that achieved by a clairvoyant algorithm knowing all user preferences in advance. Finally, we validate our algorithm against synthetic and real-world datasets, showing improved empirical performance over simple baselines.
Document type :
Conference papers
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Claudio Gentile Connect in order to contact the contributor
Submitted on : Friday, November 9, 2018 - 3:39:37 AM
Last modification on : Friday, January 21, 2022 - 3:12:51 AM
Long-term archiving on: : Sunday, February 10, 2019 - 12:40:13 PM


Files produced by the author(s)


  • HAL Id : hal-01916979, version 1


Fabio Vitale, Nikos Parotsidis, Claudio Gentile. Online Reciprocal Recommendation with Theoretical Performance Guarantees. NIPS 2018 - 32nd Conference on Neural Information Processing Systems, Dec 2018, Montreal, Canada. ⟨hal-01916979⟩



Les métriques sont temporairement indisponibles