suchirsalhan commited on
Commit
7e354e4
·
verified ·
1 Parent(s): 509efdd

Upload code/run_pairs.py with huggingface_hub

Browse files
Files changed (1) hide show
  1. code/run_pairs.py +157 -0
code/run_pairs.py ADDED
@@ -0,0 +1,157 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ """Per-pair worker: pre-merge diagnostic -> recorded prediction -> merge (naive / aligned) ->
2
+ DOWNSTREAM ACCURACY for parent A, parent B, naive merge, aligned merge.
3
+
4
+ usage: run_pairs.py <pairs.json> <gpu> [<shard> <nshards>]
5
+ """
6
+ from __future__ import annotations
7
+ import os, sys, json, time, gc, traceback
8
+ gpu = sys.argv[2]
9
+ os.environ["CUDA_VISIBLE_DEVICES"] = gpu
10
+ import numpy as np, torch
11
+ import ma_common as C
12
+ import tasks as TK
13
+
14
+ PAIRS = json.load(open(sys.argv[1]))
15
+ SHARD, NSH = (int(sys.argv[3]), int(sys.argv[4])) if len(sys.argv) > 4 else (0, 1)
16
+ LEDGER = os.environ.get("MA_LEDGER", "/root/merge-accuracy/results/ledger.jsonl")
17
+ NDOC = int(os.environ.get("MA_NDOC", "500"))
18
+ CORE = os.environ.get("MA_TASKS", "sciq,piqa,arc_easy,lambada").split(",")
19
+ DEV = "cuda"
20
+
21
+ _docs = {}
22
+ def docs(t):
23
+ if t not in _docs:
24
+ _docs[t] = TK.TASKS[t](NDOC)
25
+ return _docs[t]
26
+
27
+ done = C.jload(LEDGER)
28
+ def have(k): return k in done
29
+ def put(k, rec):
30
+ rec["key"] = k; rec["t"] = time.time()
31
+ C.jappend(LEDGER, rec); done[k] = rec
32
+ print(f"[{time.strftime('%H:%M:%S')}] {k} " +
33
+ " ".join(f"{t}={rec['acc'][t]:.4f}" for t in rec.get("acc", {})), flush=True)
34
+
35
+ def eval_sd(model, tok, sd=None):
36
+ if sd is not None:
37
+ C.sd_load(model, sd)
38
+ out, items = {}, {}
39
+ for t in CORE:
40
+ r = C.eval_task(model, tok, docs(t), DEV, bs=int(os.environ.get("MA_BS", "16")))
41
+ out[t] = r["acc"]; out[t + "_norm"] = r["acc_norm"]; items[t] = r["items"]
42
+ out["mean"] = float(np.mean([out[t] for t in CORE]))
43
+ return out, items
44
+
45
+
46
+ for pi, P in enumerate(PAIRS):
47
+ if pi % NSH != SHARD:
48
+ continue
49
+ name = P["name"]; rung = P["rung"]
50
+ t_pair = time.time()
51
+ try:
52
+ # ---------------------------------------------------------- parents
53
+ ma = C.load_model(P["a"]["repo"], P["a"].get("rev"))
54
+ ta = C.load_tok(P["a"]["repo"], P["a"].get("rev"))
55
+ sents = C.flores_lines("eng_Latn", 256)
56
+ acts_a = C.capture_acts_sent(ma, ta, sents, DEV)
57
+ sd_a = C.sd_np(ma)
58
+ ka = f"{rung}|{name}|parentA"
59
+ if not have(ka):
60
+ acc, _ = eval_sd(ma, ta)
61
+ put(ka, {"rung": rung, "pair": name, "arm": "parentA", "alpha": None,
62
+ "model": P["a"]["repo"], "rev": P["a"].get("rev"), "acc": acc})
63
+ accA = done[ka]["acc"]
64
+
65
+ mb = C.load_model(P["b"]["repo"], P["b"].get("rev"))
66
+ tb = C.load_tok(P["b"]["repo"], P["b"].get("rev"))
67
+ acts_b = C.capture_acts_sent(mb, tb, sents, DEV)
68
+ sd_b = C.sd_np(mb)
69
+ kb = f"{rung}|{name}|parentB"
70
+ if not have(kb):
71
+ acc, _ = eval_sd(mb, tb)
72
+ put(kb, {"rung": rung, "pair": name, "arm": "parentB", "alpha": None,
73
+ "model": P["b"]["repo"], "rev": P["b"].get("rev"), "acc": acc})
74
+ accB = done[kb]["acc"]
75
+ del mb; gc.collect(); torch.cuda.empty_cache()
76
+
77
+ cfg = ma.config
78
+ hid = getattr(cfg, "hidden_size", None); nh = getattr(cfg, "num_attention_heads", None)
79
+
80
+ # ---------------------------------------------------------- mergeable keys
81
+ mk = C.body_keys(sd_a, sd_b)
82
+ full = C.shared_keys(sd_a, sd_b)
83
+ emb_ok = len(full) > len(mk) and P.get("same_tokenizer", True)
84
+ keys = full if emb_ok else mk
85
+ scope = "full" if emb_ok else "body_only"
86
+
87
+ # ---------------------------------------------------------- ALIGN (B -> A's frame)
88
+ t0 = time.time()
89
+ sd_b_perm, info_p = C.align_pair(sd_a, sd_b, hid, nh, acts_a, acts_b, "permutation")
90
+ sd_b_orth, info_o = C.align_pair(sd_a, sd_b, hid, nh, acts_a, acts_b, "orthogonal")
91
+ t_align = time.time() - t0
92
+
93
+ # ---------------------------------------------------------- PRE-MERGE DIAGNOSTIC
94
+ kd = f"{rung}|{name}|diag"
95
+ if not have(kd):
96
+ d = C.diagnostics({k: sd_a[k] for k in keys}, {k: sd_b[k] for k in keys},
97
+ {k: sd_b_perm[k] for k in keys}, {k: sd_b_orth[k] for k in keys},
98
+ acts_a, acts_b)
99
+ d["align_info_perm"] = info_p; d["align_info_orth"] = info_o
100
+ d["align_seconds"] = t_align; d["merge_scope"] = scope; d["n_merge_keys"] = len(keys)
101
+ # PREDICTION, recorded BEFORE any merged model is scored.
102
+ d["predicted_align_helps"] = bool(d["coord_share"] >= 0.02)
103
+ put(kd, {"rung": rung, "pair": name, "arm": "diag", "diag": d})
104
+ diag = done[kd]["diag"]
105
+
106
+ # pick the better of the two aligners by scale-free residual distance
107
+ use_orth = diag.get("qmd_bn_orth", 9e9) < diag.get("qmd_bn_perm", 9e9)
108
+ sd_b_al = sd_b_orth if use_orth else sd_b_perm
109
+ aligner = "orthogonal" if use_orth else "permutation"
110
+
111
+ # ---------------------------------------------------------- MERGES
112
+ for alpha in P.get("alphas", [0.5]):
113
+ for arm, sdb in (("naive", sd_b), ("aligned", sd_b_al)):
114
+ k = f"{rung}|{name}|{arm}|a{alpha}"
115
+ if have(k):
116
+ continue
117
+ sd_m = dict(sd_a)
118
+ for kk in keys:
119
+ sd_m[kk] = (1 - alpha) * sd_a[kk] + alpha * np.asarray(sdb[kk], float)
120
+ acc, _ = eval_sd(ma, ta, sd_m)
121
+ put(k, {"rung": rung, "pair": name, "arm": arm, "alpha": alpha,
122
+ "aligner": aligner if arm == "aligned" else None,
123
+ "scope": scope, "acc": acc,
124
+ "coord_share": diag["coord_share"],
125
+ "accA_mean": accA["mean"], "accB_mean": accB["mean"]})
126
+ del sd_m; gc.collect()
127
+ C.sd_load(ma, sd_a) # restore A for the next merge
128
+ # ---------------------------------------------------------- TIES (alpha-free)
129
+ if P.get("ties", True):
130
+ for arm, sdb in (("ties_naive", sd_b), ("ties_aligned", sd_b_al)):
131
+ k = f"{rung}|{name}|{arm}"
132
+ if have(k):
133
+ continue
134
+ try:
135
+ base = {kk: np.zeros_like(sd_a[kk]) for kk in keys}
136
+ tv = C.MG.ties(base, [{kk: sd_a[kk] for kk in keys},
137
+ {kk: np.asarray(sdb[kk], float) for kk in keys}],
138
+ density=0.2)
139
+ sd_m = dict(sd_a); sd_m.update(tv)
140
+ acc, _ = eval_sd(ma, ta, sd_m)
141
+ put(k, {"rung": rung, "pair": name, "arm": arm, "alpha": None,
142
+ "scope": scope, "acc": acc, "coord_share": diag["coord_share"],
143
+ "accA_mean": accA["mean"], "accB_mean": accB["mean"]})
144
+ del sd_m, tv; gc.collect()
145
+ C.sd_load(ma, sd_a)
146
+ except Exception as e:
147
+ print("TIES fail", name, arm, repr(e)[:200], flush=True)
148
+ print(f"== pair {name} done in {time.time()-t_pair:.0f}s", flush=True)
149
+ except Exception as e:
150
+ print(f"!! PAIR FAIL {name}: {traceback.format_exc()[-1500:]}", flush=True)
151
+ finally:
152
+ for v in ("ma", "mb", "sd_a", "sd_b", "sd_b_perm", "sd_b_orth", "acts_a", "acts_b"):
153
+ if v in dir(): pass
154
+ try: del ma
155
+ except Exception: pass
156
+ gc.collect(); torch.cuda.empty_cache()
157
+ print("ALLDONE", flush=True)