Spaces:
Running
Running
File size: 11,961 Bytes
23d0bd0 25d3f97 23d0bd0 25d3f97 23d0bd0 8876489 ef4782e 23d0bd0 25d3f97 23d0bd0 25d3f97 23d0bd0 25d3f97 23d0bd0 5e01700 23d0bd0 5e01700 23d0bd0 5e01700 1daf349 5e01700 23d0bd0 1daf349 23d0bd0 5e01700 23d0bd0 1daf349 23d0bd0 5e01700 1daf349 23d0bd0 5e01700 23d0bd0 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 | """Ranked play: the arena picks the models at random, runs the match on the server and records Elo.
Players can't choose who plays ranked, so nobody can farm Elo by pairing a model with weak opponents.
A ranked match runs in a background thread: it finishes and counts even if every viewer leaves, so a
match can't be aborted when it's going badly. Only one ranked match runs at a time; others watch it.
"""
from __future__ import annotations
import html
import random
import threading
import time
import uuid
from arena import MAX_PIECES, choose, rank_games
from players import MAX_PARAMS, MIN_PARAMS, ModelRejected, load_player, precheck
from render import arena_html, empty_html, results_html
from tetris import TetrisGame
PIECE_DELAY = 0.12 # seconds per piece, so viewers can follow the match
LOAD_ATTEMPTS = 4
# Exact parameter counts (tied weights counted once) of the pool models, so the random pick
# can respect the size gap without downloading anything. Models missing here are estimated
# from their Hub metadata at startup, and every count is corrected after the model loads.
KNOWN_PARAMS = {
'DedeProGames/LowOnMind-300k': 296_960,
'DedeProGames/Overaddicted-500K': 492_192,
'DedeProGames/LowOnMind-1M': 985_152,
'AxiomicLabs/GPT-S-1.4M': 1_426_176,
'BananaMind/BananaMind-2.1-Pico-Preview': 1_480_516,
'BananaMind/BananaMind-2-Micro': 2_933_193,
'SupraLabs/SupraNeo-4M': 4_070_240,
'DedeProGames/LowOnMind-5M': 4_920_384,
'AxiomicLabs/GPT-S2-5M': 5_384_258,
'SupraLabs/SupraGDN-5M': 6_337_656,
'SupraLabs/Supra-Mini-v5-8M': 7_867_584,
'DedeProGames/DynamicMind-Mini': 8_884_992,
'BananaMind/BananaMind-2-Nano': 9_968_128,
'DedeBckp/BackKiyo-10M': 9_976_832,
'DedeProGames/GPT-U-20M': 20_453_760,
'BananaMind/BananaMind-2-Mini': 25_178_752,
'SupraLabs/Supra2-Medium-Base': 25_371_008,
'DedeProGames/DynamicMind-MoE': 30_150_912,
'veyra-ai/Veyra2-Mango-30M-Base': 30_683_520,
'BananaMind/BananaMind-2.1-Unified': 34_999_041,
'veyra-ai/Veyra2-Apricot-50M-Base': 49_303_040,
'BananaMind/BananaMind-2-Medium': 49_559_552,
'SupraLabs/Supra1.5-50M-Base-exp': 51_786_240,
'DedeProGames/Kiyo-65M': 64_994_816,
'SupraLabs/Supra2-100M-Base': 100_684_032,
'openai-community/gpt2': 124_439_808,
'AxiomicLabs/GPT-X2.5-135M': 135_032_256,
'BananaMind/BananaMind-2-Pro': 138_971_520,
'DedeProGames/Kiyo-230M-Preview': 229_688_064,
}
class Pool:
"""Models eligible for ranked play, with their parameter counts."""
def __init__(self, model_ids, gap: int, max_players: int, large_from: int | None = None):
self.ids = list(dict.fromkeys(model_ids))
self.gap = gap
self.max_players = max_players
self.large_from = large_from # models this size or bigger can all play each other
self.lock = threading.Lock()
self.sizes = {m: KNOWN_PARAMS[m] for m in self.ids if m in KNOWN_PARAMS}
self.broken: dict[str, str] = {} # models that failed this session -> reason
missing = [m for m in self.ids if m not in self.sizes]
if missing:
threading.Thread(target=self._estimate, args=(missing,), daemon=True).start()
def _estimate(self, ids):
for m in ids:
try:
est = precheck(m)["est_params"]
except Exception as e:
self.mark_broken(m, str(e))
continue
with self.lock:
self.sizes.setdefault(m, est)
def set_exact(self, model_id, n_params):
with self.lock:
self.sizes[model_id] = n_params
def mark_broken(self, model_id, reason):
with self.lock:
self.broken[model_id] = reason[:300]
def eligible(self) -> dict:
with self.lock:
return {m: p for m, p in self.sizes.items()
if m not in self.broken and MIN_PARAMS <= p <= MAX_PARAMS}
def fits(self, sizes) -> bool:
"""A ranked group is fair when all sizes fit within `gap`, or when every model is large.
With no gap (0/None) any models can meet: Elo already weighs each win by the opponent's rating."""
if not self.gap:
return True
if self.large_from is not None and min(sizes) >= self.large_from:
return True
return max(sizes) - min(sizes) <= self.gap
def pick(self, games_played: dict, rng) -> list:
"""Random group of up to `max_players` models that `fits` (any sizes when there is no gap; otherwise all sizes
in one `gap`-wide window, or, for a large anchor, any mix of large models).
Models with fewer ranked games are more likely to be drawn, so every model gets played."""
sizes = self.eligible()
ids = sorted(sizes)
anchors = [m for m in ids if any(o != m and self.fits([sizes[o], sizes[m]]) for o in ids)]
if not anchors:
return []
a = rng.choices(anchors, [1.0 / (1 + games_played.get(m, 0)) for m in anchors])[0]
if not self.gap:
windows = [[m for m in ids if m != a]] # no size limit: anyone can be drawn
else:
windows = self._windows(a, sizes, ids)
others = list(rng.choice(windows))
group = [a]
while others and len(group) < self.max_players: # weighted draw without replacement
o = rng.choices(others, [1.0 / (1 + games_played.get(m, 0)) for m in others])[0]
others.remove(o)
group.append(o)
return group
def _windows(self, a, sizes, ids):
"""Candidate opponent sets for anchor `a`: every `gap`-wide size window containing it (+ all large models)."""
windows = []
for s in sorted({sizes[m] for m in ids if sizes[a] - self.gap <= sizes[m] <= sizes[a]}):
members = [m for m in ids if m != a and s <= sizes[m] <= s + self.gap]
if members:
windows.append(members)
if self.large_from is not None and sizes[a] >= self.large_from:
members = [m for m in ids if m != a and sizes[m] >= self.large_from]
if members:
windows.append(members)
return windows
class RankedMatch:
"""State of one ranked match, shared by the worker thread and every viewer."""
def __init__(self, protocol: str):
self.id = uuid.uuid4().hex[:8]
self.protocol = protocol
self.lock = threading.Lock()
self.version = 0
self.status = f"⏳ Ranked · {protocol} · picking models…"
self.boards = empty_html("Picking models at random…")
self.results = ""
self.done = False
def update(self, status=None, boards=None, results=None, done=None):
with self.lock:
if status is not None:
self.status = status
if boards is not None:
self.boards = boards
if results is not None:
self.results = results
if done is not None:
self.done = done
self.version += 1
def snapshot(self):
with self.lock:
return self.version, self.status, self.boards, self.results, self.done
class RankedRunner:
def __init__(self, pool: Pool, store):
self.pool = pool
self.store = store
self.lock = threading.Lock()
self.current: RankedMatch | None = None
def start_or_join(self, protocol: str):
"""Returns (match, started). Joins the running match instead of starting a second one."""
with self.lock:
if self.current is not None and not self.current.done:
return self.current, False
match = RankedMatch(protocol)
self.current = match
threading.Thread(target=self._run, args=(match,), daemon=True, name=f"ranked-{match.id}").start()
return match, True
def _run(self, m: RankedMatch):
try:
self._play(m)
except Exception as e:
m.update(status=f"⛔ Ranked match cancelled: {str(e)[:300]} Nothing was recorded.", done=True)
def _load_group(self, m: RankedMatch, rng):
played = {e["model"]: e["games"] for e in self.store.rows(m.protocol)}
skipped = []
for _ in range(LOAD_ATTEMPTS):
ids = self.pool.pick(played, rng)
if len(ids) < 2:
raise RuntimeError("the pool has no two models of similar size.")
players = []
for i, model_id in enumerate(ids, 1):
m.update(status=f"⏳ Ranked · {m.protocol} · loading `{model_id}` ({i}/{len(ids)})… first load downloads the weights.",
boards=empty_html(f"Picked at random: {html.escape(', '.join(ids))}<br>Loading {i}/{len(ids)}…"))
try:
meta = precheck(model_id)
player = load_player(meta["id"], meta)
except ModelRejected as e:
self.pool.mark_broken(model_id, str(e))
skipped.append(model_id)
continue
self.pool.set_exact(model_id, player.n_params)
players.append(player)
if len(players) >= 2 and self.pool.fits([p.n_params for p in players]):
return players, skipped
raise RuntimeError("could not load two models of similar size.")
def _play(self, m: RankedMatch):
rng = random.SystemRandom()
players, skipped = self._load_group(m, rng)
seed = rng.randrange(1, 10**9)
games = [TetrisGame(seed) for _ in players]
head = f"Ranked · seed {seed} · {m.protocol}"
m.update(status=f"⏳ {head} · scoring the first moves…", boards=arena_html(games, players))
last = time.time()
while True:
active = [(g, p) for g, p in zip(games, players) if g.alive and g.pieces < MAX_PIECES]
if not active:
break
for g, p in active:
try:
choose(g, p, m.protocol, seed)
except Exception as e:
self.pool.mark_broken(p.model_id, str(e))
raise RuntimeError(f"`{p.model_id}` crashed during play ({type(e).__name__}: {str(e)[:150]}).")
elapsed = time.time() - last
if elapsed < PIECE_DELAY:
time.sleep(PIECE_DELAY - elapsed)
last = time.time()
n = max(g.pieces for g in games)
alive = sum(g.alive for g in games)
m.update(status=f"⏳ {head} · piece {n}/{MAX_PIECES} · {alive} still playing", boards=arena_html(games, players))
ranks = rank_games(games)
order = sorted(range(len(players)), key=lambda i: ranks[i])
record = self.store.record(m.protocol, seed, players, games)
elos = [(p["elo_before"], p["elo_after"]) for p in record["players"]]
note = self._note()
if skipped:
note += f" Skipped (failed to load): {html.escape(', '.join(skipped))}."
m.update(status=f"✅ Ranked match finished · seed {seed} · {m.protocol}.",
boards=arena_html(games, players, ranks, elos),
results=results_html(order, ranks, players, games, elos, note), done=True)
def _note(self):
s = self.store
if s.persistent and not s.save_error:
note = (f'Elo updated and saved to the public leaderboard '
f'(<a href="https://huggingface.co/datasets/{s.repo_id}" target="_blank">{s.repo_id}</a>).')
elif s.persistent:
note = f"⚠️ Elo updated in memory, but {html.escape(s.save_error)}."
else:
note = "⚠️ Elo updated in memory only: the Space has no <code>HF_TOKEN</code> secret, so results are not saved."
return note + f" Ranking: score, then lines, then pieces survived. ✓ = still alive at the {MAX_PIECES}-piece cap."
|