← Search

Evrard Garcelon

7 accepted papers

2022

A Reduction-Based Framework for Conservative Bandits and Reinforcement Learning

ICLR 2022poster

We study bandits and reinforcement learning (RL) subject to a conservative constraint where the agent is asked to perform at least as well as a given baseline policy. This setting is particular relevant in real-world domains including digital marketing, healthcare, production, finance, etc. In this…

Cited by 7SourcePDFScholar
2022

Top K Ranking for Multi-Armed Bandit with Noisy Evaluations

AISTATS 2022poster

We consider a multi-armed bandit setting where, at the beginning of each round, the learner receives noisy independent, and possibly biased, evaluations of the true reward of each arm and it selects $K$ arms with the objective of accumulating as much reward as possible over $T$ rounds. Under the ass…

Cited by 8SourcePDFScholar
2021

Local Differential Privacy for Regret Minimization in Reinforcement Learning

NeurIPS 2021poster

Reinforcement learning algorithms are widely used in domains where it is desirable to provide a personalized service. In these domains it is common that user data contains sensitive information that needs to be protected from third parties. Motivated by this, we study privacy in the context of finit…

Cited by 52SourcePDFScholar
2020

Adversarial Attacks on Linear Contextual Bandits

NeurIPS 2020poster

Contextual bandit algorithms are applied in a wide range of domains, from advertising to recommender systems, from clinical trials to education. In many of these domains, malicious agents may have incentives to force a bandit algorithm into a desired behavior For instance, an unscrupulous ad publish…

Cited by 68SourcePDFScholar
2020

Conservative Exploration in Reinforcement Learning

AISTATS 2020poster

While learning in an unknown Markov Decision Process (MDP), an agent should trade off exploration to discover new information about the MDP, and exploitation of the current knowledge to maximize the reward. Although the agent will eventually learn a good or optimal policy, there is no guarantee on t…

Cited by 34SourcePDFScholar
2020

No-Regret Exploration in Goal-Oriented Reinforcement Learning

ICML 2020poster

Many popular reinforcement learning problems (e.g., navigation in a maze, some Atari games, mountain car) are instances of the episodic setting under its stochastic shortest path (SSP) formulation, where an agent has to achieve a goal state while minimizing the cumulative cost. Despite the popularit…

Cited by 48SourcePDFScholar