69 citations · 111 across the 6 of their papers we have counts for
8 papers
How to transfer algorithmic reasoning knowledge to learn new algorithms?
Louis-Pascal A. C. Xhonneux, Andreea Deac, Petar Velickovic +1
Learning to execute algorithms is a fundamental problem that has been widely studied. Prior work~\cite{veli19neural} has shown that to enable systematic generalisation on graph alg…
Neural Algorithmic Reasoners are Implicit Planners
Andreea Deac, Petar Veličković, Ognjen Milinković +3
Implicit planning has emerged as an elegant technique for combining learned models of the world with end-to-end model-free reinforcement learning. We study the class of implicit pl…
Neural message passing for joint paratope-epitope prediction
Alice Del Vecchio, Andreea Deac, Pietro Liò +1
Antibodies are proteins in the immune system which bind to antigens to detect and neutralise them. The binding sites in an antibody-antigen interaction are known as the paratope an…
Large-scale graph representation learning with very deep GNNs and self-supervision
Ravichandra Addanki, Peter W. Battaglia, David Budden +8
Effectively and efficiently deploying graph neural networks (GNNs) at scale remains one of the most challenging aspects of graph representation learning. Many powerful solutions ha…
XLVIN: eXecuted Latent Value Iteration Nets
Andreea Deac, Petar Veličković, Ognjen Milinković +3
Value Iteration Networks (VINs) have emerged as a popular method to incorporate planning algorithms within deep reinforcement learning, enabling performance improvements on tasks r…
Graph neural induction of value iteration
Andreea Deac, Pierre-Luc Bacon, Jian Tang
Many reinforcement learning tasks can benefit from explicit planning based on an internal model of the environment. Previously, such planning components have been incorporated thro…