Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-ac2-step42
ttt-discover-v3-qwen3-8b-ac2-step42 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 ac2. Checkpoint saved after training step 41 (0-indexed). Strict upstream eval parity: 1100s hard…
Downloads · 30 days
0
Access
Public
Updated Jul 12, 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 ac2. Checkpoint saved
after training step 41 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 41,
"progress/batch": 41,
"optim/lr": 4e-05,
"progress/done_frac": 0.84,
"puct/buffer_size": 662,
"puct/sampled_size": 8,
"puct/T": 20992,
"puct/scale_last": 0.4405803877426361,
"puct/buffer_value/mean": 0.934341348237078,
"puct/buffer_value/std": 0.03825181272374337,
"puct/buffer_value/min": 0.5041471954736918,
"puct/buffer_value/max": 0.9447275832163279,
"puct/buffer_timestep/mean": 19.750755287009063,
"puct/buffer_timestep/std": 11.999362685893281,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 40.0,
"puct/buffer_construction_len/mean": 3126.558912386707,
"puct/buffer_construction_len/std": 2223.9782993852664,
"puct/buffer_construction_len/min": 1024.0,
"puct/buffer_construction_len/max": 32768.0,
"puct/sampled_value/mean": 0.9447185136914649,
"puct/sampled_value/std": 8.051497998459518e-06,
"puct/sampled_value/min": 0.9447056856398797,
"puct/sampled_value/max": 0.9447275832163279,
"puct/sampled_timestep/mean": 40.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 40.0,
"puct/sampled_timestep/max": 40.0,
"puct/sampled_construction_len/mean": 4096.0,
"puct/sampled_construction_len/std": 0.0,
"puct/sampled_construction_len/min": 4096.0,
"puct/sampled_construction_len/max": 4096.0,
"time/sampling": 4815.002299785614,
"env/all/ac_tokens_per_turn": 9847.919921875,
"env/all/ob_tokens_per_turn": 4082.875,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 5042135,
"env/all/total_ob_tokens": 2090432,
"env/all/time/sampling_mean": 404.8724509328604,
"env/all/time/sampling_max": 525.92205286026,
"env/all/time/env_step_mean": 2120.286938046571,
"env/all/time/env_step_max": 4286.916611433029,
"env/all/reward/mean": 0.7902107827672719,
"env/all/reward/max": 0.9447405950602854,
"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.7902107827672719,
"env/all/correctness": 0.8515625,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 0.9279539467358788,
"env/all/raw_score/min": 0.029189244451294484,
"env/all/raw_score/max": 0.9447405950602854,
"env/all/initial_raw_score": 0.9447185136914649,
"env/all/initial_raw_score/min": 0.9447056856398797,
"env/all/initial_raw_score/max": 0.9447275832163279,
"env/all/msg": "RuntimeError: Program execution failed: UnboundLocalError: cannot access local variable 'sum_uni' where it is not associated with a value",
"env/all/parsed_code": "```python\nimport numpy as np\nimport time\nfrom typing import Tuple\n\ndef _simpson_l2sq(conv: np.ndarray) -> Tuple[float, np.ndarray]:\n m = conv.size\n if m == 0:\n return 0.0, np.zeros_like(conv)\n dx = 1.0 / (m + 1)\n y = np.zeros(m + 2, dtype=conv.dtype)\n y[0] = 0.0\n y[1:-1] = conv\n y[-1] = 0.0\n lhs = y[:-1]\n rhs = y[1:]\n l2_sq = (dx / 3.0) * np.sum(lhs * lhs + lhs * rhs + rhs * rhs)\n grad_y = (dx / 3.0) * (4 * y + np.roll(y, 1) + np.roll(y, -1))\n grad_conv = grad_y[1:-1]\n return float(l2_sq), grad_conv\n\ndef _l1(conv: np.ndarray) -> Tuple[float, np.ndarray]:\n m = conv.size\n dx = 1.0 / (m + 1) if m > 0 else 1.0\n val = dx * float(np.sum(conv)) if m > 0 else 0.0\n grad = np.full_like(conv, dx)\n return val, grad\n\ndef _linf(conv: np.ndarray) -> Tuple[float, np.ndarray]:\n if conv.size == 0:\n return 0.0, np.zeros_like(conv)\n m = float(np.max(conv))\n mask = conv == m\n count = int(mask.sum())\n if count == 0 or m <= 0.0:\n return m, np.zeros_like(conv)\n grad = mask.astype(conv.dtype)\n return m, grad\n\ndef _objective_and_grad_conv(conv: np.ndarray) -> Tuple[float, np.ndarray]:\n l2_sq, g_l2 = _simpson_l2sq(conv)\n l1, g_l1 = _l1(conv)\n linf, g_linf = _linf(conv)\n if l1 <= 0.0 or linf <= 0.0:\n return 0.0, np.zeros_like(conv)\n denom = l1 * linf\n c_value = l2_sq / denom\n num_grad = g_l2 * denom - l2_sq * (g_l1 * linf + l1 * g_linf)\n g_conv = num_grad / (denom * denom)\n return float(c_value), g_conv\n\ndef _grad_h_from_conv_grad(h: np.ndarray, g_conv: np.ndarray) -> np.ndarray:\n h_rev = h[::-1]\n g_h = np.convolve(g_conv, h_rev, mode=\"full\")\n N = len(h)\n gradient = g_h[N-1 : N-1 + N]\n return gradient\n\ndef construct_function():\n \"\"\"Construct a sequence to maximize the lower bound C using adaptive upscaling, diverse initial sequences, and optimized gradient ascent with constraint maintenance.\"\"\"\n n_start = 128\n target_length = 4096\n max_seconds = 1000\n num_initializations = 32\n\n initial_sequences = []\n\n # Load previous best if available\n if 'height_sequence_1' in globals():\n initial_sequences.append(np.array(height_sequence_1, dtype=np.float32))\n else:\n pass # Proceed with generated sequences\n\n for _ in range(num_initializations):\n # Gaussian-like\n seq = np.zeros(n_start, dtype=np.float32)\n center = n_start // 2\n std = n_start // 6\n scale = 0.01 / np.sqrt(2 * np.pi * std**2)\n for i in range(n_start):\n seq[i] = np.exp(-((i - center) ** 2) / (2 * std**2)) * scale\n sum_seq = np.sum(seq)\n max_seq = np.max(seq)\n if max_seq > 1000.0:\n seq *= 1000.0 / max_seq\n sum_seq = np.sum(seq)\n if sum_seq < 0.01:\n seq *= 0.01 / sum_seq\n sum_seq = np.sum(seq)\n else:\n if sum_seq < 0.01:\n seq *= 0.01 / sum_seq\n sum_seq = np.sum(seq)\n initial_sequences.append(seq)\n\n # Random\n seq_rand = np.random.rand(n_start) * 0.1\n sum_rand = np.sum(seq_rand)\n max_rand = np.max(seq_rand)\n if max_rand > 1000.0:\n seq_rand *= 1000.0 / max_rand\n sum_rand = np.sum(seq_rand)\n if sum_rand < 0.01:\n seq_rand *= 0.01 / sum_rand\n sum_rand = np.sum(seq_rand)\n else:\n if sum_rand < 0.01:\n seq_rand *= 0.01 / sum_rand\n sum_rand = np.sum(seq_rand)\n initial_sequences.append(seq_rand)\n\n # Uniform\n seq_uniform = np.ones(n_start, dtype=np.float32) * 0.01 / n_start\n max_uni = np.max(seq_uniform)\n if max_uni > 1000.0:\n seq_uniform *= 1000.0 / max_uni\n sum_uni = np.sum(seq_uniform)\n if sum_uni < 0.01:\n seq_uniform *= 0.01 / sum_uni\n sum_uni = np.sum(seq_uniform)\n else:\n if sum_uni < 0.01:\n seq_uniform *= 0.01 / sum_uni\n sum_uni = np.sum(seq_uniform)\n initial_sequences.append(seq_uniform)\n\n # Multi-peak\n seq_multi = np.zeros(n_start, dtype=np.float32)\n peak_positions = [n_start // 4, n_start // 2, n_start * 3 // 4]\n for pos in peak_positions:\n seq_multi[pos] += 0.01 / len(peak_positions)\n sum_multi = np.sum(seq_multi)\n max_multi = np.max(seq_multi)\n if max_multi > 1000.0:\n seq_multi *= 1000.0 / max_multi\n sum_multi = np.sum(seq_multi)\n if sum_multi < 0.01:\n seq_multi *= 0.01 / sum_multi\n sum_multi = np.sum(seq_multi)\n else:\n if sum_multi < 0.01:\n seq_multi *= 0.01 / sum_multi\n sum_multi = np.sum(seq_multi)\n initial_sequences.append(seq_multi)\n\n # Single-peak\n seq_single = np.zeros(n_start, dtype=np.float32)\n seq_single[n_start // 2] = 0.01\n sum_single = np.sum(seq_single)\n if sum_single < 0.01:\n seq_single *= 0.01 / sum_single\n sum_single = np.sum(seq_single)\n initial_sequences.append(seq_single)\n\n # Sinc-like\n seq_sinc = np.zeros(n_start, dtype=np.float32)\n center = n_start // 2\n for i in range(n_start):\n seq_sinc[i] = np.sinc((i - center) / 32) * 0.5\n sum_sinc = np.sum(seq_sinc)\n max_sinc = np.max(seq_sinc)\n if max_sinc > 1000.0:\n seq_sinc *= 1000.0 / max_sinc\n sum_sinc = np.sum(seq_sinc)\n if sum_sinc < 0.01:\n seq_sinc *= 0.01 / sum_sinc\n sum_sinc = np.sum(seq_sinc)\n else:\n if sum_sinc < 0.01:\n seq_sinc *= 0.01 / sum_sinc\n sum_sinc = np.sum(seq_sinc)\n initial_sequences.append(seq_sinc)\n\n # Find best initial sequence\n best_seq = None\n best_value = -float('inf')\n for seq in initial_sequences:\n try:\n current_value = evaluate_sequence(seq.tolist())\n except Exception as e:\n print(f\"Error evaluating initial sequence: {e}\")\n continue\n if current_value > best_value:\n best_value = current_value\n best_seq = seq.copy()\n\n if best_seq is None:\n seq = np.zeros(n_start, dtype=np.float32)\n center = n_start // 2\n std = n_start // 6\n scale = 0.01 / np.sqrt(2 * np.pi * std**2)\n for i in range(n_start):\n seq[i] = np.exp(-((i - center) ** 2) / (2 * std**2)) * scale\n sum_seq = np.sum(seq)\n max_seq = np.max(seq)\n if max_seq > 1000.0:\n seq *= 1000.0 / max_seq\n sum_seq = np.sum(seq)\n if sum_seq < 0.01:\n seq *= 0.01 / sum_seq\n sum_seq = np.sum(seq)\n best_seq = seq.copy()\n best_value = evaluate_sequence(best_seq.tolist())\n\n # Upscale\n current_len = len(best_seq)\n while current_len < target_length:\n upsampling_factor = max(2, (target_length + current_len - 1) // current_len)\n upsampled_seq = np.repeat(best_seq, upsampling_factor)\n upsampled_sum = np.sum(upsampled_seq)\n scaled_seq = upsampled_seq * (0.01 / upsampled_sum)\n max_scaled = np.max(scaled_seq)\n if max_scaled > 1000.0:\n scaled_seq *= 1000.0 / max_scaled\n scaled_sum = np.sum(scaled_seq)\n scaled_seq *= 0.01 / scaled_sum\n best_seq = scaled_seq[:target_length]\n current_len = len(best_seq)\n\n # Optimizer\n start_time = time.time()\n best_seq = best_seq.copy()\n best_value = evaluate_sequence(best_seq.tolist())\n\n max_iter = 400000\n learning_rate = 0.025\n decay_rate = 0.9995\n min_lr = 1e-5\n decay_steps = 30\n step_counter = 0\n beta1, beta2, epsilon = 0.95, 0.9995, 1e-8\n m = np.zeros_like(best_seq)\n v = np.zeros_like(best_seq)\n t = 0\n\n for _ in range(max_iter):\n step_counter += 1\n conv = np.convolve(best_seq, best_seq, mode='full')\n l2_sq, g_l2 = _simpson_l2sq(conv)\n l1, g_l1 = _l1(conv)\n linf, g_linf = _linf(conv)\n\n if l1 <= 0.0 or linf <= 0.0:\n break\n\n denom = l1 * linf\n c_value = l2_sq / denom\n g_conv = _objective_and_grad_conv(conv)[1]\n grad_h = _grad_h_from_conv_grad(best_seq, g_conv)\n\n t += 1\n m = beta1 * m + (1 - beta1) * grad_h\n v = beta2 * v + (1 - beta2) * (grad_h ** 2)\n m_hat = m / (1 - beta1 ** t)\n v_hat = v / (1 - beta2 ** t)\n step = learning_rate * m_hat / (np.sqrt(v_hat) + epsilon)\n best_seq += step\n\n # Clip and re-scale\n best_seq = np.clip(best_seq, 0.0, 1000.0)\n sum_seq = np.sum(best_seq)\n if sum_seq < 0.01:\n best_seq = best_seq * (0.01 / sum_seq)\n best_seq = np.clip(best_seq, 0.0, 1000.0)\n\n if step_counter % 50 == 0:\n current_value = evaluate_sequence(best_seq.tolist())\n if current_value > best_value:\n best_value = current_value\n best_seq = best_seq.copy()\n\n if time.time() - start_time > max_seconds - 5:\n break\n\n if step_counter % decay_steps == 0:\n learning_rate *= decay_rate\n\n final_value = evaluate_sequence(best_seq.tolist())\n print(f\"Final C2 lower bound: {final_value:.6f}\")\n return best_seq.tolist()\n```",
"env/all/time/policy": 404.8724509328604,
"env/all/time/policy/min": 162.10075068473816,
"env/all/time/policy/max": 525.92205286026,
"env/all/time/env_step": 2120.286938046571,
"env/all/time/env_step/min": 0.008489608764648438,
"env/all/time/env_step/max": 4286.916611433029,
"env/all/time/reward_compute": 3.2782554626464844e-07,
"env/all/time/reward_compute/min": 2.0116567611694336e-07,
"env/all/time/reward_compute/max": 9.313225746154785e-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.019537940621376038,
"advantage/min": -1.0,
"advantage/max": 4.231668949127197,
"time/assemble_training_data": 9.688209295272827,
"time/kl_vs_base": 102.07052373886108,
"kl_policy_base": 0.0006588075775653124,
"time/train": 689.6101386547089,
"time/save_checkpoint": 20.611027479171753,
"time/total": 5643.096825838089
}
[2026-07-09T06:38:34+00:00] job=1812632 node=node-30 ngpu=3 ntrain=1 replicas=2 flash_attn=no
[2026-07-09T06:45:52+00:00] job=1812704 node=node-30 ngpu=3 ntrain=1 replicas=2 flash_attn=no
[2026-07-09T07:00:42+00:00] job=1812735 node=node-1 ngpu=3 ntrain=1 replicas=2 flash_attn=no
[2026-07-09T07:26:33+00:00] job=1812827 node=node-14 ngpu=3 ntrain=1 replicas=2 flash_attn=yes
[2026-07-09T09:21:09+00:00] job=1813131 node=node-1 ngpu=3 ntrain=1 replicas=2 flash_attn=yes
[2026-07-09T14:53:48+00:00] job=1813132 node=node-2 ngpu=6 ntrain=2 replicas=4 flash_attn=yes
[2026-07-10T03:31:51+00:00] job=1816627 node=node-14 ngpu=3 ntrain=1 replicas=2 flash_attn=yes
[2026-07-10T03:54:03+00:00] job=1816628 node=node-29 ngpu=6 ntrain=2 replicas=4 flash_attn=yes
[2026-07-10T07:56:44+00:00] job=1817463 node=node-27 ngpu=3 ntrain=1 replicas=2 flash_attn=yes
[2026-07-10T09:10:26+00:00] job=1817464 node=node-7 ngpu=6 ntrain=2 replicas=4 flash_attn=yes