LGOct 3, 2023
Why should autoencoders work?Matthew D. Kvalheim, Eduardo D. Sontag
Deep neural network autoencoders are routinely used computationally for model reduction. They allow recognizing the intrinsic dimension of data that lie in a $k$-dimensional subset $K$ of an input Euclidean space $\mathbb{R}^n$. The underlying idea is to obtain both an encoding layer that maps $\mathbb{R}^n$ into $\mathbb{R}^k$ (called the bottleneck layer or the space of latent variables) and a decoding layer that maps $\mathbb{R}^k$ back into $\mathbb{R}^n$, in such a way that the input data from the set $K$ is recovered when composing the two maps. This is achieved by adjusting parameters (weights) in the network to minimize the discrepancy between the input and the reconstructed output. Since neural networks (with continuous activation functions) compute continuous maps, the existence of a network that achieves perfect reconstruction would imply that $K$ is homeomorphic to a $k$-dimensional subset of $\mathbb{R}^k$, so clearly there are topological obstructions to finding such a network. On the other hand, in practice the technique is found to "work" well, which leads one to ask if there is a way to explain this effectiveness. We show that, up to small errors, indeed the method is guaranteed to work. This is done by appealing to certain facts from differential topology. A computational example is also included to illustrate the ideas.
OCApr 12
Stabilizability of first-order dynamics in second-order systemsMatthew D. Kvalheim
We study whether second-order systems can be made to behave like prescribed first-order dynamical systems through feedback control. More precisely, we study whether prescribed vector fields on compact smooth manifolds, viewed geometrically as sections of the tangent bundle, can be asymptotically stabilized in a strong sense by second-order control systems on the base manifold. Our class of second-order systems includes most Lagrangian systems, and we obtain both positive and negative results. The positive result asserts that, for fully actuated systems, the section corresponding to any smooth vector field can be made globally exponentially stable, normally hyperbolic, and more. In particular, not only does each closed-loop solution asymptotically have the prescribed velocities, but it also converges to a trajectory of the first-order dynamics generated by the prescribed vector field at an exponential rate. Thus, the closed-loop second-order system asymptotically reproduces the prescribed first-order dynamics. In contrast, the negative result asserts that, for underactuated systems on manifolds with nonzero Euler characteristic, sections corresponding to "almost all" smooth vector fields cannot even be locally asymptotically stabilized. This includes, in particular, all vector fields with only isolated zeros. An example shows that the Euler characteristic assumption is necessary for the negative result.
DSMar 12
Linearizability of flows by embeddingsMatthew D. Kvalheim, Philip Arathoon
We consider the problem of determining the class of continuous-time dynamical systems that can be globally linearized in the sense of admitting an embedding into a linear system on a higher-dimensional Euclidean space. We solve this problem for dynamical systems on connected state spaces that are either compact or contain at least one nonempty compact attractor, obtaining necessary and sufficient conditions for the existence of linearizing $C^k$ embeddings for $k\in \mathbb{N}_{\geq 0}\cup \{\infty\}$. Corollaries include (i) several checkable necessary conditions for global linearizability and (ii) extensions of the Hartman-Grobman and Floquet normal form theorems beyond the classical settings. Our results open new perspectives on linearizability by establishing relationships to symmetry, topology, and invariant manifold theory.
LGNov 6, 2025
Autoencoding Dynamics: Topological Limitations and CapabilitiesMatthew D. Kvalheim, Eduardo D. Sontag
Given a "data manifold" $M\subset \mathbb{R}^n$ and "latent space" $\mathbb{R}^\ell$, an autoencoder is a pair of continuous maps consisting of an "encoder" $E\colon \mathbb{R}^n\to \mathbb{R}^\ell$ and "decoder" $D\colon \mathbb{R}^\ell\to \mathbb{R}^n$ such that the "round trip" map $D\circ E$ is as close as possible to the identity map $\mbox{id}_M$ on $M$. We present various topological limitations and capabilites inherent to the search for an autoencoder, and describe capabilities for autoencoding dynamical systems having $M$ as an invariant manifold.
DSAug 17, 2021
Poincaré-Hopf theorem for hybrid systemsMatthew D. Kvalheim
A generalization of the Poincaré-Hopf index theorem applicable to hybrid dynamical systems is obtained. For the hybrid systems considered, guard sets are not assumed to be smooth; distinct "modes" are not assumed to have constant dimension; and resets are arbitrary multivalued maps (relations).
OCJun 1, 2021
Necessary conditions for feedback stabilization and safetyMatthew D. Kvalheim, Daniel E. Koditschek
Brockett's necessary condition yields a test to determine whether a system can be made to stabilize about some operating point via continuous, purely state-dependent feedback. For many real-world systems, however, one wants to stabilize sets which are more general than a single point. One also wants to control such systems to operate safely by making obstacles and other "dangerous" sets repelling. We generalize Brockett's necessary condition to the case of stabilizing general compact subsets having a nonzero Euler characteristic in general ambient state spaces (smooth manifolds). Using this generalization, we also formulate a necessary condition for the existence of "safe" control laws. We illustrate the theory in concrete examples and for some general classes of systems including a broad class of nonholonomically constrained Lagrangian systems. We also show that, for the special case of stabilizing a point, the specialization of our general stabilizability test is stronger than Brockett's.
DSMay 7, 2020
Conley's fundamental theorem for a class of hybrid systemsMatthew D. Kvalheim, Paul Gustafson, Daniel E. Koditschek
We establish versions of Conley's (i) fundamental theorem and (ii) decomposition theorem for a broad class of hybrid dynamical systems. The hybrid version of (i) asserts that a globally-defined "hybrid complete Lyapunov function" exists for every hybrid system in this class. Motivated by mechanics and control settings where physical or engineered events cause abrupt changes in a system's governing dynamics, our results apply to a large class of Lagrangian hybrid systems (with impacts) studied extensively in the robotics literature. Viewed formally, these results generalize those of Conley and Franks for continuous-time and discrete-time dynamical systems, respectively, on metric spaces. However, we furnish specific examples illustrating how our statement of sufficient conditions represents merely an early step in the longer project of establishing what formal assumptions can and cannot endow hybrid systems models with the topologically well characterized partitions of limit behavior that make Conley's theory so valuable in those classical settings.
ROJun 11, 2019
Gait modeling and optimization for the perturbed Stokes regimeMatthew D. Kvalheim, Brian Bittner, Shai Revzen
Many forms of locomotion, both natural and artificial, are dominated by viscous friction in the sense that without power expenditure they quickly come to a standstill. From geometric mechanics, it is known that for swimming at the "Stokesian" (viscous; zero Reynolds number) limit, the motion is governed by a reduced order "connection" model that describes how body shape change produces motion for the body frame with respect to the world. In the "perturbed Stokes regime" where inertial forces are still dominated by viscosity, but are not negligible (low Reynolds number), we show that motion is still governed by a functional relationship between shape velocity and body velocity, but this function is no longer linear in shape change rate. We derive this model using results from singular perturbation theory, and the theory of noncompact normally hyperbolic invariant manifolds (NHIMs). Using the theoretical properties of this reduced-order model, we develop an algorithm that estimates an approximation to the dynamics near a cyclic body shape change (a "gait") directly from observational data of shape and body motion. This extends our previous work which assumed kinematic "connection" models. To compare the old and new algorithms, we analyze simulated swimmers over a range of inertia to damping ratios. Our new class of models performs well on the Stokesian regime, and over several orders of magnitude outside it into the perturbed Stokes regime, where it gives significantly improved prediction accuracy compared to previous work. In addition to algorithmic improvements, we thereby present a new class of models that is of independent interest. Their application to data-driven modeling improves our ability to study the optimality of animal gaits, and our ability to use hardware-in-the-loop optimization to produce gaits for robots.