Hug, RonnyRonnyHugBecker, StefanStefanBeckerHübner, WolfgangWolfgangHübnerArens, MichaelMichaelArensBeyerer, JürgenJürgenBeyerer2023-03-072023-03-072022-11-18https://publica.fraunhofer.de/handle/publica/43737910.48550/arXiv.2205.017542205.01754v3Probabilistic models for sequential data are the basis for a variety of applications concerned with processing timely ordered information. The predominant approach in this domain is given by recurrent neural networks, implementing either an approximate Bayesian approach (e.g. Variational Autoencoders or Generative Adversarial Networks) or a regression-based approach, i.e. variations of Mixture Density networks (MDN). In this paper, we focus on the N-MDN variant, which parameterizes (mixtures of) probabilistic Bézier curves (N-Curves) for modeling stochastic processes. While in favor in terms of computational cost and stability, MDNs generally fall behind approximate Bayesian approaches in terms of expressiveness. Towards this end, we present an approach for closing this gap by enabling full Bayesian inference on top of N-MDNs. For this, we show that N-Curves are a special case of Gaussian processes (denoted as N-GP) and then derive corresponding mean and kernel functions for different modalities. Following this, we propose the use of the N-MDN as a data-dependent generator for N-GP prior distributions. We show the advantages granted by this combined model in an application context, using human trajectory prediction as an example.enMachine LearningMLpaper