arXiv AI

In-Context Learning Amplifies a Latent Symbolic Circuit

The paper investigates how large language models activate a latent symbolic reasoning circuit—comprising abstraction, induction, and retrieval—when presented with in-context examples. By tracking this circuit across different shot counts and model families, the authors show that its components become detectable and functional long before the model reaches high accuracy. They further demonstrate that per-head causal contributions can increase eightfold from 1- to 10-shot, and that interventions such as cross-shot activation patching or function vector injection can dramatically improve accuracy, even at 0-shot, by leveraging the pre‑existing circuit in the model weights.

arXiv Computation and Language
Sep 4

LLMs Learn Better In-Context from Rules than from Examples

The paper investigates how large language models learn new tasks in-context, comparing rule-based instruction following to example-based few-shot prompting across five diverse tasks. Results show that models generally learn more reliably from rule descriptions than from examples alone, and adding more examples does not consistently improve performance. Instruction tuning further enhances rule-based learning while preserving example-based capabilities, with rule advantages being strongest for algebraic tasks and weaker for tasks requiring distributional sensitivity or parametric knowledge.

By Xiang Fu, Seungmin Cho, Yukyung Lee, Najoung Kim
arXiv AI
Sep 21

Understanding In-context Learning of Addition via Activation Subspaces

The paper investigates how transformer language models perform few‑shot learning for a simple addition task, showing that the ability is concentrated in a handful of attention heads. Using dimensionality reduction, the authors identify low‑dimensional subspaces—three heads with six‑dimensional spaces in Llama‑3‑8B‑Instruct—where specific dimensions encode the units digit via trigonometric patterns and magnitude via low‑frequency components. They also derive a mathematical identity linking aggregator and extractor subspaces, enabling tracking of information flow from examples to the final prediction.

By Xinyan Hu, Kayo Yin, Michael I. Jordan, Jacob Steinhardt, Lijie Chen
arXiv Computation and Language
Sep 24

Towards Efficient Reasoning: Learning Causal Shortcuts for Diffusion Language Models

The paper introduces Causal Shortcut Learning (CSL), a framework that identifies token chains—called causal shortcuts—that guide Diffusion Language Models (DLMs) toward correct reasoning paths. By extracting these shortcuts and applying parallel prioritized masking during training, CSL improves both convergence speed and generation accuracy. Experiments on several reasoning benchmarks and two base models show CSL outperforms existing SFT-variant baselines, achieving an average 1.92% improvement over SFT-only models and up to 4.20% on MATH-500.

By Dian Jin, Kairong Han, Baohong Li, Xinpeng Dong, Zijing Hu, Nuanqiao Shan, Fei Wu, Kun Kuang