Close

Combining Theoretical and Empirical Approaches for Understanding the Foundations of LLMs

Seminar proposal Builds on the prior course by Michael Hahn: theory-25

The rise of large language models (LLMs) has drawn researchers from formal language theory, computational complexity, and empirical machine learning into a shared inquiry: how can we better understand the learnability and expressiveness of the LLMs? This seminar brings together theoretical and empirical perspectives on that question.

LLM Artifact

(Encoder-only, decoder-only, or both;
Soft/hard attention, position encoding;
Reasoning ability or agentic tool calling)

Environment

(natural language, formal language)

Herbert Simon in his The Sciences of the Artificial (1969) argued that an artifact can be understood as an interface between an “inner” environment (its own structure and mechanism) and an “outer” environment (the surroundings it operates in). He illustrated this with his well-known ant-on-a-beach example: the ant's path looks complex, but the complexity mostly reflects the irregularity of the beach (outer environment), not the ant's internal decision rules (inner environment), which are actually simple. He extended this to argue that as long as the inner system is suitably designed, an artifact's behavior is largely shaped by the environment it is embodied in. So studying artifacts requires attention to both sides of that interface, not just internal structure.

Our goal is to study LLMs within their operating environments, focusing on their expressiveness and learnability. Expressiveness concerns what problems (or languages, more broadly) can be represented or computed by an LLM; learnability concerns whether these languages can indeed be trained on by the LLM via standard training procedures. Our pursuit of understanding LLMs is divided into three important axes:

In each axis, we control the environment of the LLMs by considering controlled formal languages, enabling us to make precise claims about the artifact itself.

Instructors: Bishwamittra Ghosh.

Location: RPTU Kaiserslautern.

Intended audience: PhD and Master's students in computer science.

Format: Weekly seminar sessions.

Prerequisites: No formal prerequisites — a willingness to engage with technical, proof-based content (formal language theory, computational complexity) is expected.

Tentative syllabus

This reading list is still tentative — suggestions for additional or alternative papers are welcome.

Date Topic Reading
Week 1 Expressivity (no computational model) Kleinberg, Jon, and Sendhil Mullainathan. “Language Generation in the Limit.” In Proc. NeurIPS 2024, pp. 66058–66079.
Week 2 Expressivity (Transformers) Weiss, Gail, Yoav Goldberg, and Eran Yahav. “Thinking Like Transformers.” In Proc. ICML 2021.
Week 3 Expressivity (sensitivity) Hahn, Michael, and Mark Rofin. “Why Are Sensitive Functions Hard for Transformers?” In Proc. ACL 2024.
Week 4 Learnability (length generalization) Zhou, Hattie, et al. “What Algorithms Can Transformers Learn? A Study in Length Generalization.” In Proc. ICLR 2024.
Week 5 Learnability (attention glitches) Liu, Bingbin, et al. “Exposing Attention Glitches with Flip-Flop Language Modeling.” In Proc. NeurIPS 2023.
Week 6 Learnability (regular languages) Borenstein, Nadav, et al. “What Languages Are Easy to Language-Model? A Perspective from Learning Probabilistic Regular Languages.” In Proc. ACL 2024.
Week 7 Learnability (hierarchical structure) Allen-Zhu, Zeyuan, and Yuanzhi Li. “Physics of Language Models: Part 1, Learning Hierarchical Language Structures.” arXiv preprint arXiv:2305.13673, 2023.
Week 8 Learnability (fine-tuning vs. ICL) Ghosh, Bishwamittra, et al. “Fine-Tuning vs. In-Context Learning in Large Language Models: A Formal Language Learning Perspective.” In Proc. ACL 2026.