Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-erdos-step16
ttt-discover-v3-qwen3-8b-erdos-step16 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 15 (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 15 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 15,
"progress/batch": 15,
"optim/lr": 4e-05,
"progress/done_frac": 0.32,
"puct/buffer_size": 248,
"puct/sampled_size": 8,
"puct/T": 7680,
"puct/scale_last": 0.11905839782286143,
"puct/buffer_value/mean": -0.3865490919261261,
"puct/buffer_value/std": 0.02379734936195881,
"puct/buffer_value/min": -0.5236859987110454,
"puct/buffer_value/max": -0.38094160217714446,
"puct/buffer_timestep/mean": 6.741935483870968,
"puct/buffer_timestep/std": 4.479110956828331,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 14.0,
"puct/buffer_construction_len/mean": 78.17338709677419,
"puct/buffer_construction_len/std": 14.024107175715773,
"puct/buffer_construction_len/min": 42.0,
"puct/buffer_construction_len/max": 143.0,
"puct/sampled_value/mean": -0.38094162184773095,
"puct/sampled_value/std": 1.476946760024124e-08,
"puct/sampled_value/min": -0.38094164758418836,
"puct/sampled_value/max": -0.38094160217714446,
"puct/sampled_timestep/mean": 14.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 14.0,
"puct/sampled_timestep/max": 14.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": 1758.1136813163757,
"env/all/ac_tokens_per_turn": 9349.978515625,
"env/all/ob_tokens_per_turn": 1633.25,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 4787189,
"env/all/total_ob_tokens": 836224,
"env/all/time/sampling_mean": 511.4282429860905,
"env/all/time/sampling_max": 767.5150606632233,
"env/all/time/env_step_mean": 30.659455427899957,
"env/all/time/env_step_max": 1100.1287834644318,
"env/all/reward/mean": 0.9675884296834504,
"env/all/reward/max": 2.6250745186390128,
"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.9675884296834504,
"env/all/correctness": 0.384765625,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 0.40175073618628804,
"env/all/raw_score/min": 0.38094155676301006,
"env/all/raw_score/max": 0.5183051091884735,
"env/all/initial_raw_score": -0.38094162184773084,
"env/all/initial_raw_score/min": -0.38094164758418836,
"env/all/initial_raw_score/max": -0.38094160217714446,
"env/all/msg": "RuntimeError: Program execution failed: ValueError: The population supplied needs to have shape (S, len(x)), where S > 4.",
"env/all/parsed_code": "```python\nimport numpy as np\nfrom scipy.optimize import differential_evolution, minimize\nfrom scipy.signal import correlate\nimport time\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\ndef run(seed=42, budget_s=1000, **kwargs):\n np.random.seed(seed)\n n_points = len(initial_h_values)\n dx = 2.0 / n_points\n required_sum = int(n_points / 2)\n\n start = time.time()\n\n # Objective function with constraint enforcement\n def objective(x):\n current_sum = np.sum(x)\n scaling_factor = required_sum / current_sum\n if current_sum > required_sum:\n adjusted_x = x * scaling_factor\n return evaluate_C5(adjusted_x, dx)\n elif current_sum < required_sum:\n # Penalize for sum below required\n return evaluate_C5(x, dx) + 1000 * (required_sum - current_sum)\n else:\n return evaluate_C5(x, dx)\n\n # Generate initial guess based on the provided seed\n h_initial = initial_h_values.copy()\n h_initial = h_initial * (required_sum / h_initial.sum())\n\n # Bounds for each parameter\n bounds = [(0.0, 1.0) for _ in range(n_points)]\n\n # Run Differential Evolution to explore the search space\n de_result = differential_evolution(\n objective,\n bounds,\n popsize=100, # Higher population size for better exploration\n mutation=(0.8, 1.2),\n maxiter=500, # Reduced to save time\n tol=1e-6,\n polish=True,\n init=[h_initial],\n strategy='best1bin'\n )\n\n # Local optimization with SLSQP, ensuring sum constraint is satisfied\n def objective_local(x):\n return evaluate_C5(x, dx)\n\n constraint = {'type': 'eq', 'fun': lambda x: np.sum(x) - required_sum}\n\n # Run multiple local optimizations to avoid getting stuck in poor local optima\n num_local_optimizations = 5\n local_optimizers = []\n\n for _ in range(num_local_optimizations):\n result_local = minimize(\n objective_local,\n de_result.x,\n method='SLSQP',\n bounds=bounds,\n constraints=constraint,\n options={'maxiter': 300, 'ftol': 1e-9, 'disp': False}\n )\n local_optimizers.append(result_local)\n\n # Select the best among the local optimizations\n best_result = min(local_optimizers, key=lambda r: r.fun)\n\n # Ensure the final solution meets the constraint\n best_h = best_result.x\n best_c5 = best_result.fun\n\n elapsed = time.time() - start\n if elapsed > budget_s:\n print(f\"Budget exceeded: {elapsed} seconds used.\")\n return de_result.x, de_result.fun, n_points # Fallback\n\n return best_h, best_c5, n_points\n```",
"env/all/time/policy": 511.4282429860905,
"env/all/time/policy/min": 192.22372603416443,
"env/all/time/policy/max": 767.5150606632233,
"env/all/time/env_step": 30.659455427899957,
"env/all/time/env_step/min": 0.005598306655883789,
"env/all/time/env_step/max": 1100.1287834644318,
"env/all/time/reward_compute": 2.9243528842926025e-07,
"env/all/time/reward_compute/min": 2.123415470123291e-07,
"env/all/time/reward_compute/max": 4.0605664253234863e-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.0224761925637722,
"advantage/min": -0.9922894835472107,
"advantage/max": 2.3455491065979004,
"time/assemble_training_data": 9.034083604812622,
"time/kl_vs_base": 129.9757800102234,
"kl_policy_base": 0.0008436993230134249,
"time/train": 1026.899269104004,
"time/save_checkpoint": 9.124225378036499,
"time/total": 2934.2465369701385
}
[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