Deep Learning of Conjugate Mappings

• URL: http://arxiv.org/abs/2104.01874v1
• Date: Thu, 1 Apr 2021 16:29:41 GMT
• Title: Deep Learning of Conjugate Mappings
• Authors: Jason J. Bramburger, Steven L. Brunton, J. Nathan Kutz
• Abstract summary: Henri Poincar'e first made the connection by tracking consecutive iterations of the continuous flow with a lower-dimensional, transverse subspace. This work proposes a method for obtaining explicit Poincar'e mappings by using deep learning to construct an invertible coordinate transformation into a conjugate representation.
• Score: 2.9097303137825046
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Despite many of the most common chaotic dynamical systems being continuous in time, it is through discrete time mappings that much of the understanding of chaos is formed. Henri Poincar\'e first made this connection by tracking consecutive iterations of the continuous flow with a lower-dimensional, transverse subspace. The mapping that iterates the dynamics through consecutive intersections of the flow with the subspace is now referred to as a Poincar\'e map, and it is the primary method available for interpreting and classifying chaotic dynamics. Unfortunately, in all but the simplest systems, an explicit form for such a mapping remains outstanding. This work proposes a method for obtaining explicit Poincar\'e mappings by using deep learning to construct an invertible coordinate transformation into a conjugate representation where the dynamics are governed by a relatively simple chaotic mapping. The invertible change of variable is based on an autoencoder, which allows for dimensionality reduction, and has the advantage of classifying chaotic systems using the equivalence relation of topological conjugacies. Indeed, the enforcement of topological conjugacies is the critical neural network regularization for learning the coordinate and dynamics pairing. We provide expository applications of the method to low-dimensional systems such as the R\"ossler and Lorenz systems, while also demonstrating the utility of the method on infinite-dimensional systems, such as the Kuramoto--Sivashinsky equation.

Related papers

• Learning the Topology and Behavior of Discrete Dynamical Systems [30.424671907681688]
  We focus on the problem of learning the behavior and the underlying topology of a black-box system. We show that, in general, this learning problem is computationally intractable. Our results provide a theoretical foundation for learning both the behavior and topology of discrete dynamical systems.
  arXiv  Detail & Related papers  (2024-02-18T19:31:26Z)
• Initial Correlations in Open Quantum Systems: Constructing Linear Dynamical Maps and Master Equations [62.997667081978825]
  We show that, for any predetermined initial correlations, one can introduce a linear dynamical map on the space of operators of the open system. We demonstrate that this construction leads to a linear, time-local quantum master equation with generalized Lindblad structure.
  arXiv  Detail & Related papers  (2022-10-24T13:43:04Z)
• Ensemble forecasts in reproducing kernel Hilbert space family [0.0]
  A methodological framework for ensemble-based estimation and simulation of high dimensional dynamical systems is proposed. To that end, the dynamical system is embedded in a family of reproducing kernel Hilbert spaces (RKHS) with kernel functions driven by the dynamics.
  arXiv  Detail & Related papers  (2022-07-29T12:57:50Z)
• Entangled Residual Mappings [59.02488598557491]
  We introduce entangled residual mappings to generalize the structure of the residual connections. An entangled residual mapping replaces the identity skip connections with specialized entangled mappings. We show that while entangled mappings can preserve the iterative refinement of features across various deep models, they influence the representation learning process in convolutional networks.
  arXiv  Detail & Related papers  (2022-06-02T19:36:03Z)
• Linearization and Identification of Multiple-Attractors Dynamical System through Laplacian Eigenmaps [8.161497377142584]
  We propose a Graph-based spectral clustering method that takes advantage of a velocity-augmented kernel to connect data-points belonging to the same dynamics. We prove that there always exist a set of 2-dimensional embedding spaces in which the sub-dynamics are linear, and n-dimensional embedding where they are quasi-linear. We learn a diffeomorphism from the Laplacian embedding space to the original space and show that the Laplacian embedding leads to good reconstruction accuracy and a faster training time.
  arXiv  Detail & Related papers  (2022-02-18T12:43:25Z)
• Deep Learning Approximation of Diffeomorphisms via Linear-Control Systems [91.3755431537592]
  We consider a control system of the form $dot x = sum_i=1lF_i(x)u_i$, with linear dependence in the controls. We use the corresponding flow to approximate the action of a diffeomorphism on a compact ensemble of points.
  arXiv  Detail & Related papers  (2021-10-24T08:57:46Z)
• Supervised DKRC with Images for Offline System Identification [77.34726150561087]
  Modern dynamical systems are becoming increasingly non-linear and complex. There is a need for a framework to model these systems in a compact and comprehensive representation for prediction and control. Our approach learns these basis functions using a supervised learning approach.
  arXiv  Detail & Related papers  (2021-09-06T04:39:06Z)
• Embedding Information onto a Dynamical System [0.0]
  We show how an arbitrary sequence can be mapped into another space as an attractive solution of a nonautonomous dynamical system. This result is not a generalization of Takens embedding theorem but helps us understand what exactly is required by discrete-time state space models.
  arXiv  Detail & Related papers  (2021-05-22T16:54:16Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Euclideanizing Flows: Diffeomorphic Reduction for Learning Stable Dynamical Systems [74.80320120264459]
  We present an approach to learn such motions from a limited number of human demonstrations. The complex motions are encoded as rollouts of a stable dynamical system. The efficacy of this approach is demonstrated through validation on an established benchmark as well demonstrations collected on a real-world robotic system.
  arXiv  Detail & Related papers  (2020-05-27T03:51:57Z)

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.