Views
No views yet
Qwen/Qwen3.5-2B[THINK]...[/THINK] for reasoning and [SOLUTION]...[/SOLUTION] for final outputs, with explicit constraints applied during fine-tuning to prevent runaway overthinking loops (>2 correction cycles).| Attribute | Value |
|---|---|
| Architecture | Qwen 3.5 (2B) with LoRA adapters |
| Context Length | 2048 tokens |
| Training Data | GLM-5.2 Logic Puzzles + Synthetic Python Execution Traces |
| LoRA Rank ($r$) | 16 |
| LoRA Alpha ($\alpha$) | 16 |
| LoRA Dropout | 0.0 |
| Optimizer | AdamW 8-bit |
| Learning Rate | 2e-4 (0.0002) |
| Batch Size | 2 |
| Warmup Steps | 5 |
| Training Steps | 100 steps (0 epochs) |
Q4_K_M)1# HOW YOU SHOULD THINK AND ANSWER
2
3First draft your thinking process (inner monologue) until you arrive at a response. Do NOT overthink, immediately stop if you are checking your answer more than 2 times. Format your response using Markdown, and use LaTeX for any mathematical equations.
4
5Your thinking process must follow the template below:
6[THINK]Your concise thoughts, like working through an exercise on scratch paper. Be as casual as you want until you are confident to generate the response to the user.[/THINK]
7Here, provide a self-contained response.
8Put your final short answer inside [SOLUTION] and [/SOLUTION]
9| Parameter | Value |
|---|---|
temperature | 0.3 |
top_k | 40 |
top_p | 0.9 |
repetition_penalty | 1.1 |
max_new_tokens | 2048 |
| Category | Task Type | Performance | Notes |
|---|---|---|---|
| High Precision 🟢 | Python Execution Tracing | Strong | Accurately tracks loop counters, conditionals, and variable state updates. |
| Multi-Step Arithmetic | Strong | Exceptional stability across sign flips, zero-crossings, and fraction evaluation. | |
| Linear Path Reachability | Strong | Reliably identifies disconnected graph components and linear edge sequences. | |
| Moderate 🟡 | Recursive Stack Theory | Medium | Executes recursive arithmetic well; can over-verify theoretical terminology. |
| Structural Bounds 🔴 | Dense Dijkstra Graphing | Limited | Prone to priority queue tracking errors on dense, undirected multi-branch graphs. |
| Set-Theory Shortcuts | Limited | Vulnerable to misapplying shortcut formulas (e.g., inclusion-exclusion). Prefer step-by-step loops. | |
| String Mutation | Limited | Vulnerable to sub-word BPE tokenization limits during character-level index manipulations. |
| Use Case | Recommended |
|---|---|
| Multi-step arithmetic & numerical logic | ✅ Yes |
| Python loop & function tracing | ✅ Yes |
| State machine & register updates | ✅ Yes |
| Graph connectivity & reachability | ✅ Yes |
| Fast local reasoning (~120 t/s) | ✅ Yes |
| Full Dijkstra priority queue relaxation | ⚠️ Limited (use code execution) |
| Destructive character-level string popping | ⚠️ Limited (use code execution) |
Qwen/Qwen3.5-2B