Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-ac1-s2-step32
ttt-discover-v3-qwen3-8b-ac1-s2-step32 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 31 (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 31 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 31,
"progress/batch": 31,
"optim/lr": 4e-05,
"progress/done_frac": 0.64,
"puct/buffer_size": 504,
"puct/sampled_size": 8,
"puct/T": 15872,
"puct/scale_last": 0.5741326333625696,
"puct/buffer_value/mean": -1.526584889699966,
"puct/buffer_value/std": 0.08823499753169019,
"puct/buffer_value/min": -2.0797874683482562,
"puct/buffer_value/max": -1.5056548349856866,
"puct/buffer_timestep/mean": 14.746031746031745,
"puct/buffer_timestep/std": 9.095556658040623,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 30.0,
"puct/buffer_construction_len/mean": 1119.0277777777778,
"puct/buffer_construction_len/std": 733.5783541036005,
"puct/buffer_construction_len/min": 1000.0,
"puct/buffer_construction_len/max": 7850.0,
"puct/sampled_value/mean": -1.5056551258721864,
"puct/sampled_value/std": 5.397780725339361e-07,
"puct/sampled_value/min": -1.5056565275585594,
"puct/sampled_value/max": -1.5056548349856866,
"puct/sampled_timestep/mean": 30.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 30.0,
"puct/sampled_timestep/max": 30.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": 6419.241902589798,
"env/all/ac_tokens_per_turn": 8148.005859375,
"env/all/ob_tokens_per_turn": 3574.5,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 4171779,
"env/all/total_ob_tokens": 1830144,
"env/all/time/sampling_mean": 523.9778896579519,
"env/all/time/sampling_max": 718.8408055305481,
"env/all/time/env_step_mean": 2790.206805388443,
"env/all/time/env_step_max": 5690.08846449852,
"env/all/reward/mean": 0.5764529286385072,
"env/all/reward/max": 0.6643737568215423,
"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.5764529286385072,
"env/all/correctness": 0.884765625,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 3.721108963282016,
"env/all/raw_score/min": 1.5051768422347134,
"env/all/raw_score/max": 693.1511191234517,
"env/all/initial_raw_score": -1.5056551258721864,
"env/all/initial_raw_score/min": -1.5056565275585594,
"env/all/initial_raw_score/max": -1.5056548349856866,
"env/all/msg": "Success; raw_score=1.5056548349856869",
"env/all/parsed_code": "```python\nimport time\nimport numpy as np\nimport cvxpy as cp\nimport copy\nimport random\nfrom typing import List, Tuple\n\ndef propose_candidate(seed=42, budget_s=1000, **kwargs):\n \"\"\"\n Optimizes a sequence of non-negative coefficients to minimize the evaluation function.\n This approach uses adaptive LP-based moves, enhanced perturbation, and improved constraint selection.\n \"\"\"\n np.random.seed(seed)\n deadline = time.time() + budget_s - 10\n\n # Start from known best construction if it exists\n prev = globals().get(\"height_sequence_1\", None)\n if prev is not None and isinstance(prev, (list, np.ndarray)) and len(prev) > 0:\n best_sequence = list(np.asarray(prev, dtype=float))\n else:\n # Generate diverse initial sequences with structural patterns\n initial_sequences = []\n base_length = 128\n for _ in range(100): # Increased number of initial sequences\n base = np.zeros(base_length)\n # Use uniform and Gaussian-like distributions for variability\n base = np.random.uniform(0.01, 0.1, size=base_length) # Uniform initial distribution\n sum_base = np.sum(base)\n scale_factor = 0.5 / (sum_base if sum_base > 0.0 else 0.5)\n initial_sequences.append([max(0.0, x * scale_factor) for x in base])\n # Add a Gaussian-like decay variant\n base_gauss = np.exp(-np.linspace(0, 2, base_length)**2) * 0.1 + 0.02\n sum_gauss = np.sum(base_gauss)\n scale_factor_gauss = 0.5 / (sum_gauss if sum_gauss > 0.0 else 0.5)\n initial_sequences.append([max(0.0, x * scale_factor_gauss) for x in base_gauss])\n best_sequence = initial_sequences[0].copy()\n for seq in initial_sequences:\n curr_score = evaluate_sequence(seq)\n best_score = evaluate_sequence(best_sequence)\n if curr_score < best_score:\n best_sequence = seq.copy()\n\n current_sequence = best_sequence.copy()\n best_score = float('inf')\n\n def perturb_sequence(seq):\n \"\"\"Perturbs elements based on convolution peaks for targeted improvement.\"\"\"\n n = len(seq)\n if n == 0:\n return None\n conv = np.convolve(seq, seq)\n top_indices = np.argsort(conv)[-int(0.15 * n):] # Top 15% positions with highest convolution\n indices = np.random.choice(top_indices, size=min(50, len(top_indices)), replace=False)\n indices = [min(idx, len(seq)-1) for idx in indices]\n if np.random.rand() < 0.1: # Occasionally perturb a random element\n random_idx = np.random.randint(0, len(seq))\n indices.append(random_idx)\n scale = 0.3 * np.std(seq) # Larger perturbation\n for idx in indices:\n new_val = max(0.0, seq[idx] + np.random.normal(0, scale))\n seq = [new_val if i == idx else seq[i] for i in range(len(seq))]\n return seq\n\n def random_walk(seq):\n \"\"\"Adds small random perturbations to all elements.\"\"\"\n scale = 0.15 * np.std(seq)\n new_seq = [max(0.0, x + np.random.normal(0, scale)) for x in seq]\n return new_seq\n\n def get_good_direction_to_move_into(sequence):\n \"\"\"Computes a better sequence using dynamic constraint selection.\"\"\"\n n = len(sequence)\n sum_sequence = np.sum(sequence)\n if sum_sequence <= 0.0:\n return None\n conv = np.convolve(sequence, sequence)\n max_b_val = np.max(conv)\n threshold = 0.8 * max_b_val if max_b_val > 0 else 0.1\n tight_positions = np.where(conv >= threshold)[0]\n if not tight_positions.size:\n tight_positions = np.arange(2 * n - 1)\n g_fun = solve_convolution_lp(sequence, max_b_val, tight_positions)\n if g_fun is None:\n return None\n sum_g = np.sum(g_fun)\n if sum_g <= 0.0:\n return None\n # Golden-section search for optimal t\n def objective(t):\n new_seq = [ (1 - t) * x + t * y for x, y in zip(sequence, g_fun) ]\n return evaluate_sequence(new_seq)\n low, high = 0.0, 1.0\n for _ in range(200):\n t1 = low + (high - low) / 3\n t2 = high - (high - low) / 3\n f1 = objective(t1)\n f2 = objective(t2)\n if f1 < f2:\n high = t2\n else:\n low = t1\n best_t = (low + high) / 2\n new_seq = [ (1 - best_t) * x + best_t * y for x, y in zip(sequence, g_fun) ]\n return new_seq\n\n def solve_convolution_lp(f_sequence, rhs, tight_positions):\n n = len(f_sequence)\n if n == 0:\n return None\n g = cp.Variable(n, nonneg=True)\n objective = cp.Minimize(-cp.sum(g))\n constraints = []\n selected_positions = tight_positions[:]\n for k in selected_positions:\n coeff = np.zeros(n)\n for j in range(n):\n i = k - j\n if 0 <= i < n:\n coeff[j] = f_sequence[i]\n constraints.append(cp.sum(cp.multiply(coeff, g)) <= rhs)\n problem = cp.Problem(objective, constraints)\n try:\n problem.solve(solver=cp.GLPK, verbose=False, eps=1e-6)\n return g.value if problem.status == cp.OPTIMAL else None\n except:\n return None\n\n while time.time() < deadline:\n # Try LP-based move\n h_function = get_good_direction_to_move_into(current_sequence)\n if h_function is not None:\n current_sequence = h_function\n else:\n # Expand sequence if possible\n if len(current_sequence) < 1000:\n n = len(current_sequence)\n new_val = max(0.0, np.max(current_sequence) * 0.1)\n new_seq = current_sequence + [new_val]\n new_sum = np.sum(new_seq)\n if new_sum < 0.01:\n scale_factor = 0.01 / new_sum\n new_seq = [x * scale_factor for x in new_seq]\n current_sequence = new_seq\n else:\n current_sequence = perturb_sequence(current_sequence)\n\n # Occasionally try random walk for exploration\n if np.random.rand() < 0.05:\n current_sequence = random_walk(current_sequence)\n\n # Add structured perturbation strategy\n if np.random.rand() < 0.05:\n seq = [max(0.0, x) for x in current_sequence]\n n = len(seq)\n conv = np.convolve(seq, seq)\n peak_indices = np.argsort(conv)[-50:] # Focus on most impactful positions\n peak_indices = np.array([min(idx, n-1) for idx in peak_indices])\n # Try to balance the values around the peak\n for idx in peak_indices:\n # Reduce peak values\n if seq[idx] > 0.0:\n seq[idx] = max(0.0, seq[idx] * 0.75)\n # Increase surrounding values\n for shift in [-1, 0, 1]:\n neighbor_idx = idx + shift\n if 0 <= neighbor_idx < n:\n seq[neighbor_idx] = min(1000.0, seq[neighbor_idx] * 1.15)\n # Ensure the sequence is non-negative and within bounds\n current_sequence = [max(0.0, min(1000.0, x)) for x in seq]\n\n try:\n curr_score = evaluate_sequence(current_sequence)\n if curr_score < best_score:\n best_score = curr_score\n best_sequence = current_sequence.copy()\n print(f\"New best: {best_score}\")\n except Exception:\n pass\n\n return [float(max(0.0, x)) for x in best_sequence]\n```",
"env/all/time/policy": 523.9778896579519,
"env/all/time/policy/min": 220.50985527038574,
"env/all/time/policy/max": 718.8408055305481,
"env/all/time/env_step": 2790.206805388443,
"env/all/time/env_step/min": 4.838525772094727,
"env/all/time/env_step/max": 5690.08846449852,
"env/all/time/reward_compute": 8.246861398220062e-07,
"env/all/time/reward_compute/min": 2.086162567138672e-07,
"env/all/time/reward_compute/max": 1.8738210201263428e-06,
"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.01467389427125454,
"advantage/min": -1.0,
"advantage/max": 19.35856819152832,
"time/assemble_training_data": 9.176344871520996,
"time/kl_vs_base": 145.32106804847717,
"kl_policy_base": 0.0010592957260087132,
"time/train": 1127.400429725647,
"time/save_checkpoint": 19.324493646621704,
"time/total": 7723.024717092514
}
[2026-07-09T06:24:18+00:00] job=1812630 node=node-14 ngpu=3 ntrain=1 replicas=2 flash_attn=no
[2026-07-09T09:14:17+00:00] job=1813129 node=node-28 ngpu=3 ntrain=1 replicas=2 flash_attn=yes
[2026-07-09T13:46:36+00:00] job=1813130 node=node-22 ngpu=6 ntrain=2 replicas=4 flash_attn=yes
[2026-07-11T14:04:05+00:00] job=1824338 node=node-1 ngpu=3 ntrain=1 replicas=2 flash_attn=yes