activity
20192023
most citedSocial Attention for Autonomous Decision-Making in Dense Traffic

68 citations · 170 across the 10 of their papers we have counts for

collaborators

12 papers

cs.AI2023★ 4 cited

Diversifying AI: Towards Creative Chess with AlphaZero

Tom Zahavy, Vivek Veeriah, Shaobo Hou +7

In recent years, Artificial Intelligence (AI) systems have surpassed human intelligence in a variety of computational tasks. However, AI systems, like humans, make mistakes, have b…

cs.PF2023★ 1 cited

Optimizing Memory Mapping Using Deep Reinforcement Learning

Pengming Wang, Mikita Sazanovich, Berkin Ilbeyi +16

Resource scheduling and allocation is a critical component of many high impact systems ranging from congestion control to cloud computing. Finding more optimal solutions to these p…

eess.SY2020

Robust-Adaptive Interval Predictive Control for Linear Uncertain Systems

Edouard Leurent, Denis Efimov, Odalric-Ambrym Maillard

We consider the problem of stabilization of a linear system, under state and control constraints, and subject to bounded disturbances and unknown parameters in the state matrix. Fi…

cs.LG2020★ 31 cited

Fast active learning for pure exploration in reinforcement learning

Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson +3

Realistic environments often provide agents with very limited feedback. When the environment is initially unknown, the feedback, in the beginning, can be completely absent, and the…

cs.LG2020★ 3 cited

Planning in Markov Decision Processes with Gap-Dependent Sample Complexity

Anders Jonsson, Emilie Kaufmann, Pierre Ménard +3

We propose MDP-GapE, a new trajectory-based Monte-Carlo Tree Search algorithm for planning in a Markov Decision Process in which transitions have a finite support. We prove an uppe…

cs.LG2020★ 10 cited

Adaptive Reward-Free Exploration

Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues +3

Reward-free exploration is a reinforcement learning setting studied by Jin et al. (2020), who address it by running several algorithms with regret guarantees in parallel. In our wo…

cs.LG2020★ 12 cited

Robust-Adaptive Control of Linear Systems: beyond Quadratic Costs

Edouard Leurent, Denis Efimov, Odalric-Ambrym Maillard

We consider the problem of robust and adaptive model predictive control (MPC) of a linear system, with unknown parameters that are learned along the way (adaptive), in a critical s…

cs.LG2019★ 68 cited

Social Attention for Autonomous Decision-Making in Dense Traffic

Edouard Leurent, Jean Mercat

We study the design of learning architectures for behavioural planning in a dense traffic setting. Such architectures should deal with a varying number of nearby vehicles, be invar…

cs.LG2019

Practical Open-Loop Optimistic Planning

Edouard Leurent, Odalric-Ambrym Maillard

We consider the problem of online planning in a Markov Decision Process when given only access to a generative model, restricted to open-loop policies - i.e. sequences of actions -…

eess.SY2019★ 16 cited

Interval Prediction for Continuous-Time Systems with Parametric Uncertainties

Edouard Leurent, Denis Efimov, Tarek Raïssi +1

The problem of behaviour prediction for linear parameter-varying systems is considered in the interval framework. It is assumed that the system is subject to uncertain inputs and t…

cs.LG2019★ 9 cited

Budgeted Reinforcement Learning in Continuous State Space

Nicolas Carrara, Edouard Leurent, Romain Laroche +3

A Budgeted Markov Decision Process (BMDP) is an extension of a Markov Decision Process to critical applications requiring safety constraints. It relies on a notion of risk implemen…

eess.SY2019★ 16 cited

Approximate Robust Control of Uncertain Dynamical Systems

Edouard Leurent, Yann Blanco, Denis Efimov +1

This work studies the design of safe control policies for large-scale non-linear systems operating in uncertain environments. In such a case, the robust control framework is a prin…