activity
20192026
most citedOnline Convex Optimization in Adversarial Markov Decision Processes

45 citations · 70 across the 17 of their papers we have counts for

collaborators
Showing 2020Show all

5 papers · 1 filter

cs.LG2020

Learning Adversarial Markov Decision Processes with Delayed Feedback

Tal Lancewicki, Aviv Rosenberg, Yishay Mansour

Reinforcement learning typically assumes that agents observe feedback for their actions immediately, but in many real-world applications (like recommendation systems) feedback is o…

cs.LG2020★ 5 cited

Oracle-Efficient Regret Minimization in Factored MDPs with Unknown Structure

Aviv Rosenberg, Yishay Mansour

We study regret minimization in non-episodic factored Markov decision processes (FMDPs), where all existing algorithms make the strong assumption that the factored structure of the…

cs.LG2020

Stochastic Shortest Path with Adversarially Changing Costs

Aviv Rosenberg, Yishay Mansour

Stochastic shortest path (SSP) is a well-known problem in planning and control, in which an agent has to reach a goal state in minimum total expected cost. In this paper we present…

cs.LG2020★ 3 cited

Near-optimal Regret Bounds for Stochastic Shortest Path

Alon Cohen, Haim Kaplan, Yishay Mansour +1

Stochastic shortest path (SSP) is a well-known problem in planning and control, in which an agent has to reach a goal state in minimum total expected cost. In the learning formulat…

cs.LG2020★ 11 cited

Optimistic Policy Optimization with Bandit Feedback

Yonathan Efroni, Lior Shani, Aviv Rosenberg +1

Policy optimization methods are one of the most widely used classes of Reinforcement Learning (RL) algorithms. Yet, so far, such methods have been mostly analyzed from an optimizat…