activity
20142026
most citedNoisy Networks for Exploration

570 citations · 2.6k across the 75 of their papers we have counts for

collaborators
Showing 2016Show all

5 papers · 1 filter

cs.CL2016★ 116 cited

Listen and Translate: A Proof of Concept for End-to-End Speech-to-Text Translation

Alexandre Berard, Olivier Pietquin, Christophe Servan +1

This paper proposes a first attempt to build an end-to-end speech-to-text translation system, which does not use source language transcription during learning or decoding. We propo…

cs.AI2016★ 19 cited

GuessWhat?! Visual object discovery through multi-modal dialogue

Harm de Vries, Florian Strub, Sarath Chandar +3

We introduce GuessWhat?!, a two-player guessing game as a testbed for research on the interplay of computer vision and dialogue systems. The goal of the game is to locate an unknow…

cs.GT2016★ 15 cited

Learning Nash Equilibrium for General-Sum Markov Games from Batch Data

Julien Pérolat, Florian Strub, Bilal Piot +1

This paper addresses the problem of learning a Nash equilibrium in -discounted multiplayer general-sum Markov Games (MG). A key component of this model is the possibility for th…

cs.LG2016

Is the Bellman residual a bad proxy?

Matthieu Geist, Bilal Piot, Olivier Pietquin

This paper aims at theoretically and empirically comparing two standard optimization criteria for Reinforcement Learning: i) maximization of the mean value and ii) minimization of…

math.OC2016★ 5 cited

Difference of Convex Functions Programming Applied to Control with Expert Data

Bilal Piot, Matthieu Geist, Olivier Pietquin

This paper reports applications of Difference of Convex functions (DC) programming to Learning from Demonstrations (LfD) and Reinforcement Learning (RL) with expert data. This is m…