Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-erdos-s2-step9
ttt-discover-v3-qwen3-8b-erdos-s2-step9 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 8 (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 8 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 8,
"progress/batch": 8,
"optim/lr": 4e-05,
"progress/done_frac": 0.18,
"puct/buffer_size": 136,
"puct/sampled_size": 8,
"puct/T": 4096,
"puct/scale_last": 0.030362440548684477,
"puct/buffer_value/mean": -0.38970295629089563,
"puct/buffer_value/std": 0.02799683379898324,
"puct/buffer_value/min": -0.5130522804051018,
"puct/buffer_value/max": -0.38101721320875104,
"puct/buffer_timestep/mean": 3.235294117647059,
"puct/buffer_timestep/std": 2.462170533700747,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 7.0,
"puct/buffer_construction_len/mean": 61.779411764705884,
"puct/buffer_construction_len/std": 21.16972421132101,
"puct/buffer_construction_len/min": 40.0,
"puct/buffer_construction_len/max": 128.0,
"puct/sampled_value/mean": -0.38110812451250076,
"puct/sampled_value/std": 6.678137296835784e-05,
"puct/sampled_value/min": -0.38117816952344685,
"puct/sampled_value/max": -0.38101721320875104,
"puct/sampled_timestep/mean": 7.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 7.0,
"puct/sampled_timestep/max": 7.0,
"puct/sampled_construction_len/mean": 86.5,
"puct/sampled_construction_len/std": 18.103866990231673,
"puct/sampled_construction_len/min": 64.0,
"puct/sampled_construction_len/max": 128.0,
"time/sampling": 1610.1571815013885,
"env/all/ac_tokens_per_turn": 8835.486328125,
"env/all/ob_tokens_per_turn": 1430.5,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 4523769,
"env/all/total_ob_tokens": 732416,
"env/all/time/sampling_mean": 475.1154082301073,
"env/all/time/sampling_max": 678.5025298595428,
"env/all/time/env_step_mean": 81.56391004938632,
"env/all/time/env_step_max": 1100.127678155899,
"env/all/reward/mean": 0.5763518380640373,
"env/all/reward/max": 2.6246662407154275,
"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.5763518380640373,
"env/all/correctness": 0.2265625,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 0.39611926010237386,
"env/all/raw_score/min": 0.3810008138332892,
"env/all/raw_score/max": 0.5183051091918132,
"env/all/initial_raw_score": -0.38110812451250087,
"env/all/initial_raw_score/min": -0.38117816952344685,
"env/all/initial_raw_score/max": -0.38101721320875104,
"env/all/msg": "Evaluation timed out after 1100 seconds.",
"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 = 64 # Use a moderate number of points for a balance between accuracy and runtime\n dx = 2.0 / n_points\n\n # Start with initial_h_values and generate additional guesses\n initial_guess = initial_h_values.copy()\n\n # Generate multiple initial guesses by perturbing the initial_h_values\n # and ensuring the constraint is enforced\n def generate_perturbation(guess):\n perturbation = np.random.uniform(-0.05, 0.05, n_points)\n perturbed = guess + perturbation\n sum_perturbed = np.sum(perturbed)\n if sum_perturbed != 0:\n perturbed = perturbed * (n_points / 2) / sum_perturbed\n return np.clip(perturbed, 0.0, 1.0)\n\n # Create a list of initial guesses\n initial_guesses = [initial_guess.copy()]\n for _ in range(15): # Add 15 perturbed variants to the initial guesses\n guess = generate_perturbation(initial_guess)\n initial_guesses.append(guess)\n\n best_c5 = float('inf')\n best_h = np.zeros(n_points)\n\n bounds = [(0.0, 1.0) for _ in range(n_points)]\n\n # Local optimizer used for refinement\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(h):\n return np.sum(h) - n_points / 2\n\n for guess in initial_guesses:\n # Basin-hopping with more aggressive search parameters\n result_bh = basinhopping(\n objective,\n guess,\n niter=200, # More global search iterations\n T=0.1, # Lower temperature to reduce noise\n stepsize=0.1,\n minimizer_kwargs={\n 'method': 'SLSQP',\n 'bounds': bounds,\n 'constraints': [{'type': 'eq', 'fun': constraint}],\n 'options': {'ftol': 1e-12, 'maxiter': 500} # Tighter tolerance\n },\n seed=seed\n )\n\n # Final local refinement\n result_slsqp = minimize(\n fun=objective,\n x0=result_bh.x,\n method='SLSQP',\n bounds=bounds,\n constraints=[{'type': 'eq', 'fun': constraint}],\n options={'ftol': 1e-12, 'maxiter': 500}\n )\n\n # Update if a better solution is found\n if result_slsqp.fun < best_c5:\n best_c5 = result_slsqp.fun\n best_h = result_slsqp.x\n\n # Perturb and refine further for better convergence\n for _ in range(50): # More aggressive fine-tuning\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 sum_perturbed = np.sum(h_perturbed)\n h_perturbed = h_perturbed * (n_points / 2) / sum_perturbed\n result_refine = minimize(\n fun=objective,\n x0=h_perturbed,\n method='SLSQP',\n bounds=bounds,\n constraints=[{'type': 'eq', 'fun': constraint}],\n options={'ftol': 1e-12, 'maxiter': 200}\n )\n if result_refine.fun < best_c5:\n best_c5 = result_refine.fun\n best_h = result_refine.x\n\n return best_h, best_c5, n_points\n```",
"env/all/time/policy": 475.1154082301073,
"env/all/time/policy/min": 163.80647921562195,
"env/all/time/policy/max": 678.5025298595428,
"env/all/time/env_step": 81.56391004938632,
"env/all/time/env_step/min": 0.005884885787963867,
"env/all/time/env_step/max": 1100.127678155899,
"env/all/time/reward_compute": 3.348104655742645e-07,
"env/all/time/reward_compute/min": 2.7194619178771973e-07,
"env/all/time/reward_compute/max": 5.066394805908203e-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.03573092073202133,
"advantage/min": -0.9026234745979309,
"advantage/max": 14.149524688720703,
"time/assemble_training_data": 5.427765369415283,
"time/kl_vs_base": 125.65817952156067,
"kl_policy_base": 0.0006905627087689936,
"time/train": 942.0744025707245,
"time/save_checkpoint": 11.00989580154419,
"time/total": 2695.398871421814
}
[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