Do LLMs Understand Sequential Structure? A Controlled Study of Inference and Generation

Hugging Face Daily Papers Papers

Summary

This paper investigates whether LLMs can recover latent sequential structure beyond surface action frequencies, using controlled Rock-Paper-Scissors interactions and stochastic n-gram continuation tasks. Findings show that longer context doesn't improve strategy identification, recognition doesn't guarantee faithful simulation, and higher-order dependencies degrade rule recovery — suggesting apparent behavioral fidelity can mask incorrect generative mechanisms.

Large language models (LLMs) are increasingly used as interactive agents and simulators, yet it remains unclear whether they can recover latent sequential structure beyond surface action frequencies. This distinction is critical for behavioral simulation, where actions are often shaped by prior context rather than marginal frequencies alone. We study this question using controlled two-player Rock--Paper--Scissors interactions and a one-player stochastic n-gram continuation task. Across these experiments, we test whether LLMs can identify latent strategies, follow simple Markov rules, and sustain higher-order conditional dependencies. Our framework separates distribution matching from conditional rule following. Results show that longer context does not improve identification, correct recognition does not ensure faithful simulation, and higher-order dependencies substantially degrade rule recovery. Apparent behavioral fidelity can therefore mask incorrect generative mechanisms.
Original Article
View Cached Full Text

Cached at: 10/09/26, 06:23 AM

Paper page - Do LLMs Understand Sequential Structure? A Controlled Study of Inference and Generation

Source: https://huggingface.co/papers/2610.04977

Abstract

Largelanguagemodels(LLMs)areincreasinglyusedasinteractiveagentsandsimulators,yetitremainsunclearwhethertheycanrecoverlatentsequentialstructurebeyondsurfaceactionfrequencies.Thisdistinctioniscriticalforbehavioralsimulation,whereactionsareoftenshapedbypriorcontextratherthanmarginalfrequenciesalone.Westudythisquestionusingcontrolledtwo-playerRock--Paper--Scissorsinteractionsandaone-playerstochasticn-gramcontinuationtask.Acrosstheseexperiments,wetestwhetherLLMscanidentifylatentstrategies,followsimpleMarkovrules,andsustainhigher-orderconditionaldependencies.Ourframeworkseparatesdistributionmatchingfromconditionalrulefollowing.Resultsshowthatlongercontextdoesnotimproveidentification,correctrecognitiondoesnotensurefaithfulsimulation,andhigher-orderdependenciessubstantiallydegraderulerecovery.Apparentbehavioralfidelitycanthereforemaskincorrectgenerativemechanisms.

View arXiv pageView PDFAdd to collection

Get this paper in your agent:

hf papers read 2610\.04977

Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash

Models citing this paper0

No model linking this paper

Cite arxiv.org/abs/2610.04977 in a model README.md to link it from this page.

Datasets citing this paper0

No dataset linking this paper

Cite arxiv.org/abs/2610.04977 in a dataset README.md to link it from this page.

Spaces citing this paper0

No Space linking this paper

Cite arxiv.org/abs/2610.04977 in a Space README.md to link it from this page.

Collections including this paper0

No Collection including this paper

Add this paper to acollectionto link it from this page.

Similar Articles

Cross-LLM Consistency in Inference: Evidence from Shared Interactions

arXiv cs.AI

This paper investigates whether different LLMs share common inference patterns when predicting the same token, using interaction-based explanations. Results show that advanced LLMs exhibit consistent interaction patterns, suggesting implicit optimization toward shared inference mechanisms.

When Do LLMs Reason? A Dynamical Systems View via Entropy Phase Transitions

arXiv cs.LG

This paper investigates when chain-of-thought reasoning is beneficial for LLMs, showing that early-stage entropy dynamics reliably indicate reasoning utility, and introduces EDRM, a lightweight, training-free framework that adaptively selects inference strategies to achieve significant token savings while maintaining or improving accuracy.