On the Representational Capacity of Neural Language Models with Chain-of-Thought Reasoning
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929685236023296 |
|---|---|
| author | Nowak, Franz Svete, Anej Butoi, Alexandra Cotterell, Ryan |
| author_facet | Nowak, Franz Svete, Anej Butoi, Alexandra Cotterell, Ryan |
| contents | The performance of modern language models (LMs) has been improved by chain-of-thought (CoT) reasoning, i.e., the process of generating intermediate results that guide the model towards a final answer. A possible explanation for this improvement is that CoT reasoning extends an LM's computational power, as RNNs and transformers with additional scratch space are known to be Turing complete. Comparing LMs to Turing machines, however, introduces a category error - Turing machines decide language membership, whereas LMs define distributions over strings. To bridge this gap, we formalize CoT reasoning in a probabilistic setting. We present several results on the representational capacity of recurrent and transformer LMs with CoT reasoning, showing that they can represent the same family of distributions over strings as probabilistic Turing machines. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_14197 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Representational Capacity of Neural Language Models with Chain-of-Thought Reasoning Nowak, Franz Svete, Anej Butoi, Alexandra Cotterell, Ryan Computation and Language Formal Languages and Automata Theory The performance of modern language models (LMs) has been improved by chain-of-thought (CoT) reasoning, i.e., the process of generating intermediate results that guide the model towards a final answer. A possible explanation for this improvement is that CoT reasoning extends an LM's computational power, as RNNs and transformers with additional scratch space are known to be Turing complete. Comparing LMs to Turing machines, however, introduces a category error - Turing machines decide language membership, whereas LMs define distributions over strings. To bridge this gap, we formalize CoT reasoning in a probabilistic setting. We present several results on the representational capacity of recurrent and transformer LMs with CoT reasoning, showing that they can represent the same family of distributions over strings as probabilistic Turing machines. |
| title | On the Representational Capacity of Neural Language Models with Chain-of-Thought Reasoning |
| topic | Computation and Language Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2406.14197 |