3 citations · 6 across the 14 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.LG2025
Tail Distribution of Regret in Optimistic Reinforcement Learning
Sajad Khodadadian, Mehrdad Moharrami
We derive instance-dependent tail bounds for the regret of optimism-based reinforcement learning in finite-horizon tabular Markov decision processes with unknown transition dynamic…
cs.DS2025
The Planted Spanning Tree Problem
Mehrdad Moharrami, Cristopher Moore, Jiaming Xu
We study the problem of detecting and recovering a planted spanning tree hidden within a complete, randomly weighted graph . Specifically, each edge has a non-nega…