Recommender systems play an essential role in the choices people make in
domains such as entertainment, shopping, food, news, employment, and education.
The machine learning models underlying these recommender systems are often
enormously large and black-box in nature for users, content providers, and
system developers alike. It is often crucial for all stakeholders to understand
the model's rationale behind making certain predictions and recommendations.
This is especially true for the content providers whose livelihoods depend on
the recommender system. Drawing motivation from the practitioners' need, in
this work, we propose a recourse framework for recommender systems, targeted
towards the content providers. Algorithmic recourse in the recommendation
setting is a set of actions that, if executed, would modify the recommendations
(or ranking) of an item in the desired manner. A recourse suggests actions of
the form: "if a feature changes X to Y, then the ranking of that item for a set
of users will change to Z." Furthermore, we demonstrate that RecRec is highly
effective in generating valid, sparse, and actionable recourses through an
empirical evaluation of recommender systems trained on three real-world
datasets. To the best of our knowledge, this work is the first to conceptualize
and empirically test a generalized framework for generating recourses for
recommender systems.

针对内容提供者，我们提出了一个适用于推荐系统的追索框架，旨在理解模型在做出特定预测和推荐时的基本原理，并通过对三个真实数据集上训练的推荐系统进行实证评估，展示了 RecRec 在生成有效、稀疏和可执行的追索方面的高效性。据我们所知，这项工作是首次对推荐系统生成追索的概念进行了概括和实证测试。

RecRec: 推荐系统的算法性补救

RecRec: Algorithmic Recourse for Recommender Systems

Recommendation systems are dynamic economic systems that balance the needs of
multiple stakeholders. A recent line of work studies incentives from the
content providers' point of view. Content providers, e.g., vloggers and
bloggers, contribute fresh content and rely on user engagement to create
revenue and finance their operations. In this work, we propose a contextual
multi-armed bandit setting to model the dependency of content providers on
exposure. In our model, the system receives a user context in every round and
has to select one of the arms. Every arm is a content provider who must receive
a minimum number of pulls every fixed time period (e.g., a month) to remain
viable in later rounds; otherwise, the arm departs and is no longer available.
The system aims to maximize the users' (content consumers) welfare. To that
end, it should learn which arms are vital and ensure they remain viable by
subsidizing arm pulls if needed. We develop algorithms with sub-linear regret,
as well as a lower bound that demonstrates that our algorithms are optimal up
to logarithmic factors.

本文提出了一种上下文多臂赌博机模型来解决推荐系统中内容提供商对曝光量的依赖性，并开发具有次线性遗憾度和优化目标的算法，该算法的目标是最大程度地提高用户的福利和保留至关重要的内容提供商。