ssurface/cot-dialect-olmo3-7b-think-grpo-l4

Olmo-3-7B-Think — L4 dialect (Ultra-compact)

A LoRA adapter that makes allenai/Olmo-3-7B-Think reason at compression level L4 — semicolon-chained assignments.

Results

GSM8K test (n=1317), greedy decoding, single-turn, no exemplars, no self-consistency.

Also evaluated on (out-of-domain, not the headline metric):

Training data

GSM8K train, re-expressed at level L4 by a teacher model: 6976 examples, median chain length 41 characters inside <think>.

Across the family the median chain runs from 532 characters at L1 to 16 at L5 — a 33x span. An L4 chain looks like this:

K=18*2.5;D=8*4;T=K+D->T=77

Training setup

GRPO on top of the merged level-4 SFT model.

Reward components

• —correctness — +/- the gold solution's step count on an answer match, so harder problems are worth more
• —format — the response must be one <think>...</think> block then #### <answer>

Engine note. Stock transformers with sdpa attention, not a fused-kernel wrapper. The fused path produced adapters whose lora_B matrices were all zero — mathematically inert despite loading without error. Every adapter in this collection was verified lora_B != 0 before publishing; 13 that failed that check were withheld.

Usage

Solve this using Level 4 (Shorthand).
Problem: {your problem}

Stacks on the SFT model, not the raw base. Trained against the merged SFT model, so loading it straight onto allenai/Olmo-3-7B-Think will not reproduce the number above.

from transformers import AutoModelForCausalLM, AutoTokenizer
from peft import PeftModel

model = AutoModelForCausalLM.from_pretrained("allenai/Olmo-3-7B-Think", torch_dtype="bfloat16", device_map="auto")
model = PeftModel.from_pretrained(model, "ssurface/cot-dialect-olmo3-7b-think-sft-l4")   # 1. SFT for this level
model = model.merge_and_unload()
model = PeftModel.from_pretrained(model, "ssurface/cot-dialect-olmo3-7b-think-grpo-l4")   # 2. this adapter
tok = AutoTokenizer.from_pretrained("allenai/Olmo-3-7B-Think")

Limitations

• —Trained and evaluated on math word problems only.
• —Accuracy falls with problem difficulty, fastest at the compressed levels.
• —Single seed unless the repo name says otherwise; differences of a couple of points are within noise (95% half-width ~2.7 pp at n=1317, ~4.4 pp at n=500).

Citation

@misc{cot-compression-dialects,
  title  = {Chain-of-Thought Compression Dialects},
  author = {Frolov, Anatolii},
  year   = {2026}
}