REVIEW 3 cited by
Learning algorithms for mean field optimal control
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We analyze an algorithm to numerically solve the mean-field optimal control problems by approximating the optimal feedback controls using neural networks with problem specific architectures. We approximate the model by an $N$-particle system and leverage the exchangeability of the particles to obtain substantial computational efficiency. In addition to several numerical examples, a convergence analysis is provided. We also developed a universal approximation theorem on Wasserstein spaces.
Forward citations
Cited by 3 Pith papers
-
Iterative Schemes for Markov Perfect Equilibria
Picard and weighted Picard best-response iterations converge geometrically to the unique Markov perfect equilibrium in symmetric finite-state continuous-time games, with no Lasry-Lions monotonicity needed.
-
Actor-Critic Learning for Extended Mean Field Control with Deterministic Policies
Model-free deterministic policy gradients and a continuous-time deep actor-critic algorithm solve extended mean-field control problems whose dynamics and rewards depend on the joint state-control law.
-
Neural feedback approximation for stochastic control with degenerate diffusions: error estimates and numerical analysis
Direct neural feedback learning for time-discrete stochastic control admits an averaged value-error bound without transition-density assumptions, covering degenerate and deterministic dynamics.
Discussion (0). Continue with ORCID to comment.