pith. machine review for the scientific record. sign in

arxiv: 1706.06383 · v1 · pith:3IQ7HYX7new · submitted 2017-06-20 · 💻 cs.AI · cs.NE· stat.ML

Programmable Agents

Misha Denil , Sergio G\'omez Colmenarejo , Serkan Cabi , David Saxton , Nando de Freitas This is my paper
classification 💻 cs.AI cs.NEstat.ML
keywords agentsexecutegeneralizelanguageprogramsallowbehaviorbuild
0
0 comments X
read the original abstract

We build deep RL agents that execute declarative programs expressed in formal language. The agents learn to ground the terms in this language in their environment, and can generalize their behavior at test time to execute new programs that refer to objects that were not referenced during training. The agents develop disentangled interpretable representations that allow them to generalize to a wide variety of zero-shot semantic tasks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. How Attentive are Graph Attention Networks?

    cs.LG 2021-05 conditional novelty 7.0

    GAT uses static attention where neighbor rankings ignore the query node and thus cannot express some graph problems; GATv2 enables dynamic attention and outperforms GAT on 11 OGB and other benchmarks with equal parameters.

  2. Graph Attention Networks

    stat.ML 2017-10 accept novelty 7.0

    Graph Attention Networks compute learnable attention coefficients over node neighborhoods to produce weighted feature aggregations, achieving state-of-the-art results on citation networks and inductive protein-protein...