Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-ac1-step31
ttt-discover-v3-qwen3-8b-ac1-step31 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 30 (0-indexed). Strict upstream eval parity: 1100s hard…
Downloads · 30 days
0
Access
Public
Updated Jul 11, 2026
Repo size
354 MB
Likes
1
Public
Click a slice to open those files.
.safetensors349 MB · 99%
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 30 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 30,
"progress/batch": 30,
"optim/lr": 4e-05,
"progress/done_frac": 0.62,
"puct/buffer_size": 488,
"puct/sampled_size": 8,
"puct/T": 15360,
"puct/scale_last": 0.4936516100901467,
"puct/buffer_value/mean": -1.521551222181111,
"puct/buffer_value/std": 0.07532092758477031,
"puct/buffer_value/min": -2.000000000000008,
"puct/buffer_value/max": -1.5063483899098538,
"puct/buffer_timestep/mean": 14.245901639344263,
"puct/buffer_timestep/std": 8.806956523308148,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 29.0,
"puct/buffer_construction_len/mean": 1089.202868852459,
"puct/buffer_construction_len/std": 606.5361559168529,
"puct/buffer_construction_len/min": 1000.0,
"puct/buffer_construction_len/max": 7397.0,
"puct/sampled_value/mean": -1.5063602553675353,
"puct/sampled_value/std": 3.984250278562637e-12,
"puct/sampled_value/min": -1.506360255371331,
"puct/sampled_value/max": -1.5063602553592976,
"puct/sampled_timestep/mean": 29.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 29.0,
"puct/sampled_timestep/max": 29.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": 6103.4288284778595,
"env/all/ac_tokens_per_turn": 8228.41015625,
"env/all/ob_tokens_per_turn": 3024.25,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 4212946,
"env/all/total_ob_tokens": 1548416,
"env/all/time/sampling_mean": 283.88724840944633,
"env/all/time/sampling_max": 377.5336437225342,
"env/all/time/env_step_mean": 2940.9875311735086,
"env/all/time/env_step_max": 5720.159309864044,
"env/all/reward/mean": 0.6386215891149316,
"env/all/reward/max": 0.6638519065017691,
"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.6386215891149316,
"env/all/correctness": 0.98046875,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 1.5422631534514308,
"env/all/raw_score/min": 1.5063600534508914,
"env/all/raw_score/max": 2.0893790637193503,
"env/all/initial_raw_score": -1.506360255367535,
"env/all/initial_raw_score/min": -1.506360255371331,
"env/all/initial_raw_score/max": -1.5063602553592976,
"env/all/msg": "Success; raw_score=1.5063602553592976",
"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 using a combination of symmetry-based initialization, adaptive constraint selection,\n and enhanced line search strategies. This approach aims to find a structured initial \n configuration to avoid local optima while exploring the solution space with\n more sophisticated scaling and combination strategies.\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 symmetric Gaussian-like initialization\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 # Initial sequence: Gaussian-like symmetric\n center = n // 2\n sigma = 100\n best_sequence = np.zeros(n)\n for i in range(n):\n dist = abs(i - center)\n val = np.exp(-dist**2 / (2 * sigma**2))\n best_sequence[i] = val\n # Normalize to ensure sum is at least 0.01\n sum_a = np.sum(best_sequence)\n if sum_a < 0.001:\n best_sequence = np.full(n, 1.0)\n\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 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, mode='full')\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 # Dynamically select active constraints\n K = n # Use all indices\n conv_sorted_indices = np.argsort(conv)\n active_indices = conv_sorted_indices[-K:]\n\n # Build the A matrix for LP constraint system\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, 10000.0) for _ in range(n)] # Use higher upper bound\n\n # Solve the LP using the 'highs' method\n res = linprog(c=c, A_ub=A, b_ub=b, bounds=bounds, method='highs', options={\"feastol\": 1e-6})\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\n # Perform line search for scale with wider range\n def score_func(scale):\n scaled_g = g_0 * scale\n new_sequence = scaled_g\n return evaluate_sequence(new_sequence.tolist())\n\n a, b = 0.1, 10.0 # Wider range for scale\n iterations = 150\n for _ in range(iterations):\n c_val = a + (b - a)/2\n d_val = a + (b - a)*0.381966\n f_c = score_func(c_val)\n f_d = score_func(d_val)\n if f_d < f_c:\n b = c_val\n else:\n a = d_val\n best_scale = (a + b)/2\n g_0_normalized = g_0 * best_scale\n g_0_normalized = np.clip(g_0_normalized, 0.0, 1000.0)\n\n # Define objective function for line search to find optimal alpha\n def score_func_alpha(alpha):\n new_sequence = (1 - alpha) * curr_sequence + alpha * g_0_normalized\n new_sequence = np.clip(new_sequence, 0.0, 1000.0)\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 iterations = 150\n for _ in range(iterations):\n c_val = a + (b - a)/2\n d_val = a + (b - a)*0.381966\n f_c = score_func_alpha(c_val)\n f_d = score_func_alpha(d_val)\n if f_d < f_c:\n b = c_val\n else:\n a = d_val\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 curr_sequence = np.clip(curr_sequence, 0.0, 1000.0)\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 > 100: # Reduced threshold for earlier stopping\n print(\"No improvement for 100 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": 283.88724840944633,
"env/all/time/policy/min": 111.25921845436096,
"env/all/time/policy/max": 377.5336437225342,
"env/all/time/env_step": 2940.9875311735086,
"env/all/time/env_step/min": 2.5509610176086426,
"env/all/time/env_step/max": 5720.159309864044,
"env/all/time/reward_compute": 3.7299469113349915e-07,
"env/all/time/reward_compute/min": 2.5331974029541016e-07,
"env/all/time/reward_compute/max": 8.083879947662354e-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.004564481787383556,
"advantage/min": -1.0,
"advantage/max": 0.615384578704834,
"time/assemble_training_data": 9.993045330047607,
"time/kl_vs_base": 94.99324822425842,
"kl_policy_base": 0.0007551112212240696,
"time/train": 532.2399046421051,
"time/save_checkpoint": 34.483798027038574,
"time/total": 6779.2794778347015
}
[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