Latent Reasoning via Sentence Embedding Prediction

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Hwang, Hyeonbin, Jeon, Byeongguk, Kim, Seungone, Kim, Jiyeon, Chang, Hoyeon, Yang, Sohee, Won, Seungpil, Lee, Dohaeng, Ahn, Youbin, Seo, Minjoon
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866912641818034176
author Hwang, Hyeonbin
Jeon, Byeongguk
Kim, Seungone
Kim, Jiyeon
Chang, Hoyeon
Yang, Sohee
Won, Seungpil
Lee, Dohaeng
Ahn, Youbin
Seo, Minjoon
author_facet Hwang, Hyeonbin
Jeon, Byeongguk
Kim, Seungone
Kim, Jiyeon
Chang, Hoyeon
Yang, Sohee
Won, Seungpil
Lee, Dohaeng
Ahn, Youbin
Seo, Minjoon
contents Autoregressive language models (LMs) generate one token at a time, yet human reasoning operates over higher-level abstractions - sentences, propositions, and concepts. This contrast raises a central question- Can LMs likewise learn to reason over structured semantic units rather than raw token sequences? In this work, we investigate whether pretrained LMs can be lifted into such abstract reasoning spaces by building on their learned representations. We present a framework that adapts a pretrained token-level LM to operate in sentence space by autoregressively predicting continuous embeddings of next sentences. We explore two embedding paradigms inspired by classical representation learning: 1) semantic embeddings, learned via autoencoding to preserve surface meaning; and 2) contextual embeddings, trained via next-sentence prediction to encode anticipatory structure. We evaluate both under two inference regimes: Discretized, which decodes each predicted embedding into text before re-encoding; and Continuous, which reasons entirely in embedding space for improved efficiency. Across four domains - mathematics, logic, commonsense, and planning - contextual embeddings under continuous inference show competitive performance with Chain-of-Thought (CoT) while reducing inference-time FLOPs on average by half. We also present early signs of scalability and modular adaptation. Finally, to visualize latent trajectories, we introduce SentenceLens, a diagnostic tool that decodes intermediate model states into interpretable sentences. Together, our results indicate that pretrained LMs can effectively transition to abstract, structured reasoning within latent embedding spaces.
format Preprint
id arxiv_https___arxiv_org_abs_2505_22202
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Latent Reasoning via Sentence Embedding Prediction
Hwang, Hyeonbin
Jeon, Byeongguk
Kim, Seungone
Kim, Jiyeon
Chang, Hoyeon
Yang, Sohee
Won, Seungpil
Lee, Dohaeng
Ahn, Youbin
Seo, Minjoon
Computation and Language
Artificial Intelligence
Autoregressive language models (LMs) generate one token at a time, yet human reasoning operates over higher-level abstractions - sentences, propositions, and concepts. This contrast raises a central question- Can LMs likewise learn to reason over structured semantic units rather than raw token sequences? In this work, we investigate whether pretrained LMs can be lifted into such abstract reasoning spaces by building on their learned representations. We present a framework that adapts a pretrained token-level LM to operate in sentence space by autoregressively predicting continuous embeddings of next sentences. We explore two embedding paradigms inspired by classical representation learning: 1) semantic embeddings, learned via autoencoding to preserve surface meaning; and 2) contextual embeddings, trained via next-sentence prediction to encode anticipatory structure. We evaluate both under two inference regimes: Discretized, which decodes each predicted embedding into text before re-encoding; and Continuous, which reasons entirely in embedding space for improved efficiency. Across four domains - mathematics, logic, commonsense, and planning - contextual embeddings under continuous inference show competitive performance with Chain-of-Thought (CoT) while reducing inference-time FLOPs on average by half. We also present early signs of scalability and modular adaptation. Finally, to visualize latent trajectories, we introduce SentenceLens, a diagnostic tool that decodes intermediate model states into interpretable sentences. Together, our results indicate that pretrained LMs can effectively transition to abstract, structured reasoning within latent embedding spaces.
title Latent Reasoning via Sentence Embedding Prediction
topic Computation and Language
Artificial Intelligence
url https://arxiv.org/abs/2505.22202