3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.LG2024
Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
Asaf Cassel, Haipeng Luo, Aviv Rosenberg +1
In many real-world applications, it is hard to provide a reward signal in each step of a Reinforcement Learning (RL) process and more natural to give feedback when an episode ends.…
cs.LG2023
Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback
Tal Lancewicki, Aviv Rosenberg, Dmitry Sotnikov
Policy Optimization (PO) is one of the most popular methods in Reinforcement Learning (RL). Thus, theoretical guarantees for PO algorithms have become especially important to the R…
math.CO2011★ 3 cited
All-Pairs Shortest Paths in time with high probability
Yuval Peres, Dimitry Sotnikov, Benny Sudakov +1
We present an all-pairs shortest path algorithm whose running time on a complete directed graph on vertices whose edge weights are chosen independently and uniformly at random…