ArXiv

On the Limits of Prompt-Conditioned Language Models as General-Purpose Learners

Authors
David Mguni, Julian Ma, Jun Wang
Categories
cs.LG
arXiv
https://arxiv.org/abs/2606.23668v1
PDF
https://arxiv.org/pdf/2606.23668v1

Brief

The paper 'On the Limits of Prompt-Conditioned Language Models as General-Purpose Learners' models user–system interaction as a bilevel cheap-talk game and derives PAC-Bayes bounds to separate finite-sample estimation error from structural limits. It identifies an expressivity floor (language-channel capacity causes irreducible error even with infinite data) and an objective-misalignment floor (alignment constraints yield unavoidable distortion), and argues multimodal/external-memory interfaces can mitigate these limits.

Why it matters

Authors David Mguni, Julian Ma, and Jun Wang (arXiv 2026-06-22) prove a formal limit: an "expressivity floor" — when a task family's informational complexity exceeds the capacity of natural language as a channel, distinct tasks become indistinguishable to a prompt-conditioned Solver, creating an irreducible error even in the infinite-data regime (derived via PAC-Bayes bounds).

Key details

  • They also identify an "objective-misalignment floor": alignment or safety constraints can restrict admissible outputs so the User-ideal distribution lies outside the feasible set, producing unavoidable distortion that cannot be removed by more data or scaling.
  • Methodologically they model User–System interaction as a bilevel cheap-talk game and decompose task inference from execution; they conclude prompt-only interfaces are not universally sufficient and suggest multimodal inputs, external memory, or richer interfaces to increase task-relevant information and mitigate these limits.
Source evidence

Abstract

Large Language Models (LLMs) are frequently portrayed as general-purpose solvers capable of solving arbitrary tasks. We argue that this view overlooks a fundamental constraint: language is a compressed and capacity-limited interface for conveying task information. Modelling User--System interaction as a bilevel \emph{cheap-talk} game, we analyse how latent tasks are encoded into prompts and reinterpreted under alignment and safety constraints. We introduce a conceptual decomposition separating task inference from execution and derive PAC-Bayes bounds that distinguish finite-sample estimation error from irreducible structural limitations. Our first main result establishes an \emph{expressivity floor}: language acts as a capacity-limited communication channel, and whenever the informational complexity of a task family exceeds the capacity of that channel, distinct tasks become unavoidably indistinguishable to the Solver, inducing a strictly positive error floor that cannot be eliminated by additional data, optimisation, or model scaling alone. We then establish an \emph{objective-misalignment floor}: when alignment constraints restrict the admissible output set, the User-ideal distribution may lie outside the feasible class, inducing an irreducible distortion. Together, these results yield a formal negative conclusion: prompt-conditioned LLMs are not universal problem solvers through prompting alone, as there exist task families for which correct behaviour is provably unattainable even in the infinite-data regime. More broadly, our analysis shows the limits of prompt-based generalisation arise from information-constrained communication and alignment-constrained objectives. This suggests that interfaces beyond natural language, including multimodal observations and, external memory, may reduce the inherent LLM limitations by increasing the task-relevant information available to the System.