Efficient time stepping for numerical integration using reinforcement learning
M. Dellnitz, E. Hüllermeier, M. Lücke, S. Ober-Blöbaum, C. Offen, S. Peitz, K. Pfannschmidt, ArXiv:2104.03562 (2021).
Download
Download (ext.)
Preprint
| English
Author
Dellnitz, Michael;
Hüllermeier, EykeLibreCat;
Lücke, Marvin;
Ober-Blöbaum, SinaLibreCat;
Offen, ChristianLibreCat
;
Peitz, SebastianLibreCat
;
Pfannschmidt, KarlsonLibreCat 



Department
Abstract
Many problems in science and engineering require an efficient numerical approximation of integrals
or solutions to differential equations. For systems with rapidly changing dynamics, an equidistant
discretization is often inadvisable as it either results in prohibitively large errors or computational effort. To this end, adaptive schemes, such as solvers based on Runge–Kutta pairs, have been developed
which adapt the step size based on local error estimations at each step. While the classical schemes
apply very generally and are highly efficient on regular systems, they can behave sub-optimal when
an inefficient step rejection mechanism is triggered by structurally complex systems such as chaotic
systems. To overcome these issues, we propose a method to tailor numerical schemes to the problem
class at hand. This is achieved by combining simple, classical quadrature rules or ODE solvers with
data-driven time-stepping controllers. Compared with learning solution operators to ODEs directly,
it generalises better to unseen initial data as our approach employs classical numerical schemes as
base methods. At the same time it can make use of identified structures of a problem class and,
therefore, outperforms state-of-the-art adaptive schemes. Several examples demonstrate superior
efficiency. Source code is available at https://github.com/lueckem/quadrature-ML.
Publishing Year
Journal Title
arXiv:2104.03562
LibreCat-ID
Cite this
Dellnitz M, Hüllermeier E, Lücke M, et al. Efficient time stepping for numerical integration using reinforcement learning. arXiv:210403562. Published online 2021.
Dellnitz, M., Hüllermeier, E., Lücke, M., Ober-Blöbaum, S., Offen, C., Peitz, S., & Pfannschmidt, K. (2021). Efficient time stepping for numerical integration using reinforcement learning. In arXiv:2104.03562.
@article{Dellnitz_Hüllermeier_Lücke_Ober-Blöbaum_Offen_Peitz_Pfannschmidt_2021, title={Efficient time stepping for numerical integration using reinforcement learning}, journal={arXiv:2104.03562}, author={Dellnitz, Michael and Hüllermeier, Eyke and Lücke, Marvin and Ober-Blöbaum, Sina and Offen, Christian and Peitz, Sebastian and Pfannschmidt, Karlson}, year={2021} }
Dellnitz, Michael, Eyke Hüllermeier, Marvin Lücke, Sina Ober-Blöbaum, Christian Offen, Sebastian Peitz, and Karlson Pfannschmidt. “Efficient Time Stepping for Numerical Integration Using Reinforcement Learning.” ArXiv:2104.03562, 2021.
M. Dellnitz et al., “Efficient time stepping for numerical integration using reinforcement learning,” arXiv:2104.03562. 2021.
Dellnitz, Michael, et al. “Efficient Time Stepping for Numerical Integration Using Reinforcement Learning.” ArXiv:2104.03562, 2021.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Main File(s)
File Name
QuadratureML.pdf
562.63 KB
Access Level

Last Uploaded
2022-03-03T14:45:08Z
Link(s) to Main File(s)
Access Level
