COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > ML@CL Seminar Series > Adaptive probabilistic ODE solvers without adaptive memory requirements
Adaptive probabilistic ODE solvers without adaptive memory requirementsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Carl Henrik Ek. Adaptive probabilistic solvers for ordinary differential equations (ODEs) have made substantial progress in recent years but can still not solve memory-demanding differential equations. In this talk, I review recent developments in numerically robust fixed-point smoothers and how to use them for constructing adaptive probabilistic ODE solvers. These new algorithms use drastically less memory than their predecessors and are the first adaptive probabilistic numerical methods compatible with scientific computing in JAX . This talk is part of the ML@CL Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsMyszon88* Type the title of a new list here AmnestyOther talksLightning talk - Title TBC Talk Cancelled: Less is more Scaling up the automated verification of concurrent programs One of many possible introductions to symplectic geometry Visual Perspective Biases Autobiographical Remembering Dragging with minimum effort - Optimal control protocols for particles with self-propulsion and memory |