CLApr 29, 2024

Markovian Transformers for Informative Language Modeling

Stanford
arXiv:2404.18988v73 citationsh-index: 11
Originality Highly original
AI Analysis

This addresses the interpretability and reliability of reasoning in language models for AI and NLP applications, representing a novel method rather than an incremental improvement.

The paper tackles the problem of Chain-of-Thought reasoning not faithfully reflecting language models' decision processes by introducing a Markovian language model framework that compresses reasoning into interpretable text, resulting in large gains on QA tasks (e.g., GSM8K: +33.8 pp, ARC-Challenge: +29.4 pp).

Chain-of-Thought (CoT) reasoning often fails to faithfully reflect a language model's underlying decision process. We address this by introducing a Markovian language model framework that can be understood as a reasoning autoencoder: it creates a text-based bottleneck where CoT serves as an intermediate representation, forcing the model to compress essential reasoning into interpretable text before making predictions. We train this system with a GRPO-style policy gradient algorithm using parallel sampling, a frozen baseline CoT', within-batch standardized advantages, and actor-reward (chain-rule) gradients. Our approach yields large gains on QA tasks (e.g., GSM8K: 20.7% to 54.5%; +33.8 pp; ARC-Challenge: 47.5% to 76.9%; +29.4 pp). Perturbation analyses across types and severities show consistently higher sensitivity to CoT edits (typically 52%--82% of cases favor Markovian), indicating stronger causal reliance on the CoT. Cross-model evaluation confirms that learned CoTs generalize across architectures, suggesting they capture transferable reasoning patterns rather than model-specific artifacts.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes