TL;DR
This paper investigates the applicability of the lottery ticket hypothesis to media recommender systems, demonstrating that smaller, sparse sub-models can achieve comparable performance to large models, thus reducing complexity.
Contribution
First to extend the lottery ticket hypothesis to media recommender systems, identifying sparse sub-models that maintain performance with significantly fewer parameters.
Findings
Winning tickets exist in recommender models.
Sub-models achieve comparable performance with fewer parameters.
Parameter reduction ranges from 3% to 48% depending on dataset.
Abstract
Media recommender systems aim to capture users' preferences and provide precise personalized recommendation of media content. There are two critical components in the common paradigm of modern recommender models: (1) representation learning, which generates an embedding for each user and item; and (2) interaction modeling, which fits user preferences towards items based on their representations. In spite of great success, when a great amount of users and items exist, it usually needs to create, store, and optimize a huge embedding table, where the scale of model parameters easily reach millions or even larger. Hence, it naturally raises questions about the heavy recommender models: Do we really need such large-scale parameters? We get inspirations from the recently proposed lottery ticket hypothesis (LTH), which argues that the dense and over-parameterized model contains a much smaller…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsLightGCN
