Pith. sign in

REVIEW 1 cited by

Mean-field neural networks-based algorithms for McKean-Vlasov control problems *

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

arxiv 2212.11518 v2 pith:7KSKAROT submitted 2022-12-22 math.OC q-fin.CPstat.ML

classification math.OCq-fin.CPstat.ML
keywords algorithmscontrolmckean-vlasovmean-fieldneuralnumericalproblemsaccuracy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper is devoted to the numerical resolution of McKean-Vlasov control problems via the class of mean-field neural networks introduced in our companion paper [25] in order to learn the solution on the Wasserstein space. We propose several algorithms either based on dynamic programming with control learning by policy or value iteration, or backward SDE from stochastic maximum principle with global or local loss functions. Extensive numerical results on different examples are presented to illustrate the accuracy of each of our eight algorithms. We discuss and compare the pros and cons of all the tested methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Convergence Rates of Time Discretization in Extended Mean Field Control

    math.OC 2025-08 conditional novelty 8.0 of 10

    For linear-convex extended mean field control, piecewise constant controls approximate the optimal cost at rate 1/2 and the optimal control at rate 1/4; under smoothness, the rate improves to 1.

Pith tools