paper-with-me

홈 › Papers

Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs

2022-06-28 · Florian Krach, Marc Nübel, Josef Teichmann

This paper studies the problem of forecasting general stochastic processes using a path-dependent extension of the Neural Jump ODE (NJ-ODE) framework \citep{herrera2021neural}. While NJ-ODE was the first framework to establish convergence guarantees for the prediction of irregularly observed time series, these results were limited to data stemming from It\^o-diffusions with complete observations, in particular Markov processes, where all coordinates are observed simultaneously. In this work, we generalise these results to generic, possibly non-Markovian or discontinuous, stochastic processes with incomplete observations, by utilising the reconstruction properties of the signature transform. These theoretical results are supported by empirical studies, where it is shown that the path-dependent NJ-ODE outperforms the original NJ-ODE framework in the case of non-Markovian data. Moreover, we show that PD-NJ-ODE can be applied successfully to classical stochastic filtering problems and to limit order book (LOB) data.

📄 PDF Abstract BibTeX arXiv:2206.14284

Code (1)

floriankrach/pd-njode 공식 구현 pytorch

Tasks

Time SeriesTime Series Analysis

Similar Papers 제목 키워드 기반

A model-free approach to continuous-time finance

2022-11-28 · Henry Chiu, Rama Cont

We present a non-probabilistic, pathwise approach to continuous-time finance based on causal functional calculus. We introduce a definition of self-financing, free from any integration concept and show that the value of …

model

Learning Chaotic Systems and Long-Term Predictions with Neural Jump ODEs

2024-07-26 · Florian Krach, Josef Teichmann

The Path-dependent Neural Jump ODE (PD-NJ-ODE) is a model for online prediction of generic (possibly non-Markovian) stochastic processes with irregular (in time) and potentially incomplete (with respect to coordinates) o…

Online estimation and control with optimal pathlength regret

2021-10-24 · Gautam Goel, Babak Hassibi

A natural goal when designing online learning algorithms for non-stationary environments is to bound the regret of the algorithm in terms of the temporal variation of the input sequence. Intuitively, when the variation i…

Real-Time Energy-Optimal Path Planning for Electric Vehicles

2024-11-20 · Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby 외

The rapid adoption of electric vehicles (EVs) in modern transport systems has made energy-aware routing a critical task in their successful integration, especially within large-scale networks. In cases where an EV's rema…

Computational Efficiency

Predictability of temporal network dynamics in normal ageing and brain pathology

2025-02-23 · Annalisa Caligiuri, David Papo, Görsev Yener, Bahar Güntekin 외

Spontaneous brain activity generically displays transient spatiotemporal coherent structures, which can selectively be affected in various neurological and psychiatric pathologies. Here we model the full brain's electroe…