Mean-Field Generalisation Bounds for Learning Controls in Stochastic Environments
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909748671021056 |
|---|---|
| author | Baros, Boris Cohen, Samuel N. Reisinger, Christoph |
| author_facet | Baros, Boris Cohen, Samuel N. Reisinger, Christoph |
| contents | We consider a data-driven formulation of the classical discrete-time stochastic control problem. Our approach exploits the natural structure of many such problems, in which significant portions of the system are uncontrolled. Employing the dynamic programming principle and the mean-field interpretation of single-hidden layer neural networks, we formulate the control problem as a series of infinite-dimensional minimisation problems. When regularised carefully, we provide practically verifiable assumptions for non-asymptotic bounds on the generalisation error achieved by the minimisers to this problem, thus ensuring stability in overparametrised settings, for controls learned using finitely many observations. We explore connections to the traditional noisy stochastic gradient descent algorithm, and subsequently show promising numerical results for some classic control problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_16001 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Mean-Field Generalisation Bounds for Learning Controls in Stochastic Environments Baros, Boris Cohen, Samuel N. Reisinger, Christoph Optimization and Control Machine Learning We consider a data-driven formulation of the classical discrete-time stochastic control problem. Our approach exploits the natural structure of many such problems, in which significant portions of the system are uncontrolled. Employing the dynamic programming principle and the mean-field interpretation of single-hidden layer neural networks, we formulate the control problem as a series of infinite-dimensional minimisation problems. When regularised carefully, we provide practically verifiable assumptions for non-asymptotic bounds on the generalisation error achieved by the minimisers to this problem, thus ensuring stability in overparametrised settings, for controls learned using finitely many observations. We explore connections to the traditional noisy stochastic gradient descent algorithm, and subsequently show promising numerical results for some classic control problems. |
| title | Mean-Field Generalisation Bounds for Learning Controls in Stochastic Environments |
| topic | Optimization and Control Machine Learning |
| url | https://arxiv.org/abs/2508.16001 |