Showing math.OCShow all
3 papers · 1 filter
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…
math.OC2025
Stochastic Halpern iteration in normed spaces and applications to reinforcement learning
Mario Bravo, Juan Pablo Contreras
We analyze the oracle complexity of the stochastic Halpern iteration with minibatch, where we aim to approximate fixed-points of nonexpansive and contractive operators in a normed…