Related papers: Generalised Liouville Processes and their Properti…
A neural network (NN) is a parameterised function that can be tuned via gradient descent to approximate a labelled collection of data with high precision. A Gaussian process (GP), on the other hand, is a probabilistic model that defines a…
In this paper, we study the composition of two independent GCPs which we call the iterated generalized counting process (IGCP). Its distributional properties such as the transition probabilities, probability generating function, state…
For a broad class of the Levy processes the new form (convolution type) of the infinitesimal generators is introduced. It leads to the new notions: a truncated generator, a quasi-potential. The probability of the Levy process remaining…
An extension of non-deterministic processes driven by the random telegraph signal is introduced in the framework of "piecewise deterministic Markov processes" [Davis], including a broader category of random systems. The corresponding…
We present a class of Gauss-Markov processes which can be represented as space-time scaled stationary Ornstein-Uhlenbeck processes defined on the real line. We give several explicit examples of the representation for certain Gauss bridge…
Geostatistics is a branch of statistics concerned with stochastic processes over continuous domains, with Gaussian processes (GPs) providing a flexible and principled modelling framework. However, the high computational cost of simulating…
We develop a method of driving a Markov processes through a continuous flow. In particular, at the level of the transition functions we investigate an approach of adding a first order operator to the generator of a Markov process, when the…
As Gaussian processes are used to answer increasingly complex questions, analytic solutions become scarcer and scarcer. Monte Carlo methods act as a convenient bridge for connecting intractable mathematical expressions with actionable…
Gaussian process latent variable models (GPLVM) are a flexible and non-linear approach to dimensionality reduction, extending classical Gaussian processes to an unsupervised learning context. The Bayesian incarnation of the GPLVM Titsias…
Piecewise Deterministic Markov Processes (PDMPs) are studied in a general framework. First, different constructions are proven to be equivalent. Second, we introduce a coupling between two PDMPs following the same differential flow which…
Continuous-time Markov chains are used to model stochastic systems where transitions can occur at irregular times, e.g., birth-death processes, chemical reaction networks, population dynamics, and gene regulatory networks. We develop a…
We develop a general construction for nonlinear L\'evy processes with given characteristics. More precisely, given a set $\Theta$ of L\'evy triplets, we construct a sublinear expectation on Skorohod space under which the canonical process…
Gaussian processes (GPs) have been proven to be powerful tools in various areas of machine learning. However, there are very few applications of GPs in the scenario of multi-view learning. In this paper, we present a new GP model for…
We explore two notions of stationary processes. The first is called a random-step Markov process in which the stationary process of states, $(X_i)_{i \in \mathbb{Z}}$ has a stationary coupling with an independent process on the positive…
We develop a scale-invariant truncated L\'evy (STL) process to describe physical systems characterized by correlated stochastic variables. The STL process exhibits L\'evy stability for the probability density, and hence shows scaling…
Many learning algorithms can be represented as Markov processes, and understanding their generalization error is a central topic in learning theory. For specific continuous-time noisy algorithms, a prominent analysis technique relies on…
Every quantum Levy process with a bounded stochastic generator is shown to arise as a strong limit of a family of suitably scaled quantum random walks.
This paper introduces a class of generalised linear models (GLMs) driven by latent processes for modelling count, real-valued, binary, and positive continuous time series. Extending earlier latent-process regression frameworks based on…
Positive self-similar Markov processes (pssMp) are positive Markov processes that satisfy the scaling property and it is known that they can be represented as the exponential of a time-changed L\'evy process via Lamperti representation. In…
Additive processes are obtained from L\'{e}vy ones by relaxing the condition of stationary increments, hence they are spatially (but not temporally) homogeneous. By analogy with the case of time-homogeneous Markov processes, one can define…