Views
No views yet
ac1. Checkpoint saved
after training step 29 (0-indexed). Strict upstream eval parity:
1100s hard kill, verbatim prompts/entrypoints, group 64x8, T=1.0, kl 0.1.1{
2 "step": 29,
3 "progress/batch": 29,
4 "optim/lr": 4e-05,
5 "progress/done_frac": 0.6,
6 "puct/buffer_size": 472,
7 "puct/sampled_size": 8,
8 "puct/T": 14848,
9 "puct/scale_last": 0.4936516100901467,
10 "puct/buffer_value/mean": -1.5220661702085738,
11 "puct/buffer_value/std": 0.07653409498375906,
12 "puct/buffer_value/min": -2.000000000000008,
13 "puct/buffer_value/max": -1.5063483899098538,
14 "puct/buffer_timestep/mean": 13.745762711864407,
15 "puct/buffer_timestep/std": 8.518361464823458,
16 "puct/buffer_timestep/min": -1.0,
17 "puct/buffer_timestep/max": 28.0,
18 "puct/buffer_construction_len/mean": 1092.2266949152543,
19 "puct/buffer_construction_len/std": 616.5046200076455,
20 "puct/buffer_construction_len/min": 1000.0,
21 "puct/buffer_construction_len/max": 7397.0,
22 "puct/sampled_value/mean": -1.5063602553757682,
23 "puct/sampled_value/std": 1.9968954560835542e-12,
24 "puct/sampled_value/min": -1.5063602553789135,
25 "puct/sampled_value/max": -1.5063602553719193,
26 "puct/sampled_timestep/mean": 28.0,
27 "puct/sampled_timestep/std": 0.0,
28 "puct/sampled_timestep/min": 28.0,
29 "puct/sampled_timestep/max": 28.0,
30 "puct/sampled_construction_len/mean": 1000.0,
31 "puct/sampled_construction_len/std": 0.0,
32 "puct/sampled_construction_len/min": 1000.0,
33 "puct/sampled_construction_len/max": 1000.0,
34 "time/sampling": 5459.1986384391785,
35 "env/all/ac_tokens_per_turn": 8150.328125,
36 "env/all/ob_tokens_per_turn": 2940.5,
37 "env/all/turns_per_episode": 1.0,
38 "env/all/total_episodes": 512,
39 "env/all/total_turns": 512,
40 "env/all/total_ac_tokens": 4172968,
41 "env/all/total_ob_tokens": 1505536,
42 "env/all/time/sampling_mean": 281.0514993253164,
43 "env/all/time/sampling_max": 378.00785851478577,
44 "env/all/time/env_step_mean": 2758.342731554527,
45 "env/all/time/env_step_max": 5078.862661123276,
46 "env/all/reward/mean": 0.6383538527267569,
47 "env/all/reward/max": 0.6638518175208769,
48 "env/all/reward/min": 0.0,
49 "env/all/format": 1.0,
50 "env/all/format/min": 1.0,
51 "env/all/format/max": 1.0,
52 "env/all/reward": 0.6383538527267569,
53 "env/all/correctness": 0.982421875,
54 "env/all/correctness/min": 0.0,
55 "env/all/correctness/max": 1.0,
56 "env/all/raw_score": 3.5287214838880616,
57 "env/all/raw_score/min": 1.5063602553592976,
58 "env/all/raw_score/max": 1000.0,
59 "env/all/initial_raw_score": -1.506360255375768,
60 "env/all/initial_raw_score/min": -1.5063602553789135,
61 "env/all/initial_raw_score/max": -1.5063602553719193,
62 "env/all/msg": "Success; raw_score=1.5063602553719193",
63 "env/all/parsed_code": "```python\nimport time\nimport numpy as np\nfrom scipy.optimize import linprog\n\ndef propose_candidate(seed=42, **kwargs):\n \"\"\"\n Proposes a sequence of non-negative numbers to minimize the evaluation score \n using an enhanced optimization approach with adaptive constraint selection, \n dynamic perturbation targeting, and optimized line search strategy.\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\n try:\n best_sequence = np.array(list(height_sequence_1))\n except NameError:\n # Start with a uniform initialization with higher initial sum\n best_sequence = np.ones(n) * (np.sqrt(2 * n) / n)\n \n # Initial sequence without normalization to 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 and perturbation\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 # Select more positions with highest convolution values for tighter constraints\n k = np.random.randint(900, 920) # Select more positions for tighter constraints\n positions = np.argsort(conv)[-k:] # Select top k positions\n\n # Construct the A matrix for LP\n A = []\n for j in positions:\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(positions), max_b)\n\n # Define LP problem: maximize sum of g_0\n c = [-1.0] * n\n bounds = [(0.0, 1000.0) for _ in range(n)]\n\n # Solve the LP using 'highs' for 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\n # No normalization to desired_sum, allow sum to vary\n\n # Optimized line search with more iterations\n def find_optimal_alpha(curr_seq, g0_norm, sum_curr):\n low = 0.0\n high = 1.0\n for _ in range(500): # Reduced iterations for efficiency\n m1 = low + (high - low)/3\n m2 = high - (high - low)/3\n new_seq1 = (1 - m1) * curr_seq + m1 * g0_norm\n new_seq1 = np.clip(new_seq1, 0.0, 1000.0)\n score1 = evaluate_sequence(new_seq1.tolist())\n \n new_seq2 = (1 - m2) * curr_seq + m2 * g0_norm\n new_seq2 = np.clip(new_seq2, 0.0, 1000.0)\n score2 = evaluate_sequence(new_seq2.tolist())\n \n if score1 < score2:\n high = m2\n else:\n low = m1\n alpha_opt = (low + high) / 2\n new_seq = (1 - alpha_opt) * curr_seq + alpha_opt * g0_norm\n new_seq = np.clip(new_seq, 0.0, 1000.0)\n return new_seq, evaluate_sequence(new_seq.tolist())\n\n new_sequence, new_score = find_optimal_alpha(curr_sequence, g_0, sum_a)\n curr_sequence = new_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\n else:\n print(\"LP solution not found, breaking\")\n break\n\n # Intensive perturbation to escape local minima\n iteration_count += 1\n if iteration_count % 5 == 0: # Perturb more frequently\n print(f\"Iteration {iteration_count}, current best score: {best_score}\")\n if no_improvement_counter > 100:\n print(\"No improvement for 100 iterations, perturbing the sequence\")\n no_improvement_counter = 0\n # Identify top 10% elements to perturb\n top_indices = np.argsort(curr_sequence)[::-1][:int(0.1 * n)]\n perturb = np.zeros(n)\n perturb[top_indices] = np.random.uniform(-0.5 * curr_sequence[top_indices], 0.5 * curr_sequence[top_indices])\n curr_sequence = curr_sequence + perturb\n curr_sequence = np.clip(curr_sequence, 0.0, 1000.0)\n # Ensure sum is not too small\n if np.sum(curr_sequence) < 0.01:\n curr_sequence = curr_sequence * 0.01 / np.sum(curr_sequence) * 1000.0 # Scale to have sum 0.01\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```",
64 "env/all/time/policy": 281.0514993253164,
65 "env/all/time/policy/min": 55.44236516952515,
66 "env/all/time/policy/max": 378.00785851478577,
67 "env/all/time/env_step": 2758.342731554527,
68 "env/all/time/env_step/min": 0.7262411117553711,
69 "env/all/time/env_step/max": 5078.862661123276,
70 "env/all/time/reward_compute": 4.130415618419647e-07,
71 "env/all/time/reward_compute/min": 2.2351741790771484e-07,
72 "env/all/time/reward_compute/max": 1.389533281326294e-06,
73 "env/all/by_group/frac_mixed": 1.0,
74 "env/all/by_group/frac_all_good": 0.0,
75 "env/all/by_group/frac_all_bad": 0.0,
76 "advantage/mean": 0.003817981109023094,
77 "advantage/min": -1.0,
78 "advantage/max": 0.9687498807907104,
79 "time/assemble_training_data": 10.407095432281494,
80 "time/kl_vs_base": 88.29733514785767,
81 "kl_policy_base": 0.0007437707390636206,
82 "time/train": 523.2406702041626,
83 "time/save_checkpoint": 34.98426365852356,
84 "time/total": 6118.789489269257
85}[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