Image de couverture de livre

The Illusion of State in State-Space Models

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Merrill, William, Petty, Jackson, Sabharwal, Ashish
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Computational Complexity Computation and Language Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Exact Expressive Power of Transformers with Padding
par: Merrill, William, et autres
Publié: (2025)

Why Are Linear RNNs More Parallelizable?
par: Merrill, William, et autres
Publié: (2026)

Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't
par: Svete, Anej, et autres
Publié: (2026)

Context-Free Recognition with Transformers
par: Jerad, Selim, et autres
Publié: (2026)

Studying homing and synchronizing sequences for Timed Finite State Machines with output delays
par: Vinarskii, Evgenii, et autres
Publié: (2025)

Unique Hard Attention: A Tale of Two Sides
par: Jerad, Selim, et autres
Publié: (2025)

Transformers in Uniform TC$^0$
par: Chiang, David
Publié: (2024)

Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error
par: Gezer, M. Utkan, et autres
Publié: (2020)

Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata
par: Yamakami, Tomoyuki
Publié: (2022)

The Expressive Capacity of State Space Models: A Formal Language Perspective
par: Sarrof, Yash, et autres
Publié: (2024)

Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications
par: Moreira, Nelma, et autres
Publié: (2025)

Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)
par: Manea, Florin, et autres
Publié: (2024)

Transformers Can Represent $n$-gram Language Models
par: Svete, Anej, et autres
Publié: (2024)

Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
par: Yamakami, Tomoyuki
Publié: (2024)

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$-Partitions
par: Podolskii, Vladimir, et autres
Publié: (2024)

Regular Expressions with Backreferences and Lookaheads Capture NLOG
par: Uezato, Yuya
Publié: (2024)

Maximal Length Cellular Automata : A Survey
par: Adak, Sumit, et autres
Publié: (2024)

Trading Determinism for Noncommutativity in Edmonds' Problem
par: Arvind, V., et autres
Publié: (2024)

Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
par: Haneef, Farah
Publié: (2024)

Complexity of Unary Exclusive Nondeterministic Finite Automata
par: Kutrib, Martin, et autres
Publié: (2024)

Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits
par: Yamakami, Tomoyuki
Publié: (2024)

Synthesis of Timeline-Based Planning Strategies Avoiding Determinization
par: Acampora, Renato, et autres
Publié: (2024)

On the complexity of computing Strahler numbers
par: Ganardi, Moses, et autres
Publié: (2025)

Visibly Recursive Automata
par: Dubrulle, Kévin, et autres
Publié: (2026)

Entropy of pebble automata and space complexity
par: Montoya, J. Andres
Publié: (2026)

Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
par: Yamakami, Tomoyuki
Publié: (2023)

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
par: Yamakami, Tomoyuki
Publié: (2021)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
par: Yamakami, Tomoyuki
Publié: (2021)

Complexity of Fungal Automaton Prediction
par: Formenti, Enrico, et autres
Publié: (2026)

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
par: Bozga, Marius, et autres
Publié: (2026)

Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems
par: Chen, Zeyu, et autres
Publié: (2025)

Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
par: Goles, Eric, et autres
Publié: (2026)

Warm Starting State-Space Models with Automata Learning
par: Fishell, William, et autres
Publié: (2026)

Transformers as Transducers
par: Strobl, Lena, et autres
Publié: (2024)

Infinite Time Turing Machines and their Applications
par: Weerawarana, Rukmal, et autres
Publié: (2025)

SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelism
par: Marzouk, Reda, et autres
Publié: (2025)

Unlocking State-Tracking in Linear RNNs Through Negative Eigenvalues
par: Grazzi, Riccardo, et autres
Publié: (2024)

DeltaProduct: Improving State-Tracking in Linear RNNs via Householder Products
par: Siems, Julien, et autres
Publié: (2025)

Matching walks that are minimal with respect to edge inclusion
par: Marsault, Victor
Publié: (2024)

Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice
par: Yamakami, Tomoyuki
Publié: (2019)