English
Related papers

Related papers: Expressiveness of Visibly Pushdown Transducers

200 papers

We consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augmented with a pushdown stack. A configuration of a PTA includes a control state, dense clock values and a stack word. By using the pattern technique,…

Logic in Computer Science · Computer Science 2007-05-23 Zhe Dang

Parsing expression grammars (PEGs) offer a natural opportunity for building verified parser interpreters based on higher-order parsing combinators. PEGs are expressive, unambiguous, and efficient to parse in a top-down recursive descent…

Logic in Computer Science · Computer Science 2020-01-14 Clement Blaudeau , Natarajan Shankar

Visual prompt tuning (VPT), i.e., fine-tuning some lightweight prompt tokens, provides an efficient and effective approach for adapting pre-trained models to various downstream tasks. However, most prior art indiscriminately uses a fixed…

Computer Vision and Pattern Recognition · Computer Science 2025-10-07 Chikai Shang , Mengke Li , Yiqun Zhang , Zhen Chen , Jinlin Wu , Fangqing Gu , Yang Lu , Yiu-ming Cheung

Vision transformers (ViTs) have emerged as a significant area of focus, particularly for their capacity to be jointly trained with large language models and to serve as robust vision foundation models. Yet, the development of trustworthy…

Machine Learning · Computer Science 2024-11-04 Hengyi Wang , Shiwei Tan , Hao Wang

We investigate the robustness of vision transformers (ViTs) through the lens of their special patch-based architectural structure, i.e., they process an image as a sequence of image patches. We find that ViTs are surprisingly insensitive to…

Machine Learning · Computer Science 2023-02-23 Yao Qin , Chiyuan Zhang , Ting Chen , Balaji Lakshminarayanan , Alex Beutel , Xuezhi Wang

Despite the recent success of instruction-tuned language models and their ubiquitous usage, very little is known of how models process instructions internally. In this work, we address this gap from a mechanistic point of view by…

Computation and Language · Computer Science 2026-02-10 Irina Bigoulaeva , Jonas Rohweder , Subhabrata Dutta , Iryna Gurevych

In this thesis, we develop methods to enhance the interpretability of recent representation learning techniques in natural language processing (NLP) while accounting for the unavailability of annotated data. We choose to leverage…

Computation and Language · Computer Science 2023-05-05 Ghazi Felhi

Reasoning over multiple modalities, e.g. in Visual Question Answering (VQA), requires an alignment of semantic concepts across domains. Despite the widespread success of end-to-end learning, today's multimodal pipelines by and large…

Computer Vision and Pattern Recognition · Computer Science 2021-09-10 Jan-Martin O. Steitz , Jonas Pfeiffer , Iryna Gurevych , Stefan Roth

Recent studies of the computational power of recurrent neural networks (RNNs) reveal a hierarchy of RNN architectures, given real-time and finite-precision assumptions. Here we study auto-regressive Transformers with linearised attention,…

Machine Learning · Computer Science 2023-10-26 Kazuki Irie , Róbert Csordás , Jürgen Schmidhuber

Recurrent neural networks (RNNs) can learn continuous vector representations of symbolic structures such as sequences and sentences; these representations often exhibit linear regularities (analogies). Such regularities motivate our…

Computation and Language · Computer Science 2019-03-06 R. Thomas McCoy , Tal Linzen , Ewan Dunbar , Paul Smolensky

The introduction of Transformer neural networks has changed the landscape of Natural Language Processing (NLP) during the last years. So far, none of the visualization systems has yet managed to examine all the facets of the Transformers.…

Computation and Language · Computer Science 2021-05-27 Andrew Dunn , Diana Inkpen , Răzvan Andonie

We study succinctness as a measure of the expressive power of transformers. Succinctness -- how compactly a formalism can describe a language relative to other formalisms -- is a classical notion in logic and automata theory. We prove that…

Formal Languages and Automata Theory · Computer Science 2026-05-18 Pascal Bergsträßer , Ryan Cotterell , Anthony W. Lin

Spatial reasoning in 3D scenes requires precise geometric calculations that challenge vision-language models. Visual programming addresses this by decomposing problems into steps calling specialized tools, yet existing methods rely on…

Computer Vision and Pattern Recognition · Computer Science 2025-12-25 Shengguang Wu , Xiaohan Wang , Yuhui Zhang , Hao Zhu , Serena Yeung-Levy

A plethora of vector-space representations for words is currently available, which is growing. These consist of fixed-length vectors containing real values, which represent a word. The result is a representation upon which the power of many…

Computation and Language · Computer Science 2016-08-09 Leon Derczynski

Transformers are built upon multi-head scaled dot-product attention and positional encoding, which aim to learn the feature representations and token dependencies. In this work, we focus on enhancing the distinctive representation by…

Computer Vision and Pattern Recognition · Computer Science 2022-07-12 Litao Yu , Jian Zhang

While Word2Vec represents words (in text) as vectors carrying semantic information, audio Word2Vec was shown to be able to represent signal segments of spoken words as vectors carrying phonetic structure information. Audio Word2Vec can be…

Computation and Language · Computer Science 2018-08-08 Yu-Hsuan Wang , Hung-yi Lee , Lin-shan Lee

Behavior Trees (BTs) are high-level controllers that are useful in a variety of planning tasks and are gaining traction in robotic mission planning. As they gain popularity in safety-critical domains, it is important to formalize their…

Robotics · Computer Science 2024-11-22 Serena S. Serbinowska , Preston Robinette , Gabor Karsai , Taylor T. Johnson

Data-driven representation learning for words is a technique of central importance in NLP. While indisputably useful as a source of features in downstream tasks, such vectors tend to consist of uninterpretable components whose relationship…

Computation and Language · Computer Science 2015-06-18 Manaal Faruqui , Chris Dyer

Recent TTS models with decoder-only Transformer architecture, such as SPEAR-TTS and VALL-E, achieve impressive naturalness and demonstrate the ability for zero-shot adaptation given a speech prompt. However, such decoder-only TTS models…

Audio and Speech Processing · Electrical Eng. & Systems 2025-03-17 Chenpeng Du , Yiwei Guo , Hankun Wang , Yifan Yang , Zhikang Niu , Shuai Wang , Hui Zhang , Xie Chen , Kai Yu

Transformers are ubiquitous models in the natural language processing (NLP) community and have shown impressive empirical successes in the past few years. However, little is understood about how they reason and the limits of their…

Computation and Language · Computer Science 2024-03-18 Michael Rizvi , Maude Lizaire , Clara Lacroce , Guillaume Rabusseau