Imagen de Portada

The Expressive Power of Transformers with Chain of Thought

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Merrill, William, Sabharwal, Ashish
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning Computational Complexity Computation and Language Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Exact Expressive Power of Transformers with Padding
por: Merrill, William, et al.
Publicado: (2025)

A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers
por: Merrill, William, et al.
Publicado: (2025)

Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't
por: Svete, Anej, et al.
Publicado: (2026)

A Logic for Expressing Log-Precision Transformers
por: Merrill, William, et al.
Publicado: (2022)

The Illusion of State in State-Space Models
por: Merrill, William, et al.
Publicado: (2024)

The Expressive Power of Low Precision Softmax Transformers with (Summarized) Chain-of-Thought
por: Brösamle, Moritz, et al.
Publicado: (2026)

Why Are Linear RNNs More Parallelizable?
por: Merrill, William, et al.
Publicado: (2026)

The Complexity and Expressive Power of Second-Order Extended Logic
por: Feng, Shiguang, et al.
Publicado: (2022)

The Descriptive Complexity of Graph Neural Networks
por: Grohe, Martin
Publicado: (2023)

Local vs. Global Interpretability: A Computational Complexity Perspective
por: Bassan, Shahaf, et al.
Publicado: (2024)

On the Computational Tractability of the (Many) Shapley Values
por: Marzouk, Reda, et al.
Publicado: (2025)

Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretation
por: Amir, Guy, et al.
Publicado: (2024)

Verifying Quantized Graph Neural Networks is PSPACE-complete
por: Sälzer, Marco, et al.
Publicado: (2025)

Provably Explaining Neural Additive Models
por: Bassan, Shahaf, et al.
Publicado: (2026)

Is uniform expressivity too restrictive? Towards efficient expressivity of graph neural networks
por: Khalife, Sammy, et al.
Publicado: (2024)

What makes an Ensemble (Un) Interpretable?
por: Bassan, Shahaf, et al.
Publicado: (2025)

The Complexity of Verifying Feedforward Neural Networks in Quantised Settings
por: Alsmann, Eric, et al.
Publicado: (2026)

Limits of Deep Learning: Sequence Modeling through the Lens of Complexity Theory
por: Zubić, Nikola, et al.
Publicado: (2024)

Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning
por: Sälzer, Marco, et al.
Publicado: (2024)

Kleene algebra with commutativity conditions is undecidable
por: de Amorim, Arthur Azevedo, et al.
Publicado: (2024)

What Formal Languages Can Transformers Express? A Survey
por: Strobl, Lena, et al.
Publicado: (2023)

The Power of Negation in Higher-Order Datalog
por: Charalambidis, Angelos, et al.
Publicado: (2025)

Reasonable Space for the $λ$-Calculus, Logarithmically
por: Accattoli, Beniamino, et al.
Publicado: (2022)

LFPL: Revisited and Mechanized
por: Glover, Nathaniel, et al.
Publicado: (2026)

Complete and tractable machine-independent characterizations of second-order polytime
por: Hainry, Emmanuel, et al.
Publicado: (2022)

Reversible Computation with Stacks and "Reversible Management of Failures"
por: Palazzo, Matteo, et al.
Publicado: (2025)

Program Synthesis is $Σ_3^0$-Complete
por: Kim, Jinwoo
Publicado: (2024)

The Reachability Problem for Neural-Network Control Systems
por: Schilling, Christian, et al.
Publicado: (2024)

The Computational Complexity of Satisfiability in State Space Models
por: Alsmann, Eric, et al.
Publicado: (2025)

Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable
por: Chernobrovkin, Artem, et al.
Publicado: (2025)

Data Complexity in Expressive Description Logics With Path Expressions
por: Bednarczyk, Bartosz
Publicado: (2024)

Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
por: Bournez, Olivier
Publicado: (2026)

Theoretical Constraints on the Expressive Power of $\mathsf{RoPE}$-based Tensor Attention Transformers
por: Li, Xiaoyu, et al.
Publicado: (2024)

Context-Free Recognition with Transformers
por: Jerad, Selim, et al.
Publicado: (2026)

Non-commutative linear logic fragments with sub-context-free complexity
por: Nishimiya, Yusaku, et al.
Publicado: (2025)

An order out of nowhere: a new algorithm for infinite-domain CSPs
por: Mottet, Antoine, et al.
Publicado: (2023)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
por: Nechesov, Andrey
Publicado: (2024)

Proof Complexity of Linear Logics
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2026)

The Proof Analysis Problem
por: Arteche, Noel, et al.
Publicado: (2025)

Proof complexity of positive branching programs
por: Das, Anupam, et al.
Publicado: (2021)