This work introduces SynLat, a text-latent CoT framework that aligns compression boundaries with syntactic structure through non-overlapping Syntax-Aligned Units (SAUs) and generates mixed reasoning from only the question and requested compression level at inference.
Abstract
Long chain-of-thought (CoT) traces impose substantial output-token costs. Under constrained budgets, compression must preserve answer-critical information, making boundary placement central. Token-level and fixed-length boundaries can fragment coherent spans such as phrases, formulas, and local derivations, whereas step-level boundaries can bind content requiring different compression actions. We introduce SynLat, a text-latent CoT framework that aligns compression boundaries with syntactic structure through non-overlapping Syntax-Aligned Units (SAUs). An answer-conditioned Teacher constructs progressive KEEP/LATENT targets for a single compression-conditioned Student, which generates mixed reasoning from only the question and requested compression level at inference. Across two Qwen3 Student scales, Standard-CoT and Long-CoT groups, and three compression levels, SynLat matches or exceeds the strongest evaluated baseline in all 12 task-group aggregates and strictly leads in 11 under the reported achieved-CR selection protocol. Overall gains reach 3.6/2.6 points at MEDIUM and 7.0/5.5 points at HIGH for Qwen3-8B/14B, with larger advantages under stronger compression, particularly on Long-CoT groups.
We study whether latent sequence compression of prompt prefixes preserves the capabilities that large language models rely on during inference. We introduce SemanticFold, a compression scheme that folds prefix hidden states at learned boundaries, and evaluate it across five model scales: Qwen3-1.7B, Qwen3-8B, SmolLM2-1...
The proposed Prototype-Mediated Process Supervision (PMPS), which introduces learnable reasoning prototypes as semantic anchors to provide structural process-level supervision for latent reasoning, consistently attains the highest accuracy among all latent reasoning methods with comparable output length.
Enter intent-triggered anchoring, a training-free decoding rule that completes a format unit once the model commits its first token, inserting only units with a unique, content-free completion; fallbacks write the unit when the model stops or loops without starting it.
Tokenizers are commonly optimized for compression, but a compact vocabulary does not necessarily distribute its capacity evenly across languages. We introduce the Latent Core Tokenizer (LCT), a language-agnostic approach that separates structural discovery from vocabulary construction. LCT uses Minimum Description Leng...
Felermino D. M. A. Ali, Millicent Ochieng, O. Ekwejunor-Etchie et al.· 0 citations
Across four reasoning benchmarks and four models, \textsc{MIST} consistently outperforms baseline methods, suggesting that model-internal saliency provides an effective proxy for reasoning-token importance.
Tianyi Zhao, Yin-Han He, Wendy Zheng et al.· 0 citations
GRAFT, an IPP-oriented post-training framework combining constraint-aware SFT and preference optimization is proposed, an IPP-oriented post-training framework combining constraint-aware SFT and preference optimization that raises the average IIF score and preserves general generation ability.
Zheng Nie, Zhe-Rui Li, Jia-Ming Zhang et al.· 0 citations