Replicable Reinforcement Learning

05/24/2023
by   Eric Eaton, et al.
0

The replicability crisis in the social, behavioral, and data sciences has led to the formulation of algorithm frameworks for replicability – i.e., a requirement that an algorithm produce identical outputs (with high probability) when run on two different samples from the same underlying distribution. While still in its infancy, provably replicable algorithms have been developed for many fundamental tasks in machine learning and statistics, including statistical query learning, the heavy hitters problem, and distribution testing. In this work we initiate the study of replicable reinforcement learning, providing a provably replicable algorithm for parallel value iteration, and a provably replicable version of R-max in the episodic setting. These are the first formal replicability results for control problems, which present different challenges for replication than batch learning settings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2023

Smoothed Q-learning

In Reinforcement Learning the Q-learning algorithm provably converges to...
research
07/12/2019

Learning Self-Correctable Policies and Value Functions from Demonstrations with Negative Sampling

Imitation learning, followed by reinforcement learning algorithms, is a ...
research
06/18/2020

Provably adaptive reinforcement learning in metric spaces

We study reinforcement learning in continuous state and action spaces en...
research
03/01/2018

On Polynomial Time PAC Reinforcement Learning with Rich Observations

We study the computational tractability of provably sample-efficient (PA...
research
11/27/2020

A survey of benchmarking frameworks for reinforcement learning

Reinforcement learning has recently experienced increased prominence in ...
research
11/24/2021

A Classical Algorithm Which Also Beats 1/2+2/π1/√(D) For High Girth MAX-CUT

We give a simple classical algorithm which provably achieves the perform...
research
10/03/2022

Offline Reinforcement Learning with Differentiable Function Approximation is Provably Efficient

Offline reinforcement learning, which aims at optimizing sequential deci...

Please sign up or login with your details

Forgot password? Click here to reset