default search action
Edouard Leurent
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i13]Kaiwen Wang, Rahul Kidambi, Ryan Sullivan, Alekh Agarwal, Christoph Dann, Andrea Michi, Marco Gelmi, Yunxuan Li, Raghav Gupta, Avinava Dubey, Alexandre Ramé, Johan Ferret, Geoffrey Cideron, Le Hou, Hongkun Yu, Amr Ahmed, Aranyak Mehta, Léonard Hussenot, Olivier Bachem, Edouard Leurent:
Conditioned Language Policy: A General Framework for Steerable Multi-Objective Finetuning. CoRR abs/2407.15762 (2024) - 2023
- [j1]Daniel J. Mankowitz, Andrea Michi, Anton Zhernov, Marco Gelmi, Marco Selvi, Cosmin Paduraru, Edouard Leurent, Shariq Iqbal, Jean-Baptiste Lespiau, Alex Ahern, Thomas Köppe, Kevin Millikin, Stephen Gaffney, Sophie Elster, Jackson Broshear, Chris Gamble, Kieran Milan, Robert Tung, Minjae Hwang, A. Taylan Cemgil, Mohammadamin Barekatain, Yujia Li, Amol Mandhane, Thomas Hubert, Julian Schrittwieser, Demis Hassabis, Pushmeet Kohli, Martin A. Riedmiller, Oriol Vinyals, David Silver:
Faster sorting algorithms discovered using deep reinforcement learning. Nat. 618(7964): 257-263 (2023) - [i12]Pengming Wang, Mikita Sazanovich, Berkin Ilbeyi, Phitchaya Mangpo Phothilimthana, Manish Purohit, Han Yang Tay, Ngân Vu, Miaosen Wang, Cosmin Paduraru, Edouard Leurent, Anton Zhernov, Julian Schrittwieser, Thomas Hubert, Robert Tung, Paula Kurylowicz, Kieran Milan, Oriol Vinyals, Daniel J. Mankowitz:
Optimizing Memory Mapping Using Deep Reinforcement Learning. CoRR abs/2305.07440 (2023) - [i11]Tom Zahavy, Vivek Veeriah, Shaobo Hou, Kevin Waugh, Matthew Lai, Edouard Leurent, Nenad Tomasev, Lisa Schut, Demis Hassabis, Satinder Singh:
Diversifying AI: Towards Creative Chess with AlphaZero. CoRR abs/2308.09175 (2023) - 2022
- [c10]Pierre Schegg, Jérémie Dequidt, Eulalie Coevoet, Edouard Leurent, Rémi Sabatier, Philippe Preux, Christian Duriez:
Automated Planning for Robotic Guidewire Navigation in the Coronary Arteries. RoboSoft 2022: 239-246 - 2021
- [c9]Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Edouard Leurent, Michal Valko:
Adaptive Reward-Free Exploration. ALT 2021: 865-891 - [c8]Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Emilie Kaufmann, Edouard Leurent, Michal Valko:
Fast active learning for pure exploration in reinforcement learning. ICML 2021: 7599-7608 - 2020
- [b1]Edouard Leurent:
Safe and Efficient Reinforcement Learning for Behavioural Planning in Autonomous Driving. (Apprentissage par renforcement sûr et efficace pour la planification comportementale en conduite autonome). University of Lille, France, 2020 - [c7]Edouard Leurent, Odalric-Ambrym Maillard:
Monte-Carlo Graph Search: the Value of Merging Similar States. ACML 2020: 577-592 - [c6]Edouard Leurent, Denis V. Efimov, Odalric-Ambrym Maillard:
Robust-Adaptive Interval Predictive Control for Linear Uncertain Systems. CDC 2020: 1429-1434 - [c5]Anders Jonsson, Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Edouard Leurent, Michal Valko:
Planning in Markov Decision Processes with Gap-Dependent Sample Complexity. NeurIPS 2020 - [c4]Edouard Leurent, Odalric-Ambrym Maillard, Denis V. Efimov:
Robust-Adaptive Control of Linear Systems: beyond Quadratic Costs. NeurIPS 2020 - [i10]Edouard Leurent, Denis V. Efimov, Odalric-Ambrym Maillard:
Robust Estimation, Prediction and Control with Linear Dynamics and Generic Costs. CoRR abs/2002.10816 (2020) - [i9]Anders Jonsson, Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Edouard Leurent, Michal Valko:
Planning in Markov Decision Processes with Gap-Dependent Sample Complexity. CoRR abs/2006.05879 (2020) - [i8]Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Edouard Leurent, Michal Valko:
Adaptive Reward-Free Exploration. CoRR abs/2006.06294 (2020) - [i7]Edouard Leurent, Denis V. Efimov, Odalric-Ambrym Maillard:
Robust-Adaptive Interval Predictive Control for Linear Uncertain Systems. CoRR abs/2007.10401 (2020) - [i6]Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Emilie Kaufmann, Edouard Leurent, Michal Valko:
Fast active learning for pure exploration in reinforcement learning. CoRR abs/2007.13442 (2020)
2010 – 2019
- 2019
- [c3]Edouard Leurent, Denis V. Efimov, Tarek Raïssi, Wilfrid Perruquetti:
Interval Prediction for Continuous-Time Systems with Parametric Uncertainties. CDC 2019: 7049-7054 - [c2]Nicolas Carrara, Edouard Leurent, Romain Laroche, Tanguy Urvoy, Odalric-Ambrym Maillard, Olivier Pietquin:
Budgeted Reinforcement Learning in Continuous State Space. NeurIPS 2019: 9295-9305 - [c1]Edouard Leurent, Odalric-Ambrym Maillard:
Practical Open-Loop Optimistic Planning. ECML/PKDD (3) 2019: 69-85 - [i5]Edouard Leurent, Yann Blanco, Denis V. Efimov, Odalric-Ambrym Maillard:
Approximate Robust Control of Uncertain Dynamical Systems. CoRR abs/1903.00220 (2019) - [i4]Nicolas Carrara, Edouard Leurent, Romain Laroche, Tanguy Urvoy, Odalric-Ambrym Maillard, Olivier Pietquin:
Scaling up budgeted reinforcement learning. CoRR abs/1903.01004 (2019) - [i3]Edouard Leurent, Odalric-Ambrym Maillard:
Practical Open-Loop Optimistic Planning. CoRR abs/1904.04700 (2019) - [i2]Edouard Leurent, Denis V. Efimov, Tarek Raïssi, Wilfrid Perruquetti:
Interval Prediction for Continuous-Time Systems with Parametric Uncertainties. CoRR abs/1904.04727 (2019) - [i1]Edouard Leurent, Jean Mercat:
Social Attention for Autonomous Decision-Making in Dense Traffic. CoRR abs/1911.12250 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint