Summary
Updated after response: I think this paper could provide some valuable contributions to the community, but has real presentational issues. The authors fixed some of them that had an easy fix (which I pointed out) during the rebuttal. However, I believe the presentational standards (and therefore the understandabiluty of the contribution) are not up to par for this conference, and I thus stand by my borderline reject recommendation.
This paper studies the Elo rating system, recently popular in the context of ranking LLMs. Specifically they study two axioms that evaluation methods should adhere to: reliability and transitivity. They find that Elo ratings for LLMs are highly sensitive to the order of comparisons and the choice of hyperparameters, and that desirable properties such as transitivity are not always guaranteed.
In their first experiment, the authors focus on order sensitivity. They conduct a controlled experiment with synthetic human feedback, in which they compare various model pairs with different probabilities of winning a pairwise comparison.
They show that, with only order of comparisans (which, if I understand correctly, would be the actual scenario in which we deploy this?), if model A has a probability 40<P<60 to win a pairwise comparison with model B, even 500 games are not enough to converge to the conclusion that model A is better than model B. With 100 orders, the difference is clear after few games, though (semi) convergence happens only after around 80. For smaller differences (51%), even 100 orders do not reliably show the difference between models. For differences of P(a_win > 60) Elo results are stable (?) (I can't fully match this statement in the text with the figures).
Next, the authors investigate the impact of K-factor (which, I learned from Wikipedia, is the maximum number of points a ranking can be updated after a match). They show that higher K-factors eacerbate instability for single orderings for models that have similar performances, but that faster convergence is observed for higher K-factors when models diverge more.
Then, the authors investigate transitivity, using a set of three models with different respective win probabilities. They find that when there is a clear disparity between models, Elo ratings accurately reflect the expected hierarchy, but in more complex cases the rankings become less stable, challenging the assumption of transitivity. K-factor and number of orderings play a key roal in the stability of the rankings.
The authors confirm several of their findings using real human feedback data. And wrap-up their paper with a list of recommendations for using Elo ratings.
Strengths
The topic studied in this paper (Elo ratings for LLMs) is important, and the experiments are extensive. The paper provides several interesting lessons for using Elo ratings for LLMs that I believe can (positively) influence how we compare models in rankings based on pair-wise comparisons.
Weaknesses
While I think this paper could potentially be very impactful and has many interesting results, in its current state it does not seem ready for publication. It took me excessively long to review, because the presentation is rather messy, and not clear at several points. Some of those things are easily fixable, e.g.:
- The Elo rating system is briefly explained in an appendix, but given the importance of the concept it should be in the main text (if space is needed, I think equation 5 describing transitivity can safely be moved to the appendix).
- Some explanation of the K-factor should also be included. It is sort of described, but not really explained or defined, not even in the appendix as far as I can see).
- Maybe I missed it, but I don't think it is listed how Elo ratings are most commonly used for LLMs, is it with only a single ordering?
- Table 1 is somewhat difficult to read, why not make a plot similar to Figure 1 but with multiple lines for the different models?
- In the introduction -- impliations of our work -- it is listed that the work is particularly important in situations where model performances are closely matched, which is a common occurrence in many real-world scenarios, whereas in 4.2 it is listed that the result is relevant because skewed win-rates are common in real-world scenarios (or maybe that is not what is meant, if not I am not sure why it is mentioned that there are skewed win-rates in real world scenarios)
More problematic are the unclarities concerning the results, for example:
- It is not clear with what K-factor the main experiment (4.1) is conducted (or at least I couldn't find it)
- in 4.1 it is stated that for P(A beats B) >= 0.6 Elo results are stable; I can't match this result with Figure 1 (middle column), where there seems to be quite some variation for P(a beats B) = 0.55 as well as P(a beats B) = 0.6
- The idea of comparing a single sequence with 100 different orderings is generally strong, but doing only one single sequence and one series of permutiations is not very informative in this case: what we actually want to know is how often a single sequence or an average over 100 sequences would give us the right results. Perhaps this single sequence was a very unlucky one among many that give us the correct result, or the 100 permutations were instead 100 lucky permutations. To really make the point, we'd need the variation between single sequences, and multiple selections of 100 permutations. (similar for Figure 4)
- In 4.2 it is listed that faster convergence is observed for higher K-factors, but I don't understand the evidence for that. I don't think this is visible from Figure 3, and I couldn't find an appendix plot either.
Questions
- If I understand correctly, the number of permutations is the number of game orders, why not use a word that matches that closely, e.g. 'game orders' or 'orderings'?