GLM-5.3 is live. Run Z.ai's latest model on Friendli Model APIs. Try it today ➜
ivykopal
Available on FriendliAI
Run this model inference on single tenant GPU with unmatched speed and reliability at scale.
Run this model inference with full control and performance in your environment.
Model Details
Model Provider
ivykopal
Model Tree
HuggingFaceTB/SmolLM2-135M-Instruct
Input Modalities
Output Modalities
Supported Functionality
| value | |
|---|---|
| Base model | SmolLM2-135M-Instruct |
| Method | full fine-tuning (FFT) |
| Label noise | 20% corrupted trajectories |
| Train disk counts | 3–5 |
| Saved with | transformers 4.57.6 |
The supervised targets carry 20% corrupted demonstrations: an optimal trajectory with one move swapped, replaced, deleted or inserted. The model can only imitate that distribution, so it inherits a per-move error rate that compounds over the move chain.
| disks | heldout solved | extrapolation solved |
|---|---|---|
| 3 | 0.79 | — |
| 4 | 0.36 | — |
| 5 | 0.67 | — |
| 6 | — | 0.00 |
| overall | 0.60 | 0.00 |
solved = the trajectory moved every disk to the target peg.
Heldout (3–5 disks, unseen peg permutations): 0.60 solved. Extrapolation (6 disks, strictly longer than training): 0.00 solved. This is the length-prior failure mode, not accumulated error — the model emits a well-formed, fully legal answer of the wrong length and stops.
python
from transformers import AutoModelForCausalLM, AutoTokenizermodel = AutoModelForCausalLM.from_pretrained("ivykopal/nlp-2026-hanoi-sft")tokenizer = AutoTokenizer.from_pretrained("ivykopal/nlp-2026-hanoi-sft")system = ("You are an expert algorithmic problem solver. ""Solve the Tower of Hanoi puzzle optimally. ""Return ONLY one move per line in the format 'A->C'. ""Do not provide any explanation.")# Move 4 disks from peg A to peg C using peg B.user = ("Solve the Tower of Hanoi puzzle.\n\n""Move 4 disks from peg A to peg C using peg B.\n""Return only the sequence of moves.")messages = [{"role": "system", "content": system}, {"role": "user", "content": user}]inputs = tokenizer.apply_chat_template(messages, add_generation_prompt=True, return_tensors="pt")out = model.generate(inputs, max_new_tokens=576, do_sample=False)print(tokenizer.decode(out[0][inputs.shape[-1]:], skip_special_tokens=True))# A->B# A->C# ...
Decode greedily (do_sample=False). max_new_tokens must fit the longest
solution you evaluate — 6 disks needs 63 moves (~251 tokens).
Research and education: a tiny, fully reproducible fine-tune for studying demonstration-noise propagation, length-extrapolation failure, and as the SFT baseline / cold start for GRPO/GSPO. Not a general assistant — it only produces Tower of Hanoi move sequences.
Apache-2.0 (inherited from the base model).