Researcher profile

Maik Kschischo

Maik Kschischo contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 15 - Baseline
3works
0followers
7topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

3 published item(s)

preprint2026arXiv

Observable Neural ODEs for Identifiable Causal Forecasting in Continuous Time

Causal inference in continuous-time sequential decision problems is challenged by hidden confounders. We show that, in latent state-space models with time-varying interventions, observability of the latent dynamics from observed data is necessary for identifying dynamic treatment effects, linking control-theoretic observability to causal identifiability, even when hidden confounders affect both treatments and outcomes. We derive a continuous-time adjustment formula expressing potential outcome distributions under treatment trajectories via the measurement model, latent dynamics, and the filtering distribution over latent states given observed histories. We propose Observable Neural ODEs (ObsNODEs), Neural ODE models in observable normal form for causal forecasting. ObsNODEs learn continuous-time dynamics with states reconstructible from observations, enabling outcome prediction under alternative treatment paths. Experiments on synthetic cancer data, semi-synthetic data based on MIMIC-IV, and real-world sepsis data show strong performance over recent sequence models.

preprint2022arXiv

Localization of Invariable Sparse Errors in Dynamic Systems

Understanding the dynamics of complex systems is a central task in many different areas ranging from biology via epidemics to economics and engineering. Unexpected behaviour of dynamic systems or even system failure is sometimes difficult to comprehend. Such a data-mismatch can be caused by endogenous model errors including misspecified interactions and inaccurate parameter values. These are often difficult to distinguish from unmodelled process influencing the real system like unknown inputs or faults. Localizing the root cause of these errors or faults and reconstructing their dynamics is only possible if the measured outputs of the system are sufficiently informative. Here, we present criteria for the measurements required to localize the position of error sources in large dynamic networks. We assume that faults or errors occur at a limited number of positions in the network. This invariable sparsity differs from previous sparsity definitions for inputs to dynamic systems. We provide an exact criterion for the recovery of invariable sparse inputs to nonlinear systems and formulate an optimization criterion for invariable sparse input reconstruction. For linear systems we can provide exact error bounds for this reconstruction method.

preprint2020arXiv

Sparse Error Localization in Complex Dynamic Networks

Understanding the dynamics of complex systems is a central task in many different areas ranging form biology via epidemics to economics and engineering. Unexpected behaviour of dynamic systems or even systems failure is sometimes difficult to comprehend. Such unexpected dynamics can be caused by systematic model errors, unknown inputs from the environment and systems faults. Localizing the root cause of these errors or faults and reconstructing their dynamics is only possible if the measured outputs of the system are sufficiently informative. Here, we present a mathematical theory for the measurements required to localize the position of error sources in large dynamic networks. We assume, that faults or errors occur at a limited number of positions in the network. This sparsity assumption facilitates the accurate reconstruction of the dynamic timecourses of the errors by solving a convex optimal control problem. For cases, where the sensor measurements are not sufficiently informative to pinpoint the error position exactly, we provide methods to restrict the error location to a smaller subset of network nodes. We also suggest strategies to efficiently select additional measurements for narrowing down the error location.