Related papers: A numerical approach to large deviations in contin…
Large deviation results are given for a class of perturbed nonhomogeneous Markov chains on finite state space which formally includes some stochastic optimization algorithms. Specifically, let {P_n} be a sequence of transition matrices on a…
Gaussian couplings of partial sum processes are derived for the high-dimensional regime $d=o(n^{1/3})$. The coupling is derived for sums of independent random vectors and subsequently extended to nonstationary time series. Our inequalities…
Statistical inference can be seen as information processing involving input information and output information that updates belief about some unknown parameters. We consider the Bayesian framework for making inferences about dynamical…
Using the weak convergence approach to large deviations, we formulate and prove the large deviation principle (LDP) for W-random graphs in the cut-norm topology. This generalizes the LDP for Erd\H{o}s-R{\' e}nyi random graphs by Chatterjee…
This work introduces a novel, simple, and flexible method to quantify irreversibility in generic high-dimensional time series based on the well-known mapping to a binary classification problem. Our approach utilizes gradient boosting for…
Time-fractional parabolic equations with a Caputo time derivative are considered. For such equations, we explore and further develop the new methodology of the a-posteriori error estimation and adaptive time stepping proposed in [7]. We…
In order to extract correlation information inherited in stochastic time series, the visibility graph algorithm has been recently proposed, by which a time series can be mapped onto a complex network. We demonstrate that the visibility…
This paper investigates the data-driven predictive control problems for a class of continuous-time industrial processes with completely unknown dynamics. The proposed approach employs the data-driven technique to get the system matrices…
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled by evolutionary algorithms that use a representation which…
A novel data-driven method for formal verification is proposed to study complex systems operating in safety-critical domains. The proposed approach is able to formally verify discrete-time stochastic dynamical systems against temporal logic…
More and more distributed software systems are being developed and deployed today. Like other software, distributed software systems also need very strong quality assurance support. Distributed software is often very large/complex, has…
This work explores a novel approach for adaptive, differentiable parametrization of large-scale non-stationary random fields. Coupled with any gradient-based algorithm, the method can be applied to variety of optimization problems,…
The review presents a parameter switching algorithm and his applications which allows numerical approximation of any attractor of a class of continuous-time dynamical systems depending linearly on a real parameter. The considered classes of…
We introduce the concept of numerical Gaussian processes, which we define as Gaussian processes with covariance functions resulting from temporal discretization of time-dependent partial differential equations. Numerical Gaussian processes,…
Certain intriguing consequences of the discreteness of time on the time evolution of dynamical systems are discussed. In the discrete-time classical mechanics proposed here, there is an {\it arrow of time} that follows from the fact that…
Complex systems often show macroscopic coherent behavior due to the interactions of microscopic agents like molecules, cells, or individuals in a population with their environment. However, simulating such systems poses several…
Switching dynamical systems are an expressive model class for the analysis of time-series data. As in many fields within the natural and engineering sciences, the systems under study typically evolve continuously in time, it is natural to…
Large deviations in chaotic dynamics have potentially significant and dramatic consequences. We study large deviations of series of finite lengths $N$ generated by chaotic maps. The distributions generally display an exponential decay with…
Langevin algorithms are popular Markov chain Monte Carlo methods that are often used to solve high-dimensional large-scale sampling problems in machine learning. The most classical Langevin Monte Carlo algorithm is based on the overdamped…
Controlling complex dynamical systems has been a topic of considerable interest in academic circles in recent decades. While existing works have primarily focused on closed-loop control schemes with infinite-time durations, this paper…