Objective discovery of dominant dynamical processes with intelligible machine learning

• URL: http://arxiv.org/abs/2106.12963v1
• Date: Mon, 21 Jun 2021 20:57:23 GMT
• Title: Objective discovery of dominant dynamical processes with intelligible machine learning
• Authors: Bryan E. Kaiser, Juan A. Saenz, Maike Sonnewald, and Daniel Livescu
• Abstract summary: We present a formal definition in which the identification of dynamical regimes is formulated as an optimization problem. We propose an unsupervised learning framework which eliminates the need for a priori knowledge and ad hoc definitions. Our method is a step towards unbiased data exploration that allows serendipitous discovery within dynamical systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The advent of big data has vast potential for discovery in natural phenomena ranging from climate science to medicine, but overwhelming complexity stymies insight. Existing theory is often not able to succinctly describe salient phenomena, and progress has largely relied on ad hoc definitions of dynamical regimes to guide and focus exploration. We present a formal definition in which the identification of dynamical regimes is formulated as an optimization problem, and we propose an intelligible objective function. Furthermore, we propose an unsupervised learning framework which eliminates the need for a priori knowledge and ad hoc definitions; instead, the user need only choose appropriate clustering and dimensionality reduction algorithms, and this choice can be guided using our proposed objective function. We illustrate its applicability with example problems drawn from ocean dynamics, tumor angiogenesis, and turbulent boundary layers. Our method is a step towards unbiased data exploration that allows serendipitous discovery within dynamical systems, with the potential to propel the physical sciences forward.

Related papers

• Deep Learning Through A Telescoping Lens: A Simple Model Provides Empirical Insights On Grokking, Gradient Boosting & Beyond [61.18736646013446]
  In pursuit of a deeper understanding of its surprising behaviors, we investigate the utility of a simple yet accurate model of a trained neural network. Across three case studies, we illustrate how it can be applied to derive new empirical insights on a diverse range of prominent phenomena.
  arXiv  Detail & Related papers  (2024-10-31T22:54:34Z)
• Identifiable Representation and Model Learning for Latent Dynamic Systems [0.0]
  We study the problem of identifiable representation and model learning for latent dynamic systems. We prove that, for linear or affine nonlinear latent dynamic systems, it is possible to identify the representations up to scaling and determine the models up to some simple transformations.
  arXiv  Detail & Related papers  (2024-10-23T13:55:42Z)
• Life, uh, Finds a Way: Systematic Neural Search [2.163881720692685]
  We tackle the challenge of rapidly adapting an agent's behavior to solve continuous problems in settings. Instead of focusing on deep reinforcement learning, we propose viewing behavior as the physical manifestation of a search procedure. We describe an algorithm that implicitly enumerates behaviors by regulating the tight feedback loop between execution of behaviors and mutation of the graph.
  arXiv  Detail & Related papers  (2024-10-02T09:06:54Z)
• Learning in Hybrid Active Inference Models [0.8749675983608172]
  We present a novel hierarchical hybrid active inference agent in which a high-level discrete active inference planner sits above a low-level continuous active inference controller. We make use of recent work in recurrent switching linear dynamical systems which implement end-to-end learning of meaningful discrete representations. We apply our model to the sparse Continuous Mountain Car task, demonstrating fast system identification via enhanced exploration and successful planning.
  arXiv  Detail & Related papers  (2024-09-02T08:41:45Z)
• Active search for Bifurcations [0.0]
  We propose an active learning framework, where Bayesian Optimization is leveraged to discover saddle-node or Hopf bifurcations. It provides a framework for uncertainty quantification in systems with inherentity. It also provides a framework for uncertainty quantification in systems with resource-limited space exploration.
  arXiv  Detail & Related papers  (2024-06-17T02:01:17Z)
• Seeing Unseen: Discover Novel Biomedical Concepts via Geometry-Constrained Probabilistic Modeling [53.7117640028211]
  We present a geometry-constrained probabilistic modeling treatment to resolve the identified issues. We incorporate a suite of critical geometric properties to impose proper constraints on the layout of constructed embedding space. A spectral graph-theoretic method is devised to estimate the number of potential novel classes.
  arXiv  Detail & Related papers  (2024-03-02T00:56:05Z)
• Interpretable Imitation Learning with Dynamic Causal Relations [65.18456572421702]
  We propose to expose captured knowledge in the form of a directed acyclic causal graph. We also design this causal discovery process to be state-dependent, enabling it to model the dynamics in latent causal graphs. The proposed framework is composed of three parts: a dynamic causal discovery module, a causality encoding module, and a prediction module, and is trained in an end-to-end manner.
  arXiv  Detail & Related papers  (2023-09-30T20:59:42Z)
• Optimistic Active Exploration of Dynamical Systems [52.91573056896633]
  We develop an algorithm for active exploration called OPAX. We show how OPAX can be reduced to an optimal control problem that can be solved at each episode. Our experiments show that OPAX is not only theoretically sound but also performs well for zero-shot planning on novel downstream tasks.
  arXiv  Detail & Related papers  (2023-06-21T16:26:59Z)
• Learning dynamics from partial observations with structured neural ODEs [5.757156314867639]
  We propose a flexible framework to incorporate a broad spectrum of physical insight into neural ODE-based system identification. We demonstrate the performance of the proposed approach on numerical simulations and on an experimental dataset from a robotic exoskeleton.
  arXiv  Detail & Related papers  (2022-05-25T07:54:10Z)
• Learning Neural Causal Models with Active Interventions [83.44636110899742]
  We introduce an active intervention-targeting mechanism which enables a quick identification of the underlying causal structure of the data-generating process. Our method significantly reduces the required number of interactions compared with random intervention targeting. We demonstrate superior performance on multiple benchmarks from simulated to real-world data.
  arXiv  Detail & Related papers  (2021-09-06T13:10:37Z)
• Backprop-Free Reinforcement Learning with Active Neural Generative Coding [84.11376568625353]
  We propose a computational framework for learning action-driven generative models without backpropagation of errors (backprop) in dynamic environments. We develop an intelligent agent that operates even with sparse rewards, drawing inspiration from the cognitive theory of planning as inference. The robust performance of our agent offers promising evidence that a backprop-free approach for neural inference and learning can drive goal-directed behavior.
  arXiv  Detail & Related papers  (2021-07-10T19:02:27Z)

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.