From Expressivity to Sample Complexity: Narrow Teachers for Transformers via C-RASP
A theoretical understanding of Transformers is crucial to better understand the capacities and limitations of large language models (LLMs). There is much work analyzing the expressivity of attention-based models. By proposing handcrafted weights or using computational complexity arguments, a large amount of past theoretical works have sought to characterize which tasks are and which are not in the hypothesis class of Transformer models. However, little work investigates the learnability of such solutions. In this work, we make progress towards this goal. Inspired by recent loss landscape analysis work, we propose preliminary sample complexity bounds for learning C-RASP constructions with ...
| Authors | Michael Rizvi-Martel, Satwik Bhattamishra, Guillaume Rabusseau et al. |
|---|---|
| Primary category | cs.LG |
| Published | 13 July 2026 |
| Last updated at source | 13 July 2026 |
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.