Mean Field Game GAN

03/14/2021
by   Shaojun Ma, et al.
0

We propose a novel mean field games (MFGs) based GAN(generative adversarial network) framework. To be specific, we utilize the Hopf formula in density space to rewrite MFGs as a primal-dual problem so that we are able to train the model via neural networks and samples. Our model is flexible due to the freedom of choosing various functionals within the Hopf formula. Moreover, our formulation mathematically avoids Lipschitz-1 constraint. The correctness and efficiency of our method are validated through several experiments.

READ FULL TEXT
research
07/29/2020

Ergodicity of the underdamped mean-field Langevin dynamics

We study the long time behavior of an underdamped mean-field Langevin (M...
research
01/14/2020

Numerical methods for mean-field stochastic differential equations with jumps

In this paper, we are devoted to the numerical methods for mean-field st...
research
04/06/2020

Game on Random Environement, Mean-field Langevin System and Neural Networks

In this paper we study a type of games regularized by the relative entro...
research
04/06/2020

Game on Random Environment, Mean-field Langevin System and Neural Networks

In this paper we study a type of games regularized by the relative entro...
research
11/18/2018

GAN-QP: A Novel GAN Framework without Gradient Vanishing and Lipschitz Constraint

We know SGAN may have a risk of gradient vanishing. A significant improv...
research
06/30/2022

Bridging Mean-Field Games and Normalizing Flows with Trajectory Regularization

Mean-field games (MFGs) are a modeling framework for systems with a larg...
research
01/07/2023

Deep Learning for Mean Field Games with non-separable Hamiltonians

This paper introduces a new method based on Deep Galerkin Methods (DGMs)...

Please sign up or login with your details

Forgot password? Click here to reset