Skip to content

Author

Joseph Lazzaro

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

Non-Asymptotic Best Policy Identification Guarantees in Online Reinforcement Learning

This work provides the first non-asymptotic sample complexity guarantees for NaS, showing that its sample complexity depends not only on the characteristic time, but also on the connectivity of the underlying MDP, the curvature of the optimal characteristic time, and other instance-dependent quantities.

Joseph Lazzaro, Alessio Russo, Aldo Pacchiano · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.