中文
相关论文

相关论文: The Counting Power of Transformers

200 篇论文

Transformers have the capacity to act as supervised learning algorithms: by properly encoding a set of labeled training ("in-context") examples and an unlabeled test example into an input sequence of vectors of the same dimension, the…

机器学习 · 计算机科学 2024-12-16 Spencer Frei , Gal Vardi

Transformer-based models generate hidden states that are difficult to interpret. In this work, we analyze hidden states and modify them at inference, with a focus on motion forecasting. We use linear probing to analyze whether interpretable…

机器学习 · 计算机科学 2025-05-19 Omer Sahin Tas , Royden Wagner

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

动力系统 · 数学 2015-09-02 Volker Mayer , Mariusz Urbanski

Trained transformer models have been found to implement interpretable procedures for tasks like arithmetic and associative recall, but little is understood about how the circuits that implement these procedures originate during training. To…

机器学习 · 计算机科学 2024-10-08 Ziqian Zhong , Jacob Andreas

Formal language theory has recently been successfully employed to unravel the power of transformer encoders. This setting is primarily applicable in Natural Language Processing (NLP), as a token embedding function (where a bounded number of…

形式语言与自动机理论 · 计算机科学 2024-11-13 Pascal Bergsträßer , Chris Köcher , Anthony Widjaja Lin , Georg Zetzsche

The remarkable success of transformers in the field of natural language processing has sparked the interest of the speech-processing community, leading to an exploration of their potential for modeling long-range dependencies within speech…

计算与语言 · 计算机科学 2025-06-05 Siddique Latif , Aun Zaidi , Heriberto Cuayahuitl , Fahad Shamshad , Moazzam Shoukat , Muhammad Usama , Junaid Qadir

Existing work has analyzed the representational capacity of the transformer architecture by means of formal models of computation. However, the focus so far has been on analyzing the architecture in terms of language \emph{acceptance}. We…

计算与语言 · 计算机科学 2024-06-21 Anej Svete , Ryan Cotterell

With the rapid development of AI technology in recent years, there have been many studies with deep learning models in soft sensing area. However, the models have become more complex, yet, the data sets remain limited: researchers are…

机器学习 · 计算机科学 2022-01-25 Chao Zhang , Jaswanth Yella , Yu Huang , Xiaoye Qian , Sergei Petrov , Andrey Rzhetsky , Sthitie Bom

Transformers trained on huge text corpora exhibit a remarkable set of capabilities, e.g., performing basic arithmetic. Given the inherent compositional nature of language, one can expect the model to learn to compose these capabilities,…

机器学习 · 计算机科学 2024-02-07 Rahul Ramesh , Ekdeep Singh Lubana , Mikail Khona , Robert P. Dick , Hidenori Tanaka

As an emerging type of Neural Networks (NNs), Transformers are used in many domains ranging from Natural Language Processing to Autonomous Driving. In this paper, we study the robustness problem of Transformers, a key characteristic as low…

机器学习 · 计算机科学 2024-12-03 Brian Hsuan-Cheng Liao , Chih-Hong Cheng , Hasan Esen , Alois Knoll

Understanding Transformer-based models has attracted significant attention, as they lie at the heart of recent technological advances across machine learning. While most interpretability methods rely on running models over inputs, recent…

计算与语言 · 计算机科学 2023-12-27 Guy Dar , Mor Geva , Ankit Gupta , Jonathan Berant

Transformer-based architectures achieved breakthrough performance in natural language processing and computer vision, yet they remain inferior to simpler linear baselines in multivariate long-term forecasting. To better understand this…

Recent work by Clark et al. (2020) shows that transformers can act as 'soft theorem provers' by answering questions over explicitly provided knowledge in natural language. In our work, we take a step closer to emulating formal theorem…

计算与语言 · 计算机科学 2020-10-07 Swarnadeep Saha , Sayan Ghosh , Shashank Srivastava , Mohit Bansal

The expressive power of transformers over inputs of unbounded size can be studied through their ability to recognize classes of formal languages. In this paper, we establish exact characterizations of transformers with hard attention (in…

形式语言与自动机理论 · 计算机科学 2024-10-31 Andy Yang , David Chiang , Dana Angluin

Transformers achieve state-of-the-art accuracy and robustness across many tasks, but an understanding of their inductive biases and how those biases differ from other neural network architectures remains elusive. In this work, we identify…

机器学习 · 计算机科学 2025-02-14 Bhavya Vasudeva , Deqing Fu , Tianyi Zhou , Elliott Kau , Youqi Huang , Vatsal Sharan

Despite the empirical success of prompt tuning in adapting pretrained language models to new tasks, theoretical analyses of its capabilities remain limited. Existing theoretical work primarily addresses universal approximation properties,…

机器学习 · 计算机科学 2025-09-03 Maxime Meyer , Mario Michelessa , Caroline Chaux , Vincent Y. F. Tan

Transformers excel through content-addressable retrieval and the ability to exploit contexts of, in principle, unbounded length. We recast associative memory at the level of probability measures, treating a context as a distribution over…

机器学习 · 统计学 2026-02-03 Ryotaro Kawata , Taiji Suzuki

Transformers have proven highly effective across various applications, especially in handling sequential data such as natural languages and time series. However, transformer models often lack clear interpretability, and the success of…

机器学习 · 计算机科学 2025-12-01 Wei Shi , Yuan Cao

Despite their central role in the success of foundational models and large-scale language modeling, the theoretical foundations governing the operation of Transformers remain only partially understood. Contemporary research has largely…

机器学习 · 计算机科学 2025-06-02 Sagar Ghosh , Kushal Bose , Swagatam Das

Transformer-based large language models have achieved remarkable performance across various natural language processing tasks. However, they often struggle with seemingly easy tasks like arithmetic despite their vast capabilities. This…

计算与语言 · 计算机科学 2024-07-23 Luyu Qiu , Jianing Li , Chi Su , Chen Jason Zhang , Lei Chen