Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-erdos-s2-step37
ttt-discover-v3-qwen3-8b-erdos-s2-step37 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 36 (0-indexed). Strict upstream eval parity: 1100s har…
Downloads · 30 days
0
Access
Public
Updated Jul 10, 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 36 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 36,
"progress/batch": 36,
"optim/lr": 4e-05,
"progress/done_frac": 0.74,
"puct/buffer_size": 584,
"puct/sampled_size": 8,
"puct/T": 18432,
"puct/scale_last": 0.2790759619298157,
"puct/buffer_value/mean": -0.3839368360408238,
"puct/buffer_value/std": 0.019326821317622936,
"puct/buffer_value/min": -0.66,
"puct/buffer_value/max": -0.3809240380701843,
"puct/buffer_timestep/mean": 17.246575342465754,
"puct/buffer_timestep/std": 10.538618897736114,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 35.0,
"puct/buffer_construction_len/mean": 94.27397260273973,
"puct/buffer_construction_len/std": 32.332713945286784,
"puct/buffer_construction_len/min": 40.0,
"puct/buffer_construction_len/max": 200.0,
"puct/sampled_value/mean": -0.38092501071000273,
"puct/sampled_value/std": 3.9247459429327167e-07,
"puct/sampled_value/min": -0.3809252561334897,
"puct/sampled_value/max": -0.3809240380701843,
"puct/sampled_timestep/mean": 35.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 35.0,
"puct/sampled_timestep/max": 35.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": 1760.60369181633,
"env/all/ac_tokens_per_turn": 9753.689453125,
"env/all/ob_tokens_per_turn": 1642.125,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 4993889,
"env/all/total_ob_tokens": 840768,
"env/all/time/sampling_mean": 567.2069350276142,
"env/all/time/sampling_max": 829.6941080093384,
"env/all/time/env_step_mean": 18.95986255025491,
"env/all/time/env_step_max": 1100.1222214698792,
"env/all/reward/mean": 0.8776864650118265,
"env/all/reward/max": 2.6251952468299056,
"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.8776864650118265,
"env/all/correctness": 0.341796875,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 0.3930200257967537,
"env/all/raw_score/min": 0.3809240379189368,
"env/all/raw_score/max": 1.0,
"env/all/initial_raw_score": -0.38092501071000273,
"env/all/initial_raw_score/min": -0.3809252561334897,
"env/all/initial_raw_score/max": -0.3809240380701843,
"env/all/msg": "RuntimeError: Program execution failed: ValueError: The number of bounds is not compatible with the length of `x0`.",
"env/all/parsed_code": "```python\nimport numpy as np\nfrom scipy.optimize import minimize\nfrom scipy.signal import correlate\n\ndef run(seed=42, budget_s=1000, **kwargs):\n n_points = 200\n dx = 2.0 / n_points\n desired_sum = n_points / 2\n\n # Use the provided initial sample or a more balanced one\n initial_h = np.array(initial_h_values, dtype=np.float64)\n initial_h = np.clip(initial_h, 0.0, 1.0)\n sum_h = np.sum(initial_h)\n if abs(desired_sum - sum_h) > 1e-6:\n initial_h[-1] += (desired_sum - sum_h)\n initial_h = np.clip(initial_h, 0.0, 1.0)\n\n # Set initial t\n initial_t = 0.38092\n x0 = np.concatenate((initial_h, [initial_t]))\n\n def objective(x):\n return x[-1]\n\n # Constraint: total integral of h(x) must be 1\n def constraint_sum(x):\n return np.sum(x[:-1]) - desired_sum\n\n # Compute overlaps for relevant k values only\n def compute_overlap(h, k):\n if k > 0:\n i_start = 0\n i_end = n_points - k - 1\n if i_start > i_end:\n return 0.0\n j = np.arange(i_start, i_end + 1) + k\n valid = (j >= 0) & (j < n_points)\n values = h[np.arange(i_start, i_end + 1)[valid]] * (1 - h[j[valid]])\n return np.sum(values) * dx\n elif k < 0:\n i_start = -k\n i_end = n_points - 1\n if i_start > i_end:\n return 0.0\n j = np.arange(i_start, i_end + 1) + k\n valid = (j >= 0) & (j < n_points)\n values = h[np.arange(i_start, i_end + 1)[valid]] * (1 - h[j[valid]])\n return np.sum(values) * dx\n else: # k == 0\n return np.sum(h * (1 - h)) * dx\n\n # Compute constraints for k = -2, -1, 0, 1, 2\n k_values = [-2, -1, 0, 1, 2]\n\n def constraints_func(x):\n h = x[:-1]\n t = x[-1]\n overlaps = [compute_overlap(h, k) for k in k_values]\n return [t - overlap for overlap in overlaps]\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 result = minimize(\n fun=objective,\n x0=x0,\n bounds=bounds,\n constraints=cons,\n method='SLSQP',\n options={\n 'ftol': 1e-9,\n 'maxiter': 5000,\n 'disp': False\n }\n )\n\n if result.success:\n best_h = result.x[:-1]\n best_t = result.x[-1]\n else:\n best_h = initial_h.copy()\n best_t = initial_t\n\n return best_h, best_t, n_points\n```",
"env/all/time/policy": 567.2069350276142,
"env/all/time/policy/min": 256.6535475254059,
"env/all/time/policy/max": 829.6941080093384,
"env/all/time/env_step": 18.95986255025491,
"env/all/time/env_step/min": 0.005200862884521484,
"env/all/time/env_step/max": 1100.1222214698792,
"env/all/time/reward_compute": 5.634501576423645e-07,
"env/all/time/reward_compute/min": 2.4959444999694824e-07,
"env/all/time/reward_compute/max": 2.2761523723602295e-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.02587207406759262,
"advantage/min": -1.0,
"advantage/max": 6.506897449493408,
"time/assemble_training_data": 11.028441429138184,
"time/kl_vs_base": 146.56563568115234,
"kl_policy_base": 0.0008501674165017903,
"time/train": 1078.959444284439,
"time/save_checkpoint": 18.40455985069275,
"time/total": 3017.4046082496643
}
[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