1 code implementation • ICLR 2021 • Balázs Kégl, Gabriel Hurtado, Albert Thomas
We contribute to micro-data model-based reinforcement learning (MBRL) by rigorously comparing popular generative models using a fixed (random shooting) control agent.
no code implementations • 3 May 2017 • Stephan Clémençon, Albert Thomas
Here we formulate the issue of scoring anomalies as a M-estimation problem by means of a novel functional performance criterion, referred to as the Mass Volume curve (MV curve in short), whose optimal elements are strictly increasing transforms of the density almost everywhere on the support of the density.
no code implementations • 30 Aug 2015 • Albert Thomas, Vincent Feuillard, Alexandre Gramfort
Our approach makes it possible to tune the hyperparameters automatically and obtain nested set estimates.
no code implementations • 21 Jan 2019 • Igor Colin, Albert Thomas, Moez Draief
As cellular networks become denser, a scalable and dynamic tuning of wireless base station parameters can only be achieved through automated optimization.
no code implementations • 14 Dec 2020 • Geovani Rizk, Albert Thomas, Igor Colin, Rida Laraki, Yann Chevaleyre
We study the best arm identification problem in which the learner wants to find the graph allocation maximizing the sum of the bilinear rewards.
no code implementations • 22 Dec 2020 • Geovani Rizk, Igor Colin, Albert Thomas, Moez Draief
Experimental design is an approach for selecting samples among a given set so as to obtain the best estimator for a given criterion.
no code implementations • 29 Sep 2021 • Albert Thomas, Balázs Kégl, Othman Gaizi, Gabriel Hurtado
Iterated batch reinforcement learning (RL) is a growing subfield fueled by the demand from systems engineers for intelligent control solutions that they can apply within their technical and organizational constraints.
no code implementations • 1 Jun 2022 • Geovani Rizk, Igor Colin, Albert Thomas, Rida Laraki, Yann Chevaleyre
We propose the first regret-based approach to the Graphical Bilinear Bandits problem, where $n$ agents in a graph play a stochastic bilinear bandit game with each of their neighbors.
no code implementations • 20 Jun 2022 • Giuseppe Paolo, Jonas Gonzalez-Billandon, Albert Thomas, Balázs Kégl
In the last decade, reinforcement learning successfully solved complex control tasks and decision-making problems, like the Go board game.
no code implementations • 9 Oct 2023 • Abdelhakim Benechehab, Giuseppe Paolo, Albert Thomas, Maurizio Filippone, Balázs Kégl
In model-based reinforcement learning (MBRL), most algorithms rely on simulating trajectories from one-step dynamics models learned on data.
Model-based Reinforcement Learning reinforcement-learning +1
no code implementations • 5 Feb 2024 • Abdelhakim Benechehab, Albert Thomas, Giuseppe Paolo, Maurizio Filippone, Balázs Kégl
In model-based reinforcement learning, most algorithms rely on simulating trajectories from one-step models of the dynamics learned on data.
no code implementations • 5 Feb 2024 • Abdelhakim Benechehab, Albert Thomas, Balázs Kégl
We consider the problem of offline reinforcement learning where only a set of system transitions is made available for policy optimization.
no code implementations • 8 Feb 2024 • Alexandre Rio, Merwan Barlier, Igor Colin, Albert Thomas
We address offline reinforcement learning with privacy guarantees, where the goal is to train a policy that is differentially private with respect to individual trajectories in the dataset.