Search Results for author: Mateusz B. Majka

Found 7 papers, 1 papers with code

Non-convex entropic mean-field optimization via Best Response flow

no code implementations28 May 2025 Razvan-Andrei Lascu, Mateusz B. Majka

We study the problem of minimizing non-convex functionals on the space of probability measures, regularized by the relative entropy (KL divergence) with respect to a fixed reference measure, as well as the corresponding problem of solving entropy-regularized non-convex-non-concave min-max problems.

Linear convergence of proximal descent schemes on the Wasserstein space

no code implementations22 Nov 2024 Razvan-Andrei Lascu, Mateusz B. Majka, David Šiška, Łukasz Szpruch

Since the relative entropy is not Wasserstein differentiable, we prove that along the scheme the iterates belong to a certain class of Sobolev regularity, and hence the relative entropy $\operatorname{KL}(\cdot|\pi)$ has a unique Wasserstein sub-gradient, and that the relative Fisher information is indeed finite.

LEMMA

A Fisher-Rao gradient flow for entropic mean-field min-max games

no code implementations24 May 2024 Razvan-Andrei Lascu, Mateusz B. Majka, Łukasz Szpruch

Gradient flows play a substantial role in addressing many machine learning problems.

Mirror Descent-Ascent for mean-field min-max problems

no code implementations12 Feb 2024 Razvan-Andrei Lascu, Mateusz B. Majka, Łukasz Szpruch

We study two variants of the mirror descent-ascent algorithm for solving min-max problems on the space of measures: simultaneous and sequential.

Multi-index Antithetic Stochastic Gradient Algorithm

1 code implementation10 Jun 2020 Mateusz B. Majka, Marc Sabate-Vidales, Łukasz Szpruch

In this paper, we construct a Multi-index Antithetic Stochastic Gradient Algorithm (MASGA) whose implementation is independent of the structure of the target measure and which achieves performance on par with Monte Carlo estimators that have access to unbiased samples from the distribution of interest.

Non-asymptotic bounds for sampling algorithms without log-concavity

no code implementations21 Aug 2018 Mateusz B. Majka, Aleksandar Mijatović, Lukasz Szpruch

Finally, we provide a weak convergence analysis that covers both the standard and the randomised (inaccurate) drift case.

Multilevel Monte Carlo methods for the approximation of invariant measures of stochastic differential equations

no code implementations4 May 2016 Michael B. Giles, Mateusz B. Majka, Lukasz Szpruch, Sebastian Vollmer, Konstantinos Zygalakis

We show that this is the first stochastic gradient MCMC method with complexity $\mathcal{O}(\varepsilon^{-2}|\log {\varepsilon}|^{3})$, in contrast to the complexity $\mathcal{O}(\varepsilon^{-3})$ of currently available methods.

Cannot find the paper you are looking for? You can Submit a new open access paper.