28 citations · 29 across the 11 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.OC2025
Near-Optimal Sample Complexity for MDPs via Anchoring
Jongmin Lee, Mario Bravo, Roberto Cominetti
We study a new model-free algorithm to compute -optimal policies for average reward Markov decision processes, in the weakly communicating case. Given a generative mod…
stat.ML2025
Mixing Times and Privacy Analysis for the Projected Langevin Algorithm under a Modulus of Continuity
Mario Bravo, Juan P. Flores-Mella, Cristóbal Guzmán
We study the mixing time of the projected Langevin algorithm (LA) and the privacy curve of noisy Stochastic Gradient Descent (SGD), beyond nonexpansive iterations. Specifically, we…