Clarifications on "top-k recommendation", "non-zero probability of not shown items", and "random intervention"
We would like to provide some clarification regarding item delivery. When referring to "top-$k$”, we actually mean “top-$k$ truncation". For a given user $u_i$, we compute probability $p_{ij}$ for each creator $v_j$. Let $p^{(k)}$ be the $k^{\text{th}}$ largest $p_{ij}$, then all $p_{ij} < p^{(k)}$ are set to 0. Creators are then recommended to $u_i$ based on the remaining nonzero probability $p_{ij}$. This filtering process corresponds to the (first) recall stage commonly found in large-scale recommendation systems with two (or more) stages (see, e.g., [[Youtube's DNN recommendation paper]](https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/45530.pdf)).
Top-$k$ truncation does not mean showing $k$ items to the users. Let's say that a user sees $L$ items in a short time frame. In real-world scenarios, the value of $L$ is usually smaller than $k$ and can depend on factors like screen size. Moreover, the set of $L$ items shown to the user is a random sample from a distribution of items. Reviewer EsTG wrote "(p=0 for items that users can't see)" and "Therefore, I am unclear on why there would be a non-zero probability when only K items are shown". That seems to be a misunderstanding. Even if an item $j$ is not shown to the user in one time step, its probability $p_{ij}$ can still be $>0$, and this item can be sampled and shown to the user in the next time step.
The random traffic intervention (which has been used in large-scale recommendation systems as we discussed in Lines 225 - 227; see also [[KuaiRand, page 4, left column (ii)]](https://arxiv.org/pdf/2208.08696)) bypasses all the steps (scoring, filter, etc) in the multi-stage recommendation system and replaces the candidates returned by the multi-stage recommendation process with randomly chosen candidates at a low probability. The random traffic intervention does not cause efficiency loss for the system. And with random traffic, a user might be recommended any possible creator (namely, all $p_{ij} > 0$), even if $L$ is small.