activity
20172021
most citedLearning Deterministic Weighted Automata with Queries and Counterexamples

23 citations · 44 across the 4 of their papers we have counts for

collaborators

14 papers

cs.LG202111 cited

Thinking Like Transformers

Gail Weiss, Yoav Goldberg, Eran Yahav

What is the computational model behind a Transformer? Where recurrent neural networks have direct parallels in finite state machines, allowing clear discussion and thought around a…

cs.LG2020

On the Bottleneck of Graph Neural Networks and its Practical Implications

Uri Alon, Eran Yahav

Since the proposal of the graph neural network (GNN) by Gori et al. (2005) and Scarselli et al. (2008), one of the major problems in training GNNs was their struggle to propagate i…

cs.PL2020

A Structural Model for Contextual Code Changes

Shaked Brody, Uri Alon, Eran Yahav

We address the problem of predicting edit completions based on a learned model that was trained on past edits. Given a code snippet that is partially edited, our goal is to predict…

cs.CL2020

A Formal Hierarchy of RNN Architectures

William Merrill, Gail Weiss, Yoav Goldberg +3

We develop a formal hierarchy of the expressive capacity of RNN architectures. The hierarchy is based on two formal properties: space complexity, which measures the RNN's memory, a…

cs.LG201923 cited

Learning Deterministic Weighted Automata with Queries and Counterexamples

Gail Weiss, Yoav Goldberg, Eran Yahav

We present an algorithm for extraction of a probabilistic deterministic finite automaton (PDFA) from a given black-box language model, such as a recurrent neural network (RNN). The…

cs.LG2019

Adversarial Examples for Models of Code

Noam Yefet, Uri Alon, Eran Yahav

Neural models of code have shown impressive results when performing tasks such as predicting method names and identifying certain kinds of bugs. We show that these models are vulne…