2 papers
math.OC2026
Minimax-optimal Halpern iterations for Lipschitz maps
Mario Bravo, Roberto Cominetti, Jongmin Lee
This paper investigates the minimax-optimality of Halpern fixed-point iterations for Lipschitz maps in general normed spaces. Starting from an a priori bound on the orbit of iterat…
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…