Skip to content

SYNLAT: Syntax-Aligned Text-Latent Compression for Chain-of-Thought Reasoning

Oct 2026 · 0 citations · 24 references
Computer Science

TL;DR

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.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

SemanticFold: Latent Sequence Compression SeparatesLanguage Modeling, Decodability, and Reasoning

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...

Ming-Yan Liu, Ming-Qiang Huang · 0 citations
#artificial intelligence Preprint Sep 2026

Structural Process Supervision for Latent Chain-of-Thought Reasoning

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.

Yi-Qi Li, Xu Chen, Chen Ju et al. · 1 citation
#natural language process... Preprint Oct 2026

Intent-Triggered Anchoring for Multi-Token Format Units in Parallel Decoding of Diffusion Language Models

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.

Junhyeok Lee, Kyu Sung Choi · 0 citations
#natural language process... Preprint Oct 2026

Latent Core Tokenizer: Compress, but Meaningfully

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
#natural language process... Preprint Aug 2026

Every Token Leaves a Ripple in the Stream of Thought: Eliciting Model-Internal Token Saliency for Chain-of-Thought Compression

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
#artificial intelligence Preprint Sep 2026

In-Place Instruction Following in Diffusion Language Models

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

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.