Related papers: Decompositions of stochastic processes based on ir…
Despite their many desirable properties, Gaussian processes (GPs) are often compared unfavorably to deep neural networks (NNs) for lacking the ability to learn representations. Recent efforts to bridge the gap between GPs and deep NNs have…
Let the process Y(t) be a Skorohod integral process with respect to Brownian motion. We use a recent result by Tudor (2004), to prove that Y(t) can be represented as the limit of linear combinations of processes that are products of forward…
Bayesian learning using Gaussian processes provides a foundational framework for making decisions in a manner that balances what is known with what could be learned by gathering data. In this dissertation, we develop techniques for…
Disentangling irreversible and reversible forces from random fluctuations is a challenging problem in the analysis of stochastic trajectories measured from real-world dynamical systems. We present an approach to approximate the dynamics of…
Using the concept of self-decomposable subordinators introduced in Gardini et al. [11], we build a new bivariate Normal Inverse Gaussian process that can capture stochastic delays. In addition, we also develop a novel path simulation scheme…
Spectral decomposition of the covariance operator is one of the main building blocks in the theory and applications of Gaussian processes. Unfortunately it is notoriously hard to derive in a closed form. In this paper we consider the…
We consider groups that act on spherically symmetric rooted trees and study the associated representation of the group on the space of locally constant functions on the boundary of the tree. We introduce and discuss the new notion of…
Gaussian processes are a versatile framework for learning unknown functions in a manner that permits one to utilize prior information about their properties. Although many different Gaussian process models are readily available when the…
This paper studies the problem of learning the large-scale Gaussian graphical models that are multivariate totally positive of order two ($\text{MTP}_2$). By introducing the concept of bridge, which commonly exists in large-scale sparse…
Gaussian processes (GPs) provide a powerful non-parametric framework for reasoning over functions. Despite appealing theory, its superlinear computational and memory complexities have presented a long-standing challenge. State-of-the-art…
We develop new machinery for producing decomposability tests for involutive solutions to the Yang-Baxter equation. It is based on the seminal decomposability theorem of Rump, and on "cabling" operations on solutions and their effect on the…
We extend the result of Nualart and Schoutens on chaotic decomposition of the $L^2$-space of a L\'evy process to the case of a generalized stochastic processes with independent values.
For a series of Markov processes we prove stochastic duality relations with duality functions given by orthogonal polynomials. This means that expectations with respect to the original process (which evolves the variable of the orthogonal…
We generalize the notion of Gaussian bridges by conditioning Gaussian processes given that certain linear functionals of the sample paths vanish. We show the equivalence of the laws of the unconditioned and the conditioned process and by an…
We propose a novel Bayesian nonparametric method to learn translation-invariant relationships on non-Euclidean domains. The resulting graph convolutional Gaussian processes can be applied to problems in machine learning for which the input…
We study a decomposition of a general Markov process in a manifold invariant under a Lie group action into a radial part (transversal to orbits) and an angular part (along an orbit). We show that given a radial path, the conditioned angular…
In this paper we introduce a general stochastic representation for an important class of processes with resetting. It allows to describe any stochastic process intermittently terminated and restarted from a predefined random or non-random…
In current paper we refer to the geometrical classification of the Einstein equations which has been developed by one of the authors of this paper. This classification was based on the classical theory for decomposition of the tensor…
Let G be a connected reductive group over a field of characteristic zero, and consider an orthogonal representation of G. We give a simple criterion for whether the representation lifts to the spin group, in terms of the highest weights of…
Let $p$ be an odd prime and $q$ a power of $p$. We examine the deformation theory of reducible and indecomposable Galois representations $\bar{\rho}:G_{\mathbb{Q}}\rightarrow \text{GSp}_{2n}(\mathbb{F}_q)$ that are unramified outside a…