Brownian bridge and other path-dependent Gaussian processes vectorial simulation

The iterative simulation of the Brownian bridge is well known. In this article, we present a vectorial simulation alternative based on Gaussian processes for machine learning regression that is suitable for interpreted programming languages implementations. We extend the vectorial simulation of path-dependent trajectories to other Gaussian processes, namely, sequences of Brownian bridges, geometric Brownian motion, fractional Brownian motion, and Ornstein-Ulenbeck mean reversion process.

Machine learning Vasicek model calibration with Gaussian processes

In this article, we calibrate the Vasicek interest rate model under the risk neutral measure by learning the model parameters using Gaussian processes for machine learning regression. The calibration is done by maximizing the likelihood of zero coupon bond log prices, using mean and covariance functions computed analytically, as well as likelihood derivatives with respect to the parameters. The maximization method used is the conjugate gradients. The only prices needed for calibration are zero coupon bond prices and the parameters are directly obtained in the arbitrage free risk neutral measure.

Lévy area for Gaussian processes: A double Wiener--Itô integral approach

"Vegeu el resum a l'inici del document del fitxer adjunt."

Hamiltonian formalism for path-dependent Lagrangians

A presymplectic structure for path-dependent Lagrangian systems is set up such that, when applied to ordinary Lagrangians, it yields the familiar Legendre transformation. It is then applied to derive a Hamiltonian formalism and the conserved quantities for those predictive invariant systems whose solutions also satisfy a Fokker-type action principle.

Canonical formalism for path dependent Lagrangians. Coupling constant expansions

A canonical formalism obtained for path-dependent Lagrangians is applied to Fokker-type Lagrangians. The results are specialized for coupling constant expansions and later on are applied to relativistic systems of particles interacting through symmetric scalar and vector mesodynamics and electrodynamics.

Gaussian processes autoencoder for dimensionality reduction

Learning low dimensional manifold from highly nonlinear data of high dimensionality has become increasingly important for discovering intrinsic representation that can be utilized for data visualization and preprocessing. The autoencoder is a powerful dimensionality reduction technique based on minimizing reconstruction error, and it has regained popularity because it has been efficiently used for greedy pretraining of deep neural networks. Compared to Neural Network (NN), the superiority of Gaussian Process (GP) has been shown in model inference, optimization and performance. GP has been successfully applied in nonlinear Dimensionality Reduction (DR) algorithms, such as Gaussian Process Latent Variable Model (GPLVM). In this paper we propose the Gaussian Processes Autoencoder Model (GPAM) for dimensionality reduction by extending the classic NN based autoencoder to GP based autoencoder. More interestingly, the novel model can also be viewed as back constrained GPLVM (BC-GPLVM) where the back constraint smooth function is represented by a GP. Experiments verify the performance of the newly proposed model.