Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-erdos-s2-step8
ttt-discover-v3-qwen3-8b-erdos-s2-step8 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 7 (0-indexed). Strict upstream eval parity: 1100s hard…
Downloads · 30 days
0
Access
Public
Updated Jul 9, 2026
Repo size
349 MB
Likes
0
Public
Click a slice to open those files.
.safetensors349 MB · 100%
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 7 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 7,
"progress/batch": 7,
"optim/lr": 4e-05,
"progress/done_frac": 0.16,
"puct/buffer_size": 120,
"puct/sampled_size": 8,
"puct/T": 3584,
"puct/scale_last": 0.030273321240342432,
"puct/buffer_value/mean": -0.39083983980935305,
"puct/buffer_value/std": 0.029620012533741216,
"puct/buffer_value/min": -0.5130522804051018,
"puct/buffer_value/max": -0.3811063325170931,
"puct/buffer_timestep/mean": 2.7333333333333334,
"puct/buffer_timestep/std": 2.174600857373345,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 6.0,
"puct/buffer_construction_len/mean": 60.71666666666667,
"puct/buffer_construction_len/std": 20.95359290326018,
"puct/buffer_construction_len/min": 40.0,
"puct/buffer_construction_len/max": 100.0,
"puct/sampled_value/mean": -0.38122511123128666,
"puct/sampled_value/std": 6.377289348872367e-05,
"puct/sampled_value/min": -0.38129657028434244,
"puct/sampled_value/max": -0.3811063325170931,
"puct/sampled_timestep/mean": 6.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 6.0,
"puct/sampled_timestep/max": 6.0,
"puct/sampled_construction_len/mean": 67.0,
"puct/sampled_construction_len/std": 16.658331248957683,
"puct/sampled_construction_len/min": 53.0,
"puct/sampled_construction_len/max": 100.0,
"time/sampling": 1881.7153153419495,
"env/all/ac_tokens_per_turn": 8522.38671875,
"env/all/ob_tokens_per_turn": 1585.125,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 4363462,
"env/all/total_ob_tokens": 811584,
"env/all/time/sampling_mean": 458.4608020358719,
"env/all/time/sampling_max": 646.5195879936218,
"env/all/time/env_step_mean": 133.166764610447,
"env/all/time/env_step_max": 1231.0708463191986,
"env/all/reward/mean": 1.0172504827547817,
"env/all/reward/max": 2.624553272365123,
"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": 1.0172504827547817,
"env/all/correctness": 0.392578125,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 0.38691504732724175,
"env/all/raw_score/min": 0.38101721320875104,
"env/all/raw_score/max": 0.5000000000000088,
"env/all/initial_raw_score": -0.3812251112312867,
"env/all/initial_raw_score/min": -0.38129657028434244,
"env/all/initial_raw_score/max": -0.3811063325170931,
"env/all/msg": "Success; raw_score=0.38108646162479093",
"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 # Start from the better known initial guess\n h_initial = np.array(initial_h_values, dtype=np.float64)\n h_initial[-1] = n_points / 2 - np.sum(h_initial[:-1]) # Ensures the sum constraint\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 # Basin-hopping for global exploration\n result_bh = basinhopping(\n objective,\n h_initial,\n niter=150, # More iterations for global exploration\n T=1.5, # Moderately high temperature to allow more exploration\n stepsize=0.2,\n minimizer_kwargs={\n 'method': 'SLSQP',\n 'bounds': bounds,\n 'constraints': [{'type': 'eq', 'fun': constraint_func}],\n 'options': {'ftol': 1e-10, 'maxiter': 500, 'disp': False}\n },\n seed=seed\n )\n\n best_h = result_bh.x\n best_c5 = result_bh.fun\n\n # Refine with SLSQP\n constraints = [{'type': 'eq', 'fun': constraint_func}]\n res_slsqp = minimize(\n fun=objective,\n x0=best_h,\n method='SLSQP',\n bounds=bounds,\n constraints=constraints,\n options={'ftol': 1e-10, 'maxiter': 500}\n )\n\n best_h, best_c5 = res_slsqp.x, res_slsqp.fun\n\n # Evaluate all cross-correlation values to find the lags with the largest overlaps\n def get_max_lag(h_array):\n corr = np.correlate(h_array, 1 - h_array, mode=\"full\")\n max_idx = np.argmax(corr)\n return max_idx, corr[max_idx] * dx\n\n max_idx, max_overlap_val = get_max_lag(best_h)\n\n # Apply targeted perturbations to the lag with the highest overlap\n for _ in range(20):\n h_perturbed = best_h + np.random.uniform(-0.05, 0.05, size=n_points)\n h_perturbed = np.clip(h_perturbed, 0.0, 1.0)\n h_sum = np.sum(h_perturbed[:-1])\n h_perturbed[-1] = max(0.0, min(1.0, n_points / 2 - h_sum))\n res_perturbed = minimize(\n fun=objective,\n x0=h_perturbed,\n method='SLSQP',\n bounds=bounds,\n constraints=constraints,\n options={'ftol': 1e-10, 'maxiter': 200}\n )\n if res_perturbed.fun < best_c5:\n best_h, best_c5 = res_perturbed.x, res_perturbed.fun\n\n # Final fine-tuning\n for _ in range(20):\n h_perturbed = best_h + np.random.uniform(-0.01, 0.01, size=n_points)\n h_perturbed = np.clip(h_perturbed, 0.0, 1.0)\n h_sum = np.sum(h_perturbed[:-1])\n h_perturbed[-1] = max(0.0, min(1.0, n_points / 2 - h_sum))\n res_perturbed = minimize(\n fun=objective,\n x0=h_perturbed,\n method='SLSQP',\n bounds=bounds,\n constraints=constraints,\n options={'ftol': 1e-10, 'maxiter': 100}\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": 458.4608020358719,
"env/all/time/policy/min": 207.1914520263672,
"env/all/time/policy/max": 646.5195879936218,
"env/all/time/env_step": 133.166764610447,
"env/all/time/env_step/min": 0.0052721500396728516,
"env/all/time/env_step/max": 1231.0708463191986,
"env/all/time/reward_compute": 4.931353032588959e-07,
"env/all/time/reward_compute/min": 1.5273690223693848e-07,
"env/all/time/reward_compute/max": 1.6614794731140137e-06,
"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.023009292781352997,
"advantage/min": -1.0,
"advantage/max": 3.4012036323547363,
"time/assemble_training_data": 9.01777696609497,
"time/kl_vs_base": 125.17944860458374,
"kl_policy_base": 0.0006696797790937126,
"time/train": 926.7443289756775,
"time/save_checkpoint": 9.232323169708252,
"time/total": 2953.0930066108704
}
[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