Related papers: Multipoint Schur algorithm, II: generalized moment…
Let G be a topological compact group acting on some space Y. We study a decomposition of Y-indexed stochastic processes, based on the orthogonality relations between the characters of the irreducible representations of G. In the particular…
The problem of (pathwise) large deviations for conditionally continuous Gaussian processes is investigated. The theory of large deviations for Gaussian processes is extended to the wider class of random processes -- the conditionally…
We develop a systematic projection-operator technique for constructing Gaussian approximations and their perturbative corrections in bosonic nonlinear models. As a case study, we apply it to the driven dissipative Kerr oscillator. In the…
We propose a stochastic method for solving Schwinger-Dyson equations in large-N quantum field theories. Expectation values of single-trace operators are sampled by stationary probability distributions of the so-called nonlinear random…
We construct discrete time Markov chains that preserve the class of Schur processes on partitions and signatures. One application is a simple exact sampling algorithm for q^{volume}-distributed skew plane partitions with an arbitrary back…
We introduce a new class of nonstationary kernels, which we derive as covariance functions of a novel family of stochastic processes we refer to as string Gaussian processes (string GPs). We construct string GPs to allow for multiple types…
As a general rule, differential equations driven by a multi-dimensional irregular path $\Gamma$ are solved by constructing a rough path over $\Gamma$. The domain of definition ? and also estimates ? of the solutions depend on upper bounds…
A class of generalized Schr\"{o}dinger problems in bounded domain is studied. A complete overview of the set of solutions is provided, depending on the values assumed by parameters involved in the problem. In order to obtain the results, we…
In this article, we primarily propose a novel Bayesian characterization of stationary and nonstationary stochastic processes. In practice, this theory aims to distinguish between global stationarity and nonstationarity for both parametric…
Gaussian process regression is a frequently used statistical method for flexible yet fully probabilistic non-linear regression modeling. A common obstacle is its computational complexity which scales poorly with the number of observations.…
Under certain mild conditions, limit theorems for additive functionals of some $d$-dimensional self-similar Gaussian processes are obtained. These limit theorems work for general Gaussian processes including fractional Brownian motions,…
I develop a theory of classicality from quantum systems. This theory stems from the study of classical and quantum stationary stochastic processes. The stochastic processes are characterized by polyhedral (classical) and semidefinite…
We address the counting of level crossings for inertial stochastic processes. We review Rice's approach to the problem and generalize the classical Rice formula to include all Gaussian processes in their most general form. We apply the…
This paper presents new uniform Gaussian strong approximations for empirical processes indexed by classes of functions based on $d$-variate random vectors ($d\geq1$). First, a uniform Gaussian strong approximation is established for general…
We study from a theoretical viewpoint the fundamental problem of efficiently computing the stationary distribution of general classes of structured Markov processes. In strong contrast with previous work, we consider this fundamental…
Gaussian processes (GPs) are commonplace in spatial statistics. Although many non-stationary models have been developed, there is arguably a lack of flexibility compared to equipping each location with its own parameters. However, the…
This paper presents a new model called infinite mixtures of multivariate Gaussian processes, which can be used to learn vector-valued functions and applied to multitask learning. As an extension of the single multivariate Gaussian process,…
Computing the posterior distribution of a probabilistic program is a hard task for which no one-fit-for-all solution exists. We propose Gaussian Semantics, which approximates the exact probabilistic semantics of a bounded program by means…
Bayesian Optimization using Gaussian Processes is a popular approach to deal with the optimization of expensive black-box functions. However, because of the a priori on the stationarity of the covariance matrix of classic Gaussian…
Predicting the labels of graph-structured data is crucial in scientific applications and is often achieved using graph neural networks (GNNs). However, when data is scarce, GNNs suffer from overfitting, leading to poor performance.…