File size: 10,239 Bytes
a80c66a | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 | #!/usr/bin/env python3
"""
repetition_probe.py — A builder tool for tiny model developers.
Takes a HuggingFace model and probes how different repetition_penalty values
affect generation quality. Outputs a comparison table with:
- Repetition rate (fraction of tokens already seen in the output)
- Unique token ratio (diversity)
- Loop detection (repeated n-grams)
- Sample text
Usage:
python3 repetition_probe.py --model kevin-bretz/Small-Language-Model --prompt "Once upon a time"
python3 repetition_probe.py --model kevin-bretz/Small-Language-Model --prompts "Once upon a time|The cat sat|I want to"
Why this matters:
Tiny models (<50M params) are extremely prone to degenerate repetition loops.
The default repetition_penalty=1.0 means NO penalty — the model can output the
same token forever. Most training scripts don't test generation quality, so
you discover this at inference time with no idea what to do.
This tool gives you a quick diagnostic: sweep the penalty, see where quality
peaks, and know what to set in your inference config.
"""
import argparse
import json
import sys
import time
from collections import Counter
from dataclasses import dataclass, field
from typing import List, Optional
import torch
import torch.nn.functional as F
@dataclass
class ProbeResult:
prompt: str
penalty: float
text: str
n_tokens: int
repetition_rate: float # fraction of output tokens that appeared before
unique_token_ratio: float # unique tokens / total tokens
max_loop_len: int # longest repeated trigram
n_repeated_trigrams: int # count of trigrams appearing 2+ times
elapsed_s: float
def compute_repetition_rate(token_ids: List[int]) -> float:
"""Fraction of tokens (excluding first) that have appeared earlier in the sequence."""
if len(token_ids) < 2:
return 0.0
seen = set()
repeated = 0
for t in token_ids[1:]:
if t in seen:
repeated += 1
seen.add(t)
return repeated / (len(token_ids) - 1)
def compute_unique_ratio(token_ids: List[int]) -> float:
"""Unique tokens / total tokens."""
if not token_ids:
return 0.0
return len(set(token_ids)) / len(token_ids)
def find_repeated_trigrams(token_ids: List[int]) -> tuple:
"""Find the longest repeated trigram and count of repeated trigrams."""
if len(token_ids) < 6:
return 0, 0
trigrams = []
for i in range(len(token_ids) - 2):
trigrams.append(tuple(token_ids[i:i+3]))
counts = Counter(trigrams)
repeated = sum(1 for c in counts.values() if c >= 2)
# Longest repeated trigram: find the longest n-gram that repeats
max_len = 0
for n in range(3, min(len(token_ids), 20)):
ngrams = [tuple(token_ids[i:i+n]) for i in range(len(token_ids) - n + 1)]
ngram_counts = Counter(ngrams)
if any(c >= 2 for c in ngram_counts.values()):
max_len = n
else:
break
return max_len, repeated
def generate_with_penalty(
model,
tokenizer,
prompt: str,
max_new_tokens: int = 64,
repetition_penalty: float = 1.0,
temperature: float = 0.8,
top_k: int = 50,
device: str = "cpu",
) -> tuple:
"""Generate text with a given repetition penalty. Returns (text, token_ids, elapsed)."""
model.eval()
input_ids = tokenizer.encode(prompt, return_tensors="pt").to(device)
gen_start = input_ids.shape[1]
with torch.no_grad():
generated = input_ids
for _ in range(max_new_tokens):
outputs = model(generated)
logits = outputs.logits[0, -1, :]
# Apply repetition penalty
if repetition_penalty != 1.0:
for i in range(generated.shape[1]):
tok = generated[0, i].item()
if logits[tok] > 0:
logits[tok] /= repetition_penalty
else:
logits[tok] *= repetition_penalty
# Temperature
if temperature != 1.0:
logits = logits / temperature
# Top-k
if top_k > 0:
top_k_val = min(top_k, logits.shape[-1])
indices_to_remove = logits < torch.topk(logits, top_k_val)[0][..., -1:]
logits[indices_to_remove] = float("-inf")
probs = F.softmax(logits, dim=-1)
next_token = torch.multinomial(probs, num_samples=1).unsqueeze(0)
generated = torch.cat([generated, next_token], dim=1)
# Stop on EOS
if next_token.item() == tokenizer.eos_token_id:
break
elapsed = None # measured outside
output_ids = generated[0, gen_start:].tolist()
text = tokenizer.decode(output_ids, skip_special_tokens=True)
return text, output_ids
def run_probe(
model_name: str,
prompts: List[str],
penalties: List[float],
max_new_tokens: int = 64,
temperature: float = 0.8,
top_k: int = 50,
device: str = "cpu",
seed: int = 42,
) -> List[ProbeResult]:
"""Run the full probe sweep."""
print(f"Loading model: {model_name}")
from transformers import AutoModelForCausalLM, AutoTokenizer
tokenizer = AutoTokenizer.from_pretrained(model_name)
if tokenizer.pad_token is None:
tokenizer.pad_token = tokenizer.eos_token
model = AutoModelForCausalLM.from_pretrained(model_name, torch_dtype=torch.float32).to(device)
torch.manual_seed(seed)
results = []
for prompt in prompts:
for penalty in penalties:
torch.manual_seed(seed) # Same seed for fair comparison
start = time.time()
text, token_ids = generate_with_penalty(
model, tokenizer, prompt,
max_new_tokens=max_new_tokens,
repetition_penalty=penalty,
temperature=temperature,
top_k=top_k,
device=device,
)
elapsed = time.time() - start
rep_rate = compute_repetition_rate(token_ids)
unique_ratio = compute_unique_ratio(token_ids)
max_loop, n_rep_tri = find_repeated_trigrams(token_ids)
results.append(ProbeResult(
prompt=prompt,
penalty=penalty,
text=text,
n_tokens=len(token_ids),
repetition_rate=rep_rate,
unique_token_ratio=unique_ratio,
max_loop_len=max_loop,
n_repeated_trigrams=n_rep_tri,
elapsed_s=elapsed,
))
print(f" [{prompt[:20]:20s}] rp={penalty:.1f} rep={rep_rate:.1%} "
f"uniq={unique_ratio:.1%} max_loop={max_loop} "
f"n_rep_tri={n_rep_tri} ({len(token_ids)} tokens)")
return results
def format_table(results: List[ProbeResult]) -> str:
"""Format results as a readable table."""
lines = []
lines.append(f"{'Prompt':<22} {'RP':>4} {'Tokens':>6} {'Repet':>7} {'Unique':>7} {'MaxLoop':>8} {'RepTri':>7}")
lines.append("-" * 72)
for r in results:
lines.append(
f"{r.prompt[:20]:<22} {r.penalty:>4.1f} {r.n_tokens:>6} "
f"{r.repetition_rate:>7.1%} {r.unique_token_ratio:>7.1%} "
f"{r.max_loop_len:>8} {r.n_repeated_trigrams:>7}"
)
lines.append("-" * 72)
lines.append("")
lines.append("Sample outputs (first 100 chars):")
lines.append("")
for r in results:
lines.append(f" [{r.prompt[:15]:15s}] rp={r.penalty:.1f}: {r.text[:100]}")
return "\n".join(lines)
def main():
parser = argparse.ArgumentParser(description="Repetition penalty probe for tiny models")
parser.add_argument("--model", required=True, help="HuggingFace model name or path")
parser.add_argument("--prompt", default="Once upon a time", help="Single prompt")
parser.add_argument("--prompts", default=None, help="Pipe-separated prompts")
parser.add_argument("--penalties", default="1.0,1.1,1.2,1.3,1.5",
help="Comma-separated repetition penalty values")
parser.add_argument("--max-tokens", type=int, default=64, help="Max new tokens to generate")
parser.add_argument("--temperature", type=float, default=0.8)
parser.add_argument("--top-k", type=int, default=50)
parser.add_argument("--device", default="cpu")
parser.add_argument("--seed", type=int, default=42)
parser.add_argument("--output", default=None, help="Save JSON results to file")
args = parser.parse_args()
if args.prompts:
prompts = [p.strip() for p in args.prompts.split("|")]
else:
prompts = [args.prompt]
penalties = [float(p) for p in args.penalties.split(",")]
print(f"Model: {args.model}")
print(f"Prompts: {prompts}")
print(f"Penalties: {penalties}")
print(f"Max tokens: {args.max_tokens}, Temp: {args.temperature}, Top-k: {args.top_k}")
print()
results = run_probe(
args.model, prompts, penalties,
max_new_tokens=args.max_tokens,
temperature=args.temperature,
top_k=args.top_k,
device=args.device,
seed=args.seed,
)
print()
print(format_table(results))
if args.output:
out = {
"model": args.model,
"prompts": prompts,
"penalties": penalties,
"max_tokens": args.max_tokens,
"temperature": args.temperature,
"top_k": args.top_k,
"seed": args.seed,
"results": [
{
"prompt": r.prompt,
"penalty": r.penalty,
"text": r.text,
"n_tokens": r.n_tokens,
"repetition_rate": round(r.repetition_rate, 4),
"unique_token_ratio": round(r.unique_token_ratio, 4),
"max_loop_len": r.max_loop_len,
"n_repeated_trigrams": r.n_repeated_trigrams,
}
for r in results
],
}
with open(args.output, "w") as f:
json.dump(out, f, indent=2)
print(f"\nResults saved to {args.output}")
if __name__ == "__main__":
main() |