Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-ac1-step27
ttt-discover-v3-qwen3-8b-ac1-step27 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 ac1. Checkpoint saved after training step 26 (0-indexed). Strict upstream eval parity: 1100s hard…
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 ac1. Checkpoint saved
after training step 26 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 26,
"progress/batch": 26,
"optim/lr": 4e-05,
"progress/done_frac": 0.54,
"puct/buffer_size": 424,
"puct/sampled_size": 8,
"puct/T": 13312,
"puct/scale_last": 0.4936516100901467,
"puct/buffer_value/mean": -1.5238441982911475,
"puct/buffer_value/std": 0.08055737274790363,
"puct/buffer_value/min": -2.000000000000008,
"puct/buffer_value/max": -1.5063483899098538,
"puct/buffer_timestep/mean": 12.245283018867925,
"puct/buffer_timestep/std": 7.652612478761028,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 25.0,
"puct/buffer_construction_len/mean": 1102.6674528301887,
"puct/buffer_construction_len/std": 649.641218308681,
"puct/buffer_construction_len/min": 1000.0,
"puct/buffer_construction_len/max": 7397.0,
"puct/sampled_value/mean": -1.5063602558384819,
"puct/sampled_value/std": 2.1740162864685578e-10,
"puct/sampled_value/min": -1.5063602561280551,
"puct/sampled_value/max": -1.5063602555263058,
"puct/sampled_timestep/mean": 25.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 25.0,
"puct/sampled_timestep/max": 25.0,
"puct/sampled_construction_len/mean": 1000.0,
"puct/sampled_construction_len/std": 0.0,
"puct/sampled_construction_len/min": 1000.0,
"puct/sampled_construction_len/max": 1000.0,
"time/sampling": 4852.96252655983,
"env/all/ac_tokens_per_turn": 8407.3984375,
"env/all/ob_tokens_per_turn": 2920.0,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 4304588,
"env/all/total_ob_tokens": 1495040,
"env/all/time/sampling_mean": 289.95399259077385,
"env/all/time/sampling_max": 395.76331329345703,
"env/all/time/env_step_mean": 2198.0958067425527,
"env/all/time/env_step_max": 4453.907531499863,
"env/all/reward/mean": 0.6155245997805803,
"env/all/reward/max": 0.6638518175035639,
"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.6155245997805803,
"env/all/correctness": 0.953125,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 9.747097984298579,
"env/all/raw_score/min": 1.5063602553985826,
"env/all/raw_score/max": 2000.0,
"env/all/initial_raw_score": -1.5063602558384819,
"env/all/initial_raw_score/min": -1.5063602561280551,
"env/all/initial_raw_score/max": -1.5063602555263058,
"env/all/msg": "Success; raw_score=1.5063602555263056",
"env/all/parsed_code": "```python\nimport time\nimport numpy as np\nfrom scipy.optimize import linprog\nimport random\nimport copy\nimport math\n\ndef propose_candidate(seed=42, **kwargs):\n \"\"\"\n Proposes a sequence of non-negative numbers to minimize the evaluation score \n by using a combination of improved constraint selection, gradient-based search, \n and adaptive line search for efficient optimization.\n \"\"\"\n np.random.seed(seed)\n deadline = time.time() + 1000 - 10 # Run for up to 1000 seconds\n\n n = 1000\n # Start with a high-quality initial sequence if available, otherwise a spread-out one\n best_sequence = None\n if 'height_sequence_1' in globals() and isinstance(height_sequence_1, (list, np.ndarray)):\n best_sequence = np.array(list(height_sequence_1))\n else:\n best_sequence = np.random.rand(n)\n \n # Normalize to ensure the sum is non-zero and valid\n sum_a = np.sum(best_sequence)\n desired_sum = np.sqrt(2 * n)\n if sum_a > 0:\n best_sequence = best_sequence / sum_a * desired_sum\n curr_sequence = best_sequence.copy()\n best_score = evaluate_sequence(curr_sequence.tolist())\n no_improvement_counter = 0\n iteration_count = 0\n\n # Parameters for line search\n # Use golden-section search for alpha optimization with increased iterations\n golden_iterations = 200\n\n while time.time() < deadline:\n current_time = time.time()\n try:\n # Compute current convolution and max_b\n conv = np.convolve(curr_sequence, curr_sequence)\n max_b = np.max(conv)\n sum_a = np.sum(curr_sequence)\n if sum_a < 0.001:\n raise ValueError(\"Sum too small\")\n\n # Build constraints for LP with active indices\n # Select active indices based on 90% of current max_b for better constraint coverage\n threshold = max_b * 0.9\n active_indices = np.where(conv >= threshold)[0]\n if len(active_indices) == 0:\n raise ValueError(\"No active constraints found\")\n\n A = []\n for j in active_indices:\n row = np.zeros(n)\n for m in range(n):\n i = j - m\n if 0 <= i < n:\n row[m] = curr_sequence[i]\n A.append(row)\n A = np.array(A)\n b = np.full(len(active_indices), max_b)\n\n # Define LP problem: maximize sum of g_0 subject to constraints\n c = [-1.0] * n\n bounds = [(0.0, 2000.0) for _ in range(n)] # Increase upper bound for flexibility\n\n # Solve the LP using the 'highs' method for better performance\n res = linprog(c=c, A_ub=A, b_ub=b, bounds=bounds, method='highs', options={\"feastol\": 1e-8})\n if res.success:\n g_0 = res.x\n sum_g = np.sum(g_0)\n if sum_g == 0:\n continue # Avoid division by zero\n # Normalize g_0 to have the same sum as curr_sequence\n g_0_normalized = g_0 / sum_g * sum_a\n\n # Define objective function for golden-section search\n def score_func(alpha):\n new_sequence = (1 - alpha) * curr_sequence + alpha * g_0_normalized\n # Remove clipping for more flexibility\n # new_sequence = np.clip(new_sequence, 0.0, desired_sum)\n return evaluate_sequence(new_sequence.tolist())\n\n # Use golden-section search to find the optimal alpha between 0 and 1\n a, b = 0.0, 1.0\n for _ in range(golden_iterations):\n c = a + (b - a)/2\n d = a + (b - a)*0.381966\n f_c = score_func(c)\n f_d = score_func(d)\n if f_d < f_c:\n b = c\n else:\n a = d\n best_alpha = (a + b) / 2\n \n # Apply the best alpha found\n curr_sequence = (1 - best_alpha) * curr_sequence + best_alpha * g_0_normalized\n # Ensure non-negative and valid values\n curr_sequence = np.maximum(0.0, curr_sequence)\n\n # Evaluate and update best sequence\n curr_score = evaluate_sequence(curr_sequence.tolist())\n if curr_score < best_score:\n best_score = curr_score\n best_sequence = curr_sequence.copy()\n no_improvement_counter = 0\n print(f\"New best score: {best_score}\")\n else:\n no_improvement_counter += 1\n else:\n print(\"LP solution not found, breaking\")\n break\n\n iteration_count += 1\n if iteration_count % 100 == 0:\n print(f\"Iteration {iteration_count}, current best score: {best_score}\")\n if no_improvement_counter > 200: # Increased threshold\n print(\"No improvement for 200 iterations, stopping early\")\n break\n\n except Exception as e:\n print(f\"Error during optimization: {e}. Skipping update.\")\n continue\n\n # Final safety check to ensure non-negative and valid values\n final_sequence = np.maximum(0.0, best_sequence).tolist()\n return [float(x) for x in final_sequence]\n```",
"env/all/time/policy": 289.95399259077385,
"env/all/time/policy/min": 68.71115326881409,
"env/all/time/policy/max": 395.76331329345703,
"env/all/time/env_step": 2198.0958067425527,
"env/all/time/env_step/min": 0.011261224746704102,
"env/all/time/env_step/max": 4453.907531499863,
"env/all/time/reward_compute": 4.1443854570388794e-07,
"env/all/time/reward_compute/min": 2.5704503059387207e-07,
"env/all/time/reward_compute/max": 8.828938007354736e-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.004491254687309265,
"advantage/min": -1.0,
"advantage/max": 0.7027026414871216,
"time/assemble_training_data": 10.652206420898438,
"time/kl_vs_base": 93.68642568588257,
"kl_policy_base": 0.0007623572601005435,
"time/train": 538.5329284667969,
"time/save_checkpoint": 34.73179864883423,
"time/total": 5533.034000635147
}
[2026-07-09T06:24:18+00:00] job=1812628 node=node-12 ngpu=3 ntrain=1 replicas=2 flash_attn=no
[2026-07-09T08:30:32+00:00] job=1813127 node=node-22 ngpu=3 ntrain=1 replicas=2 flash_attn=yes
[2026-07-09T13:07:08+00:00] job=1813128 node=node-6 ngpu=6 ntrain=2 replicas=4 flash_attn=yes