SDSuddhasattwa Das

Suddhasattwa Das

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Suddhasattwa Das has a total of 27 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Dynamics, Data, and Reconstruction

    by Suddhasattwa Das, Tomoharu Suda

    The goal of data-driven learning of dynamical systems is to interpret time series as a continuous observation of an underlying dynamical system. This task is not well-posed for a variety of reasons—such as multiple coexisting subsystems, topologically interweaving of these subsystems, and more importantly, the noninjectivity of the correspondence between dynamical systems and time series. We show how these ambiguities are circumvented if one considers dynamical systems and measurement maps collectively. Dynamical systems, observed dynamical systems, and time series data—each of these three collections have an extensive network of relations within them, which gives them the mathematical structure of a category. One of the new concepts proposed is a rigorous definition of time series data as a chain of measurement sequences with decreasing information content. This definition subsumes the familiar notions of sequences, time series, and even subshifts. Using these notions, it is shown that the entire process of converting an observed dynamical systems into a time series object is functorial and passes through a number of phases each bearing its own categorical structure. This discovery sheds new light on the nature of reconstruction algorithms. Under mild conditions of consistency, reconstruction itself is shown to be a functorial operation. This provides a new category-theoretic perspective on the nature and limits of reconstruction.

  • Open Access

    Physics-informed machine learning for reconstruction of dynamical systems with invariant measure score matching

    by Yongsheng Chen, Suddhasattwa Das, Wei Guo, Xinghui Zhong

    In this paper, we develop a novel mesh-free framework, termed physics-informed neural networks with invariant measure score matching (PINN-IMSM), for reconstructing dynamical systems from unlabeled point-cloud data that capture the system's invariant measure. The invariant density satisfies the steady-state Fokker-Planck (FP) equation. We reformulate this equation in terms of its score function (the gradient of the log-density), which is estimated directly from data via denoising score matching, thereby bypassing explicit density estimation. This learned score is then embedded into a physics-informed neural network (PINN) to reconstruct the drift velocity field under the resulting score-based FP equation. The mesh-free nature of PINNs allows the framework to scale to higher dimensions, avoiding the curse of dimensionality inherent in mesh-based methods. To address the ill-posedness of high-dimensional inverse problems, we recast the problem as a PDE-constrained optimization that seeks the minimal-energy velocity field. Under suitable conditions, we prove that this problem admits a unique solution that depends continuously on the score function. The constrained formulation is solved using a stochastic augmented Lagrangian method. Numerical experiments on representative dynamical systems, including the Van der Pol oscillator, an active swimmer in an anharmonic trap, and the chaotic Lorenz-63 and Lorenz-96 systems, demonstrate that PINN-IMSM accurately recovers invariant measures and reconstructs faithful dynamical behavior for problems in up to five dimensions.

  • Open Access

    A probabilistic approach to drift estimation from stochastic data

    by Suddhasattwa Das

    Time series generated from a dynamical source can often be modeled as sample paths of a stochastic differential equation. The time series thus reflects the motion of a particle that flows along the direction provided by a drift/vector field, and is simultaneously scattered by the effect of white noise. The resulting motion can only be described as a random process instead of a solution curve. Due to the non-deterministic nature of this motion, the task of determining the drift from data is quite challenging, since the data does not directly represent the directional information of the flow. This paper describes an interpretation of a drift as a conditional expectation, which makes its estimation feasible via kernel-integral methods. In addition, some techniques are proposed to overcome the challenge of dimensionality if the stochastic differential equations carry some structure enabling sparsity. The technique is shown to be convergent, consistent and permits a wide choice of kernels.

  • Open Access

    Functors induced by comma categories

    by Suddhasattwa Das

    Category theory provides a collective description of many arrangements in mathematics, such as topological spaces, Banach spaces and game theory. Within this collective description, the perspective from any individual member of the collection is provided by its associated left or right slice. The assignment of slices to objects extends to a functor from the base category, into the category of categories. Slice categories are a special case of the more general notion of comma categories. Comma categories are created when two categories \(\mathcal{A}\) and \(\mathcal{B}\) transform into a common third category \(\mathcal{C}\), via functors \(F,G\). Such arrangements denoted as \([F;G]\) abound in mathematics, and provide a categorical interpretation of many constructions in dynamics. Objects in this category are morphisms between objects of \(\mathcal{A}\) and \(\mathcal{B}\), via the functors \(F, G\). We show that these objects also have a natural interpretation as functors between slice categories of \(\mathcal{A}\) and \(\mathcal{B}\). Thus even though \(\mathcal{A}\) and \(\mathcal{B}\) may have completely disparate structures, morphisms in \(\calC\) lead to functors between their respective slices. We present this relation in the form of a functor from \(\calC\) into the category of left slices. The proof of our main result requires a deeper look into associated categories, in which the objects themselves are various commuting diagrams.


  • Open Access

    Learning Dynamical Systems with the Spectral Exterior Calculus

    by Suddhasattwa Das, Dimitrios Giannakis, Yanbing Gu, Joanna Slawinska

    We present a data-driven framework for learning dynamical systems on compact Riemannian manifolds based on the spectral exterior calculus (SEC). This approach represents vector fields as linear combinations of frame elements constructed using the eigenfunctions of the Laplacian on smooth functions, along with their gradients. Such reconstructed vector fields generate dynamical flows that consistently approximate the true system, while being compatible with the nonlinear geometry of the manifold. The data-driven implementation of this framework utilizes embedded data points and tangent vectors as training data, along with a graph-theoretic approximation of the Laplacian. In this paper, we prove the convergence of the SEC-based reconstruction in the limit of large data. Moreover, we illustrate the approach numerically with applications to dynamical systems on the unit circle and the 2-torus. In these examples, the reconstructed vector fields compare well with the true vector fields, in terms of both pointwise estimates and generation of orbits.

  • Limits of Learning Dynamical Systems

    by Tyrus Berry, Suddhasattwa Das

    A dynamical system is a transformation of a phase space, and the transformation law is the primary means of defining as well as identifying the dynamical system and is the object of focus of many learning techniques. However, there are many secondary aspects of dynamical systems—invariant sets, the Koopman operator, and Markov approximations—that provide alternative objectives for learning techniques. Crucially, while many learning methods are focused on the transformation law, we find that forecast performance can depend on how well these other aspects of the dynamics are approximated. These different facets of a dynamical system correspond to objects in completely different spaces—namely, interpolation spaces, compact Hausdorff sets, unitary operators, and Markov operators, respectively. Thus, learning techniques targeting any of these four facets perform different kinds of approximations. We examine whether an approximation of any one of these aspects of the dynamics could lead to an approximation of another facet. Many connections and obstructions are brought to light in this analysis. Special focus is placed on methods of learning the primary feature—the dynamics law itself. The main question considered is the connection between learning this law and reconstructing the Koopman operator and the invariant set. The answers are tied to the ergodic and topological properties of the dynamics, and they reveal how these properties determine the limits of forecasting techniques.


  • Data-driven discovery of quasiperiodically driven dynamics

    by Suddhasattwa Das, Shakib Mustavee, Shaurya Agarwal