Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-erdos-step50
ttt-discover-v3-qwen3-8b-erdos-step50 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 49 (0-indexed). Strict upstream eval parity: 1100s har…
Downloads · 30 days
0
Access
Public
Updated Jul 11, 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 49 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 49,
"progress/batch": 49,
"optim/lr": 4e-05,
"progress/done_frac": 1.0,
"puct/buffer_size": 784,
"puct/sampled_size": 8,
"puct/T": 25088,
"puct/scale_last": 0.12405074150219608,
"puct/buffer_value/mean": -0.3832127518222866,
"puct/buffer_value/std": 0.015133239842634054,
"puct/buffer_value/min": -0.5236859987110454,
"puct/buffer_value/max": -0.38094051871019485,
"puct/buffer_timestep/mean": 23.556122448979593,
"puct/buffer_timestep/std": 14.224221698348973,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 48.0,
"puct/buffer_construction_len/mean": 79.54974489795919,
"puct/buffer_construction_len/std": 8.469939337675479,
"puct/buffer_construction_len/min": 42.0,
"puct/buffer_construction_len/max": 160.0,
"puct/sampled_value/mean": -0.38094064579488285,
"puct/sampled_value/std": 6.679176239074958e-08,
"puct/sampled_value/min": -0.38094073193798067,
"puct/sampled_value/max": -0.38094051871019485,
"puct/sampled_timestep/mean": 48.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 48.0,
"puct/sampled_timestep/max": 48.0,
"puct/sampled_construction_len/mean": 80.0,
"puct/sampled_construction_len/std": 0.0,
"puct/sampled_construction_len/min": 80.0,
"puct/sampled_construction_len/max": 80.0,
"time/sampling": 2885.9708108901978,
"env/all/ac_tokens_per_turn": 9247.423828125,
"env/all/ob_tokens_per_turn": 1284.375,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 4734681,
"env/all/total_ob_tokens": 657600,
"env/all/time/sampling_mean": 283.78204646054655,
"env/all/time/sampling_max": 386.86468505859375,
"env/all/time/env_step_mean": 900.9445394580252,
"env/all/time/env_step_max": 2500.476953983307,
"env/all/reward/mean": 0.4387160390476521,
"env/all/reward/max": 2.6250816200426703,
"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.4387160390476521,
"env/all/correctness": 0.16796875,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 0.3833170894615982,
"env/all/raw_score/min": 0.3809405262351153,
"env/all/raw_score/max": 0.5108707817409756,
"env/all/initial_raw_score": -0.3809406457948829,
"env/all/initial_raw_score/min": -0.38094073193798067,
"env/all/initial_raw_score/max": -0.38094051871019485,
"env/all/msg": "C5 mismatch: reported 0.01537333, computed 0.96895448",
"env/all/parsed_code": "```python\nimport numpy as np\nfrom scipy.optimize import differential_evolution, minimize\n\ndef evaluate_c5(h, dx):\n n_points = len(h)\n one_minus_h = 1.0 - h\n corr = np.correlate(h, one_minus_h, mode='full')\n overlap_start = n_points - 1\n overlap_end = 2 * n_points - 1\n valid_corr = corr[overlap_start:overlap_end]\n max_corr = np.max(valid_corr)\n return max_corr * dx\n\ndef run(seed=42, budget_s=1000, **kwargs):\n np.random.seed(seed)\n\n # Use provided initial guess if available\n if 'initial_h_values' in globals() and len(initial_h_values) > 0:\n n_points = len(initial_h_values)\n dx = 2.0 / n_points\n required_sum = n_points / 2.0\n initial_guess = initial_h_values.copy()\n else:\n # Fallback: 80 points with random 0/1 values for more diverse initial search\n n_points = 80\n dx = 2.0 / n_points\n required_sum = n_points / 2.0\n indices = np.random.choice(n_points, size=n_points // 2, replace=False)\n initial_guess = np.zeros(n_points)\n initial_guess[indices] = 1.0\n\n bounds = [(0.0, 1.0) for _ in range(n_points)]\n\n def objective(x):\n h = np.array(x)\n sum_h = np.sum(h)\n # Penalize sum deviation with higher weight for strict constraint\n penalty = 1e3 * (sum_h - required_sum) ** 2\n max_c5 = evaluate_c5(h, dx)\n return max_c5 + penalty\n\n # Run differential evolution for global exploration with more aggressive parameters\n result_de = differential_evolution(\n objective,\n bounds,\n strategy='best1bin', # More robust for exploration\n popsize=100, # Larger population for better exploration\n maxiter=400, # Increased iterations for better exploration\n tol=1e-4,\n mutation=(0.8, 1.0), # Broad mutation for exploration\n recombination=0.95, # Higher recombination for mixing\n seed=seed,\n x0=initial_guess,\n polish=True # Refine the best individual after evolution\n )\n\n best_h = result_de.x\n best_c5 = evaluate_c5(best_h, dx)\n\n # Local refinement with SLSQP and explicit equality constraint\n constraints = [\n {'type': 'eq', 'fun': lambda x: np.sum(x) - required_sum}\n ]\n result_slsqp = minimize(\n objective,\n best_h,\n bounds=bounds,\n method='SLSQP',\n constraints=constraints,\n tol=1e-8,\n options={'maxiter': 700, 'ftol': 1e-7, 'eps': 1e-7}\n )\n\n final_h = result_slsqp.x\n final_c5 = evaluate_c5(final_h, dx)\n\n return final_h, final_c5, n_points\n```",
"env/all/time/policy": 283.78204646054655,
"env/all/time/policy/min": 149.9666233062744,
"env/all/time/policy/max": 386.86468505859375,
"env/all/time/env_step": 900.9445394580252,
"env/all/time/env_step/min": 0.004969358444213867,
"env/all/time/env_step/max": 2500.476953983307,
"env/all/time/reward_compute": 2.5704503059387207e-07,
"env/all/time/reward_compute/min": 1.7136335372924805e-07,
"env/all/time/reward_compute/max": 3.762543201446533e-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.04158974066376686,
"advantage/min": -0.874153196811676,
"advantage/max": 9.887174606323242,
"time/assemble_training_data": 8.933504104614258,
"time/kl_vs_base": 78.3884949684143,
"kl_policy_base": 0.0009776601800695062,
"time/train": 529.8142125606537,
"time/save_checkpoint": 16.5112144947052,
"time/total": 3520.912221431732
}
[2026-07-09T06:24:18+00:00] job=1812624 node=node-6 ngpu=3 ntrain=1 replicas=2 flash_attn=no
[2026-07-09T07:31:44+00:00] job=1812955 node=node-1 ngpu=3 ntrain=1 replicas=2 flash_attn=yes
[2026-07-09T07:59:00+00:00] job=1813123 node=node-14 ngpu=3 ntrain=1 replicas=2 flash_attn=yes
[2026-07-09T09:28:32+00:00] job=1813124 node=node-3 ngpu=6 ntrain=2 replicas=4 flash_attn=yes
[2026-07-09T09:35:59+00:00] job=1813609 node=node-6 ngpu=3 ntrain=1 replicas=2 flash_attn=yes
[2026-07-09T09:45:57+00:00] job=1813622 node=node-12 ngpu=3 ntrain=1 replicas=2 flash_attn=yes
[2026-07-10T08:20:19+00:00] job=1813610 node=node-29 ngpu=6 ntrain=2 replicas=4 flash_attn=yes