Towards Principled User-side Recommender Systems
Not on the map. Why?
Abstract (arXiv)
Traditionally, recommendation algorithms have been designed for service developers. However, recently, a new paradigm called user-side recommender systems has been proposed and they enable web service users to construct their own recommender systems without access to trade-secret data. This approach opens the door to user-defined fair systems even if the official recommender system of the service is not fair. While existing methods for user-side recommender systems have addressed the challenging problem of building recommender systems without using log data, they rely on heuristic approaches, and it is still unclear whether constructing user-side recommender systems is a well-defined problem from theoretical point of view. In this paper, we provide theoretical justification of user-side recommender systems. Specifically, we see that hidden item features can be recovered from the information available to the user, making the construction of user-side recommender system well-defined. However, this theoretically grounded approach is not efficient. To realize practical yet theoretically sound recommender systems, we propose three desirable properties of user-side recommender systems and propose an effective and efficient user-side recommender system, textscConsul, based on these foundations. We prove that textscConsul satisfies all three properties, whereas existing user-side recommender systems lack at least one of them. In the experiments, we empirically validate the theory of feature recovery via numerical experiments. We also show that our proposed method achieves an excellent trade-off between effectiveness and efficiency and demonstrate via case studies that the proposed method can retrieve information that the provider's official recommender system cannot.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Aug 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 1; 2025: 1; 2026: 1.
7 papers.
- 2023Embarrassingly Simple Text Watermarkscited by 29
- 2023Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structurecited by 4
- 2023Making Translators Privacy-aware on the User's Sidecited by 3
- 2024Overhead-free User-side Recommender Systemscited by 2
- 2025Solving the Cold Start Problem on One's Own as an End User via Preference Transfercited by 1
- 2022Active Learning from the Webcited by 0
- 2026AgentRecommender: LLM Agents Enable Customizable Recommender Systems on the User Sidecited by 0
- 2026AgentRecommender: LLM Agents Enable Customizable Recommender Systems on the User Side25 Sep 2026
- 2025Solving the Cold Start Problem on One's Own as an End User via Preference Transfer18 Feb 2025
- 2024Overhead-free User-side Recommender Systems12 Nov 2024
- 2023Making Translators Privacy-aware on the User's Side7 Dec 2023
- 2023Embarrassingly Simple Text Watermarks13 Oct 2023
- 2023Graph Neural Networks can Recover the Hidden Features Solely from the Graph Structure26 Jan 2023
- 2022Active Learning from the Web15 Oct 2022