Recurrent Relational Networks episode artwork

EPISODE · Feb 15, 2019 · 19 MIN

Recurrent Relational Networks

from Data Skeptic · host Kyle Polich with guest Rasmus Berg Palm

One of the most challenging NLP tasks is natural language understanding and reasoning. How can we construct algorithms that are able to achieve human level understanding of text and be able to answer general questions about it? This is truly an open problem, and one with the bAbI dataset has been constructed to facilitate. bAbI presents a variety of different language understanding and reasoning tasks and exists as benchmark for comparing approaches. In this episode, Kyle talks to Rasmus Berg Palm about his recent paper Recurrent Relational Networks

Episode metadata supplied by the publisher feed · Published Feb 15, 2019

Embed this episode

Ready to play

Recurrent Relational Networks

0:00 19:13

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Data Skeptic?

This episode is 19 minutes long.

When was this Data Skeptic episode published?

This episode was published on February 15, 2019.

Can I download this Data Skeptic episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!