Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-erdos-s2-step40
ttt-discover-v3-qwen3-8b-erdos-s2-step40 is a machine learning model from EdwardoSunny. Use it for the machine learning task on the model card, and read the license before you ship it in a product.
LoRA adapter (rank 32, all-linear) from the upstream-faithful local reproduction of TTT-Discover on autoresearch-bench erdos. Checkpoint saved after training step 39 (0-indexed). Strict upstream eval parity: 1100s har…
Downloads · 30 days
0
Access
Public
Updated Jul 16, 2026
Repo size
355 MB
Likes
0
Public
Click a slice to open those files.
.safetensors349 MB · 98%
From the Hugging Face model README
LoRA adapter (rank 32, all-linear) from the upstream-faithful local
reproduction of TTT-Discover on autoresearch-bench erdos. Checkpoint saved
after training step 39 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 39,
"progress/batch": 39,
"optim/lr": 4e-05,
"progress/done_frac": 0.8,
"puct/buffer_size": 632,
"puct/sampled_size": 8,
"puct/T": 19968,
"puct/scale_last": 0.279076682489534,
"puct/buffer_value/mean": -0.3838636046793858,
"puct/buffer_value/std": 0.0189751733537608,
"puct/buffer_value/min": -0.66,
"puct/buffer_value/max": -0.38092331751046604,
"puct/buffer_timestep/mean": 18.746835443037973,
"puct/buffer_timestep/std": 11.404494288901162,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 38.0,
"puct/buffer_construction_len/mean": 94.77215189873418,
"puct/buffer_construction_len/std": 31.472089047920186,
"puct/buffer_construction_len/min": 40.0,
"puct/buffer_construction_len/max": 200.0,
"puct/sampled_value/mean": -0.38092373428170617,
"puct/sampled_value/std": 2.0222440347431146e-07,
"puct/sampled_value/min": -0.3809240377282457,
"puct/sampled_value/max": -0.38092331751046604,
"puct/sampled_timestep/mean": 38.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 38.0,
"puct/sampled_timestep/max": 38.0,
"puct/sampled_construction_len/mean": 100.0,
"puct/sampled_construction_len/std": 0.0,
"puct/sampled_construction_len/min": 100.0,
"puct/sampled_construction_len/max": 100.0,
"time/sampling": 1881.9964051246643,
"env/all/ac_tokens_per_turn": 9887.65234375,
"env/all/ob_tokens_per_turn": 1385.875,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 5062478,
"env/all/total_ob_tokens": 709568,
"env/all/time/sampling_mean": 548.5941278086975,
"env/all/time/sampling_max": 873.0590214729309,
"env/all/time/env_step_mean": 75.06931490032002,
"env/all/time/env_step_max": 1100.1414487361908,
"env/all/reward/mean": 0.6431065269234666,
"env/all/reward/max": 2.6253937248670174,
"env/all/reward/min": 0.0,
"env/all/format": 1.0,
"env/all/format/min": 1.0,
"env/all/format/max": 1.0,
"env/all/reward": 0.6431065269234666,
"env/all/correctness": 0.26953125,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 0.4308486006982775,
"env/all/raw_score/min": 0.3808952403117042,
"env/all/raw_score/max": 1.0,
"env/all/initial_raw_score": -0.3809237342817062,
"env/all/initial_raw_score/min": -0.3809240377282457,
"env/all/initial_raw_score/max": -0.38092331751046604,
"env/all/msg": "Computed C5 is not finite: nan",
"env/all/parsed_code": "```python\nimport numpy as np\nfrom scipy.optimize import minimize\n\ndef run(seed=42, budget_s=1000, **kwargs):\n np.random.seed(seed)\n n_points = 100 # Small number of samples for performance\n dx = 2.0 / n_points\n desired_sum = n_points / 2.0 # Normalization constant for area 1\n\n best_t = 0.5\n best_h = np.zeros(n_points)\n\n if 'initial_h_values' in globals():\n initial_h = np.array(initial_h_values)\n if initial_h.shape[0] > n_points:\n initial_h = initial_h[::2] # Downsample\n elif initial_h.shape[0] < n_points:\n # Upsample by repeating\n initial_h = np.repeat(initial_h, n_points // len(initial_h))\n initial_h = initial_h[:n_points]\n # Adjust sum and clip to [0, 1]\n sum_h = np.sum(initial_h)\n delta = desired_sum - sum_h\n initial_h[-1] += delta\n initial_h = np.clip(initial_h, 0, 1)\n else:\n # Fallback to random\n initial_h = np.random.rand(n_points)\n initial_h = initial_h / np.sum(initial_h) * desired_sum\n initial_h = np.clip(initial_h, 0, 1)\n\n # Objective: minimize the upper bound t\n def objective(x):\n h_vec = x[:-1]\n t_val = x[-1]\n cross_corr = np.correlate(h_vec, 1 - h_vec, mode='full')\n overlaps = cross_corr * dx\n current_max = np.max(overlaps)\n return current_max\n\n def constraint_sum(x):\n return np.sum(x[:-1]) - desired_sum\n\n def constraints_func(x):\n h_vec = x[:-1]\n cross_corr = np.correlate(h_vec, 1 - h_vec, mode='full')\n overlaps = cross_corr * dx\n return [x[-1] - np.max(overlaps)] # Single constraint: t \u2265 max overlap\n\n cons = [\n {'type': 'eq', 'fun': constraint_sum},\n {'type': 'ineq', 'fun': constraints_func}\n ]\n\n bounds = [(0.0, 1.0) for _ in range(n_points)] + [(0.0, np.inf)]\n\n try:\n result = minimize(\n fun=objective,\n x0=np.concatenate((initial_h, [0.5])),\n method='L-BFGS-B',\n bounds=bounds,\n constraints=cons,\n options={\n 'ftol': 1e-6, # Reduced tolerance for faster convergence\n 'maxiter': 200, # Reasonable iteration limit\n 'disp': False\n }\n )\n if result.success:\n current_t = result.x[-1]\n if current_t < best_t:\n best_t = current_t\n best_h = result.x[:-1]\n except:\n pass\n\n return best_h, best_t, n_points\n```",
"env/all/time/policy": 548.5941278086975,
"env/all/time/policy/min": 231.95224523544312,
"env/all/time/policy/max": 873.0590214729309,
"env/all/time/env_step": 75.06931490032002,
"env/all/time/env_step/min": 0.007306814193725586,
"env/all/time/env_step/max": 1100.1414487361908,
"env/all/time/reward_compute": 3.948807716369629e-07,
"env/all/time/reward_compute/min": 2.7194619178771973e-07,
"env/all/time/reward_compute/max": 8.568167686462402e-07,
"env/all/by_group/frac_mixed": 1.0,
"env/all/by_group/frac_all_good": 0.0,
"env/all/by_group/frac_all_bad": 0.0,
"advantage/mean": 0.03134578466415405,
"advantage/min": -0.9660258293151855,
"advantage/max": 7.257862091064453,
"time/assemble_training_data": 6.804502010345459,
"time/kl_vs_base": 136.9415442943573,
"kl_policy_base": 0.0008389363647438586,
"time/train": 1057.8202304840088,
"time/save_checkpoint": 18.67066478729248,
"time/total": 3103.5269503593445
}
[2026-07-09T06:24:18+00:00] job=1812626 node=node-31 ngpu=3 ntrain=1 replicas=2 flash_attn=no
[2026-07-09T08:02:36+00:00] job=1813125 node=node-12 ngpu=3 ntrain=1 replicas=2 flash_attn=yes
[2026-07-09T09:32:13+00:00] job=1813126 node=node-3 ngpu=6 ntrain=2 replicas=4 flash_attn=yes
[2026-07-09T10:04:31+00:00] job=1813623 node=node-31 ngpu=3 ntrain=1 replicas=2 flash_attn=yes