Upload 143 files
Browse files- hugging/td_fuse/grpo_reason.py +607 -0
hugging/td_fuse/grpo_reason.py
ADDED
|
@@ -0,0 +1,607 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""
|
| 2 |
+
TD GRPO Reasoning Training — Cycle 2 (Overnight)
|
| 3 |
+
|
| 4 |
+
Teaches the model HOW to reason, not just WHAT to answer.
|
| 5 |
+
Uses chain-of-thought with <think>...</think> tags.
|
| 6 |
+
|
| 7 |
+
THE APPROACH:
|
| 8 |
+
1. Generate diverse reasoning problems with verified answers
|
| 9 |
+
2. For each problem, generate N candidate chain-of-thought responses
|
| 10 |
+
3. Score each candidate: correct answer = +1, wrong = -1
|
| 11 |
+
4. Train on (correct CoT, wrong CoT) pairs — model learns to prefer
|
| 12 |
+
good reasoning chains over bad ones
|
| 13 |
+
5. This is simplified GRPO: verified rewards, no learned reward model
|
| 14 |
+
|
| 15 |
+
KEY INSIGHT (from interviews test_12-18):
|
| 16 |
+
- The model already has reasoning ability from DeepSeek/MiMo/Falcon
|
| 17 |
+
- It just needs practice USING chain-of-thought consistently
|
| 18 |
+
- Qwen3 supports <think>...</think> natively — we activate it
|
| 19 |
+
- Training on CoT pairs teaches the reasoning PROCESS
|
| 20 |
+
|
| 21 |
+
OVERNIGHT MODE:
|
| 22 |
+
- Checkpoints every 100 steps
|
| 23 |
+
- Progress saved to JSON after each generation batch
|
| 24 |
+
- Can resume from last checkpoint if GPU disconnects
|
| 25 |
+
- Estimated: 3-5 hours for full cycle on A6000
|
| 26 |
+
|
| 27 |
+
From test_16 cost optimization:
|
| 28 |
+
- 70-80% budget on inference scaling (generate many, pick best)
|
| 29 |
+
- 10-20% on short GRPO training bursts
|
| 30 |
+
- Verified rewards only (math correct, logic valid)
|
| 31 |
+
"""
|
| 32 |
+
|
| 33 |
+
import torch
|
| 34 |
+
import time
|
| 35 |
+
import json
|
| 36 |
+
import math
|
| 37 |
+
import random
|
| 38 |
+
import gc
|
| 39 |
+
import re
|
| 40 |
+
from pathlib import Path
|
| 41 |
+
from typing import List, Dict, Tuple
|
| 42 |
+
from dataclasses import dataclass
|
| 43 |
+
|
| 44 |
+
|
| 45 |
+
@dataclass
|
| 46 |
+
class GRPOConfig:
|
| 47 |
+
"""Configuration for overnight GRPO reasoning training."""
|
| 48 |
+
model_path: str = "td_fuse_outputs/healed_final"
|
| 49 |
+
output_dir: str = "td_fuse_outputs/grpo_cycle2"
|
| 50 |
+
progress_file: str = "td_fuse_outputs/grpo_cycle2/progress.json"
|
| 51 |
+
|
| 52 |
+
# Generation
|
| 53 |
+
num_candidates: int = 8 # Generate N chain-of-thought attempts per problem
|
| 54 |
+
max_gen_tokens: int = 1024 # Longer — CoT needs room to think
|
| 55 |
+
temperature: float = 0.7
|
| 56 |
+
|
| 57 |
+
# Problems
|
| 58 |
+
num_problems: int = 500 # Total reasoning problems
|
| 59 |
+
batch_save_every: int = 50 # Save generation progress every N problems
|
| 60 |
+
|
| 61 |
+
# Training
|
| 62 |
+
lora_r: int = 16
|
| 63 |
+
lora_alpha: int = 32
|
| 64 |
+
train_epochs: int = 3
|
| 65 |
+
train_batch: int = 2 # Smaller batch — CoT sequences are longer
|
| 66 |
+
train_grad_accum: int = 8 # Effective batch = 16
|
| 67 |
+
learning_rate: float = 1e-5 # Very gentle — don't break what works
|
| 68 |
+
save_steps: int = 100 # Checkpoint every 100 training steps
|
| 69 |
+
|
| 70 |
+
|
| 71 |
+
# ============================================================
|
| 72 |
+
# PROBLEM GENERATORS — Diverse reasoning with verified answers
|
| 73 |
+
# ============================================================
|
| 74 |
+
|
| 75 |
+
def generate_all_problems(cfg: GRPOConfig) -> List[Dict]:
|
| 76 |
+
"""Generate a diverse mix of reasoning problems with verified answers."""
|
| 77 |
+
problems = []
|
| 78 |
+
|
| 79 |
+
# 1. TEMPORAL REASONING (the model's known weakness)
|
| 80 |
+
days = ["Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"]
|
| 81 |
+
for i in range(7):
|
| 82 |
+
for offset_desc, offset in [("tomorrow", 2), ("the day after tomorrow", 3), ("3 days from now", 4)]:
|
| 83 |
+
yesterday = days[i]
|
| 84 |
+
answer_day = days[(i + offset) % 7]
|
| 85 |
+
problems.append({
|
| 86 |
+
"question": f"If yesterday was {yesterday}, what day is {offset_desc}?",
|
| 87 |
+
"answer": answer_day.lower(),
|
| 88 |
+
"type": "temporal",
|
| 89 |
+
"think_hint": f"Yesterday was {yesterday}, so today is {days[(i+1)%7]}. {offset_desc.capitalize()} is {answer_day}."
|
| 90 |
+
})
|
| 91 |
+
|
| 92 |
+
# 2. TRICK QUESTIONS (the other known weakness)
|
| 93 |
+
tricks = [
|
| 94 |
+
("Which is heavier: a pound of feathers or a pound of bricks?",
|
| 95 |
+
"same", "They both weigh exactly one pound. The material doesn't matter — a pound is a pound."),
|
| 96 |
+
("Which is heavier: a ton of feathers or a ton of steel?",
|
| 97 |
+
"same", "They both weigh one ton. Despite steel being denser, the question specifies equal weights."),
|
| 98 |
+
("Which weighs more: 1kg of cotton or 1kg of iron?",
|
| 99 |
+
"same", "They both weigh 1 kilogram. The density differs but the mass is identical."),
|
| 100 |
+
("A farmer has 17 sheep. All but 9 die. How many are left?",
|
| 101 |
+
"9", "'All but 9' means 9 survive. Not 17-9=8."),
|
| 102 |
+
("How many times can you subtract 5 from 25?",
|
| 103 |
+
"once", "Only once. After subtracting 5, you have 20, not 25 anymore."),
|
| 104 |
+
("If there are 3 apples and you take away 2, how many do YOU have?",
|
| 105 |
+
"2", "You took 2 apples, so YOU have 2. The pile has 1 left, but you have 2."),
|
| 106 |
+
("A rooster lays an egg on top of a barn roof. Which side does it roll down?",
|
| 107 |
+
"neither", "Roosters don't lay eggs. Only hens do."),
|
| 108 |
+
("How many months have 28 days?",
|
| 109 |
+
"all", "All 12 months have at least 28 days."),
|
| 110 |
+
("If you're running in a race and pass the person in 2nd place, what position are you in?",
|
| 111 |
+
"2nd", "You passed the 2nd place runner, so you take their position: 2nd place."),
|
| 112 |
+
("A man builds a house with all 4 sides facing south. A bear walks past. What color is the bear?",
|
| 113 |
+
"white", "All sides face south means the house is at the North Pole. Bears there are polar bears — white."),
|
| 114 |
+
]
|
| 115 |
+
for q, key, explanation in tricks:
|
| 116 |
+
problems.append({
|
| 117 |
+
"question": q, "answer": key, "type": "trick",
|
| 118 |
+
"think_hint": explanation
|
| 119 |
+
})
|
| 120 |
+
|
| 121 |
+
# 3. SYLLOGISMS & DEDUCTIVE LOGIC
|
| 122 |
+
syllogisms = [
|
| 123 |
+
("All mammals breathe air. Whales are mammals. Do whales breathe air?", "yes",
|
| 124 |
+
"Whales are mammals. All mammals breathe air. Therefore whales breathe air."),
|
| 125 |
+
("All birds have feathers. Penguins are birds. Do penguins have feathers?", "yes",
|
| 126 |
+
"Penguins are birds. All birds have feathers. Therefore penguins have feathers."),
|
| 127 |
+
("No fish are mammals. Salmon is a fish. Is salmon a mammal?", "no",
|
| 128 |
+
"Salmon is a fish. No fish are mammals. Therefore salmon is not a mammal."),
|
| 129 |
+
("Some dogs are large. Rex is a dog. Is Rex definitely large?", "no",
|
| 130 |
+
"Only SOME dogs are large. We can't conclude Rex is large — he might be small."),
|
| 131 |
+
("All squares are rectangles. All rectangles have 4 sides. Do squares have 4 sides?", "yes",
|
| 132 |
+
"Squares are rectangles. Rectangles have 4 sides. Therefore squares have 4 sides."),
|
| 133 |
+
("All cats are animals. Some animals can swim. Can all cats swim?", "no",
|
| 134 |
+
"Only SOME animals can swim. We can't conclude all cats can swim."),
|
| 135 |
+
("No reptiles are warm-blooded. All mammals are warm-blooded. Can a reptile be a mammal?", "no",
|
| 136 |
+
"Reptiles aren't warm-blooded. Mammals are warm-blooded. So no reptile can be a mammal."),
|
| 137 |
+
("All doctors studied medicine. Jane studied medicine. Is Jane definitely a doctor?", "no",
|
| 138 |
+
"All doctors studied medicine, but not everyone who studied medicine is a doctor."),
|
| 139 |
+
]
|
| 140 |
+
for q, a, hint in syllogisms:
|
| 141 |
+
problems.append({"question": q, "answer": a, "type": "syllogism", "think_hint": hint})
|
| 142 |
+
|
| 143 |
+
# 4. MULTI-STEP REASONING
|
| 144 |
+
multi = [
|
| 145 |
+
("If A is taller than B, and B is taller than C, who is the shortest?", "c",
|
| 146 |
+
"A > B > C in height. C is at the bottom, so C is the shortest."),
|
| 147 |
+
("Tom is older than Jerry. Jerry is older than Spike. Spike is older than Tyke. Who is youngest?", "tyke",
|
| 148 |
+
"Tom > Jerry > Spike > Tyke. Tyke is youngest."),
|
| 149 |
+
("In a race, Tom finished before Jerry but after Sam. Who won?", "sam",
|
| 150 |
+
"Sam finished first, then Tom, then Jerry. Sam won."),
|
| 151 |
+
("Red is left of Blue. Blue is left of Green. Green is left of Yellow. What is rightmost?", "yellow",
|
| 152 |
+
"Order left to right: Red, Blue, Green, Yellow. Yellow is rightmost."),
|
| 153 |
+
("Amy has more money than Bob. Carol has less money than Bob. Who has the least?", "carol",
|
| 154 |
+
"Amy > Bob > Carol. Carol has the least money."),
|
| 155 |
+
("The library is north of the school. The park is south of the school. What is furthest north?", "library",
|
| 156 |
+
"North to south: Library, School, Park. Library is furthest north."),
|
| 157 |
+
]
|
| 158 |
+
for q, a, hint in multi:
|
| 159 |
+
problems.append({"question": q, "answer": a, "type": "multi_step", "think_hint": hint})
|
| 160 |
+
|
| 161 |
+
# 5. MATH WORD PROBLEMS (with reasoning required)
|
| 162 |
+
for _ in range(min(200, cfg.num_problems - len(problems))):
|
| 163 |
+
ptype = random.choice(["rate", "ratio", "sequence", "percentage", "comparison"])
|
| 164 |
+
|
| 165 |
+
if ptype == "rate":
|
| 166 |
+
speed = random.randint(20, 120)
|
| 167 |
+
hours = random.choice([1, 2, 3, 4, 5, 0.5, 1.5, 2.5])
|
| 168 |
+
dist = int(speed * hours)
|
| 169 |
+
problems.append({
|
| 170 |
+
"question": f"A car drives at {speed} mph for {hours} hours. How far does it travel?",
|
| 171 |
+
"answer": str(dist), "type": "math_reasoning",
|
| 172 |
+
"think_hint": f"Distance = speed × time = {speed} × {hours} = {dist} miles."
|
| 173 |
+
})
|
| 174 |
+
elif ptype == "ratio":
|
| 175 |
+
cost = random.randint(2, 10)
|
| 176 |
+
n1 = random.randint(3, 8)
|
| 177 |
+
n2 = random.randint(5, 20)
|
| 178 |
+
total1 = cost * n1
|
| 179 |
+
total2 = cost * n2
|
| 180 |
+
problems.append({
|
| 181 |
+
"question": f"If {n1} items cost ${total1}, how much do {n2} items cost?",
|
| 182 |
+
"answer": str(total2), "type": "math_reasoning",
|
| 183 |
+
"think_hint": f"Each item costs ${total1}/{n1} = ${cost}. So {n2} items cost {n2} × ${cost} = ${total2}."
|
| 184 |
+
})
|
| 185 |
+
elif ptype == "sequence":
|
| 186 |
+
start = random.randint(1, 20)
|
| 187 |
+
step = random.randint(2, 10)
|
| 188 |
+
seq = [start + i * step for i in range(5)]
|
| 189 |
+
next_val = start + 5 * step
|
| 190 |
+
problems.append({
|
| 191 |
+
"question": f"What comes next in the sequence: {', '.join(map(str, seq))}?",
|
| 192 |
+
"answer": str(next_val), "type": "math_reasoning",
|
| 193 |
+
"think_hint": f"Each number increases by {step}. So {seq[-1]} + {step} = {next_val}."
|
| 194 |
+
})
|
| 195 |
+
elif ptype == "percentage":
|
| 196 |
+
base = random.choice([80, 100, 120, 150, 200, 250, 400, 500])
|
| 197 |
+
pct = random.choice([10, 15, 20, 25, 30, 40, 50, 75])
|
| 198 |
+
answer = base * pct // 100
|
| 199 |
+
problems.append({
|
| 200 |
+
"question": f"What is {pct}% of {base}?",
|
| 201 |
+
"answer": str(answer), "type": "math_reasoning",
|
| 202 |
+
"think_hint": f"{pct}% of {base} = {base} × {pct}/100 = {answer}."
|
| 203 |
+
})
|
| 204 |
+
elif ptype == "comparison":
|
| 205 |
+
a_val = random.randint(10, 100)
|
| 206 |
+
b_val = random.randint(10, 100)
|
| 207 |
+
diff = abs(a_val - b_val)
|
| 208 |
+
who = "Alice" if a_val > b_val else "Bob"
|
| 209 |
+
problems.append({
|
| 210 |
+
"question": f"Alice has {a_val} marbles and Bob has {b_val} marbles. Who has more and by how many?",
|
| 211 |
+
"answer": str(diff), "type": "math_reasoning",
|
| 212 |
+
"think_hint": f"{who} has more. Difference: {max(a_val,b_val)} - {min(a_val,b_val)} = {diff}."
|
| 213 |
+
})
|
| 214 |
+
|
| 215 |
+
random.shuffle(problems)
|
| 216 |
+
return problems[:cfg.num_problems]
|
| 217 |
+
|
| 218 |
+
|
| 219 |
+
# ============================================================
|
| 220 |
+
# CHAIN-OF-THOUGHT GENERATION & SCORING
|
| 221 |
+
# ============================================================
|
| 222 |
+
|
| 223 |
+
def build_cot_prompt(question: str) -> str:
|
| 224 |
+
"""Build a prompt that encourages chain-of-thought reasoning."""
|
| 225 |
+
return (
|
| 226 |
+
f"<|im_start|>user\n{question}\n"
|
| 227 |
+
f"Think step by step before giving your final answer.<|im_end|>\n"
|
| 228 |
+
f"<|im_start|>assistant\n<think>\n"
|
| 229 |
+
)
|
| 230 |
+
|
| 231 |
+
|
| 232 |
+
def verify_answer(problem: Dict, response: str) -> float:
|
| 233 |
+
"""Check if the response contains the correct answer. Returns 1.0 or 0.0."""
|
| 234 |
+
expected = problem["answer"].lower().strip()
|
| 235 |
+
answer_lower = response.lower()
|
| 236 |
+
|
| 237 |
+
if expected in answer_lower:
|
| 238 |
+
return 1.0
|
| 239 |
+
|
| 240 |
+
# Numeric check
|
| 241 |
+
if expected.replace(".", "").replace("-", "").isdigit():
|
| 242 |
+
numbers = re.findall(r'-?\d+\.?\d*', answer_lower)
|
| 243 |
+
for num in numbers:
|
| 244 |
+
try:
|
| 245 |
+
if abs(float(num) - float(expected)) < 0.01:
|
| 246 |
+
return 1.0
|
| 247 |
+
except ValueError:
|
| 248 |
+
pass
|
| 249 |
+
|
| 250 |
+
return 0.0
|
| 251 |
+
|
| 252 |
+
|
| 253 |
+
def generate_and_score_cot(model, tokenizer, problems, cfg, eos_id, resume_from=0):
|
| 254 |
+
"""
|
| 255 |
+
Generate chain-of-thought candidates, score them, return winning pairs.
|
| 256 |
+
Saves progress every batch_save_every problems for crash recovery.
|
| 257 |
+
"""
|
| 258 |
+
print(f"\n=== GENERATE & SCORE CoT ({len(problems)} problems, {cfg.num_candidates} candidates each) ===")
|
| 259 |
+
|
| 260 |
+
progress_path = Path(cfg.progress_file)
|
| 261 |
+
progress_path.parent.mkdir(parents=True, exist_ok=True)
|
| 262 |
+
|
| 263 |
+
# Load existing progress if resuming
|
| 264 |
+
winning_pairs = []
|
| 265 |
+
losing_pairs = []
|
| 266 |
+
if resume_from > 0 and progress_path.exists():
|
| 267 |
+
with open(progress_path) as f:
|
| 268 |
+
saved = json.load(f)
|
| 269 |
+
winning_pairs = saved.get("winning_pairs", [])
|
| 270 |
+
losing_pairs = saved.get("losing_pairs", [])
|
| 271 |
+
print(f" Resumed from problem {resume_from}, {len(winning_pairs)} winners loaded")
|
| 272 |
+
|
| 273 |
+
total_correct = 0
|
| 274 |
+
total_attempted = resume_from
|
| 275 |
+
|
| 276 |
+
for i in range(resume_from, len(problems)):
|
| 277 |
+
prob = problems[i]
|
| 278 |
+
prompt = build_cot_prompt(prob["question"])
|
| 279 |
+
ids = tokenizer(prompt, return_tensors="pt").to(model.device)
|
| 280 |
+
|
| 281 |
+
correct_responses = []
|
| 282 |
+
wrong_responses = []
|
| 283 |
+
|
| 284 |
+
for _ in range(cfg.num_candidates):
|
| 285 |
+
out = model.generate(
|
| 286 |
+
**ids, max_new_tokens=cfg.max_gen_tokens,
|
| 287 |
+
do_sample=True, temperature=cfg.temperature,
|
| 288 |
+
eos_token_id=eos_id
|
| 289 |
+
)
|
| 290 |
+
response = tokenizer.decode(out[0][ids.input_ids.shape[1]:], skip_special_tokens=True)
|
| 291 |
+
score = verify_answer(prob, response)
|
| 292 |
+
|
| 293 |
+
if score > 0:
|
| 294 |
+
correct_responses.append(response)
|
| 295 |
+
else:
|
| 296 |
+
wrong_responses.append(response)
|
| 297 |
+
|
| 298 |
+
total_attempted += 1
|
| 299 |
+
|
| 300 |
+
if correct_responses:
|
| 301 |
+
total_correct += 1
|
| 302 |
+
# Pick shortest correct answer (most concise reasoning)
|
| 303 |
+
best = min(correct_responses, key=len)
|
| 304 |
+
# Format as full chat with CoT
|
| 305 |
+
chat = (
|
| 306 |
+
f"<|im_start|>user\n{prob['question']}\n"
|
| 307 |
+
f"Think step by step before giving your final answer.<|im_end|>\n"
|
| 308 |
+
f"<|im_start|>assistant\n{best}<|im_end|>"
|
| 309 |
+
)
|
| 310 |
+
winning_pairs.append(chat)
|
| 311 |
+
|
| 312 |
+
# Also keep a wrong answer for preference training
|
| 313 |
+
if wrong_responses:
|
| 314 |
+
worst = max(wrong_responses, key=len)
|
| 315 |
+
losing_pairs.append(
|
| 316 |
+
f"<|im_start|>user\n{prob['question']}<|im_end|>\n"
|
| 317 |
+
f"<|im_start|>assistant\n{worst}<|im_end|>"
|
| 318 |
+
)
|
| 319 |
+
|
| 320 |
+
# Progress update & save
|
| 321 |
+
if (i + 1) % cfg.batch_save_every == 0:
|
| 322 |
+
pct = total_correct / total_attempted * 100
|
| 323 |
+
print(f" [{i+1}/{len(problems)}] Correct: {total_correct}/{total_attempted} ({pct:.0f}%) | Winners: {len(winning_pairs)}")
|
| 324 |
+
|
| 325 |
+
# Save progress to disk
|
| 326 |
+
with open(progress_path, "w") as f:
|
| 327 |
+
json.dump({
|
| 328 |
+
"winning_pairs": winning_pairs,
|
| 329 |
+
"losing_pairs": losing_pairs,
|
| 330 |
+
"problems_completed": i + 1,
|
| 331 |
+
"total_correct": total_correct,
|
| 332 |
+
"timestamp": time.strftime("%Y-%m-%d %H:%M:%S"),
|
| 333 |
+
}, f)
|
| 334 |
+
|
| 335 |
+
# Final save
|
| 336 |
+
pct = total_correct / total_attempted * 100 if total_attempted > 0 else 0
|
| 337 |
+
print(f"\n FINAL: {total_correct}/{total_attempted} ({pct:.0f}%) | Winners: {len(winning_pairs)} | Losers: {len(losing_pairs)}")
|
| 338 |
+
|
| 339 |
+
with open(progress_path, "w") as f:
|
| 340 |
+
json.dump({
|
| 341 |
+
"winning_pairs": winning_pairs,
|
| 342 |
+
"losing_pairs": losing_pairs,
|
| 343 |
+
"problems_completed": len(problems),
|
| 344 |
+
"total_correct": total_correct,
|
| 345 |
+
"timestamp": time.strftime("%Y-%m-%d %H:%M:%S"),
|
| 346 |
+
}, f)
|
| 347 |
+
|
| 348 |
+
return winning_pairs, losing_pairs
|
| 349 |
+
|
| 350 |
+
|
| 351 |
+
# ============================================================
|
| 352 |
+
# TRAINING — SFT on winning CoT chains + DPO-style preference
|
| 353 |
+
# ============================================================
|
| 354 |
+
|
| 355 |
+
def train_grpo(model, tokenizer, winning_pairs, losing_pairs, cfg):
|
| 356 |
+
"""
|
| 357 |
+
Train on winning chain-of-thought responses.
|
| 358 |
+
|
| 359 |
+
This is simplified GRPO:
|
| 360 |
+
- SFT on correct CoT chains (teaches good reasoning)
|
| 361 |
+
- The model learns to generate <think>step by step</think> then answer
|
| 362 |
+
- Verified rewards mean we KNOW these chains lead to correct answers
|
| 363 |
+
"""
|
| 364 |
+
print(f"\n=== GRPO TRAINING ({len(winning_pairs)} winning CoT chains) ===")
|
| 365 |
+
|
| 366 |
+
if len(winning_pairs) < 20:
|
| 367 |
+
print(" Too few winning pairs — skipping training")
|
| 368 |
+
return model
|
| 369 |
+
|
| 370 |
+
from peft import LoraConfig, get_peft_model, TaskType
|
| 371 |
+
from transformers import TrainingArguments, Trainer
|
| 372 |
+
from torch.utils.data import Dataset
|
| 373 |
+
|
| 374 |
+
lora_config = LoraConfig(
|
| 375 |
+
r=cfg.lora_r, lora_alpha=cfg.lora_alpha, lora_dropout=0.0,
|
| 376 |
+
target_modules=["q_proj", "k_proj", "v_proj", "o_proj",
|
| 377 |
+
"gate_proj", "up_proj", "down_proj"],
|
| 378 |
+
bias="none", task_type=TaskType.CAUSAL_LM,
|
| 379 |
+
)
|
| 380 |
+
model = get_peft_model(model, lora_config)
|
| 381 |
+
model.print_trainable_parameters()
|
| 382 |
+
|
| 383 |
+
class CoTDataset(Dataset):
|
| 384 |
+
def __init__(self, texts, tokenizer, max_len=1024):
|
| 385 |
+
self.data = []
|
| 386 |
+
for t in texts:
|
| 387 |
+
e = tokenizer(t, truncation=True, max_length=max_len,
|
| 388 |
+
padding="max_length", return_tensors="pt")
|
| 389 |
+
self.data.append({
|
| 390 |
+
"input_ids": e["input_ids"].squeeze(),
|
| 391 |
+
"attention_mask": e["attention_mask"].squeeze(),
|
| 392 |
+
"labels": e["input_ids"].squeeze(),
|
| 393 |
+
})
|
| 394 |
+
def __len__(self): return len(self.data)
|
| 395 |
+
def __getitem__(self, i): return self.data[i]
|
| 396 |
+
|
| 397 |
+
dataset = CoTDataset(winning_pairs, tokenizer)
|
| 398 |
+
|
| 399 |
+
out_dir = Path(cfg.output_dir) / "train_output"
|
| 400 |
+
out_dir.mkdir(parents=True, exist_ok=True)
|
| 401 |
+
|
| 402 |
+
total_steps = (len(dataset) * cfg.train_epochs) // (cfg.train_batch * cfg.train_grad_accum)
|
| 403 |
+
print(f" Steps: ~{total_steps} | Checkpoints every {cfg.save_steps}")
|
| 404 |
+
|
| 405 |
+
args = TrainingArguments(
|
| 406 |
+
output_dir=str(out_dir),
|
| 407 |
+
num_train_epochs=cfg.train_epochs,
|
| 408 |
+
per_device_train_batch_size=cfg.train_batch,
|
| 409 |
+
gradient_accumulation_steps=cfg.train_grad_accum,
|
| 410 |
+
learning_rate=cfg.learning_rate,
|
| 411 |
+
bf16=True,
|
| 412 |
+
logging_steps=max(1, total_steps // 20),
|
| 413 |
+
save_strategy="steps",
|
| 414 |
+
save_steps=cfg.save_steps,
|
| 415 |
+
save_total_limit=2,
|
| 416 |
+
warmup_ratio=0.05,
|
| 417 |
+
lr_scheduler_type="cosine",
|
| 418 |
+
optim="adamw_torch",
|
| 419 |
+
report_to="none",
|
| 420 |
+
)
|
| 421 |
+
|
| 422 |
+
trainer = Trainer(
|
| 423 |
+
model=model, processing_class=tokenizer,
|
| 424 |
+
train_dataset=dataset, args=args
|
| 425 |
+
)
|
| 426 |
+
|
| 427 |
+
print(f" Starting GRPO training...")
|
| 428 |
+
trainer.train()
|
| 429 |
+
|
| 430 |
+
# Clean checkpoints, merge LoRA
|
| 431 |
+
import shutil
|
| 432 |
+
shutil.rmtree(str(out_dir), ignore_errors=True)
|
| 433 |
+
gc.collect()
|
| 434 |
+
|
| 435 |
+
print(" Merging LoRA...")
|
| 436 |
+
merged = model.merge_and_unload()
|
| 437 |
+
gc.collect()
|
| 438 |
+
return merged
|
| 439 |
+
|
| 440 |
+
|
| 441 |
+
# ============================================================
|
| 442 |
+
# BENCHMARK
|
| 443 |
+
# ============================================================
|
| 444 |
+
|
| 445 |
+
def benchmark(model, tokenizer, eos_id):
|
| 446 |
+
"""Run reasoning-focused benchmark."""
|
| 447 |
+
print("\n=== BENCHMARK ===")
|
| 448 |
+
results = {}
|
| 449 |
+
|
| 450 |
+
def ask(prompt, use_cot=False):
|
| 451 |
+
if use_cot:
|
| 452 |
+
p = (f"<|im_start|>user\n{prompt}\n"
|
| 453 |
+
f"Think step by step before giving your final answer.<|im_end|>\n"
|
| 454 |
+
f"<|im_start|>assistant\n<think>\n")
|
| 455 |
+
else:
|
| 456 |
+
p = f"<|im_start|>user\n{prompt}<|im_end|>\n<|im_start|>assistant\n"
|
| 457 |
+
ids = tokenizer(p, return_tensors="pt").to(model.device)
|
| 458 |
+
out = model.generate(**ids, max_new_tokens=500, do_sample=False, eos_token_id=eos_id)
|
| 459 |
+
return tokenizer.decode(out[0][ids.input_ids.shape[1]:], skip_special_tokens=True)
|
| 460 |
+
|
| 461 |
+
# Math (no CoT needed)
|
| 462 |
+
math_tests = [("7+8", "15"), ("123+456", "579"), ("1000-387", "613"), ("12*13", "156"), ("144/12", "12")]
|
| 463 |
+
mc = sum(1 for q, e in math_tests if e in ask(f"What is {q}? Give just the number."))
|
| 464 |
+
results["math"] = f"{mc}/5"
|
| 465 |
+
print(f" Math: {mc}/5")
|
| 466 |
+
|
| 467 |
+
# Reasoning WITH chain-of-thought
|
| 468 |
+
reason_tests = [
|
| 469 |
+
("Which is heavier: a pound of feathers or a pound of bricks?", "same"),
|
| 470 |
+
("If yesterday was Monday, what day is tomorrow?", "wednesday"),
|
| 471 |
+
("A farmer has 17 sheep. All but 9 die. How many are left?", "9"),
|
| 472 |
+
("If you're running and pass the person in 2nd place, what position are you in?", "2nd"),
|
| 473 |
+
("How many times can you subtract 5 from 25?", "once"),
|
| 474 |
+
("If A is taller than B, and B is taller than C, who is shortest?", "c"),
|
| 475 |
+
("In a race, Tom finished before Jerry but after Sam. Who won?", "sam"),
|
| 476 |
+
("All mammals breathe air. Whales are mammals. Do whales breathe air?", "yes"),
|
| 477 |
+
("Some dogs are large. Rex is a dog. Is Rex definitely large?", "no"),
|
| 478 |
+
("How many months have 28 days?", "all"),
|
| 479 |
+
]
|
| 480 |
+
rc = 0
|
| 481 |
+
for q, expected in reason_tests:
|
| 482 |
+
a = ask(q, use_cot=True)
|
| 483 |
+
correct = expected.lower() in a.lower()
|
| 484 |
+
rc += correct
|
| 485 |
+
status = "OK" if correct else "FAIL"
|
| 486 |
+
print(f" {status}: {q[:55]}... -> {a[:80]}")
|
| 487 |
+
results["reasoning"] = f"{rc}/10"
|
| 488 |
+
print(f" Reasoning: {rc}/10")
|
| 489 |
+
|
| 490 |
+
# Word problems with CoT
|
| 491 |
+
wp_tests = [
|
| 492 |
+
("A train travels 60 mph for 2.5 hours. How far does it go?", "150"),
|
| 493 |
+
("If 3 shirts cost $45, how much do 7 shirts cost?", "105"),
|
| 494 |
+
("24 cookies split among 6 friends. How many each?", "4"),
|
| 495 |
+
]
|
| 496 |
+
wc = sum(1 for q, e in wp_tests if e in ask(q, use_cot=True))
|
| 497 |
+
results["word_problems"] = f"{wc}/3"
|
| 498 |
+
print(f" Word problems: {wc}/3")
|
| 499 |
+
|
| 500 |
+
# Perplexity
|
| 501 |
+
test_text = "The quick brown fox jumps over the lazy dog. Machine learning models can process natural language."
|
| 502 |
+
enc = tokenizer(test_text, return_tensors="pt").to(model.device)
|
| 503 |
+
with torch.no_grad():
|
| 504 |
+
loss = model(**enc, labels=enc.input_ids).loss.item()
|
| 505 |
+
results["perplexity"] = f"{math.exp(loss):.2f}"
|
| 506 |
+
print(f" Perplexity: {results['perplexity']}")
|
| 507 |
+
|
| 508 |
+
return results
|
| 509 |
+
|
| 510 |
+
|
| 511 |
+
# ============================================================
|
| 512 |
+
# MAIN — Full overnight GRPO cycle
|
| 513 |
+
# ============================================================
|
| 514 |
+
|
| 515 |
+
def run_grpo_cycle(cfg: GRPOConfig = None):
|
| 516 |
+
"""Run the full GRPO reasoning training cycle."""
|
| 517 |
+
if cfg is None:
|
| 518 |
+
cfg = GRPOConfig()
|
| 519 |
+
|
| 520 |
+
start = time.time()
|
| 521 |
+
print("=" * 60)
|
| 522 |
+
print("TD GRPO REASONING TRAINING — CYCLE 2 (OVERNIGHT)")
|
| 523 |
+
print(f"Model: {cfg.model_path}")
|
| 524 |
+
print(f"Problems: {cfg.num_problems} | Candidates: {cfg.num_candidates}")
|
| 525 |
+
print(f"Started: {time.strftime('%H:%M:%S')}")
|
| 526 |
+
print("=" * 60)
|
| 527 |
+
|
| 528 |
+
# Check for resume
|
| 529 |
+
progress_path = Path(cfg.progress_file)
|
| 530 |
+
resume_from = 0
|
| 531 |
+
if progress_path.exists():
|
| 532 |
+
with open(progress_path) as f:
|
| 533 |
+
saved = json.load(f)
|
| 534 |
+
resume_from = saved.get("problems_completed", 0)
|
| 535 |
+
if resume_from >= cfg.num_problems:
|
| 536 |
+
print(f"\n Generation already complete ({resume_from} problems). Skipping to training...")
|
| 537 |
+
|
| 538 |
+
# Load model
|
| 539 |
+
from transformers import AutoModelForImageTextToText, AutoTokenizer
|
| 540 |
+
print("\nLoading model...")
|
| 541 |
+
model = AutoModelForImageTextToText.from_pretrained(
|
| 542 |
+
cfg.model_path, dtype=torch.bfloat16,
|
| 543 |
+
device_map="auto", trust_remote_code=True
|
| 544 |
+
)
|
| 545 |
+
tokenizer = AutoTokenizer.from_pretrained(cfg.model_path, trust_remote_code=True)
|
| 546 |
+
eos_id = tokenizer.convert_tokens_to_ids("<|im_end|>")
|
| 547 |
+
|
| 548 |
+
# Pre-benchmark
|
| 549 |
+
print("\n--- PRE-TRAINING BENCHMARK ---")
|
| 550 |
+
pre_results = benchmark(model, tokenizer, eos_id)
|
| 551 |
+
|
| 552 |
+
# Generate problems (deterministic seed for reproducibility)
|
| 553 |
+
random.seed(42)
|
| 554 |
+
problems = generate_all_problems(cfg)
|
| 555 |
+
print(f"\nGenerated {len(problems)} problems")
|
| 556 |
+
|
| 557 |
+
# Generate & score
|
| 558 |
+
if resume_from < cfg.num_problems:
|
| 559 |
+
winning_pairs, losing_pairs = generate_and_score_cot(
|
| 560 |
+
model, tokenizer, problems, cfg, eos_id, resume_from=resume_from
|
| 561 |
+
)
|
| 562 |
+
else:
|
| 563 |
+
with open(progress_path) as f:
|
| 564 |
+
saved = json.load(f)
|
| 565 |
+
winning_pairs = saved["winning_pairs"]
|
| 566 |
+
losing_pairs = saved.get("losing_pairs", [])
|
| 567 |
+
|
| 568 |
+
# Train
|
| 569 |
+
model = train_grpo(model, tokenizer, winning_pairs, losing_pairs, cfg)
|
| 570 |
+
|
| 571 |
+
# Save
|
| 572 |
+
save_dir = Path(cfg.output_dir) / "final"
|
| 573 |
+
save_dir.mkdir(parents=True, exist_ok=True)
|
| 574 |
+
print(f"\nSaving improved model to {save_dir}...")
|
| 575 |
+
model.save_pretrained(str(save_dir), safe_serialization=True)
|
| 576 |
+
tokenizer.save_pretrained(str(save_dir))
|
| 577 |
+
sz = (save_dir / "model.safetensors").stat().st_size / 1e9
|
| 578 |
+
print(f"SAVED: {save_dir} ({sz:.1f} GB)")
|
| 579 |
+
|
| 580 |
+
# Post-benchmark
|
| 581 |
+
print("\n--- POST-TRAINING BENCHMARK ---")
|
| 582 |
+
post_results = benchmark(model, tokenizer, eos_id)
|
| 583 |
+
|
| 584 |
+
# Compare
|
| 585 |
+
elapsed = (time.time() - start) / 60
|
| 586 |
+
print(f"\n{'=' * 60}")
|
| 587 |
+
print(f"CYCLE 2 COMPLETE — {elapsed:.1f} min")
|
| 588 |
+
print(f"PRE: {pre_results}")
|
| 589 |
+
print(f"POST: {post_results}")
|
| 590 |
+
print(f"Model: {save_dir}")
|
| 591 |
+
print(f"{'=' * 60}")
|
| 592 |
+
|
| 593 |
+
# Save full report
|
| 594 |
+
report = {
|
| 595 |
+
"cycle": 2,
|
| 596 |
+
"pre_benchmark": pre_results,
|
| 597 |
+
"post_benchmark": post_results,
|
| 598 |
+
"problems_generated": len(problems),
|
| 599 |
+
"winning_pairs": len(winning_pairs),
|
| 600 |
+
"losing_pairs": len(losing_pairs),
|
| 601 |
+
"duration_min": elapsed,
|
| 602 |
+
"timestamp": time.strftime("%Y-%m-%d %H:%M:%S"),
|
| 603 |
+
}
|
| 604 |
+
with open(save_dir / "cycle_report.json", "w") as f:
|
| 605 |
+
json.dump(report, f, indent=2)
|
| 606 |
+
|
| 607 |
+
return str(save_dir)
|