Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Learning nonparametric ordinary differential equations from noisy data
by
Kamel Lahouel
, Lovitz, David
, Rielly, Victor
, Wells, Michael
, Jedynak, Bruno M
, Lew, Ethan
in
Differential equations
/ Hilbert space
/ Machine learning
/ Mathematical analysis
/ Optimization
2023
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Learning nonparametric ordinary differential equations from noisy data
by
Kamel Lahouel
, Lovitz, David
, Rielly, Victor
, Wells, Michael
, Jedynak, Bruno M
, Lew, Ethan
in
Differential equations
/ Hilbert space
/ Machine learning
/ Mathematical analysis
/ Optimization
2023
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Learning nonparametric ordinary differential equations from noisy data
Paper
Learning nonparametric ordinary differential equations from noisy data
2023
Request Book From Autostore
and Choose the Collection Method
Overview
Learning nonparametric systems of Ordinary Differential Equations (ODEs) dot x = f(t,x) from noisy data is an emerging machine learning topic. We use the well-developed theory of Reproducing Kernel Hilbert Spaces (RKHS) to define candidates for f for which the solution of the ODE exists and is unique. Learning f consists of solving a constrained optimization problem in an RKHS. We propose a penalty method that iteratively uses the Representer theorem and Euler approximations to provide a numerical solution. We prove a generalization bound for the L2 distance between x and its estimator and provide experimental comparisons with the state-of-the-art.
Publisher
Cornell University Library, arXiv.org
This website uses cookies to ensure you get the best experience on our website.