Classification with Runge-Kutta networks and feature space augmentation
In this paper we combine an approach based on Runge-Kutta Nets considered in [Benning et al., J. Comput. Dynamics, 9, 2019] and a technique on augmenting the input space in [Dupont et al., NeurIPS, 2019] to obtain network architectures which show a better numerical performance for deep neural networks in point and image classification problems. The approach is illustrated with several examples implemented in PyTorch.
Code (1)
Tasks
ClassificationGeneral Classificationimage-classificationImage ClassificationSimilar Papers 제목 키워드 기반
Novel sparse PCA method via Runge Kutta numerical method(s) for face recognition
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 RecognitionProbabilistic ODE Solvers with Runge-Kutta Means
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
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…
Model-Agnostic Meta-Learning using Runge-Kutta Methods
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 LearningLearning Hamiltonian Systems with Mono-Implicit Runge-Kutta Methods
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…