Data-Driven Observability Analysis for Nonlinear Stochastic Systems

• URL: http://arxiv.org/abs/2302.11979v2
• Date: Fri, 7 Jun 2024 15:54:54 GMT
• Title: Data-Driven Observability Analysis for Nonlinear Stochastic Systems
• Authors: Pierre-François Massiani, Mona Buisson-Fenet, Friedrich Solowjow, Florent Di Meglio, Sebastian Trimpe,
• Abstract summary: Distinguishability and observability are key properties of dynamical systems. We show that both concepts are equivalent for a class of systems that includes linear systems. We propose a statistical test to determine a threshold above which two states can be considered distinguishable with high confidence.
• Score: 5.4511976387114895
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Distinguishability and, by extension, observability are key properties of dynamical systems. Establishing these properties is challenging, especially when no analytical model is available and they are to be inferred directly from measurement data. The presence of noise further complicates this analysis, as standard notions of distinguishability are tailored to deterministic systems. We build on distributional distinguishability, which extends the deterministic notion by comparing distributions of outputs of stochastic systems. We first show that both concepts are equivalent for a class of systems that includes linear systems. We then present a method to assess and quantify distributional distinguishability from output data. Specifically, our quantification measures how much data is required to tell apart two initial states, inducing a continuous spectrum of distinguishability. We propose a statistical test to determine a threshold above which two states can be considered distinguishable with high confidence. We illustrate these tools by computing distinguishability maps over the state space in simulation, then leverage the test to compare sensor configurations on hardware.

Related papers

• Identifiability Analysis of Linear ODE Systems with Hidden Confounders [45.14890063421295]
  This paper presents a systematic analysis of identifiability in linear ODE systems incorporating hidden confounders. In the first case, latent confounders exhibit no causal relationships, yet their evolution adheres to specific forms. Subsequently, we extend this analysis to encompass scenarios where hidden confounders exhibit causal dependencies.
  arXiv  Detail & Related papers  (2024-10-29T10:15:56Z)
• Inferring Kernel $ε$-Machines: Discovering Structure in Complex Systems [49.1574468325115]
  We introduce causal diffusion components that encode the kernel causal-state estimates as a set of coordinates in a reduced dimension space. We show how each component extracts predictive features from data and demonstrate their application on four examples.
  arXiv  Detail & Related papers  (2024-10-01T21:14:06Z)
• Detecting and Identifying Selection Structure in Sequential Data [53.24493902162797]
  We argue that the selective inclusion of data points based on latent objectives is common in practical situations, such as music sequences. We show that selection structure is identifiable without any parametric assumptions or interventional experiments. We also propose a provably correct algorithm to detect and identify selection structures as well as other types of dependencies.
  arXiv  Detail & Related papers  (2024-06-29T20:56:34Z)
• DAGnosis: Localized Identification of Data Inconsistencies using Structures [73.39285449012255]
  Identification and appropriate handling of inconsistencies in data at deployment time is crucial to reliably use machine learning models. We use directed acyclic graphs (DAGs) to encode the training set's features probability distribution and independencies as a structure. Our method, called DAGnosis, leverages these structural interactions to bring valuable and insightful data-centric conclusions.
  arXiv  Detail & Related papers  (2024-02-26T11:29:16Z)
• Robust Independence Tests with Finite Sample Guarantees for Synchronous Stochastic Linear Systems [0.0]
  The paper introduces robust independence tests with non-asymptotically guaranteed significance levels for linear time-invariant systems. Our method provides bounds for the type I error probabilities that are distribution-free, i.e., the innovations can have arbitrary distributions.
  arXiv  Detail & Related papers  (2023-08-03T21:13:34Z)
• Identifiability and Asymptotics in Learning Homogeneous Linear ODE Systems from Discrete Observations [114.17826109037048]
  Ordinary Differential Equations (ODEs) have recently gained a lot of attention in machine learning. theoretical aspects, e.g., identifiability and properties of statistical estimation are still obscure. This paper derives a sufficient condition for the identifiability of homogeneous linear ODE systems from a sequence of equally-spaced error-free observations sampled from a single trajectory.
  arXiv  Detail & Related papers  (2022-10-12T06:46:38Z)
• Active Learning for Nonlinear System Identification with Guarantees [102.43355665393067]
  We study a class of nonlinear dynamical systems whose state transitions depend linearly on a known feature embedding of state-action pairs. We propose an active learning approach that achieves this by repeating three steps: trajectory planning, trajectory tracking, and re-estimation of the system from all available data. We show that our method estimates nonlinear dynamical systems at a parametric rate, similar to the statistical rate of standard linear regression.
  arXiv  Detail & Related papers  (2020-06-18T04:54:11Z)
• Data-Driven Verification under Signal Temporal Logic Constraints [0.0]
  We consider systems under uncertainty whose dynamics are partially unknown. Our aim is to study satisfaction of temporal logic properties by trajectories of such systems. We employ Bayesian inference techniques to associate a confidence value to the satisfaction of the property.
  arXiv  Detail & Related papers  (2020-05-08T08:32:30Z)
• A Kernel Two-sample Test for Dynamical Systems [7.198860143325813]
  evaluating whether data streams are drawn from the same distribution is at the heart of various machine learning problems. This is particularly relevant for data generated by dynamical systems since such systems are essential for many real-world processes in biomedical, economic, or engineering systems. We propose a two-sample test for dynamical systems by addressing three core challenges: we (i) introduce a novel notion of mixing that captures autocorrelations in a relevant metric, (ii) propose an efficient way to estimate the speed of mixing relying purely on data, and (iii) integrate these into established kernel two-sample tests.
  arXiv  Detail & Related papers  (2020-04-23T11:57:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.