no code implementations • 25 Oct 2023 • Philipp Scholl, Maged Iskandar, Sebastian Wolf, Jinoh Lee, Aras Bacho, Alexander Dietrich, Alin Albu-Schäffer, Gitta Kutyniok
Subsequently, to adapt to more complex asymmetric settings, we train a second network on a small dataset, focusing on predicting the residual of the initial network's output.
1 code implementation • 9 Oct 2023 • Philipp Scholl, Katharina Bieker, Hillary Hauger, Gitta Kutyniok
In this paper, we present our new method ParFam that utilizes parametric families of suitable symbolic functions to translate the discrete symbolic regression problem into a continuous one, resulting in a more straightforward setup compared to current state-of-the-art methods.
1 code implementation • 15 Oct 2022 • Philipp Scholl, Aras Bacho, Holger Boche, Gitta Kutyniok
Finally, we provide extensive numerical experiments showing that our algorithms in combination with common approaches for learning physical laws indeed allow to guarantee that a unique governing differential equation is learnt, without assuming any knowledge about the function, thereby ensuring reliability.
1 code implementation • 1 Aug 2022 • Philipp Scholl, Felix Dietrich, Clemens Otte, Steffen Udluft
Based on this finding, we develop adaptations, the Adv-Soft-SPIBB algorithms, and show that they are provably safe.
1 code implementation • 28 Jan 2022 • Philipp Scholl, Felix Dietrich, Clemens Otte, Steffen Udluft
Safe Policy Improvement (SPI) aims at provable guarantees that a learned policy is at least approximately as good as a given baseline policy.