Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xuanqiang Angelo Huang

dblp:430/6601 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Language models and text generation · 70% Representation and self-supervised learning · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
continuous representation
0.912025
Language Models Are Implicitly Continuous · ICLR 2025
Natural language and speech › Language models and text generation
text representation
0.912025
Language Models Are Implicitly Continuous · ICLR 2025
Natural language and speech › Language models and text generation › language modeling › language model architecture
transformer language model
0.912025
Language Models Are Implicitly Continuous · ICLR 2025
Natural language and speech › Language models and text generation
large language model
0.312025
Language Models Are Implicitly Continuous · ICLR 2025

Methods — techniques the papers use, named apart from their topics

continuous-time function approximation · 0.9
YearPublicationVenuePosition
2025 Language Models Are Implicitly Continuous
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.
Samuele Marro, Davide Evangelista, Xuanqiang Angelo Huang, Emanuele La Malfa, Michele Lombardi 0001, Michael J. Wooldridge
ICLR3