Spaces:
Running
Running
Create elo_README.md
Browse files- elo_README.md +83 -0
elo_README.md
ADDED
@@ -0,0 +1,83 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# Modified ELO Rating System for AI Model Arena
|
2 |
+
|
3 |
+
This document outlines the mathematical foundations and implementation details of our modified ELO rating system, designed specifically for ranking AI models in competitive scenarios.
|
4 |
+
|
5 |
+
## 1. Introduction to ELO
|
6 |
+
|
7 |
+
The ELO rating system, originally developed for chess rankings, has been adapted for our AI model arena. The core principle remains: after each match, the winning model gains rating points while the losing model loses points. The magnitude of this exchange depends on the relative ratings of the two models and the outcome of the match.
|
8 |
+
|
9 |
+
## 2. Initial Ratings
|
10 |
+
|
11 |
+
Unlike traditional ELO systems that start all participants at the same rating, our system assigns initial ratings based on model size:
|
12 |
+
|
13 |
+
Initial Rating = 1000 + (model_size * 100)
|
14 |
+
|
15 |
+
This approach acknowledges that larger models often have inherent advantages due to their increased capacity and training data.
|
16 |
+
|
17 |
+
## 3. Expected Score Calculation
|
18 |
+
|
19 |
+
The expected score for each model in a match is calculated using the standard ELO formula:
|
20 |
+
|
21 |
+
E(A) = 1 / (1 + 10^((R_B - R_A) / 400))
|
22 |
+
|
23 |
+
Where:
|
24 |
+
E(A) is the expected score for model A
|
25 |
+
R_A is the current rating of model A
|
26 |
+
R_B is the current rating of model B
|
27 |
+
|
28 |
+
## 4. K-Factor Modification
|
29 |
+
|
30 |
+
In standard ELO, the K-factor is a constant that determines the maximum change in rating after a single game. Our system modifies the K-factor based on the size difference between the competing models:
|
31 |
+
|
32 |
+
k_factor = min(64, 32 * (1 + (loser_size - winner_size) / max_size))
|
33 |
+
|
34 |
+
Where:
|
35 |
+
loser_size is the size of the losing model
|
36 |
+
winner_size is the size of the winning model
|
37 |
+
max_size is the size of the largest model in the arena
|
38 |
+
|
39 |
+
This modification allows for larger rating changes when a smaller model defeats a larger one, reflecting the significance of such outcomes.
|
40 |
+
|
41 |
+
## 5. Rating Update Formula
|
42 |
+
|
43 |
+
After each match, the ratings are updated using the following formula:
|
44 |
+
|
45 |
+
R'_A = R_A + k_factor * (S_A - E(A))
|
46 |
+
|
47 |
+
Where:
|
48 |
+
R'_A is the new rating for model A
|
49 |
+
R_A is the current rating for model A
|
50 |
+
S_A is the actual score (1 for win, 0 for loss)
|
51 |
+
E(A) is the expected score for model A
|
52 |
+
|
53 |
+
## 6. Impact Scores
|
54 |
+
|
55 |
+
To provide additional insight into model performance, we calculate two impact scores:
|
56 |
+
|
57 |
+
### Positive Impact
|
58 |
+
|
59 |
+
positive_impact += wins * (1 + max(0, (opponent_size - model_size) / max_size))
|
60 |
+
|
61 |
+
This score is higher when a model wins against larger opponents, reflecting the significance of these victories.
|
62 |
+
|
63 |
+
### Negative Impact
|
64 |
+
|
65 |
+
negative_impact += losses * (1 + max(0, (model_size - opponent_size) / max_size))
|
66 |
+
|
67 |
+
This score is higher when a model loses against smaller opponents, indicating potential underperformance.
|
68 |
+
|
69 |
+
## 7. Advantages of Our Modified System
|
70 |
+
|
71 |
+
1. **Size-Aware Initialization**: Larger models start with higher ratings, reflecting their potential advantages.
|
72 |
+
2. **Dynamic K-Factor**: The K-factor adapts based on model size differences, allowing for more significant rating changes in upset scenarios.
|
73 |
+
3. **Impact Scores**: These provide additional context beyond the raw ELO rating, helping to interpret a model's performance against various opponents.
|
74 |
+
|
75 |
+
## 8. Limitations and Considerations
|
76 |
+
|
77 |
+
1. **Sensitivity to Initial Conditions**: The system's reliance on model size for initialization may need refinement as more data is collected.
|
78 |
+
2. **Potential for Rating Inflation**: As with all ELO systems, there's a possibility of rating inflation over time. Periodic resets or normalization may be necessary.
|
79 |
+
3. **Assumption of Transitive Performance**: The system assumes that if A beats B and B beats C, then A is likely to beat C. This may not always hold true in complex AI model comparisons.
|
80 |
+
|
81 |
+
## Conclusion
|
82 |
+
|
83 |
+
Our modified ELO system aims to provide a fair and insightful ranking mechanism for AI models, taking into account the unique characteristics of these competitions. As we gather more data and insights, we may further refine this system to improve its accuracy and interpretability.
|