Downloads · 30 days
0
EdwardoSunny/ttt-discover-v3-qwen3-8b-ac1-s2-step21
ttt-discover-v3-qwen3-8b-ac1-s2-step21 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 20 (0-indexed). Strict upstream eval parity: 1100s hard…
Downloads · 30 days
0
Access
Public
Updated Jul 10, 2026
Repo size
354 MB
Likes
0
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 20 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.
{
"step": 20,
"progress/batch": 20,
"optim/lr": 4e-05,
"progress/done_frac": 0.42,
"puct/buffer_size": 328,
"puct/sampled_size": 8,
"puct/T": 10240,
"puct/scale_last": 0.5741089445017498,
"puct/buffer_value/mean": -1.5378104071174274,
"puct/buffer_value/std": 0.10771304969196169,
"puct/buffer_value/min": -2.0797874683482562,
"puct/buffer_value/max": -1.5056785238465065,
"puct/buffer_timestep/mean": 9.24390243902439,
"puct/buffer_timestep/std": 5.921356501659915,
"puct/buffer_timestep/min": -1.0,
"puct/buffer_timestep/max": 19.0,
"puct/buffer_construction_len/mean": 1182.8963414634147,
"puct/buffer_construction_len/std": 902.8911463635785,
"puct/buffer_construction_len/min": 1000.0,
"puct/buffer_construction_len/max": 7850.0,
"puct/sampled_value/mean": -1.5057067937192186,
"puct/sampled_value/std": 1.590791098953735e-05,
"puct/sampled_value/min": -1.5057256097121587,
"puct/sampled_value/max": -1.5056785238465065,
"puct/sampled_timestep/mean": 19.0,
"puct/sampled_timestep/std": 0.0,
"puct/sampled_timestep/min": 19.0,
"puct/sampled_timestep/max": 19.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": 5620.863057613373,
"env/all/ac_tokens_per_turn": 7903.501953125,
"env/all/ob_tokens_per_turn": 3260.75,
"env/all/turns_per_episode": 1.0,
"env/all/total_episodes": 512,
"env/all/total_turns": 512,
"env/all/total_ac_tokens": 4046593,
"env/all/total_ob_tokens": 1669504,
"env/all/time/sampling_mean": 270.9543356192298,
"env/all/time/sampling_max": 374.4400088787079,
"env/all/time/env_step_mean": 2737.297601984348,
"env/all/time/env_step_max": 5233.013004779816,
"env/all/reward/mean": 0.5544630172084943,
"env/all/reward/max": 0.6641585332384482,
"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.5544630172084943,
"env/all/correctness": 0.873046875,
"env/all/correctness/min": 0.0,
"env/all/correctness/max": 1.0,
"env/all/raw_score": 1.6374169126961182,
"env/all/raw_score/min": 1.50566460161612,
"env/all/raw_score/max": 4.965296256319767,
"env/all/initial_raw_score": -1.5057067937192183,
"env/all/initial_raw_score/min": -1.5057256097121587,
"env/all/initial_raw_score/max": -1.5056785238465065,
"env/all/msg": "Success; raw_score=1.5188345321971612",
"env/all/parsed_code": "```python\nimport time\nimport numpy as np\nimport cvxpy as cp\nimport copy\nimport random\n\ndef propose_candidate(seed=42, budget_s=1000, **kwargs):\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 n = 500 # Start with larger sequences for better coverage\n # Generate diverse initial sequences\n initial_sequences = []\n for _ in range(5):\n # Use structured initializations\n if np.random.rand() < 0.1: # Spike\n base = np.zeros(n)\n base[0] = 0.1\n elif np.random.rand() < 0.2: # Cosine-like\n base = np.cos(np.linspace(0, np.pi, n)) * 0.1 + 0.1\n elif np.random.rand() < 0.3: # Uniform\n base = np.random.uniform(0.01, 0.05, size=n)\n elif np.random.rand() < 0.4: # Exponential\n base = np.random.exponential(scale=0.01, size=n)\n elif np.random.rand() < 0.5: # Periodic\n base = np.sin(np.linspace(0, 2 * np.pi, n)) * 0.05 + 0.1\n elif np.random.rand() < 0.6: # Random with absolute values\n base = np.random.randn(n)\n base = np.abs(base) * 0.1 + 0.05\n elif np.random.rand() < 0.7: # Geometric sequence\n base = np.geomspace(0.01, 0.5, n)\n elif np.random.rand() < 0.8: # Inverse exponential\n base = np.random.exponential(scale=0.01, size=n)\n base = np.abs(base) * 0.05 + 0.05\n else: # Random\n base = np.random.rand(n)\n # Normalize to target sum\n target_sum = np.sqrt(2 * n)\n scale_factor = target_sum / np.sum(base) if np.sum(base) > 0 else target_sum\n initial_sequences.append([max(0.0, x * scale_factor) for x in base])\n best_sequence = initial_sequences[0].copy()\n for seq in initial_sequences[1:]:\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 best_seq = None\n K = 50 # Number of top positions to consider in constraints\n\n def get_good_direction_to_move_into(sequence):\n \"\"\"Computes a better sequence using dynamic constraint selection and adaptive line search.\"\"\"\n n = len(sequence)\n if n == 0:\n return None\n\n sum_sequence = np.sum(sequence)\n if sum_sequence <= 0.0:\n return None\n\n conv = np.convolve(sequence, sequence)\n max_b_val = np.max(conv)\n # Select top K positions contributing to max_b\n tight_positions = np.argsort(conv)[-K:]\n if not tight_positions.size:\n tight_positions = np.arange(2 * n - 1)\n # Solve LP with enhanced constraint selection\n g_fun = solve_convolution_lp(sequence, max_b_val, tight_positions)\n if g_fun is None:\n return None\n\n sum_g = np.sum(g_fun)\n if sum_g <= 0.0:\n return None\n\n # Try multiple t values with finer grid\n best_t = 0.0\n best_score = float('inf')\n t_values = np.linspace(0.003, 0.5, 200) # Finer t grid for better optimization\n for t in t_values:\n new_seq = [(1 - t) * x + t * y for x, y in zip(sequence, g_fun)]\n try:\n curr_score = evaluate_sequence(new_seq)\n if curr_score < best_score:\n best_score = curr_score\n best_t = t\n print(f\"New best: {best_score}\")\n except Exception:\n continue\n if best_score < float('inf'):\n return [(1 - best_t) * x + best_t * y for x, y in zip(sequence, g_fun)]\n else:\n return None\n\n def solve_convolution_lp(f_sequence, rhs, tight_positions):\n \"\"\"Solves LP with enhanced constraint selection.\"\"\"\n n = len(f_sequence)\n if n == 0:\n return None\n\n # Variables\n g = cp.Variable(n, nonneg=True)\n # Objective: maximize sum(g_j), equivalent to minimizing -sum(g_j)\n objective = cp.Minimize(-cp.sum(g))\n\n # Constraints: ensure max(convolution) <= rhs\n constraints = []\n for k in tight_positions:\n # Coefficients for the constraint: sum_{j=0}^{n-1} f[i] * g[j] <= rhs\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(coeff * g) <= rhs)\n\n # Solve the LP with a more efficient solver\n problem = cp.Problem(objective, constraints)\n try:\n problem.solve(solver=cp.SCS, verbose=False)\n if problem.status == cp.OPTIMAL:\n return g.value\n except:\n return None\n return None\n\n def perturb_sequence(seq):\n \"\"\"Perturbation with structured strategies for local minima escape.\"\"\"\n n = len(seq)\n if n == 0:\n return None\n\n conv = np.convolve(seq, seq)\n # Select top indices with highest convolution values\n top_indices = np.argsort(conv)[-50:]\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.3:\n random_idx = np.random.randint(0, len(seq))\n indices.append(random_idx)\n for idx in indices:\n # Larger random variation with adaptive scaling\n scale = 0.15 * np.std(seq)\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.1 * 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 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 None:\n # Expand sequence length if possible\n if len(current_sequence) < 1000:\n n = len(current_sequence)\n # Append new element initialized to a small value\n new_val = 0.05\n new_seq = current_sequence + [new_val]\n # Normalize to maintain target sum\n target_sum = np.sqrt(2 * len(new_seq))\n scale_factor = target_sum / np.sum(new_seq) if np.sum(new_seq) > 0 else target_sum\n current_sequence = [x * scale_factor for x in new_seq]\n print(f\"Expanded sequence to length {len(current_sequence)}\")\n else:\n current_sequence = perturb_sequence(current_sequence)\n else:\n current_sequence = h_function\n\n # Occasionally try random walk for exploration\n if np.random.rand() < 0.15:\n current_sequence = random_walk(current_sequence)\n\n try:\n curr_score = evaluate_sequence(current_sequence)\n if curr_score < best_score:\n best_score = curr_score\n best_seq = 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_seq]\n```",
"env/all/time/policy": 270.9543356192298,
"env/all/time/policy/min": 128.64635682106018,
"env/all/time/policy/max": 374.4400088787079,
"env/all/time/env_step": 2737.297601984348,
"env/all/time/env_step/min": 0.010165929794311523,
"env/all/time/env_step/max": 5233.013004779816,
"env/all/time/reward_compute": 7.650814950466156e-07,
"env/all/time/reward_compute/min": 2.086162567138672e-07,
"env/all/time/reward_compute/max": 1.8924474716186523e-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.017685417085886,
"advantage/min": -1.0,
"advantage/max": 3.9979724884033203,
"time/assemble_training_data": 9.141954183578491,
"time/kl_vs_base": 91.2705020904541,
"kl_policy_base": 0.0009365623700432479,
"time/train": 531.062878370285,
"time/save_checkpoint": 19.044036865234375,
"time/total": 6275.0009961128235
}
[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