{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3OGLBMVMBID7EPKJLE43WKBAWS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2e125be7fdf6638ceb9756bfc4aea2683f2152a631e2701600d42e4b1ba7ab64","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-13T00:18:45Z","title_canon_sha256":"17be86dadc5c939e274173c430c46465eab872612d4dd4f4af5b46ca7f8d8fce"},"schema_version":"1.0","source":{"id":"1907.05980","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05980","created_at":"2026-07-05T02:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05980v2","created_at":"2026-07-05T02:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05980","created_at":"2026-07-05T02:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"3OGLBMVMBID7","created_at":"2026-07-05T02:26:45Z"},{"alias_kind":"pith_short_16","alias_value":"3OGLBMVMBID7EPKJ","created_at":"2026-07-05T02:26:45Z"},{"alias_kind":"pith_short_8","alias_value":"3OGLBMVM","created_at":"2026-07-05T02:26:45Z"}],"graph_snapshots":[{"event_id":"sha256:513492064b5c503d16eb2c604ef086572c10f2b1dd42e2f9d816380958b68592","target":"graph","created_at":"2026-07-05T02:26:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.05980/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose two algorithms for the solution of the optimal control of ergodic McKean-Vlasov dynamics. Both algorithms are based on approximations of the theoretical solutions by neural networks, the latter being characterized by their architecture and a set of parameters. This allows the use of modern machine learning tools, and efficient implementations of stochastic gradient descent.The first algorithm is based on the idiosyncrasies of the ergodic optimal control problem. We provide a mathematical proof of the convergence of the approximation scheme, and we analyze rigorously the approximatio","authors_text":"Mathieu Lauri\\`ere, Ren\\'e Carmona","cross_cats":["cs.LG","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-13T00:18:45Z","title":"Convergence Analysis of Machine Learning Algorithms for the Numerical Solution of Mean Field Control and Games: I -- The Ergodic Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05980","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ce43521adf93758bbcf597e828fc7c0a4576fc38bf0c7f5776b555fed86ef3a9","target":"record","created_at":"2026-07-05T02:26:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2e125be7fdf6638ceb9756bfc4aea2683f2152a631e2701600d42e4b1ba7ab64","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-13T00:18:45Z","title_canon_sha256":"17be86dadc5c939e274173c430c46465eab872612d4dd4f4af5b46ca7f8d8fce"},"schema_version":"1.0","source":{"id":"1907.05980","kind":"arxiv","version":2}},"canonical_sha256":"db8cb0b2ac0a07f23d495939bb2820b494928254e8c211a551919e5277685776","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db8cb0b2ac0a07f23d495939bb2820b494928254e8c211a551919e5277685776","first_computed_at":"2026-07-05T02:26:45.740392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:26:45.740392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QK0hoJZwRPFiFhp05itaEYWJKyHTG6I17K9l8oVWONLbbHkHiCKy2aYe5iRi049ke7tc7sOFCzUvd3AW7s4jCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:26:45.740871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.05980","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce43521adf93758bbcf597e828fc7c0a4576fc38bf0c7f5776b555fed86ef3a9","sha256:513492064b5c503d16eb2c604ef086572c10f2b1dd42e2f9d816380958b68592"],"state_sha256":"80ae912f1f7515695142400c380943e37f54a4c7ef67f84176312b3acc377ef9"}