Upload folder using huggingface_hub
Browse files- logs/in2/arm_b.trained +1 -1
- logs/in2/arm_b_train.log +0 -0
- logs/in2/arm_c.trained +1 -1
- logs/in2/arm_c_train.log +0 -0
- logs/in2/driver_20260830_0834.log +161 -0
- logs/in2/in2_report.txt +8 -0
logs/in2/arm_b.trained
CHANGED
|
@@ -1 +1 @@
|
|
| 1 |
-
|
|
|
|
| 1 |
+
15
|
logs/in2/arm_b_train.log
CHANGED
|
The diff for this file is too large to render.
See raw diff
|
|
|
logs/in2/arm_c.trained
CHANGED
|
@@ -1 +1 @@
|
|
| 1 |
-
|
|
|
|
| 1 |
+
16
|
logs/in2/arm_c_train.log
CHANGED
|
The diff for this file is too large to render.
See raw diff
|
|
|
logs/in2/driver_20260830_0834.log
ADDED
|
@@ -0,0 +1,161 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
[08:34:40] IN2 driver starting. base=/root/Adhi/BluTrain/dist/Context_Parallelism/checkpoints_bluscriptcp/rank_0/blumodelcp_run7_step_750.ckpt d_min=64 R=9835
|
| 2 |
+
[08:34:40] gate (train) on all three arms
|
| 3 |
+
|
| 4 |
+
=== arm a T=16384 examples=12816 K=64 ===
|
| 5 |
+
ok 1 total size across 3 shard(s) == examples*T*2 (419954688 bytes, got 419954688)
|
| 6 |
+
ok 2 tokens in [0,50304) (min 0, max 50256)
|
| 7 |
+
ok 3 no answer within the last 4 offsets (0 bad)
|
| 8 |
+
ok 4 planted spans never overlap (0 bad)
|
| 9 |
+
ok 5 RETRIEVAL POSSIBLE: probe==key and answer==value (0 bad)
|
| 10 |
+
ok 7 arm-a distance invariant (0 bad)
|
| 11 |
+
ok 6a batch stride 65536 is a multiple of T=16384
|
| 12 |
+
ok 6b total 209977344 tokens is a whole number of batches (stride 65536)
|
| 13 |
+
ok 6c row r starts at token r*T for all B=4 rows
|
| 14 |
+
ok 6d y[T-1] targets the next example's first token (why PAD_TAIL exists)
|
| 15 |
+
|
| 16 |
+
=== arm b T=16384 examples=12816 K=64 ===
|
| 17 |
+
ok 1 total size across 3 shard(s) == examples*T*2 (419954688 bytes, got 419954688)
|
| 18 |
+
ok 2 tokens in [0,50304) (min 0, max 50256)
|
| 19 |
+
ok 3 no answer within the last 4 offsets (0 bad)
|
| 20 |
+
ok 4 planted spans never overlap (0 bad)
|
| 21 |
+
ok 5 RETRIEVAL POSSIBLE: probe==key and answer==value (0 bad)
|
| 22 |
+
ok 7 arm-b distance invariant (0 bad)
|
| 23 |
+
ok 6a batch stride 65536 is a multiple of T=16384
|
| 24 |
+
ok 6b total 209977344 tokens is a whole number of batches (stride 65536)
|
| 25 |
+
ok 6c row r starts at token r*T for all B=4 rows
|
| 26 |
+
ok 6d y[T-1] targets the next example's first token (why PAD_TAIL exists)
|
| 27 |
+
|
| 28 |
+
=== arm c T=16384 examples=12816 K=64 ===
|
| 29 |
+
ok 1 total size across 3 shard(s) == examples*T*2 (419954688 bytes, got 419954688)
|
| 30 |
+
ok 2 tokens in [0,50304) (min 0, max 50256)
|
| 31 |
+
ok 3 no answer within the last 4 offsets (0 bad)
|
| 32 |
+
ok 4 planted spans never overlap (0 bad)
|
| 33 |
+
ok 5 RETRIEVAL POSSIBLE: probe==key and answer==value (0 bad)
|
| 34 |
+
ok 7 arm-c distance invariant (0 bad)
|
| 35 |
+
ok 6a batch stride 65536 is a multiple of T=16384
|
| 36 |
+
ok 6b total 209977344 tokens is a whole number of batches (stride 65536)
|
| 37 |
+
ok 6c row r starts at token r*T for all B=4 rows
|
| 38 |
+
ok 6d y[T-1] targets the next example's first token (why PAD_TAIL exists)
|
| 39 |
+
|
| 40 |
+
=== cross-arm ===
|
| 41 |
+
ok 8 arms B and C have BIT-IDENTICAL answer_start histograms (16293 vs 16293 distinct offsets)
|
| 42 |
+
ok 8b same seed
|
| 43 |
+
ok 8c same answer-token count
|
| 44 |
+
|
| 45 |
+
ALL PASS
|
| 46 |
+
[08:35:09] gate train: ALL PASS
|
| 47 |
+
[08:35:09] gate (val) on all three arms
|
| 48 |
+
|
| 49 |
+
=== arm a T=16384 examples=64 K=64 ===
|
| 50 |
+
ok 1 total size across 1 shard(s) == examples*T*2 (2097152 bytes, got 2097152)
|
| 51 |
+
ok 2 tokens in [0,50304) (min 0, max 50256)
|
| 52 |
+
ok 3 no answer within the last 4 offsets (0 bad)
|
| 53 |
+
ok 4 planted spans never overlap (0 bad)
|
| 54 |
+
ok 5 RETRIEVAL POSSIBLE: probe==key and answer==value (0 bad)
|
| 55 |
+
ok 7 arm-a distance invariant (0 bad)
|
| 56 |
+
ok 6a batch stride 65536 is a multiple of T=16384
|
| 57 |
+
ok 6b total 1048576 tokens is a whole number of batches (stride 65536)
|
| 58 |
+
ok 6c row r starts at token r*T for all B=4 rows
|
| 59 |
+
ok 6d y[T-1] targets the next example's first token (why PAD_TAIL exists)
|
| 60 |
+
|
| 61 |
+
=== arm b T=16384 examples=64 K=64 ===
|
| 62 |
+
ok 1 total size across 1 shard(s) == examples*T*2 (2097152 bytes, got 2097152)
|
| 63 |
+
ok 2 tokens in [0,50304) (min 0, max 50256)
|
| 64 |
+
ok 3 no answer within the last 4 offsets (0 bad)
|
| 65 |
+
ok 4 planted spans never overlap (0 bad)
|
| 66 |
+
ok 5 RETRIEVAL POSSIBLE: probe==key and answer==value (0 bad)
|
| 67 |
+
ok 7 arm-b distance invariant (0 bad)
|
| 68 |
+
ok 6a batch stride 65536 is a multiple of T=16384
|
| 69 |
+
ok 6b total 1048576 tokens is a whole number of batches (stride 65536)
|
| 70 |
+
ok 6c row r starts at token r*T for all B=4 rows
|
| 71 |
+
ok 6d y[T-1] targets the next example's first token (why PAD_TAIL exists)
|
| 72 |
+
|
| 73 |
+
=== arm c T=16384 examples=64 K=64 ===
|
| 74 |
+
ok 1 total size across 1 shard(s) == examples*T*2 (2097152 bytes, got 2097152)
|
| 75 |
+
ok 2 tokens in [0,50304) (min 0, max 50256)
|
| 76 |
+
ok 3 no answer within the last 4 offsets (0 bad)
|
| 77 |
+
ok 4 planted spans never overlap (0 bad)
|
| 78 |
+
ok 5 RETRIEVAL POSSIBLE: probe==key and answer==value (0 bad)
|
| 79 |
+
ok 7 arm-c distance invariant (0 bad)
|
| 80 |
+
ok 6a batch stride 65536 is a multiple of T=16384
|
| 81 |
+
ok 6b total 1048576 tokens is a whole number of batches (stride 65536)
|
| 82 |
+
ok 6c row r starts at token r*T for all B=4 rows
|
| 83 |
+
ok 6d y[T-1] targets the next example's first token (why PAD_TAIL exists)
|
| 84 |
+
|
| 85 |
+
=== cross-arm ===
|
| 86 |
+
ok 8 arms B and C have BIT-IDENTICAL answer_start histograms (3593 vs 3593 distinct offsets)
|
| 87 |
+
ok 8b same seed
|
| 88 |
+
ok 8c same answer-token count
|
| 89 |
+
|
| 90 |
+
ALL PASS
|
| 91 |
+
[08:35:09] gate val: ALL PASS
|
| 92 |
+
[08:35:09] arm a already trained (run 12)
|
| 93 |
+
[08:35:09] free disk: 75G
|
| 94 |
+
[08:35:09] training arm b (400 steps x 524288 tokens, T=16384, cp=4, YaRN=4)
|
| 95 |
+
[09:18:26] arm b checkpoint: blumodelcp_run15_step_400.ckpt (3.9G)
|
| 96 |
+
[09:18:26] arm b done -> run 15, final loss loss: 1.450279
|
| 97 |
+
[09:18:26] free disk: 56G
|
| 98 |
+
[09:18:27] training arm c (400 steps x 524288 tokens, T=16384, cp=4, YaRN=4)
|
| 99 |
+
[10:01:33] arm c checkpoint: blumodelcp_run16_step_400.ckpt (3.9G)
|
| 100 |
+
[10:01:33] arm c done -> run 16, final loss loss: 1.536691
|
| 101 |
+
[10:01:33] arm C val_loss: 3 distinct point(s), first=1.888691 last=1.526967
|
| 102 |
+
[10:01:33] learnability gate: PASS
|
| 103 |
+
[10:01:33] probing arm a (checkpoints_bluscriptcp/rank_0/blumodelcp_run12_step_400.ckpt)
|
| 104 |
+
[2026-08-30 10:01:43] GPUS=0,1,2,3 (n=4) kv=4 head_dim=128 theta=500000
|
| 105 |
+
[2026-08-30 10:01:43] == s=4 T=16384 CP=1 (single-GPU) N=8 slots=4 ==
|
| 106 |
+
[2026-08-30 10:14:03] scoring s=4 cache=yarn -> probe_arm_a/reach.csv
|
| 107 |
+
variant nll se score sig? notes
|
| 108 |
+
p0 13.3473 0.1606 0.0219 no
|
| 109 |
+
p0.25 12.3399 0.1690 0.2399 YES
|
| 110 |
+
p0.5 11.3300 0.2163 0.4586 YES
|
| 111 |
+
p0.75 9.8416 0.4121 0.7808 YES
|
| 112 |
+
p1 8.8293 0.2808 1.0000 YES
|
| 113 |
+
|
| 114 |
+
floor(p1)=8.8293 absent=13.4482 null=13.3600 denom=4.6190 nats
|
| 115 |
+
|
| 116 |
+
wrote probe_arm_a/reach.csv
|
| 117 |
+
[2026-08-30 10:14:03] SWEEP DONE -> probe_arm_a/reach.csv (CSVs in probe_arm_a/csv, markers in probe_arm_a/state)
|
| 118 |
+
[10:14:03] arm a reach.csv written
|
| 119 |
+
[10:14:03] probing arm b (checkpoints_bluscriptcp/rank_0/blumodelcp_run15_step_400.ckpt)
|
| 120 |
+
[2026-08-30 10:14:12] == s=4 T=16384 CP=1 (single-GPU) N=8 slots=4 ==
|
| 121 |
+
[2026-08-30 10:26:32] scoring s=4 cache=yarn -> probe_arm_b/reach.csv
|
| 122 |
+
variant nll se score sig? notes
|
| 123 |
+
p0 13.3803 0.1131 0.0204 no
|
| 124 |
+
p0.25 12.8800 0.1736 0.3319 YES
|
| 125 |
+
p0.5 12.5317 0.1653 0.5488 YES
|
| 126 |
+
p0.75 9.8638 0.2064 2.2102 YES
|
| 127 |
+
p1 11.8072 0.1473 1.0000 YES
|
| 128 |
+
|
| 129 |
+
floor(p1)=11.8072 absent=13.4130 null=13.4133 denom=1.6059 nats
|
| 130 |
+
FLAG p0.75: below the floor by more than 2 s.e. -- distant needle beating adjacency is suspicious; inspect (not an auto-fail).
|
| 131 |
+
|
| 132 |
+
wrote probe_arm_b/reach.csv
|
| 133 |
+
[2026-08-30 10:26:33] SWEEP DONE -> probe_arm_b/reach.csv (CSVs in probe_arm_b/csv, markers in probe_arm_b/state)
|
| 134 |
+
[10:26:33] arm b reach.csv written
|
| 135 |
+
[10:26:33] probing arm c (checkpoints_bluscriptcp/rank_0/blumodelcp_run16_step_400.ckpt)
|
| 136 |
+
[2026-08-30 10:38:59] scoring s=4 cache=yarn -> probe_arm_c/reach.csv
|
| 137 |
+
variant nll se score sig? notes
|
| 138 |
+
p0 13.3633 0.1909 0.1335 no
|
| 139 |
+
p0.25 10.5884 0.1582 1.6998 YES
|
| 140 |
+
p0.5 11.6092 0.2228 1.1236 YES
|
| 141 |
+
p0.75 6.5995 0.2618 3.9515 YES
|
| 142 |
+
p1 11.8282 0.1906 1.0000 YES
|
| 143 |
+
|
| 144 |
+
floor(p1)=11.8282 absent=13.5998 null=13.3837 denom=1.7716 nats
|
| 145 |
+
FLAG p0.25: below the floor by more than 2 s.e. -- distant needle beating adjacency is suspicious; inspect (not an auto-fail).
|
| 146 |
+
FLAG p0.75: below the floor by more than 2 s.e. -- distant needle beating adjacency is suspicious; inspect (not an auto-fail).
|
| 147 |
+
|
| 148 |
+
wrote probe_arm_c/reach.csv
|
| 149 |
+
[2026-08-30 10:38:59] SWEEP DONE -> probe_arm_c/reach.csv (CSVs in probe_arm_c/csv, markers in probe_arm_c/state)
|
| 150 |
+
[10:38:59] arm c reach.csv written
|
| 151 |
+
[10:38:59] readout
|
| 152 |
+
[10:38:59] WARN: in2_report returned nonzero (see in2_logs/in2_report.txt)
|
| 153 |
+
Traceback (most recent call last):
|
| 154 |
+
File "/root/Adhi/BluTrain/dist/Context_Parallelism/Tests/bluscriptcp/in2_report.py", line 167, in <module>
|
| 155 |
+
sys.exit(main())
|
| 156 |
+
^^^^^^
|
| 157 |
+
File "/root/Adhi/BluTrain/dist/Context_Parallelism/Tests/bluscriptcp/in2_report.py", line 117, in main
|
| 158 |
+
name, d = spec.split(":", 1)
|
| 159 |
+
^^^^^^^
|
| 160 |
+
ValueError: not enough values to unpack (expected 2, got 1)
|
| 161 |
+
[10:38:59] staging artefacts for HF
|
logs/in2/in2_report.txt
ADDED
|
@@ -0,0 +1,8 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
Traceback (most recent call last):
|
| 2 |
+
File "/root/Adhi/BluTrain/dist/Context_Parallelism/Tests/bluscriptcp/in2_report.py", line 167, in <module>
|
| 3 |
+
sys.exit(main())
|
| 4 |
+
^^^^^^
|
| 5 |
+
File "/root/Adhi/BluTrain/dist/Context_Parallelism/Tests/bluscriptcp/in2_report.py", line 117, in main
|
| 6 |
+
name, d = spec.split(":", 1)
|
| 7 |
+
^^^^^^^
|
| 8 |
+
ValueError: not enough values to unpack (expected 2, got 1)
|