Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-erdos-step15
ttt-discover-v3-qwen3-8b-erdos-step15 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 14 (0-indexed). Strict upstream eval parity: 1100s har…
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 14 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 14,
"progress/batch": 14,
"optim/lr": 4e-05,
"progress/done_frac": 0.3,
"puct/buffer_size": 232,
"puct/sampled_size": 8,
"puct/T": 7168,
"puct/scale_last": 0.11905839627050108,
"puct/buffer_value/mean": -0.38692623835592316,
"puct/buffer_value/std": 0.024559017085336234,
"puct/buffer_value/min": -0.5236859987110454,
"puct/buffer_value/max": -0.3809416037295048,
"puct/buffer_timestep/mean": 6.241379310344827,
"puct/buffer_timestep/std": 4.190754786874301,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 13.0,
"puct/buffer_construction_len/mean": 78.04741379310344,
"puct/buffer_construction_len/std": 14.491150457689544,
"puct/buffer_construction_len/min": 42.0,
"puct/buffer_construction_len/max": 143.0,
"puct/sampled_value/mean": -0.38094167738110274,
"puct/sampled_value/std": 4.447162686680136e-08,
"puct/sampled_value/min": -0.3809417327729232,
"puct/sampled_value/max": -0.3809416037295048,
"puct/sampled_timestep/mean": 13.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 13.0,
"puct/sampled_timestep/max": 13.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": 1814.5249514579773,
"env/all/ac_tokens_per_turn": 9453.890625,
"env/all/ob_tokens_per_turn": 1602.375,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 4840392,
"env/all/total_ob_tokens": 820416,
"env/all/time/sampling_mean": 530.9087074976414,
"env/all/time/sampling_max": 780.2013051509857,
"env/all/time/env_step_mean": 39.390933700371534,
"env/all/time/env_step_max": 1100.145405292511,
"env/all/reward/mean": 0.8498177325908731,
"env/all/reward/max": 2.625074205689513,
"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.8498177325908731,
"env/all/correctness": 0.337890625,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 0.4010291147487932,
"env/all/raw_score/min": 0.38094160217714446,
"env/all/raw_score/max": 0.5243023194018515,
"env/all/initial_raw_score": -0.38094167738110285,
"env/all/initial_raw_score/min": -0.3809417327729232,
"env/all/initial_raw_score/max": -0.3809416037295048,
"env/all/msg": "RuntimeError: Program execution failed: NameError: name 'Bounds' is not defined",
"env/all/parsed_code": "```python\nimport numpy as np\nfrom scipy.optimize import minimize\nfrom scipy.signal import correlate\n\ndef generate_initial_guesses(n_points, required_sum):\n guesses = []\n\n # Use current solution as reference\n h = initial_h_values.copy()\n h /= np.sum(h)\n h *= required_sum\n guesses.append(h)\n\n # Perturbed version\n perturbed = h + np.random.normal(0, 0.03, n_points)\n perturbed = np.clip(perturbed, 0.0, 1.0)\n perturbed /= np.sum(perturbed)\n perturbed *= required_sum\n guesses.append(perturbed)\n\n # Random uniform binary pattern\n binary_indices = np.random.choice(n_points, size=required_sum, replace=False)\n h_binary = np.zeros(n_points)\n h_binary[binary_indices] = 1.0\n guesses.append(h_binary)\n\n # Even distribution of 1s\n h_even = np.zeros(n_points)\n for i in range(n_points):\n if i < required_sum:\n h_even[i] = 1.0\n h_even /= np.sum(h_even)\n h_even *= required_sum\n guesses.append(h_even)\n\n # Alternating blocks of 1s and 0s\n h_alternate = np.zeros(n_points)\n for i in range(n_points):\n if i % 4 in [0, 1]:\n h_alternate[i] = 1.0\n h_alternate /= np.sum(h_alternate)\n h_alternate *= required_sum\n guesses.append(h_alternate)\n\n # Half-ones pattern\n h_half = np.zeros(n_points)\n h_half[:required_sum] = 1.0\n guesses.append(h_half)\n\n # Random cluster-based pattern\n clusters = np.random.choice(n_points, size=3, replace=False)\n h_cluster = np.zeros(n_points)\n h_cluster[clusters] = 1.0\n h_cluster /= np.sum(h_cluster)\n h_cluster *= required_sum\n guesses.append(h_cluster)\n\n return guesses\n\n\ndef evaluate_C5(h, dx):\n h1 = 1.0 - h\n corr = correlate(h, h1, mode='full')\n max_corr = np.max(corr)\n return max_corr * dx\n\n\ndef run(seed=42, budget_s=1000, **kwargs):\n np.random.seed(seed)\n import random\n random.seed(seed)\n\n n_points = len(initial_h_values)\n dx = 2.0 / n_points\n required_sum = int(n_points / 2) + (1 if n_points % 2 else 0)\n\n initial_guesses = generate_initial_guesses(n_points, required_sum)\n best_h = None\n best_c5 = float('inf')\n\n for guess in initial_guesses:\n result = minimize(\n fun=lambda x: evaluate_C5(x, dx),\n x0=guess,\n method=\"L-BFGS-B\",\n bounds=Bounds(0.0, 1.0),\n constraints=[{'type': 'eq', 'fun': lambda x: np.sum(x) - required_sum}],\n options={\n \"ftol\": 1e-10,\n \"gtol\": 1e-10,\n \"maxiter\": 500,\n \"disp\": False\n }\n )\n if result.success:\n current_c5 = result.fun\n if current_c5 < best_c5:\n best_c5 = current_c5\n best_h = result.x\n\n return best_h, best_c5, n_points\n```",
"env/all/time/policy": 530.9087074976414,
"env/all/time/policy/min": 263.8343403339386,
"env/all/time/policy/max": 780.2013051509857,
"env/all/time/env_step": 39.390933700371534,
"env/all/time/env_step/min": 0.005780458450317383,
"env/all/time/env_step/max": 1100.145405292511,
"env/all/time/reward_compute": 4.87547367811203e-07,
"env/all/time/reward_compute/min": 2.7567148208618164e-07,
"env/all/time/reward_compute/max": 9.08970832824707e-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.025965094566345215,
"advantage/min": -1.0,
"advantage/max": 4.252557277679443,
"time/assemble_training_data": 9.479153394699097,
"time/kl_vs_base": 136.4198169708252,
"kl_policy_base": 0.0008236804278567433,
"time/train": 1035.5127620697021,
"time/save_checkpoint": 13.057955503463745,
"time/total": 3010.081531763077
}
[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