3 papers
math.OC2026
Mirror Descent-Ascent for mean-field min-max problems
Razvan-Andrei Lascu, Mateusz B. Majka, Åukasz Szpruch
We study two variants of the mirror descent-ascent (MDA) algorithm for solving min-max problems on the space of measures: simultaneous and alternating. We work under assumptions of…
cs.LG2026
PPO in the Fisher-Rao geometry
Razvan-Andrei Lascu, David Å iÅ¡ka, Åukasz Szpruch
Proximal Policy Optimization (PPO) is widely used in reinforcement learning due to its strong empirical performance, yet it lacks formal guarantees for policy improvement and conve…
math.OC2024
Linear convergence of proximal descent schemes on the Wasserstein space
Razvan-Andrei Lascu, Mateusz B. Majka, David Šiška +1
We investigate proximal descent methods, inspired by the minimizing movement scheme introduced by Jordan, Kinderlehrer and Otto, for optimizing entropy-regularized functionals on t…