118 citations · 148 across the 21 of their papers we have counts for
4 papers · 1 filter
Provably Efficient Exploration in Reward Machines with Low Regret
Hippolyte Bourel, Anders Jonsson, Odalric-Ambrym Maillard +2
We study reinforcement learning (RL) for decision processes with non-Markovian reward, in which high-level knowledge of the task in the form of reward machines is available to the…
Near-Optimal Reinforcement Learning with Shuffle Differential Privacy
Shaojie Bai, Mohammad Sadegh Talebi, Chengcheng Zhao +2
Reinforcement learning (RL) is a powerful tool for sequential decision-making, but its application is often hindered by privacy concerns arising from its interaction data. This cha…
Tractable Offline Learning of Regular Decision Processes
Ahana Deb, Roberto Cipollone, Anders Jonsson +2
This work studies offline Reinforcement Learning (RL) in a class of non-Markovian environments called Regular Decision Processes (RDPs). In RDPs, the unknown dependency of future o…
How to Shrink Confidence Sets for Many Equivalent Discrete Distributions?
Odalric-Ambrym Maillard, Mohammad Sadegh Talebi
We consider the situation when a learner faces a set of unknown discrete distributions defined over a common alphabet , and can build for each…