相关论文: Constraint-defined Manifolds: a Legacy Code Approa…

Several physical systems in condensed matter have been modeled approximating their constituent particles as hard objects. The hard spheres model has been indeed one of the cornerstones of the computational and theoretical description in…

A general approach to provide approximate parameterizations of the "small" scales by the "large" ones, is developed for stochastic partial differential equations driven by linear multiplicative noise. This is accomplished via the concept of…

Given (small amounts of) time-series' data from a high-dimensional, fine-grained, multiscale dynamical system, we propose a generative framework for learning an effective, lower-dimensional, coarse-grained dynamical model that is predictive…

Invariant manifolds facilitate the understanding of nonlinear stochastic dynamics. When an invariant manifold is represented approximately by a graph for example, the whole stochastic dynamical system may be reduced or restricted to this…

Efficient methods for the simulation of quantum circuits on classic computers are crucial for their analysis due to the exponential growth of the problem size with the number of qubits. Here we study lumping methods based on bisimulation,…

We develop a validated numerical procedure for continuation of local stable/unstable manifold patches attached to equilibrium solutions of ordinary differential equations. The procedure has two steps. First we compute an accurate high order…

We study the problem of predicting rare critical transition events for a class of slow-fast nonlinear dynamical systems. The state of the system of interest is described by a slow process, whereas a faster process drives its evolution and…

The reduction of dynamical systems has a rich history, with many important applications related to stability, control and verification. Reduction of nonlinear systems is typically performed in an exact manner - as is the case with…

Stability is a basic requirement when studying the behavior of dynamical systems. However, stabilizing dynamical systems via reinforcement learning is challenging because only little data can be collected over short time horizons before…

Latent variable models are an elegant framework for capturing rich probabilistic dependencies in many applications. However, current approaches typically parametrize these models using conditional probability tables, and learning relies…

Optimization-based solvers play a central role in a wide range of signal processing and communication tasks. However, their applicability in latency-sensitive systems is limited by the sequential nature of iterative methods and the high…

To ease analysis and simulation we make low-dimensional models of complicated dynamical systems. Centre manifold theory provides a systematic basis for the reduction of dimensionality from some detailed dynamical prescription down to a…

Time-varying linear state-space models are powerful tools for obtaining mathematically interpretable representations of neural signals. For example, switching and decomposed models describe complex systems using latent variables that evolve…

Learning identifiable representations and models from low-level observations is helpful for an intelligent spacecraft to complete downstream tasks reliably. For temporal observations, to ensure that the data generating process is provably…

Invariant manifolds provide the geometric structures for describing and understanding dynamics of nonlinear systems. The theory of invariant manifolds for both finite and infinite dimensional autonomous deterministic systems, and for…

We present new algorithms and fast implementations to find efficient approximations for modelling stochastic processes. For many numerical computations it is essential to develop finite approximations for stochastic processes. While the…

Latent variable conditional models, including the latent conditional random fields as a special case, are popular models for many natural language processing and vision processing tasks. The computational complexity of the exact…

We consider a stable driven degenerate stochastic differential equation, whose coefficients satisfy a kind of weak H{\"o}rmander condition. Under mild smoothness assumptions we prove the uniqueness of the martingale problem for the…

Increasing effort is put into the development of methods for learning mechanistic models from data. This task entails not only the accurate estimation of parameters but also a suitable model structure. Recent work on the discovery of…

In sparse coding, we attempt to extract features of input vectors, assuming that the data is inherently structured as a sparse superposition of basic building blocks. Similarly, neural networks perform a given task by learning features of…