@article{BittracherKoltaiKlusetal., author = {Bittracher, Andreas and Koltai, P{\´e}ter and Klus, Stefan and Banisch, Ralf and Dellnitz, Michael and Sch{\"u}tte, Christof}, title = {Transition manifolds of complex metastable systems: Theory and data-driven computation of effective dynamics}, series = {Jounal of Nonlinear Science}, volume = {28}, journal = {Jounal of Nonlinear Science}, number = {2}, doi = {10.1007/s00332-017-9415-0}, pages = {471 -- 512}, abstract = {We consider complex dynamical systems showing metastable behavior but no local separation of fast and slow time scales. The article raises the question of whether such systems exhibit a low-dimensional manifold supporting its effective dynamics. For answering this question, we aim at finding nonlinear coordinates, called reaction coordinates, such that the projection of the dynamics onto these coordinates preserves the dominant time scales of the dynamics. We show that, based on a specific reducibility property, the existence of good low-dimensional reaction coordinates preserving the dominant time scales is guaranteed. Based on this theoretical framework, we develop and test a novel numerical approach for computing good reaction coordinates. The proposed algorithmic approach is fully local and thus not prone to the curse of dimension with respect to the state space of the dynamics. Hence, it is a promising method for data-based model reduction of complex dynamical systems such as molecular dynamics.}, language = {en} } @article{KlusSchusterMuandet, author = {Klus, Stefan and Schuster, Ingmar and Muandet, Krikamol}, title = {Eigendecompositions of Transfer Operators in Reproducing Kernel Hilbert Spaces}, series = {Journal of Machine Learning Research}, journal = {Journal of Machine Learning Research}, abstract = {Transfer operators such as the Perron-Frobenius or Koopman operator play an important role in the global analysis of complex dynamical systems. The eigenfunctions of these operators can be used to detect metastable sets, to project the dynamics onto the dominant slow processes, or to separate superimposed signals. We extend transfer operator theory to reproducing kernel Hilbert spaces and show that these operators are related to Hilbert space representations of conditional distributions, known as conditional mean embeddings in the machine learning community. Moreover, numerical methods to compute empirical estimates of these embeddings are akin to data-driven methods for the approximation of transfer operators such as extended dynamic mode decomposition and its variants. In fact, most of the existing methods can be derived from our framework, providing a unifying view on the approximation of transfer operators. One main benefit of the presented kernel-based approaches is that these methods can be applied to any domain where a similarity measure given by a kernel is available. We illustrate the results with the aid of guiding examples and highlight potential applications in molecular dynamics as well as video and text data analysis.}, language = {en} } @article{KlusSchuette, author = {Klus, Stefan and Sch{\"u}tte, Christof}, title = {Towards tensor-based methods for the numerical approximation of the Perron-Frobenius and Koopman operator}, series = {Journal of Computational Dynamics}, volume = {3}, journal = {Journal of Computational Dynamics}, number = {2}, doi = {10.3934/jcd.2016007}, pages = {139 -- 161}, abstract = {The global behavior of dynamical systems can be studied by analyzing the eigenvalues and corresponding eigenfunctions of linear operators associated with the system. Two important operators which are frequently used to gain insight into the system's behavior are the Perron-Frobenius operator and the Koopman operator. Due to the curse of dimensionality, computing the eigenfunctions of high-dimensional systems is in general infeasible. We will propose a tensor-based reformulation of two numerical methods for computing finite-dimensional approximations of the aforementioned infinite-dimensional operators, namely Ulam's method and Extended Dynamic Mode Decomposition (EDMD). The aim of the tensor formulation is to approximate the eigenfunctions by low-rank tensors, potentially resulting in a significant reduction of the time and memory required to solve the resulting eigenvalue problems, provided that such a low-rank tensor decomposition exists. Typically, not all variables of a high-dimensional dynamical system contribute equally to the system's behavior, often the dynamics can be decomposed into slow and fast processes, which is also reflected in the eigenfunctions. Thus, the weak coupling between different variables might be approximated by low-rank tensor cores. We will illustrate the efficiency of the tensor-based formulation of Ulam's method and EDMD using simple stochastic differential equations.}, language = {en} } @article{KlusKoltaiSchuette, author = {Klus, Stefan and Koltai, Peter and Sch{\"u}tte, Christof}, title = {On the numerical approximation of the Perron-Frobenius and Koopman operator}, series = {Journal of Computational Dynamics}, volume = {3}, journal = {Journal of Computational Dynamics}, number = {1}, doi = {10.3934/jcd.2016003}, pages = {51 -- 77}, abstract = {Information about the behavior of dynamical systems can often be obtained by analyzing the eigenvalues and corresponding eigenfunctions of linear operators associated with a dynamical system. Examples of such operators are the Perron-Frobenius and the Koopman operator. In this paper, we will review di� fferent methods that have been developed over the last decades to compute � infinite-dimensional approximations of these in� finite-dimensional operators - in particular Ulam's method and Extended Dynamic Mode Decomposition (EDMD) - and highlight the similarities and di� fferences between these approaches. The results will be illustrated using simple stochastic di� fferential equations and molecular dynamics examples.}, language = {en} } @article{KlusNueskeKoltaietal., author = {Klus, Stefan and N{\"u}ske, Feliks and Koltai, Peter and Wu, Hao and Kevrekidis, Ioannis and Sch{\"u}tte, Christof and No{\´e}, Frank}, title = {Data-driven model reduction and transfer operator approximation}, series = {Journal of Nonlinear Science}, volume = {28}, journal = {Journal of Nonlinear Science}, number = {3}, doi = {10.1007/s00332-017-9437-7}, pages = {985 -- 1010}, language = {en} } @article{KlusBittracherSchusteretal., author = {Klus, Stefan and Bittracher, Andreas and Schuster, Ingmar and Sch{\"u}tte, Christof}, title = {A kernel-based approach to molecular conformation analysis}, series = {Journal of Chemical Physics}, volume = {149}, journal = {Journal of Chemical Physics}, number = {24}, doi = {10.1063/1.5063533}, abstract = {We present a novel machine learning approach to understanding conformation dynamics of biomolecules. The approach combines kernel-based techniques that are popular in the machine learning community with transfer operator theory for analyzing dynamical systems in order to identify conformation dynamics based on molecular dynamics simulation data. We show that many of the prominent methods like Markov State Models, EDMD, and TICA can be regarded as special cases of this approach and that new efficient algorithms can be constructed based on this derivation. The results of these new powerful methods will be illustrated with several examples, in particular the alanine dipeptide and the protein NTL9.}, language = {en} } @article{BittracherKlusHamzietal., author = {Bittracher, Andreas and Klus, Stefan and Hamzi, Boumediene and Sch{\"u}tte, Christof}, title = {Dimensionality Reduction of Complex Metastable Systems via Kernel Embeddings of Transition Manifolds}, series = {Journal of Nonlinear Science}, volume = {31}, journal = {Journal of Nonlinear Science}, doi = {10.1007/s00332-020-09668-z}, abstract = {We present a novel kernel-based machine learning algorithm for identifying the low-dimensional geometry of the effective dynamics of high-dimensional multiscale stochastic systems. Recently, the authors developed a mathematical framework for the computation of optimal reaction coordinates of such systems that is based on learning a parameterization of a low-dimensional transition manifold in a certain function space. In this article, we enhance this approach by embedding and learning this transition manifold in a reproducing kernel Hilbert space, exploiting the favorable properties of kernel embeddings. Under mild assumptions on the kernel, the manifold structure is shown to be preserved under the embedding, and distortion bounds can be derived. This leads to a more robust and more efficient algorithm compared to the previous parameterization approaches.}, language = {en} } @misc{MollenhauerSchusterKlusetal., author = {Mollenhauer, Mattes and Schuster, Ingmar and Klus, Stefan and Sch{\"u}tte, Christof}, title = {Singular Value Decomposition of Operators on Reproducing Kernel Hilbert Spaces}, series = {Advances om Dynamics, Optimization and Computation. Series: Studies in Systems, Decision and Control. A volume dedicated to Michael Dellnitz on his 60th birthday}, volume = {304}, journal = {Advances om Dynamics, Optimization and Computation. Series: Studies in Systems, Decision and Control. A volume dedicated to Michael Dellnitz on his 60th birthday}, editor = {Junge, Oliver and Sch{\"u}tze, O. and Froyland, Gary and Ober-Blobaum, S. and Padberg-Gehle, K.}, publisher = {Springer International}, isbn = {978-3-030-51264-4}, doi = {10.1007/978-3-030-51264-4_5}, pages = {109 -- 131}, language = {en} } @article{KlusHusicMollenhaueretal., author = {Klus, Stefan and Husic, Brooke E. and Mollenhauer, Mattes and Noe, Frank}, title = {Kernel methods for detecting coherent structures in dynamical data}, series = {Chaos: An Interdisciplinary Journal of Nonlinear Science}, volume = {29}, journal = {Chaos: An Interdisciplinary Journal of Nonlinear Science}, number = {12}, doi = {10.1063/1.5100267}, language = {en} } @article{MollenhauerKlusSchuetteetal., author = {Mollenhauer, Mattes and Klus, Stefan and Sch{\"u}tte, Christof and Koltai, P{\´e}ter}, title = {Kernel Autocovariance Operators of Stationary Processes: Estimation and Convergence}, series = {Journal of Machine Learning Research}, volume = {23}, journal = {Journal of Machine Learning Research}, number = {327}, pages = {1 -- 34}, abstract = {We consider autocovariance operators of a stationary stochastic process on a Polish space that is embedded into a reproducing kernel Hilbert space. We investigate how empirical estimates of these operators converge along realizations of the process under various conditions. In particular, we examine ergodic and strongly mixing processes and obtain several asymptotic results as well as finite sample error bounds. We provide applications of our theory in terms of consistency results for kernel PCA with dependent data and the conditional mean embedding of transition probabilities. Finally, we use our approach to examine the nonparametric estimation of Markov transition operators and highlight how our theory can give a consistency analysis for a large family of spectral analysis methods including kernel-based dynamic mode decomposition.}, language = {en} } @misc{SchuetteKlusHartmann, author = {Sch{\"u}tte, Christof and Klus, Stefan and Hartmann, Carsten}, title = {Overcoming the Timescale Barrier in Molecular Dynamics: Transfer Operators, Variational Principles, and Machine Learning}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-88637}, abstract = {One of the main challenges in molecular dynamics is overcoming the "timescale barrier", a phrase used to describe that in many realistic molecular systems, biologically important rare transitions occur on timescales that are not accessible to direct numerical simulation, not even on the largest or specifically dedicated supercomputers. This article discusses how to circumvent the timescale barrier by a collection of transfer operator-based techniques that have emerged from dynamical systems theory, numerical mathematics, and machine learning over the last two decades. We will focus on how transfer operators can be used to approximate the dynamical behavior on long timescales, review the introduction of this approach into molecular dynamics, and outline the respective theory as well as the algorithmic development from the early numerics-based methods, via variational reformulations, to modern data-based techniques utilizing and improving concepts from machine learning. Furthermore, its relation to rare event simulation techniques will be explained, revealing a broad equivalence of variational principles for long-time quantities in MD. The article will mainly take a mathematical perspective and will leave the application to real-world molecular systems to the more than 1000 research articles already written on this subject.}, language = {en} } @article{GelssKlusSchusteretal., author = {Gelss, Patrick and Klus, Stefan and Schuster, Ingmar and Sch{\"u}tte, Christof}, title = {Feature space approximation for kernel-based supervised learning}, series = {Knowledge-Based Sytems}, volume = {221}, journal = {Knowledge-Based Sytems}, publisher = {Elsevier}, doi = {https://doi.org/10.1016/j.knosys.2021.106935}, language = {en} } @article{KlusGelssPeitzetal., author = {Klus, Stefan and Gelß, Patrick and Peitz, Sebastian and Sch{\"u}tte, Christof}, title = {Tensor-based dynamic mode decomposition}, series = {Nonlinearity}, volume = {31}, journal = {Nonlinearity}, number = {7}, publisher = {IOP Publishing Ltd \& London Mathematical Society}, doi = {10.1088/1361-6544/aabc8f}, language = {en} } @article{MelnykMontavonKlusetal., author = {Melnyk, Kateryna and Montavon, Gr{\`e}goire and Klus, Stefan and Conrad, Tim}, title = {Graph Kernel Koopman Embedding for Human Microbiome Analysis}, series = {Applied Network Science}, volume = {5}, journal = {Applied Network Science}, number = {96}, doi = {10.1007/s41109-020-00339-2}, abstract = {More and more diseases have been found to be strongly correlated with disturbances in the microbiome constitution, e.g., obesity, diabetes, or some cancer types. Thanks to modern high-throughput omics technologies, it becomes possible to directly analyze human microbiome and its influence on the health status. Microbial communities are monitored over long periods of time and the associations between their members are explored. These relationships can be described by a time-evolving graph. In order to understand responses of the microbial community members to a distinct range of perturbations such as antibiotics exposure or diseases and general dynamical properties, the time-evolving graph of the human microbial communities has to be analyzed. This becomes especially challenging due to dozens of complex interactions among microbes and metastable dynamics. The key to solving this problem is the representation of the time-evolving graphs as fixed-length feature vectors preserving the original dynamics. We propose a method for learning the embedding of the time-evolving graph that is based on the spectral analysis of transfer operators and graph kernels. We demonstrate that our method can capture temporary changes in the time-evolving graph on both synthetic data and real-world data. Our experiments demonstrate the efficacy of the method. Furthermore, we show that our method can be applied to human microbiome data to study dynamic processes.}, language = {en} } @article{ZhangKlusConradetal., author = {Zhang, Wei and Klus, Stefan and Conrad, Tim and Sch{\"u}tte, Christof}, title = {Learning chemical reaction networks from trajectory data}, series = {SIAM Journal on Applied Dynamical Systems (SIADS)}, volume = {18}, journal = {SIAM Journal on Applied Dynamical Systems (SIADS)}, number = {4}, doi = {10.1137/19M1265880}, pages = {2000 -- 2046}, abstract = {We develop a data-driven method to learn chemical reaction networks from trajectory data. Modeling the reaction system as a continuous-time Markov chain and assuming the system is fully observed,our method learns the propensity functions of the system with predetermined basis functions by maximizing the likelihood function of the trajectory data under l^1 sparse regularization. We demonstrate our method with numerical examples using synthetic data and carry out an asymptotic analysis of the proposed learning procedure in the infinite-data limit.}, language = {en} } @article{GelssKlusKnebeletal., author = {Gelß, Patrick and Klus, Stefan and Knebel, Sebastian and Shakibaei, Zarin and Pokutta, Sebastian}, title = {Low-Rank Tensor Decompositions of Quantum Circuits}, series = {Journal of Computational Physics}, journal = {Journal of Computational Physics}, abstract = {Quantum computing is arguably one of the most revolutionary and disruptive technologies of this century. Due to the ever-increasing number of potential applications as well as the continuing rise in complexity, the development, simulation, optimization, and physical realization of quantum circuits is of utmost importance for designing novel algorithms. We show how matrix product states (MPSs) and matrix product operators (MPOs) can be used to express certain quantum states, quantum gates, and entire quantum circuits as low-rank tensors. This enables the analysis and simulation of complex quantum circuits on classical computers and to gain insight into the underlying structure of the system. We present different examples to demonstrate the advantages of MPO formulations and show that they are more efficient than conventional techniques if the bond dimensions of the wave function representation can be kept small throughout the simulation.}, language = {en} } @article{GelssKlusEisertetal., author = {Gelß, Patrick and Klus, Stefan and Eisert, Jens and Sch{\"u}tte, Christof}, title = {Multidimensional Approximation of Nonlinear Dynamical Systems}, series = {Journal of Computational and Nonlinear Dynamics}, volume = {14}, journal = {Journal of Computational and Nonlinear Dynamics}, number = {6}, doi = {10.1115/1.4043148}, abstract = {A key task in the field of modeling and analyzing nonlinear dynamical systems is the recovery of unknown governing equations from measurement data only. There is a wide range of application areas for this important instance of system identification, ranging from industrial engineering and acoustic signal processing to stock market models. In order to find appropriate representations of underlying dynamical systems, various data-driven methods have been proposed by different communities. However, if the given data sets are high-dimensional, then these methods typically suffer from the curse of dimensionality. To significantly reduce the computational costs and storage consumption, we propose the method multidimensional approximation of nonlinear dynamical systems (MANDy) which combines data-driven methods with tensor network decompositions. The efficiency of the introduced approach will be illustrated with the aid of several high-dimensional nonlinear dynamical systems.}, language = {en} } @article{SchuetteKlusHartmann, author = {Sch{\"u}tte, Christof and Klus, Stefan and Hartmann, Carsten}, title = {Overcoming the Timescale Barrier in Molecular Dynamics: Transfer Operators, Variational Principles, and Machine Learning}, series = {Acta Numerica}, volume = {32}, journal = {Acta Numerica}, doi = {10.1017/S0962492923000016}, pages = {517 -- 673}, abstract = {One of the main challenges in molecular dynamics is overcoming the 'timescale barrier': in many realistic molecular systems, biologically important rare transitions occur on timescales that are not accessible to direct numerical simulation, even on the largest or specifically dedicated supercomputers. This article discusses how to circumvent the timescale barrier by a collection of transfer operator-based techniques that have emerged from dynamical systems theory, numerical mathematics and machine learning over the last two decades. We will focus on how transfer operators can be used to approximate the dynamical behaviour on long timescales, review the introduction of this approach into molecular dynamics, and outline the respective theory, as well as the algorithmic development, from the early numerics-based methods, via variational reformulations, to modern data-based techniques utilizing and improving concepts from machine learning. Furthermore, its relation to rare event simulation techniques will be explained, revealing a broad equivalence of variational principles for long-time quantities in molecular dynamics. The article will mainly take a mathematical perspective and will leave the application to real-world molecular systems to the more than 1000 research articles already written on this subject.}, language = {en} } @article{KlusDjurdjevacConrad, author = {Klus, Stefan and Djurdjevac Conrad, Natasa}, title = {Koopman-based spectral clustering of directed and time-evolving graphs}, series = {Journal of Nonlinear Science}, volume = {33}, journal = {Journal of Nonlinear Science}, doi = {10.1007/s00332-022-09863-0}, pages = {8}, abstract = {While spectral clustering algorithms for undirected graphs are well established and have been successfully applied to unsupervised machine learning problems ranging from image segmentation and genome sequencing to signal processing and social network analysis, clustering directed graphs remains notoriously difficult. Two of the main challenges are that the eigenvalues and eigenvectors of graph Laplacians associated with directed graphs are in general complex-valued and that there is no universally accepted definition of clusters in directed graphs. We first exploit relationships between the graph Laplacian and transfer operators and in particular between clusters in undirected graphs and metastable sets in stochastic dynamical systems and then use a generalization of the notion of metastability to derive clustering algorithms for directed and time-evolving graphs. The resulting clusters can be interpreted as coherent sets, which play an important role in the analysis of transport and mixing processes in fluid flows.}, language = {en} } @misc{BittracherKoltaiKlusetal., author = {Bittracher, Andreas and Koltai, P{\´e}ter and Klus, Stefan and Banisch, Ralf and Dellnitz, Michael and Sch{\"u}tte, Christof}, title = {Transition manifolds of complex metastable systems: Theory and data-driven computation of effective dynamics}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-63822}, abstract = {We consider complex dynamical systems showing metastable behavior but no local separation of fast and slow time scales. The article raises the question of whether such systems exhibit a low-dimensional manifold supporting its effective dynamics. For answering this question, we aim at finding nonlinear coordinates, called reaction coordinates, such that the projection of the dynamics onto these coordinates preserves the dominant time scales of the dynamics. We show that, based on a specific reducibility property, the existence of good low-dimensional reaction coordinates preserving the dominant time scales is guaranteed. Based on this theoretical framework, we develop and test a novel numerical approach for computing good reaction coordinates. The proposed algorithmic approach is fully local and thus not prone to the curse of dimension with respect to the state space of the dynamics. Hence, it is a promising method for data-based model reduction of complex dynamical systems such as molecular dynamics.}, language = {en} } @article{NiemannKlusSchuette, author = {Niemann, Jan-Hendrik and Klus, Stefan and Sch{\"u}tte, Christof}, title = {Data-driven model reduction of agent-based systems using the Koopman generator}, series = {PLOS ONE}, volume = {16}, journal = {PLOS ONE}, number = {5}, doi = {10.1371/journal.pone.0250970}, abstract = {The dynamical behavior of social systems can be described by agent-based models. Although single agents follow easily explainable rules, complex time-evolving patterns emerge due to their interaction. The simulation and analysis of such agent-based models, however, is often prohibitively time-consuming if the number of agents is large. In this paper, we show how Koopman operator theory can be used to derive reduced models of agent-based systems using only simulation or real-world data. Our goal is to learn coarse-grained models and to represent the reduced dynamics by ordinary or stochastic differential equations. The new variables are, for instance, aggregated state variables of the agent-based model, modeling the collective behavior of larger groups or the entire population. Using benchmark problems with known coarse-grained models, we demonstrate that the obtained reduced systems are in good agreement with the analytical results, provided that the numbers of agents is sufficiently large.}, language = {en} } @misc{NiemannSchuetteKlus, author = {Niemann, Jan-Hendrik and Sch{\"u}tte, Christof and Klus, Stefan}, title = {Simulation data: Data-driven model reduction of agent-based systems using the Koopman generator}, series = {PLOS ONE}, volume = {16}, journal = {PLOS ONE}, number = {5}, doi = {http://doi.org/10.5281/zenodo.4522119}, language = {en} } @article{KlusNueskePeitzetal., author = {Klus, Stefan and N{\"u}ske, Feliks and Peitz, Sebastian and Niemann, Jan-Hendrik and Clementi, Cecilia and Sch{\"u}tte, Christof}, title = {Data-driven approximation of the Koopman generator: Model reduction, system identification, and control}, series = {Physica D: Nonlinear Phenomena}, volume = {406}, journal = {Physica D: Nonlinear Phenomena}, doi = {10.1016/j.physd.2020.132416}, language = {en} } @article{NiemannKlusConradetal., author = {Niemann, Jan-Hendrik and Klus, Stefan and Conrad, Natasa Djurdjevac and Sch{\"u}tte, Christof}, title = {Koopman-Based Surrogate Models for Multi-Objective Optimization of Agent-Based Systems}, series = {Physica D: Nonlinear Phenomena}, volume = {460}, journal = {Physica D: Nonlinear Phenomena}, doi = {https://doi.org/10.1016/j.physd.2024.134052}, pages = {134052}, abstract = {Agent-based models (ABMs) provide an intuitive and powerful framework for studying social dynamics by modeling the interactions of individuals from the perspective of each individual. In addition to simulating and forecasting the dynamics of ABMs, the demand to solve optimization problems to support, for example, decision-making processes naturally arises. Most ABMs, however, are non-deterministic, high-dimensional dynamical systems, so objectives defined in terms of their behavior are computationally expensive. In particular, if the number of agents is large, evaluating the objective functions often becomes prohibitively time-consuming. We consider data-driven reduced models based on the Koopman generator to enable the efficient solution of multi-objective optimization problems involving ABMs. In a first step, we show how to obtain data-driven reduced models of non-deterministic dynamical systems (such as ABMs) that depend on potentially nonlinear control inputs. We then use them in the second step as surrogate models to solve multi-objective optimal control problems. We first illustrate our approach using the example of a voter model, where we compute optimal controls to steer the agents to a predetermined majority, and then using the example of an epidemic ABM, where we compute optimal containment strategies in a prototypical situation. We demonstrate that the surrogate models effectively approximate the Pareto-optimal points of the ABM dynamics by comparing the surrogate-based results with test points, where the objectives are evaluated using the ABM. Our results show that when objectives are defined by the dynamic behavior of ABMs, data-driven surrogate models support or even enable the solution of multi-objective optimization problems.}, language = {en} }