Recommender systems personalize content by recommending items to users. Item recommendation algorithms are evaluated by metrics that compare the positions of truly relevant items among the recommended items. To speed up the computation of metrics, recent work often uses sampled metrics where only a smaller set of random items and the relevant items are ranked. This paper investigates such sampled metrics in more detail and shows that they are inconsistent with their exact counterpart, in the sense that they do not persist relative statements, for example, *recommender A is better than B*, not even in expectation. Moreover, the smaller the sample size, the less difference there is between metrics, and for very small sample size, all metrics collapse to the AUC metric. We show that it is possible to improve the quality of the sampled metrics by applying a correction, obtained by minimizing different criteria. We conclude with an empirical evaluation of the naive sampled metrics and their corrected variants. To summarize, our work suggests that sampling should be avoided for metric calculation, however if an experimental study needs to sample, the proposed corrections can improve the quality of the estimate.

### 1. Introduction

Recommender systems are a key technology in online platforms for personalizing the selection of *items* that are shown to a user. Examples include recommending which products to buy, which videos to watch or which songs to play. Recommendations are typically user-dependent and often context-dependent. A key operation of recommender systems is to retrieve a ranked list of the best items for a user in a particular context. This task is called *item recommendation.* Usually, the catalogue of items to retrieve from is large: tens of thousands in academic studies and often millions or more in industrial applications. Finding matching items from this large pool is challenging as the user will usually only explore a few of the highest ranked ones. When building new algorithms for item recommendation, it is crucial to understand how well a particular item recommendation algorithm performs. For evaluating item recommenders, usually sharp metrics such as precision or recall over the few highest scoring items (e.g., top 10), are favored. Other popular choices include average precision or normalized discounted cumulative gain (NDCG), which place a strong emphasis on the top ranked items.

Item recommendation can be very costly for large catalogues because without additional indexing it requires scoring all items. Recently, it has become common in research papers to speed up evaluation by sampling a small set of irrelevant items and ranking the relevant items only among this smaller set.^{2,4,5,6,8,9,10} Although sampling the loss during training is well-studied,^{11} to the best of our knowledge, the implications of sampling during *evaluation* have not been explored, and this work attempts to shed light on the topic. In particular, we show that findings from sampled metrics (even in expectation) can be inconsistent with exact metrics. This means that if a recommender A outperforms a recommender B on a sampled metric, this does not imply that A has a better metric than B when the metric is computed exactly. This problem occurs even in expectation; that is, with unlimited repetitions of the measurement. Moreover, a sampled metric has different characteristics than its exact counterpart. In general, the smaller the sample size, the less difference there is between different metrics, and in the small sample limit, all metrics collapse to the area under the ROC curve (AUC), which discounts positions linearly. This is particularly problematic because many ranking metrics are designed to focus on the top positions, which is not the case for AUC.

As we will show, the sampled metrics can be viewed as high-bias, low-variance estimators of the exact metrics. Their low variance can be particularly misleading if one does not recognize that they are biased, as repeated measurements may indicate a low variance, and yet no meaningful conclusion can be drawn because the bias is *recommender-dependent*, that is, the bias depends on the recommender algorithm being evaluated. We also show that this issue can be alleviated if one applies a point-wise correction to the sampled metric, by minimizing criteria that trade-off bias and variance. Empirical performance of the sampled metrics and their corrections is illustrated on a movie recommendation problem.

This analysis suggests that if a study is really interested in metrics that emphasize the top-ranked items, sampling candidates should be avoided for the purposes of evaluation, and if the size of the problem is such that sampling is necessary, corrected metrics can provide a more accurate evaluation. Lastly, if sampling is used, the reader should be aware that the reported metric has different characteristics than its name implies.

### 2. Evaluating Item Recommendation

This section starts by formalizing the most common evaluation scheme for item recommendation. Let there be a pool of *n* items to recommend from. For a given instance^{a} **x,** a recommendation algorithm, *A*, returns a ranked list of the *n* items. In an evaluation, the positions, *R*(*A*, **x**) ∪ {1, …, *n*}, of the withheld relevant items within this ranking are computed—*R* will also be referred to as the *predicted ranks.* For example, *R*(*A*, **x**) = {3, 5} means for an instance **x** recommender *A* ranked two relevant items at positions 3 and 5. Then, a metric *M* is used to translate the positions into a single number measuring the quality of the ranking. This process is repeated for a set of instances, *D* = {**x**_{1}, **x**_{2}, …}, and an average metric is reported:

This problem definition assumes that in the ground truth, all relevant items are equally preferred by the user, that is, the relevant items are a *set.* This is the most commonly used evaluation scheme in recommender systems. In more complex cases, the ground truth includes preferences among the relevant items. For example, the ground truth can be a ranked list or weighted set. Our work shows issues with sampling in the simpler setup, which implies that the issues carry over to the more complex case.

### 3. Metrics

This section recaps commonly used metrics for measuring the quality of a ranking. For convenience, the arguments, *A*, **x**, from *R*(*A*, **x**) are omitted whenever the particular recommender, *A*, or instance, **x,** is clear from context. Instead, the shorter form *R* is used.

Area under the ROC curve (AUC) measures the likelihood that a random relevant item is ranked higher than a random irrelevant item.

with the indicator function δ (*b*) = 1 if *b* is true and 0 otherwise. Precision at position *k* measures the fraction of relevant items among the top *k* predicted items:

Recall at position *k* measures the fraction of all relevant items that were recovered in the top *k*:

Average Precision at *k* measures the precision at all ranks that hold a relevant item:

Normalized discounted cumulative gain (NDCG) at *k* places an inverse log reward on all positions that hold a relevant item:

**3.1. Simplified metrics**

The remainder of the paper analyzes these metrics for |*R*| = 1, that is, when there is exactly one relevant item. We will denote its rank by *r.* This will simplify the analysis and give a better understanding of the differences between these metrics. The metrics of the previous section simplify to the following:

For metrics such as Average Precision and NDCG, it makes sense to also define their untruncated counterpart, that is, for *k* = *n*:

Some other popular metrics can be reduced to these definitions: For |*R*| = 1, *Reciprocal Rank* is equivalent to Average Precision, *Hit Ratio* is equivalent to Recall and *Accuracy* is equivalent to Recall at 1, and Precision at 1.

Figure 1 visualizes how the different ranking metrics trade-off the position versus quality score. Average precision has the sharpest score decay, for example, rank 1 is twice as valuable as rank 2, whereas for NDCG, rank 1 is 1.58 more valuable than rank 2. The least position-aware metric is AUC, which places a linear decay on the rank; for example, improving the ranking of a relevant item from position 101 to 100 is as valuable as an improvement from position 2 to 1.

**Figure 1. Visualization of metric versus predicted rank for n = 10, 000. The left side shows the metrics over the whole set of 10, 000 items. The right side zooms into the contributions of the top 100 ranks. All metrics besides AUC are top heavy and almost completely ignore the tail. This is usually a desirable property for evaluating ranking because users are unlikely to explore items further down the result list.**

**3.2. Example**

This section concludes with a short example that will be used throughout this work. Let there be three recommenders *A*, *B*, *C* and a set of *n* = 10, 000 items. Each recommender is evaluated on five instances (i.e., |*D*| = 5) with one relevant item each. For each instance, each recommender creates a ranking and the position at which the relevant item appears is recorded. Assume that recommender *C* manages to rank the relevant item in one of the evaluation instances on position 2; besides this, it never achieves a good rank for the other four instances. Assume recommender *B* ranks relevant items in two evaluation instances at position 40. And recommender *A* is never good nor terrible and the relevant items are ranked at position 100 in each of the five instances. Table 1 shows more details about the predicted ranks and the corresponding evaluation metrics. On AUC, recommender *A* is the best as it cares about all ranks equally. For top heavy metrics (AP, NDCG, and Recall), recommender *C* scores the highest. This example will be revisited in Section 4.2 when sampled metrics are discussed.

**Table 1. Toy example of evaluating three recommenders A, B, and C on five instances.**

### 4. Sampled Metrics

Ranking all items is expensive when the number of items, *n*, is large. Recently, it has become common to rank only a small set, consisting of the relevant items together with a random sample of *m* irrelevant ones. The metric is then computed on the ranking generated by this subset.^{2,4,5,6,8,9,10} It is common to pick the number of sampled irrelevant items, *m*, to be orders of magnitude smaller than the number of items *n*, for example, *m* = 100 samples for datasets with *n* = {4*k*, 10*k*, 17*k*, 140*k*, 2*M*} items,^{2, 4, 8} *m* = 50 samples for *n* ∈ {2*k*, 18*k*, 14*k*} items,^{5} or *m* = 200 samples for *n* ∈ {17*k*, 450*k*} items.^{10} This section will highlight that this approach is problematic. In particular, results can become inconsistent with the exact metrics.

Let be the ranks of the relevant items among the union of relevant items and the *m* randomly sampled irrelevant ones. It is important to note that is a random variable, that is, it depends on the random sample of irrelevant items. The properties of will be analyzed in Section 4.3.

**4.1. Inconsistency of sampled metrics**

A central goal of evaluation metrics is to make comparisons between recommenders, such as, *recommender A has a higher value than B on metric M.* When comparing recommenders among sampled metrics, we would hope that at least the relative order is preserved in expectation. This property can be formalized as follows.

*Definition 1.* Let the evaluation data *D* be fixed. A metric *M* is __consistent__ under sampling if the relative order of any two recommenders *A* and *B* is preserved in expectation. That is, for all *A*, *B*,

If a metric is inconsistent, then measuring *M* on a subsample is not a good indicator of the true performance of *M.*

**4.2. Example**

Now, the example from Section 3.2 is revisited and the same measures are computed using sampling. Specifically, *m* = 99 random irrelevant items are sampled, the position of the relevant item among this sampled subset is found, and then the metrics are computed for the rank within the subsample. This procedure with a comparable sample size is commonly used in recent work.^{2,4,5,8,10}

Table 2 shows the sampled metrics for the example from Section 3.2. As this is a random process, for better understanding of its outcome, it is repeated 1000 times and the average and standard deviation is computed.^{b}

**Table 2. Sampled evaluation for the recommenders from Table 1.**

Compared to the exact metrics in Table 1, the relative ordering of metrics completely changed. On the exact metrics, C is clearly the best with a 10x higher average precision than B and A. But it has the lowest average precision when sampled measurements are used. A and B perform the same on the exact metrics, but A has a 2x better average precision on the sampled metrics. Sampled average precision does not give any indication of the true ordering among the methods. Similarly, sampled NDCG and sampled Recall at 10 do not agree with the exact metrics. Only AUC is consistent between sampled and exact computation. The other metrics are inconsistent.

Figure 2 shows the same study as in the previous table, as we vary the number of samples, *m.* The relative ordering of recommenders changes with an increasing sample size. For example, for average precision, depending on the number of samples, any conclusion could be drawn: A better than C better than B (for sample size < 50), A better than B better than C (for sample size ≈ 200), C better than A better than B (for sample size ≈ 500), and finally C better than A equal B (for large sample sizes). This example shows that the bias of sampled average precision is recommender-dependent and sample-size dependent. This is why the relative ordering of recommenders changes as we change the sample size. Similar observations can be made for NDCG. Recall is even more sensitive to the sample size, and it takes about *m* = 5000 samples out of *n* = 10,000 items for the metric to become consistent. Only AUC is consistent for all *m*, and the expected metric is independent of sample size.

**Figure 2. Expected sampled metrics for the running example (Section 3.2 and 4.2) as the sample size is increased. For Average Precision, NDCG, and Recall, even the relative order of recommender performance changes with the number of samples. That means, conclusions drawn from a subsample are not consistent with the true performance of the recommender.**

**4.3. Rank distribution under sampling**

This section takes a closer look at the sampling process and derives the distribution of ranks, and the expected metrics. For simplicity, the analysis is restricted to rankings with exactly one relevant item, that is, , so we can use the simplified metrics from Section 3.1. Let *r* denote the true rank of the unique relevant item, and denote its measured rank on the sample.

When an irrelevant item is sampled uniformly, it can either rank higher or lower than the relevant item. If the number of all items is *n*, then the probability that the sampled item *j* is ranked above *r* is:

For example, if *r* is at position 1, the likelihood of a random irrelevant being ranked higher is 0. If *r* = *n*, then the likelihood is 1. Note that the pool of all possible sampled items excludes the truly relevant item and thus has size *n* – 1.

Repeating the sampling procedure *m* times with replacement and counting how often an item is ranked higher, corresponds to a Binomial distribution. In other words, the rank obtained from the sampling process follows . If there are no successes in getting a higher ranked item, the rank remains 1, if all *m* samples are successful, the rank is *m* + 1. The expected value of the metrics under this distribution is

Note that this is implicitly a function of *r*, *m*, and *n*, which appear as parameters of the Binomial distribution. Figure 3 visualizes the expected metrics as we vary *r.* The figure highlights the weight that the sampled metric assigns to different ranks. Metrics such as Average Precision or NDCG are much less top heavy. Even sharp metrics such as recall become smooth. Only AUC remains unchanged. In general, all metrics converge to a linear function in the small sample limit, similar to AUC behavior.

**Figure 3. Characteristics of sampled metrics with a varying number of samples, m. Sampled Average Precision, NDCG, and Recall change their characteristics substantially compared to exact computation of the metric. Even large sample sizes (m = 1000 samples of n = 10000 items) show large bias. Note this plot zooms into the top 1000 ranks out of n = 10000 items.**

**4.4. Expected metrics**

This section analyzes sampled metrics more formally by applying Equation (16) to particular metrics. The discussion focuses on uniform sampling with replacement, that is, Binomial distributed ranks. Similar results hold for uniform sampling without replacement. In this case, the distribution is hyper-geometric, with population size *n* – 1, where a pool of *r* – 1 items can be potential successes. Where appropriate, this variation will be discussed as well.

**Expected AUC.** First, AUC is a linear function of the rank:

Thus by linearity of the expectation, and the fact that follows a Binomial distribution, we have

That means AUC measurements created by sampling are unbiased estimators of the exact AUC. This result is not surprising because the AUC can alternatively be defined as the expectation that a random relevant item is ranked over a random irrelevant one. Consequently, AUC is a consistent metric under sampling.

This result also holds for any sampling distributions where the expected value of the sampled rank is . For example, this is also true for sampling from a hyper-geometric distribution—that is, uniform sampling without replacement.

**Cut-off metrics.** For a cutoff metric such as recall or precision:

where CDF denotes the cumulative distribution of the Binomial distribution. This analysis carries over to any sampling distribution, such as the hypergeometric distribution.

**Average precision.** For the expected value of sampled average precision, we distinguish two cases. If *r* = 1, then and the sampled metric is always equal to 1. If *r* > 1, then *p*(*j* < *r*) > 0 and

Interestingly, this can be written as:

If *AUC*_{n}(*r*)^{m+1} ≈ 0.0, this would be and would be similar to the unsampled average precision metric. However, as soon as the relevant item is reasonably highly ranked (i.e., AUC is close to 1.0), it takes many samples *m* for this term to approach 0.

**Small sample size.** This section investigates the behavior of sampled metrics in the limit, where *m* = 1. In this case, , and for any metric *M* and any sampling distribution:

For uniform sampling^{c} of items, is the probability to sample an item that is ranked after *r*, that is, . Now,

which is a linear function of the true rank *r*, regardless of the metric. If we only care about the ordering produced by two different metrics on a set of rankings (Equation (14)), we can ignore const_{2}. Similarly, for const_{1}, only the sign matters when comparing two sets of ranking. This sign of *M*(2) – *M*(1) depends on how much ranking a relevant item at position 1 is preferred over ranking it at position 2. For metrics that cannot distinguish between the first and second position, such as precision and recall at *k* ≥ 2, the sampled metric is always constant and not useful at all. For any reasonable metric, const_{1} should be negative, that is, ranking at position 1 gives a higher metric than position 2. To summarize, for *m* = 1, all metrics give the same qualitative result in expectation. There is no reason to choose one metric over the other if we are only interested in relative statements such as "metric of *A* is higher than metric of *B.*" Furthermore, the qualitative result with *m* = 1 coincides with exhaustive AUC because (i) all sampled metrics, such as sampled AUC, are indistinguishable for *m* = 1 as shown in this section, and (ii) sampled AUC is consistent with exhaustive AUC as shown in Subsection *Expected AUC.*

The discussion above shows that it does not make sense to choose different metrics for *m* = 1; any sensible metric gives the same qualitative statement. A similar observation can be found in Figures 2 and 3 where all metrics behave similarly for small samples sizes.

### 5. Corrected Metrics

So far, we have shown that sampled metrics have different characteristics than the same metric on the full set of items. This section investigates whether we can design a sampled metric , a function from {1, …, *m* + 1} to ℝ, such that provides a good estimate of *M*(*r*). We will consider different definitions of what a "good" estimate is.

**5.1. Unbiased estimator of the rank**

Our first approach is motivated by a simple observation. The sampled metrics that are commonly used are obtained by applying the exact metric *M* to the observed rank , that is, . But is a poor estimate of the true rank *r*, in fact it always under-estimates it. Instead, one can measure the metric not on the observed rank , but on an unbiased estimator of *r.* Recall from Section 4.3 that . If we let , then an unbiased estimator of *p* is given by . Thus an unbiased estimator of *r* = 1 + (*n* – 1)*p* is given by . This motivates using the following corrected metric:

Because the rank estimate is a real number in [1, *n*], and the original metric *M* is only defined on natural numbers, we can either round the rank estimate or extend *M* using, for example, linear interpolation. In our experiments, we round using floor ⌊·⌋.

**5.2. Minimal bias estimator**

The first correction used an unbiased estimator of the rank. However, whenever *M* is nonlinear, is biased in general. A criterion one may seek to optimize is the average bias of , that is, , where *p*(*r*) is a prior on the distribution of ranks, if available,^{d} or the uniform distribution otherwise. Because is a function from {1, …, *m* + 1} to ℝ, can equivalently be viewed as a vector in ℝ^{m+1}. Thus we seek to find a vector that minimizes the following problem:

This is a least-squares problem, and its solution is given by

where

Note that the problem is underdetermined when *m*+1 < *n*, that is, in general, one cannot obtain an unbiased estimator for all *r.* This is consistent with the observation made in Section 4.4 about small sample sizes, that for the limit case *m* = 1, any metric coincides with (an affine transformation of) AUC.

It may also be desirable for the solution to be monotone nonincreasing, so that on any given evaluation point, a higher rank results in a lower estimated metric , although this constraint is not essential when averaging over a large number of evaluation points. The monotonic constraint corresponds to the linear inequalities for all . In this case, problem (21) becomes an isotonic regression problem.^{1} We will refer to this as *Constrained Least Squares* in the experiments.

**5.3. Bias-variance trade-off**

One potential issue with the minimal bias estimator is that it could have high variance, which we observe numerically in Section 6. In order to alleviate this problem, we can regularize problem (21) by introducing a variance term:

where γ is a positive constant. This is a regularized least squares problem and its solution is given by:

with *A* and **b** are from Equation (23) and . When γ = 0, this reduces to problem (21). When γ = 1, this reduces to the least squares estimator and the solution is

In a real study, measurements are aggregated over many evaluation points, which reduce the overall variance, so a lower value γ < 1 is preferable.

**5.4. Example**

Figure 4 shows an example of a corrected average precision metric , for several choices of the parameter γ, and for a uniform prior *p*(*r*). The sample size is *m* = 100 and the full item set is *n* = 10000, that is, a sampling rate of 1%. As can be seen, when no order constraint is applied, lower values of γ give oscillating solutions on the sample (left figure). This is not a problem in aggregate over the full evaluation set (right figure). All corrected sampled metrics are closer, in expectation, to the true metric.

**Figure 4. Evaluating the corrected metric on a sample of m = 100 items (left) is equivalent to measuring the metric on the full item set of m = 10, 000 (right). Different choices of correction algorithms are plotted.**

**5.5. Effect of the sample size and dataset size**

Increasing the sample size *m* reduces the bias of the sampled metrics, as seen in Figure 3, as well as the corrected metrics: for example, the solution in Equation (21) has a lower bias when optimizing over a higher dimensional vector . Increasing the size of the item set, *n*, has the opposite effect. Increasing the number of evaluation points, |*D*|, decreases the variance of the average estimates. This mostly benefits the corrected metrics introduced in this section; the uncorrected metrics are high-bias estimators which will have a large error even in the limit of zero variance.

### 6. Experiments

In this section, we study sampled metrics on real recommender algorithms and a real dataset. We investigate the following: (1) Do recommender algorithms create different ranking distributions, for example, some are better in the top, some are better overall? (2) Are results from sampled metrics and exact metrics inconsistent, for example, a given recommender is better on the sampled metric but worse on the true metric? (3) Can corrections help to get more reliable results?

Our study uses the item recommendation evaluation data-set and setup from^{4}: The data comes from the movie recommender Movielens^{3} where users rate movies. Following the item recommendation protocol, the ratings are ignored, and the task is to recommend movies that a user is likely to rate next. The evaluation protocol removes the most recently rated item from each user's timeline and hides it for evaluation purposes—this item becomes the *relevant* item when measuring the metrics. We use a sampling size of *m* = 100, and we use the metrics Recallⓐ10=HRⓐ10, NDCGⓐ10, AP and AUC. We study the behavior of sampled metrics on three popular recommender system algorithms: matrix factorization and two variations of item-based collaborative filtering (see the appendix in the conference version of this work^{7} for details). We want to emphasize that the purpose of this study is not to make a statement about which particular recommender algorithm is good. The purpose is rather to assess the behavior of metrics and correction methods on different algorithms. To deemphasize the particular recommender method and hyper-parameter choice, we will refer to matrix factorization as "recommender X," to the two item-based collaborative filtering variations as "recommender Y" and "recommender Z."

**6.1. Rank distributions**

For each of the 6040 test users, we rank all items (leaving out the user's training items) and record at which position the withheld relevant item appears. In total, we get 6040 ranks. Figure 5 shows the distribution of these ranks. The plot indicates the different characteristics of the three recommenders. Z is the best in the top 10 but has very poor performance at higher ranks as it puts the relevant items of over 1600 users in the worst bucket. X is more balanced and puts only few items at poor ranks; 2310 items are in the top 100 and less than 300 are in the bottom half. Y is in the middle, with a better top 10 performance than X, but tends to put the relevant item at a worse rank overall.

**Figure 5. Distribution of predicted ranks for three recommender algorithms on the Movielens 1M dataset.**

**6.2. Sampled metrics**

The leftmost block in Table 3 reports the exact metric and the sampled metric with standard deviation.^{e} As expected from the rank distributions, for Recall, NDCG and AP, recommender Z is better than Y better than X on the exact metric. However, on the sampled metric this does not hold. For sampled Recall, the order is reversed and recommender X is much better than Y which is better than Z. All the measures have low standard deviation, so the issue is not that of variance, but is due to the bias in the sampled metrics. Also for NDCG and AP, the worst recommender on the exact metric (X) appears to be the best according to sampled metrics. The relative ordering of the two better recommenders is correct. For AUC, all sampled results are consistent with the exact metrics.

**Table 3. Evaluation of three recommenders (X, Y, and Z) on the Movielens dataset.**

These results indicate that sampled metrics can be inconsistent in real experiments. In particular, if a study would have compared the recommenders only on the sampled metrics, the study would have drawn the wrong conclusion about the performance of the recommender with respect to top heavy metrics such as Recall, NDCG, and AP. The worst recommender (X) would have been found to be the best one.

**6.3. Corrected metrics**

We finally investigate if correction methods can help. We consider the three correction strategies proposed in Section 5: *rank estimate* (Equation (20)), *constrained least squares (CLS)* (Equation (21)) with the constraint , and *bias-variance trade-off (BV γ)* with γ ∈ {1.0, 0.1, 0.01, 0.001} and a uniform rank distribution *p*(*r*) = 1/*n.*

The right block of Table 3 shows the expected metrics under correction. All methods are closer to the exact results than sampling without correction. In particular, CLS and BV with low γ have values close to the exact metric—which indicates a low bias. All identify the order better, for example, all of them place recommender Z as the best performing method for Recall, NDCG and AP. Some of them (BV with low γ) also get the order of recommenders X and Y right. We also conducted experiments with different choices of the sampling size *m* and observed that uncorrected metrics need more than *m* = 1000 samples (equivalent to 1/3^{rd} sampling rate) to correctly order recommenders X and Y, whereas the corrected metric using a bias-variance trade-off with γ = 0.1 already has the correct ordering with less than *m* = 60 samples.

Although the corrections seem to be effective in expectation, one also needs to consider the variance of these measurements. In addition to the variances reported in Table 3, we ran for each metric pairwise comparisons between any two recommenders and counted how often (over 100 repetitions of the experiment) a sampled metric correctly assigns a higher value to the recommender that performs better on the exact metric (see Table 4 in the conference version of this work^{7} for details). For example, for Recall and "X versus Y" we count in how many of 100 repetitions, the sampled Recall of recommender X is worse than Y. As expected, we observe that the corrected metrics with both low variance and low bias, in particular BV 0.1, have a high success rate (>90%) on all but the challenging AP metric for the Y versus Z comparison. Also the simple 'rank estimate' correction is surprisingly effective and is strictly better than the uncorrected metric in all comparisons. It is worth mentioning that under the rank estimate correction, Recallⓐ10 and NDCGⓐ10 are identical (see Table 3). However, it still represents an improvement over the uncorrected metrics which are much more biased and lead to the wrong conclusion. The rank estimate method is trivial to implement (that is, upscaling the rank before applying the metric). In a study with sampled evaluation, this should be preferred over uncorrected metrics. Other corrections such as the adjusted bias-variance can get higher gains but are more difficult to implement.

### 7. Suggestions

Our results have shown a sampled metric can be a poor indicator of the true performance of recommender algorithms under this metric. For uncorrected metrics this is mostly due to the large bias introduced by sampling. Using correction methods, this bias can be reduced but at the cost of higher variance. If a study needs to use sampled metrics and is still interested in the true performance of the metrics, we suggest to use a correction method as proposed in this work. In this case, it is important to rerun the experiment with different samples (for example, different random seeds). It is already common, in most evaluations, to repeat an experiment *N* times—usually by varying the dataset (for example, *N*-fold cross validation). In this case, variance is introduced by the differences in the dataset split and potentially by the initialization of the recommender algorithm. In a sampled evaluation, adding a different seed for negative sampling will add another source of variance. This means that it may be more difficult to find "statistically significant" differences between two recommenders. If even under the increased variance a difference is found, then this is a stronger indication the recommender is truly better under the exact metric. The lower the bias in the corrected metric (for example, the lower γ), the stronger the indication. Although this evaluation is preferable over uncorrected metrics, it is still prone to either not identifying differences (due to variance) or drawing false conclusions because of the bias. This bias can only be eliminated by avoiding sampling altogether.

### 8. Conclusion

This work seeks to bring attention to some issues with sampling of evaluation metrics for item recommendation. It has shown that most metrics are inconsistent under sampling and can lead to false discoveries. Moreover, metrics are usually motivated by applications, for example, does the top 10 list contain a relevant item? Sampled metrics do not measure the intended quantities—not even in expectation. For this reason, sampling should be avoided as much as possible during evaluation. If an experimental study needs to sample, we propose correction methods that give a better estimate of the true metric, however at the cost of increased variance. Our analysis focused on the case of a single relevant item. The general case may be treated by making the approximation that observed ranks are independent, in which case similar correction methods can be applied. Deriving correction methods without independence is an interesting direction for future research.

### Acknowledgment

We would like to thank Nicolas Mayoraz and Li Zhang for their helpful comments and suggestions.

### References

1. Barlow, R., Bartholomew, D., Bremner, J.M., Brenner, H.D. *Statistical Inference Under Order Restrictions: The Theory and Application of Isotonic Regression.* John Wiley, 1972.

2. Ebesu, T., Shen, B., Fang, Y. Collaborative memory network for recommendation systems. In *The 41 ^{st} International ACM SIGIR Conference on Research & Development in Information Retrieval, SIGIR '18* (Ann Arbor, MI, USA, 2018), ACM, New York, NY, USA, 515–524.

3. Harper, F.M., Konstan, J.A. The movielens datasets: History and context. *ACM Trans. Interact. Intell. Syst. 5*, 4 (2015).

4. He, X., Liao, L., Zhang, H., Nie, L., Hu, X., Chua, T.-S. Neural collaborative filtering. In *Proceedings of the 26 ^{th} International Conference on World Wide Web, WWW '17* (Perth, Australia, 2017), International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, Switzerland, 173–182.

5. Hu, B., Shi, C., Zhao, W.X., Yu, P.S. Leveraging meta-path based context for top- n recommendation with a neural co-attention model. In *Proceedings of the 24 ^{th} ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD '18* (London, U.K, 2018), ACM, New York, NY, USA, 1531–1540.

6. Krichene, W., Mayoraz, N., Rendle, S., Zhang, L., Yi, X., Hong, L., Chi, E., Anderson, J. Efficient training on very large corpora via gramian estimation. In *International Conference on Learning Representations* (2019) OpenReview.net, New Orleans, LA, USA.

7. Krichene, W., Rendle, S. On sampled metrics for item recommendation. In *Proceedings of the 26 ^{th} ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD '20* (New York, NY, USA, 2020). Association for Computing Machinery, New York, NY, USA, 1748–1757.

8. Wang, X., Wang, Xu, C., He, X., Cao, Y., Chua, T.-S. Explainable reasoning over knowledge graphs for recommendation. In *Proceedings of the 33 ^{rd} AAAI Conference on Artificial Intelligence (AAAI), AAAI '19* (2019), 5329–5336.

9. Yang, L., Bagdasaryan, E., Gruenstein, J., Hsieh, C.-K., Estrin, D. Openrec: A modular framework for extensible and adaptable recommendation algorithms. In *Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, WSDM '18* (Marina Del Rey, CA, USA, 2018), ACM, New York, NY, USA, 664–672.

10. Yang, L., Cui, Y., Xuan, Y., Wang, C., Belongie, S., Estrin, D. Unbiased offline recommender evaluation for missing-not-at-random implicit feedback. In *Proceedings of the 12 ^{th} ACM Conference on Recommender Systems, RecSys '18* (Vancouver, British Columbia, Canada, 2018), ACM, New York, NY, USA, 279–287.

11. Yu, H.-F., Bilenko, M., Lin, C.-J. Selection of negative samples for one-class matrix factorization. In *Proceedings of the 2017 SIAM International Conference on Data Mining* (2017), 363–371.

### Footnotes

a. For example, a user, context, or query.

b. In a real evaluation, the process would not be repeated because this would defeat the purpose of sampling to reduce computational cost.

c. Here *m* = 1, so it does not matter whether sampling is with or without replacement.

d. Note that the true distribution of ranks *p*(*r*) is algorithm dependent and typically unknown. We use a uniform prior in our experiments.

e. We repeated the sampling experiment 100 times to measure the variance.

To view the accompanying Technical Perspective, visit doi.acm.org/10.1145/3535334

The original version of this paper was published in *Proceedings of the 26 ^{th} ACM SIGKDD International Conference on Knowledge Discovery & Data Mining*, 2020.

The Digital Library is published by the Association for Computing Machinery. Copyright © 2022 ACM, Inc.