Joseph Lazzaro
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Stats ML×1ML×1
Frequent co-authors
Research Timeline
2026
Non-Asymptotic Best Policy Identification Guarantees in Online Reinforcement Learning
This paper provides non-asytotic sample complexity guarantees for the Navigate and Stop algorithm in online tabular Reinforcement Learning, identifying additional attributes that affect the overall sample complexity.
Highlighted terms show continued research focus across papers