Language Models Are Implicitly Continuous

Samuele Marro, David Evangelista, X. A. Huang, Emanuele La Malfa, Michele Lombardi +1 more
4/1/2025

No official code found. Best implementation: samuelemarro/continuous-llm-experiments (18 stars, Apache-2.0, last commit 2025-05-12).

Abstract

Language is typically modelled with discrete sequences. However, the most successful approaches to language modelling, namely neural networks, are continuous and smooth function approximators. In this work, we show that Transformer-based language models implicitly learn to represent sentences as continuous-time functions defined over a continuous input space. This phenomenon occurs in most state-of-the-art Large Language Models (LLMs), including Llama2, Llama3, Phi3, Gemma, Gemma2, and Mistral, and suggests that LLMs reason about language in ways that fundamentally differ from humans. Our work formally extends Transformers to capture the nuances of time and space continuity in both input and output space. Our results challenge the traditional interpretation of how LLMs understand language, with several linguistic and engineering implications.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Experiments on continuous LMs.

180C, C++Sep 1, 20241 years agoApache-2.0

Cite this paper

@article{marro2025language,
  title  = {Language Models Are Implicitly Continuous},
  author = {Samuele Marro and David Evangelista and X. A. Huang and Emanuele La Malfa and Michele Lombardi and Michael Wooldridge},
  year   = {2025},
  eprint = {2504.03933},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2504.03933},
  journal = {ICLR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.03933.svg)](https://codeofpaper.com/paper/2504.03933)

Discussion