Spaces:
Running
Running
Commit
·
631d285
1
Parent(s):
084747b
add instructions
Browse files
app.py
CHANGED
|
@@ -513,6 +513,9 @@ with gr.Blocks(
|
|
| 513 |
with gr.TabItem("How to Submit"):
|
| 514 |
gr.Markdown(f"""
|
| 515 |
### Submitting Your Model
|
|
|
|
|
|
|
|
|
|
| 516 |
|
| 517 |
1. **Train your model** using the [Chess Challenge Template](https://github.com/nathanael-fijalkow/ChessChallengeTemplate)
|
| 518 |
|
|
@@ -527,10 +530,7 @@ with gr.Blocks(
|
|
| 527 |
|
| 528 |
3. **Verify your submission** by checking the model page on Hugging Face
|
| 529 |
|
| 530 |
-
4. **Run evaluations**:
|
| 531 |
-
- First: **Legal Move Eval** (quick sanity check)
|
| 532 |
-
- Then: **Win Rate Eval** (full ELO computation)
|
| 533 |
-
|
| 534 |
### Requirements
|
| 535 |
|
| 536 |
- Model must be under **1M parameters**
|
|
|
|
| 513 |
with gr.TabItem("How to Submit"):
|
| 514 |
gr.Markdown(f"""
|
| 515 |
### Submitting Your Model
|
| 516 |
+
|
| 517 |
+
The goal is to create a chess-playing language model with **under 1 million parameters**, which is roughly the number of neurons in a honey bee's brain.
|
| 518 |
+
At this scale, efficiency and clever architecture choices are key! We are not targetting superhuman performance, but rather exploring how well small models can learn the rules of chess, the goal being (only) to play **legal moves**.
|
| 519 |
|
| 520 |
1. **Train your model** using the [Chess Challenge Template](https://github.com/nathanael-fijalkow/ChessChallengeTemplate)
|
| 521 |
|
|
|
|
| 530 |
|
| 531 |
3. **Verify your submission** by checking the model page on Hugging Face
|
| 532 |
|
| 533 |
+
4. **Run evaluations**:
|
|
|
|
|
|
|
|
|
|
| 534 |
### Requirements
|
| 535 |
|
| 536 |
- Model must be under **1M parameters**
|