activity
20162023
most citedHybrid Reward Architecture for Reinforcement Learning

187 citations · 456 across the 29 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

cs.LG2021

Global Optimality and Finite Sample Analysis of Softmax Off-Policy Actor Critic under State Distribution Mismatch

Shangtong Zhang, Remi Tachet, Romain Laroche

In this paper, we establish the global optimality and convergence rate of an off-policy actor critic algorithm in the tabular setting without using density ratio to correct the dis…

cs.LG2021

Batched Bandits with Crowd Externalities

Romain Laroche, Othmane Safsafi, Raphael Feraud +1

In Batched Multi-Armed Bandits (BMAB), the policy is not allowed to be updated at each time step. Usually, the setting asserts a maximum number of allowed policy updates and the al…

cs.LG2021★ 1 cited

Dr Jekyll and Mr Hyde: the Strange Case of Off-Policy Policy Updates

Romain Laroche, Remi Tachet

The policy gradient theorem states that the policy should only be updated in states that are visited by the current policy, which leads to insufficient planning in the off-policy s…

cs.CL2021

The Emergence of the Shape Bias Results from Communicative Efficiency

Eva Portelance, Michael C. Frank, Dan Jurafsky +2

By the age of two, children tend to assume that new word categories are based on objects' shape, rather than their color or texture; this assumption is called the shape bias. They…

cs.LG2021★ 5 cited

Multi-Objective SPIBB: Seldonian Offline Policy Improvement with Safety Constraints in Finite MDPs

Harsh Satija, Philip S. Thomas, Joelle Pineau +1

We study the problem of Safe Policy Improvement (SPI) under constraints in the offline Reinforcement Learning (RL) setting. We consider the scenario where: (i) we have a dataset co…