Umeå University's logo

umu.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Transformers as recognizers and transducers
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
2025 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)Alternativ tittel
Transformers som igenkännare och transduktorer (svensk)
Abstract [en]

This thesis studies the computational expressivity of transformers from the perspective of formal language theory, circuit complexity, and transductions. It develops a unified framework that locates finite-precision transformer architectures within established constant-depth circuit classes and descriptive logics, and links their recognition power to well-known hierarchies of string-to-string functions.

The analysis focuses on architectures under explicit and realistic constraints: constant depth, O(log n) precision, and simple positional features. Under these assumptions, encoder-only transformers with average-hard attention lie within DLOGTIME-uniform TC0. With a small set of positional encodings, masked average-hard encoders can simulate a calculus that contains the aperiodic polyregular transductions. Together, these results point to constant-depth counting (e.g., prefix sums and majority) as a shared mechanism behind both recognition and transduction.

The thesis further shows that temperature-scaled softmax attention can match the selection behavior of unique-hard attention, and that for average-hard heads with a unique maximizer per query (uniform-tieless), the same outputs can be obtained without changing the learned weights by choosing a length-dependent temperature. It also characterizes trade-offs in succinct models: some table-lookup layouts can be solved by a single concise layer under structure-aware encodings, whereas structure-oblivious layouts require either additional depth or super-polylogarithmic communication size.

Throughout, constructive proofs are paired with reference implementations and learning experiments on synthetic tasks. This combination clarifies which theoretically possible behaviors emerge in practice and where learnability lags expressivity, especially for length extrapolation. The thesis concludes with open directions toward adaptive masking, resource-aware analyses, and conditions under which standard training enables the models to reach their theoretical potential, strengthening the bridge between formal methods and neural language modeling.

sted, utgiver, år, opplag, sider
Umeå: Umeå University, 2025. , s. 34
HSV kategori
Identifikatorer
URN: urn:nbn:se:umu:diva-244111ISBN: 978-91-8070-790-9 (tryckt)ISBN: 978-91-8070-791-6 (digital)OAI: oai:DiVA.org:umu-244111DiVA, id: diva2:1997321
Disputas
2025-10-07, SAM.A.280, Samhällsvetarhuset, Umeå, 13:00 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2025-09-16 Laget: 2025-09-11 Sist oppdatert: 2025-09-17bibliografisk kontrollert
Delarbeid
1. Average-hard attention transformers are constant-depth uniform threshold circuits
Åpne denne publikasjonen i ny fane eller vindu >>Average-hard attention transformers are constant-depth uniform threshold circuits
(engelsk)Manuskript (preprint) (Annet vitenskapelig)
HSV kategori
Identifikatorer
urn:nbn:se:umu:diva-244107 (URN)
Tilgjengelig fra: 2025-09-11 Laget: 2025-09-11 Sist oppdatert: 2025-09-12bibliografisk kontrollert
2. What formal languages can transformers express? a survey
Åpne denne publikasjonen i ny fane eller vindu >>What formal languages can transformers express? a survey
Vise andre…
2024 (engelsk)Inngår i: Transactions of the Association for Computational Linguistics, E-ISSN 2307-387X, Vol. 12, s. 543-561Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

As transformers have gained prominence in natural language processing, some researchers have investigated theoretically what problems they can and cannot solve, by treating problems as formal languages. Exploring such questions can help clarify the power of transformers relative to other models of computation, their fundamental capabilities and limits, and the impact of architectural choices. Work in this subarea has made considerable progress in recent years. Here, we undertake a comprehensive survey of this work, documenting the diverse assumptions that underlie different results and providing a unified framework for harmonizing seemingly contradictory findings.

sted, utgiver, år, opplag, sider
MIT Press, 2024
HSV kategori
Identifikatorer
urn:nbn:se:umu:diva-225336 (URN)10.1162/tacl_a_00663 (DOI)001259434600001 ()2-s2.0-85193832932 (Scopus ID)
Tilgjengelig fra: 2024-06-04 Laget: 2024-06-04 Sist oppdatert: 2025-09-12bibliografisk kontrollert
3. Transformers as transducers
Åpne denne publikasjonen i ny fane eller vindu >>Transformers as transducers
Vise andre…
2025 (engelsk)Inngår i: Transactions of the Association for Computational Linguistics, E-ISSN 2307-387X, Vol. 13, s. 200-219Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

We study the sequence-to-sequence mapping capacity of transformers by relating them to finite transducers, and find that they can express surprisingly large classes of (total functional) transductions. We do so using variants of RASP, a programming language designed to help people “think like transformers,” as an intermediate representation. We extend the existing Boolean variant B-RASP to sequence-to-sequence transductions and show that it computes exactly the first-order rational transductions (such as string rotation). Then, we introduce two new extensions. B-RASP[pos] enables calculations on positions (such as copying the first half of a string) and contains all first-order regular transductions. S-RASP adds prefix sum, which enables additional arithmetic operations (such as squaring a string) and contains all first-order polyregular transductions. Finally, we show that masked average-hard attention transformers can simulate S-RASP.

sted, utgiver, år, opplag, sider
MIT Press, 2025
HSV kategori
Identifikatorer
urn:nbn:se:umu:diva-242255 (URN)10.1162/tacl_a_00736 (DOI)001436318200002 ()2-s2.0-105010222957 (Scopus ID)
Tilgjengelig fra: 2025-07-17 Laget: 2025-07-17 Sist oppdatert: 2025-10-09bibliografisk kontrollert
4. Simulating hard attention using soft attention
Åpne denne publikasjonen i ny fane eller vindu >>Simulating hard attention using soft attention
(engelsk)Manuskript (preprint) (Annet vitenskapelig)
HSV kategori
Identifikatorer
urn:nbn:se:umu:diva-244109 (URN)
Tilgjengelig fra: 2025-09-11 Laget: 2025-09-11 Sist oppdatert: 2025-09-12bibliografisk kontrollert
5. Concise one-layer transformers can do function evaluation (sometimes)
Åpne denne publikasjonen i ny fane eller vindu >>Concise one-layer transformers can do function evaluation (sometimes)
(engelsk)Manuskript (preprint) (Annet vitenskapelig)
HSV kategori
Identifikatorer
urn:nbn:se:umu:diva-244110 (URN)
Tilgjengelig fra: 2025-09-11 Laget: 2025-09-11 Sist oppdatert: 2025-09-12bibliografisk kontrollert

Open Access i DiVA

fulltext(1550 kB)411 nedlastinger
Filinformasjon
Fil FULLTEXT04.pdfFilstørrelse 1550 kBChecksum SHA-512
c103b656f65bac4d1e66b739ea0790d292bb142f76d49de26069d758c0b6a4ed951f033fc6c36588691869a46c0d7a98239798372e7a9dc3660a82f42ce1b33b
Type fulltextMimetype application/pdf
spikblad(271 kB)37 nedlastinger
Filinformasjon
Fil SPIKBLAD01.pdfFilstørrelse 271 kBChecksum SHA-512
96ad22d2a858d3609355db94b64bba74c764466170484331f7cf93eb209eeff9422019267222242c1e1c9e7ef539200137becb719cb1986b94e7cc3b448877a5
Type spikbladMimetype application/pdf

Person

Strobl, Lena

Søk i DiVA

Av forfatter/redaktør
Strobl, Lena
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 423 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

isbn
urn-nbn

Altmetric

isbn
urn-nbn
Totalt: 3787 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf