We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Recommender systems often rely on models which are trained to maximize accuracy in predicting user preferences. When the systems are deployed, these models determine the availability of content and information to different users. The gap between these objectives gives rise to a potential for unintended consequences, contributing to phenomena such as filter bubbles and polarization. In this work, we consider directly the information availability problem through the lens of user recourse. Using ideas of reachability, we propose a computationally efficient audit for top-$N$ linear recommender models. Furthermore, we describe the relationship between model complexity and the effort necessary for users to exert control over their recommendations. We use this insight to provide a novel perspective on the user cold-start problem. Finally, we demonstrate these concepts with an empirical investigation of a state-of-the-art model trained on a widely used movie ratings dataset.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1912.10068")
get_code_for_paper("1912.10068")
have("1912.10068")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1912.10068.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1912.10068)
Connect an agent — have() is free.