paper-with-me

Papers

Meta-Learning Runge-Kutta

2019-09-25 · Nadine Behrmann, Patrick Schramowski, Kristian Kersting

Initial value problems, i.e. differential equations with specific, initial conditions, represent a classic problem within the field of ordinary differential equations(ODEs). While the simplest types of ODEs may have closed-form solutions, most interesting cases typically rely on iterative schemes for numerical integration such as the family of Runge-Kutta methods. They are, however, sensitive to the strategy the step size is adapted during integration, which has to be chosen by the experimenter. In this paper, we show how the design of a step size controller can be cast as a learning problem, allowing deep networks to learn to exploit structure in the initial value problem at hand in an automatic way. The key ingredients for the resulting Meta-Learning Runge-Kutta (MLRK) are the development of a good performance measure and the identification of suitable input features. Traditional approaches suggest the local error estimates as input to the controller. However, by studying the characteristics of the local error function we show that including the partial derivatives of the initial value problem is favorable. Our experiments demonstrate considerable benefits over traditional approaches. In particular, MLRK is able to mitigate sudden spikes in the local error function by a faster adaptation of the step size. More importantly, the additional information in the form of partial derivatives and function values leads to a substantial improvement in performance. The source code can be found at https://www.dropbox.com/sh/rkctdfhkosywnnx/AABKadysCR8-aHW_0kb6vCtSa?dl=0

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Meta-LearningNumerical Integration

Similar Papers 제목 키워드 기반

Model-Agnostic Meta-Learning using Runge-Kutta Methods

2019-10-16 · Daniel Jiwoong Im, Yibo Jiang, Nakul Verma

Meta-learning has emerged as an important framework for learning new tasks from just a few examples. The success of any meta-learning model depends on (i) its fast adaptation to new tasks, as well as (ii) having a shared…

Meta-LearningmodelReinforcement Learning

Probabilistic ODE Solvers with Runge-Kutta Means

2014-06-10 · NeurIPS 2014 12 · Michael Schober, David Duvenaud, Philipp Hennig

Runge-Kutta methods are the classic family of solvers for ordinary differential equations (ODEs), and the basis for the state of the art. Like most numerical methods, they return point estimates. We construct a family of…

Pricing American options with the Runge-Kutta-Legendre finite difference scheme

2021-06-22 · Fabien Le Floc'h

This paper presents the Runge-Kutta-Legendre finite difference scheme, allowing for an additional shift in its polynomial representation. A short presentation of the stability region, comparatively to the Runge-Kutta-Che…

Novel sparse PCA method via Runge Kutta numerical method(s) for face recognition

2025-03-30 · Loc Hoang Tran, Luong Anh Tuan Nguyen

Face recognition is a crucial topic in data science and biometric security, with applications spanning military, finance, and retail industries. This paper explores the implementation of sparse Principal Component Analys…

Face Recognition

Learning Hamiltonian Systems with Mono-Implicit Runge-Kutta Methods

2023-03-07 · Håkon Noren

Numerical integrators could be used to form interpolation conditions when training neural networks to approximate the vector field of an ordinary differential equation (ODE) from data. When numerical one-step schemes suc…