activity
20162023
most citedOnline Learning with Feedback Graphs Without the Graphs

22 citations · 90 across the 19 of their papers we have counts for

collaborators

21 papers

cs.LG2023

APART: Diverse Skill Discovery using All Pairs with Ascending Reward and DropouT

Hadar Schreiber Galler, Tom Zahavy, Guillaume Desjardins +1

We study diverse skill discovery in reward-free environments, aiming to discover all possible skills in simple grid-world environments where prior methods have struggled to succeed…

cs.LG2023

Rate-Optimal Policy Optimization for Linear Markov Decision Processes

Uri Sherman, Alon Cohen, Tomer Koren +1

We study regret minimization in online episodic linear Markov Decision Processes, and obtain rate-optimal regret where denotes the number of episodes.…

cs.LG2023

Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation

Orin Levy, Alon Cohen, Asaf Cassel +1

We present the OMG-CMDP! algorithm for regret minimization in adversarial Contextual MDPs. The algorithm operates under the minimal assumptions of realizable function class and acc…

cs.LG2022

Eluder-based Regret for Stochastic Contextual MDPs

Orin Levy, Asaf Cassel, Alon Cohen +1

We present the E-UCRL algorithm for regret minimization in Stochastic Contextual Markov Decision Processes (CMDPs). The algorithm operates under the minimal assumptions of real…

cs.LG2022

Rate-Optimal Online Convex Optimization in Adaptive Linear Control

Asaf Cassel, Alon Cohen, Tomer Koren

We consider the problem of controlling an unknown linear dynamical system under adversarially changing convex costs and full feedback of both the state and cost function. We presen…

math.OC2022

Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics

Asaf Cassel, Alon Cohen, Tomer Koren

We consider the problem of controlling an unknown linear dynamical system under a stochastic convex cost and full feedback of both the state and cost function. We present a computa…