Almanac
← Events
5arXiv cs.CL (Computation and Language)·18h ago

Paper argues LLMs are a degenerate special case of world models, maps continuous spectrum from NTP to JEPA

A new arXiv preprint reframes the LLM-vs-world-model debate by arguing that LLMs are a degenerate special case of world models rather than a fundamentally different paradigm, with the state space being token sequences and the only action being token appending. The paper maps a continuous spectrum from next-token prediction through multi-token prediction, future-summary prediction, and next-latent prediction up to JEPA-style architectures. It identifies two open research challenges in moving along this spectrum: the data cliff from self-supervised text to action-labeled environments, and whether transformers generalize to continuous-state prediction or require a new architectural primitive. The work directly engages with Yann LeCun's 2022 argument that general intelligence requires abandoning autoregressive prediction.

Related events (8)

6arXiv · cs.AI·12d ago·source ↗

Looped World Models introduce iterative latent depth as a new scaling axis for world simulation

A new arXiv preprint introduces Looped World Models (LoopWM), a parameter-shared transformer architecture that iteratively refines latent environment states to achieve up to 100x parameter efficiency over conventional world models. The approach uses adaptive computation to scale depth dynamically per prediction step, addressing the tension between long-horizon simulation fidelity and deployment cost. The authors position iterative latent depth as a new scaling axis orthogonal to model size and training data.

6Hacker News·1mo ago·source ↗

A Sleep-Like Consolidation Mechanism for LLMs

A preprint on arXiv proposes a sleep-like memory consolidation mechanism for large language models, drawing an analogy to biological sleep-based memory consolidation in neural systems. The work appears to address how LLMs might better retain and integrate new information over time, a key challenge in continual learning and knowledge updating. The paper attracted notable community attention on Hacker News with 164 points and 122 comments, suggesting broad interest in the approach.

5arXiv · cs.CL·7d ago·source ↗

Paper argues LLMs learn causal structure via difference-making logic, not Pearl/Rubin frameworks

A new arXiv preprint proposes that LLMs learn causal structure through 'variational induction' — a difference-making logic — rather than through the dominant formalisms of Judea Pearl's interventionist approach or the Neyman-Rubin potential outcomes framework. The author analyzes how this logic is realized during training and maps specific architectural features (token embeddings, self-attention) to their roles in this inductive process. The argument draws a parallel between LLM causal learning and the experimental method of systematically varying circumstances. This is a theoretical contribution to understanding how LLMs represent causal and world-model structure.

5arXiv · cs.LG·26d ago·source ↗

Sleep paradigm for LLMs enables continual learning and memory consolidation via distillation and RL

A new arXiv preprint proposes a 'Sleep' paradigm for language models that enables continual learning by consolidating short-term in-context memories into long-term parameters. The framework has two stages: Knowledge Seeding (distilling a smaller model's memories into a larger network via on-policy distillation combined with RL-based imitation learning) and Dreaming (self-improvement via RL-generated synthetic curricula without human supervision). Experiments cover long-horizon tasks, continual learning, knowledge incorporation, and few-shot generalization, addressing a known weakness of current LLMs in retaining temporal knowledge across contexts.

3arXiv · cs.CL·13d ago·source ↗

Revisiting LLM systematicity in negation understanding via in-context learning

A new arXiv preprint analyzes how well large language models handle negation from two angles: behavioral systematicity (whether models correctly recognize negation expressions and scope) and representational systematicity (whether function vectors can be reliably constructed from in-context examples). Results show LLMs partially succeed at negation cue recognition via in-context learning but struggle with scope recognition, with performance varying by output format. Function vectors can be composed for cue extraction but are harder to extract for scope recognition tasks.

6arXiv · cs.LG·7d ago·source ↗

PAC-Bayes analysis establishes formal expressivity and alignment floors for prompt-conditioned LLMs

A new arXiv preprint models user-LLM interaction as a bilevel cheap-talk game and derives PAC-Bayes bounds showing two irreducible limitations: an 'expressivity floor' where language's finite channel capacity makes distinct tasks indistinguishable, and an 'objective-misalignment floor' where alignment constraints prevent reaching user-ideal outputs. The authors prove that prompt-conditioned LLMs cannot be universal problem solvers, as correct behavior on certain task families is provably unattainable even with infinite data, optimal training, or model scaling. The work suggests multimodal inputs and external memory as potential mitigations by increasing task-relevant information bandwidth.

6arXiv · cs.CL·4d ago·source ↗

LMs encode knowledge in task-specific parameter subsets, undermining the knowledge-base analogy

A new arXiv paper investigates whether language models satisfy the consistency property of knowledge bases — that the same fact returns consistent results regardless of query form. Behavioral and mechanistic analyses reveal that LMs encode knowledge in a task-specific manner: facts acquired on one task frequently fail to transfer to others during training, and distinct parameter subsets underlie the same fact across different tasks. The authors also show that chain-of-thought reasoning derives part of its effectiveness by engaging task-specific parameters beyond those tied to the evaluation task, with implications for factual reliability and model controllability.

5arXiv · cs.CL·24d ago·source ↗

LLMs fail to consistently simulate demographic perspective-taking in hate speech annotation

A new arXiv paper evaluates whether persona-conditioned LLMs can replicate how different demographic groups perceive hate speech, testing three dimensions: inter-group disagreement, in-group sensitivity, and vicarious prediction. No model consistently captures all three dimensions, and performance is highly model-dependent rather than emerging reliably from identity prompts alone. Vicarious prompting with Llama 3.1 provides the closest approximation to human disagreement patterns across demographic axes. The findings have implications for using LLMs as proxies for diverse human annotators in content moderation tasks.