Numerical approximation of McKean-Vlasov SDEs via stochastic gradient descent
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908777333129216 |
|---|---|
| author | Agarwal, Ankush Amato, Andrea Reis, Goncalo dos Pagliarani, Stefano |
| author_facet | Agarwal, Ankush Amato, Andrea Reis, Goncalo dos Pagliarani, Stefano |
| contents | We propose a novel approach to numerically approximate McKean-Vlasov stochastic differential equations (MV-SDE) using stochastic gradient descent (SGD) while avoiding the use of interacting particle systems (IPS) {and the associated simulation costs required to achieve the ``propagation of chaos'' limit}. The SGD technique is deployed to solve a Euclidean minimization problem, obtained by first representing the MV-SDE as a minimization problem over the set of continuous functions of time, and then approximating the domain with a finite-dimensional subspace. Convergence is established by proving certain intermediate stability and moment estimates of the relevant stochastic processes, including the tangent processes. Numerical experiments illustrate the competitive performance of our SGD based method compared to the IPS benchmarks. This work offers a theoretical foundation for using the SGD method in the context of numerical approximation of MV-SDEs, and provides analytical tools to study its stability and convergence. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_13579 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Numerical approximation of McKean-Vlasov SDEs via stochastic gradient descent Agarwal, Ankush Amato, Andrea Reis, Goncalo dos Pagliarani, Stefano Numerical Analysis Probability We propose a novel approach to numerically approximate McKean-Vlasov stochastic differential equations (MV-SDE) using stochastic gradient descent (SGD) while avoiding the use of interacting particle systems (IPS) {and the associated simulation costs required to achieve the ``propagation of chaos'' limit}. The SGD technique is deployed to solve a Euclidean minimization problem, obtained by first representing the MV-SDE as a minimization problem over the set of continuous functions of time, and then approximating the domain with a finite-dimensional subspace. Convergence is established by proving certain intermediate stability and moment estimates of the relevant stochastic processes, including the tangent processes. Numerical experiments illustrate the competitive performance of our SGD based method compared to the IPS benchmarks. This work offers a theoretical foundation for using the SGD method in the context of numerical approximation of MV-SDEs, and provides analytical tools to study its stability and convergence. |
| title | Numerical approximation of McKean-Vlasov SDEs via stochastic gradient descent |
| topic | Numerical Analysis Probability |
| url | https://arxiv.org/abs/2310.13579 |