Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-erdos-s2-step11
ttt-discover-v3-qwen3-8b-erdos-s2-step11 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 10 (0-indexed). Strict upstream eval parity: 1100s har…
Downloads · 30 days
0
Access
Public
Updated Jul 9, 2026
Repo size
354 MB
Likes
0
Public
Click a slice to open those files.
.safetensors349 MB · 99%
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 10 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 10,
"progress/batch": 10,
"optim/lr": 4e-05,
"progress/done_frac": 0.22,
"puct/buffer_size": 168,
"puct/sampled_size": 8,
"puct/T": 5120,
"puct/scale_last": 0.030430701760354173,
"puct/buffer_value/mean": -0.3881391048001889,
"puct/buffer_value/std": 0.02540007298228171,
"puct/buffer_value/min": -0.5130522804051018,
"puct/buffer_value/max": -0.38094895199708134,
"puct/buffer_timestep/mean": 4.238095238095238,
"puct/buffer_timestep/std": 3.0379310300450633,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 9.0,
"puct/buffer_construction_len/mean": 66.17857142857143,
"puct/buffer_construction_len/std": 22.594595178770454,
"puct/buffer_construction_len/min": 40.0,
"puct/buffer_construction_len/max": 128.0,
"puct/sampled_value/mean": -0.38099582095832396,
"puct/sampled_value/std": 1.8981220310375933e-05,
"puct/sampled_value/min": -0.3810088231542323,
"puct/sampled_value/max": -0.38094895199708134,
"puct/sampled_timestep/mean": 9.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 9.0,
"puct/sampled_timestep/max": 9.0,
"puct/sampled_construction_len/mean": 77.0,
"puct/sampled_construction_len/std": 14.798648586948742,
"puct/sampled_construction_len/min": 64.0,
"puct/sampled_construction_len/max": 100.0,
"time/sampling": 1926.7340815067291,
"env/all/ac_tokens_per_turn": 8546.462890625,
"env/all/ob_tokens_per_turn": 1622.75,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 4375789,
"env/all/total_ob_tokens": 830848,
"env/all/time/sampling_mean": 466.33031401829794,
"env/all/time/sampling_max": 649.3448717594147,
"env/all/time/env_step_mean": 182.97795340325683,
"env/all/time/env_step_max": 1287.378674507141,
"env/all/reward/mean": 0.687151395441632,
"env/all/reward/max": 2.6250361915828053,
"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.687151395441632,
"env/all/correctness": 0.263671875,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 0.38407732491279734,
"env/all/raw_score/min": 0.3809471187315985,
"env/all/raw_score/max": 0.5108728990837365,
"env/all/initial_raw_score": -0.38099582095832396,
"env/all/initial_raw_score/min": -0.3810088231542323,
"env/all/initial_raw_score/max": -0.38094895199708134,
"env/all/msg": "Success; raw_score=0.3810273435542479",
"env/all/parsed_code": "```python\nimport numpy as np\nfrom scipy.optimize import basinhopping, minimize\n\ndef run(seed=42, budget_s=1000, **kwargs):\n n_points = 100\n dx = 2.0 / n_points\n np.random.seed(seed)\n\n # Generate a random initial guess that satisfies the integral constraint\n h_initial = np.random.uniform(0.0, 1.0, n_points)\n sum_h = np.sum(h_initial)\n h_initial[-1] = n_points / 2 - sum_h\n h_initial[-1] = np.clip(h_initial[-1], 0.0, 1.0)\n sum_h = np.sum(h_initial)\n if abs(sum_h - n_points / 2) > 1e-8:\n h_initial[0] = n_points / 2 - sum_h + h_initial[0]\n h_initial[0] = np.clip(h_initial[0], 0.0, 1.0)\n\n def objective(h):\n h_array = np.array(h, dtype=np.float64)\n corr = np.correlate(h_array, 1 - h_array, mode=\"full\")\n max_corr = np.max(corr)\n return max_corr * dx\n\n def constraint_func(h):\n return np.sum(h) - n_points / 2\n\n bounds = [(0.0, 1.0) for _ in range(n_points)]\n\n # Perform basin-hopping with increased iterations\n result_bh = basinhopping(\n objective,\n h_initial,\n niter=1000,\n T=0.1,\n stepsize=0.1,\n minimizer_kwargs={\n 'method': 'SLSQP',\n 'bounds': bounds,\n 'constraints': [{'type': 'eq', 'fun': constraint_func}],\n 'options': {'ftol': 1e-10, 'maxiter': 2000, 'disp': False}\n },\n seed=seed\n )\n\n best_h = result_bh.x\n best_c5 = result_bh.fun\n\n # Refine using SLSQP\n res_slsqp = minimize(\n fun=objective,\n x0=best_h,\n method='SLSQP',\n bounds=bounds,\n constraints=[{'type': 'eq', 'fun': constraint_func}],\n options={'ftol': 1e-10, 'maxiter': 2000}\n )\n\n best_h, best_c5 = res_slsqp.x, res_slsqp.fun\n\n # Guided perturbations for deeper refinement\n for _ in range(200):\n h_perturbed = best_h.copy()\n h_perturbed[0::5] += np.random.uniform(-0.02, 0.02, size=len(h_perturbed[0::5]))\n h_perturbed = np.clip(h_perturbed, 0.0, 1.0)\n h_perturbed[-1] = max(0.0, min(1.0, n_points / 2 - np.sum(h_perturbed[:-1])))\n\n res_perturbed = minimize(\n fun=objective,\n x0=h_perturbed,\n method='SLSQP',\n bounds=bounds,\n constraints=[{'type': 'eq', 'fun': constraint_func}],\n options={'ftol': 1e-10, 'maxiter': 300}\n )\n\n if res_perturbed.fun < best_c5:\n best_h, best_c5 = res_perturbed.x, res_perturbed.fun\n\n # Final refinement with smaller perturbations\n for _ in range(50):\n h_perturbed = best_h.copy()\n h_perturbed[20:-10] += np.random.uniform(-0.01, 0.01, size=len(h_perturbed[20:-10]))\n h_perturbed = np.clip(h_perturbed, 0.0, 1.0)\n h_perturbed[-1] = max(0.0, min(1.0, n_points / 2 - np.sum(h_perturbed[:-1])))\n\n res_perturbed = minimize(\n fun=objective,\n x0=h_perturbed,\n method='SLSQP',\n bounds=bounds,\n constraints=[{'type': 'eq', 'fun': constraint_func}],\n options={'ftol': 1e-10, 'maxiter': 150}\n )\n\n if res_perturbed.fun < best_c5:\n best_h, best_c5 = res_perturbed.x, res_perturbed.fun\n\n return (best_h, best_c5, n_points)\n```",
"env/all/time/policy": 466.33031401829794,
"env/all/time/policy/min": 200.05661249160767,
"env/all/time/policy/max": 649.3448717594147,
"env/all/time/env_step": 182.97795340325683,
"env/all/time/env_step/min": 0.006216764450073242,
"env/all/time/env_step/max": 1287.378674507141,
"env/all/time/reward_compute": 3.1990930438041687e-07,
"env/all/time/reward_compute/min": 2.905726432800293e-07,
"env/all/time/reward_compute/max": 4.246830940246582e-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.029055263847112656,
"advantage/min": -0.9647364616394043,
"advantage/max": 5.021705150604248,
"time/assemble_training_data": 8.075253248214722,
"time/kl_vs_base": 116.01116228103638,
"kl_policy_base": 0.0007771423552185297,
"time/train": 932.8687388896942,
"time/save_checkpoint": 9.767582178115845,
"time/total": 2996.171240091324
}
[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